Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Large Scale and Heavy Traffic Asymptotics for Systems with Unreliable Servers

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The asymptotic behaviour of the M/M/n queue, with servers subject to independent breakdowns and repairs, is examined in the limit where the number of servers tends to infinity and the repair rate tends to 0, such that their product remains finite. It is shown that the limiting two-dimensional Markov process corresponds to a queue where the number of servers has the same stationary distribution as the number of jobs in an M/M/∞ queue. Hence, the limiting model is referred to as the M/M/[M/M/∞] queue. Its numerical solution is discussed.

Next, the behaviour of the M/M/[M/M/∞] queue is analysed in heavy traffic when the traffic intensity approaches 1. The convergence of the (suitably normalized) process of the number of jobs to a diffusion is proved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. Asmussen, Applied Probability and Queues (John Wiley & Sons Ltd., Chichester, 1987).

    Google Scholar 

  2. P. Billingsley, Convergence of Probability Measures, Wiley Series in Probability and Mathematical Statistics (John Wiley & Sons Ltd., New York, 1968).

    Google Scholar 

  3. S.N. Ethier and T.G. Kurtz, Markov Processes (John Wiley & Sons Inc., New York, 1986).

    Google Scholar 

  4. M. Ettl and I. Mitrani, Applying spectral expansion in evaluating the performance of multiprocessor systems, in: Performance Evaluation of Parallel and Distributed Systems, Part 1, CWI Tract, Vol. 105, eds. O.J. Boxma and G.M. Koole (1991) pp. 45-58.

  5. G. Fayolle, V.A. Malyshev and M.V. Men'shikov, Topics in the Constructive Theory of Countable Markov Chains (Cambridge Univ. Press, Cambridge, 1995).

    Google Scholar 

  6. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. II, 2nd ed. (John Wiley & Sons Ltd., New York, 1971).

    Google Scholar 

  7. F. Guillemin and A. Simonian, Transient characteristics of an M/M/? system, Adv. Appl. Probab. 27(3) (1995) 862-888.

    Google Scholar 

  8. J.M. Harrison and M.I. Reiman, Reflected brownian motion on an orthant, Ann. Probab. 9(2) (1981) 302-308.

    Google Scholar 

  9. J.F.C. Kingman, The heavy traffic approximation in the theory of queues, in: Proc. Symp. on Congestion Theory (Univ. of North Carolina Press, Chapel Hill, 1965) pp. 137-169.

    Google Scholar 

  10. I. Mitrani and B. Avi-Itzhak, A many-server queue with service interruptions, Oper. Res. 16 (1968) 628-638.

    Google Scholar 

  11. I. Mitrani and R. Chakka, Spectral expansion solution for a class of Markov models: Application and comparison with the matrix-geometric method, Performance Evaluation 23 (1995) 241-260.

    Google Scholar 

  12. I. Mitrani and A. Puhalskii, Limiting results for multiprocessor systems with breakdowns and repairs, Queueing Systems Theory Appl. 14(3-4) (1993) 293-311.

    Google Scholar 

  13. M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models (Dover Publications Inc., New York, 1994). Corrected reprint of the 1981 original.

    Google Scholar 

  14. M.F. Neuts and D.M. Lucantoni, A Markovian queue with N servers subject to breakdowns and repairs, Management Sci. 25(9) (1979) 849-861 (1980).

    Google Scholar 

  15. L.C.G. Rogers and D. Williams, Diffusions, Markov Processes, and Martingales, Vol. 2: Itô Calculus (John Wiley & Sons Inc., New York, 1987).

    Google Scholar 

  16. R.J. Williams, Some recent developments for queueing networks, in: Probability Towards 2000, New York, 1995 (Springer, New York, 1998) pp. 340-356.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dantzer, JF., Mitrani, I. & Robert, P. Large Scale and Heavy Traffic Asymptotics for Systems with Unreliable Servers. Queueing Systems 38, 5–24 (2001). https://doi.org/10.1023/A:1010807811172

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010807811172