Transient Analysis of a Queuing System with Matrix-Geometric Methods

  • Péter Vaderna
  • Tamás Éltető
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4003)


This paper investigates a queuing system with infinite number of servers where the arrival process is given by a Markov Arrival Process (MAP) and the service time follows a Phase-type (PH) distribution. They were chosen since they are simple enough to describe the model by exact methods. Moreover, highly correlated arrival processes and heavy-tailed service time distributions can be approximated by these tools on a wide range of time-scales. The transient behaviour of the system is analysed and the time-dependent moments of the queue length is computed explicitly by solving a set of differential equations. The results can be applied to models where performance of parallel processing is important. The applicability of the model is illustrated by dimensioning a WEB-based content provider.


Queue Length Transient Analysis Storage Unit Factorial Moment Markov Arrival Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ramaswami, V., Neuts, M.F.: Some explicit formulas and computational methods for infinite-server queues with phase-type arrivals. J. Appl. Prob. 17, 498–514 (1980)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling. In: ASA-SIAM series on statistics and applied probability (1999)Google Scholar
  3. 3.
    Pfening, A., Telek, M.: Evaluation of task completion time of phase type work requirement. In: Proceedings of Relectronic 1995 (Budapest), pp. 73–78 (1995)Google Scholar
  4. 4.
    Rácz, S., Tari, A., Telek, M.: MRMSolve: Distribution Estimation of Large Markov Reward Models. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol. 2324, pp. 72–81. Springer, Heidelberg (2002)Google Scholar
  5. 5.
    Fischer, W., Meier-Hellstern, K.: The Markov-modulated Poisson process (MMPP) cookbook. Performance Evaluation 18, 149–171 (1993)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Burman, D., Smith, R.: An Asymptotic Analysis of a Queuing System with Markov-Modulated Arrivals. Operations Research 34 (1986)Google Scholar
  7. 7.
    Takács, L.: On Erlang’s Formula. The Annals of Mathematical Statistics 40(1), 71–78 (1969)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Nelson, B.L., Taaffe, M.R.: The Ph t/Ph t/ ∞ Queueing System: Part I — The Single Node. In: INFORMS JOC (to appear, 2004)Google Scholar
  9. 9.
    Masuyama, H., Takine, T.: Analysis of an Infinite-Server Queue with Batch Markovian Arrival Streams. Queueing Systems 42(3), 269–296 (2002)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Weisstein, E.W.: Ordinary Differential Equation. MathWorld–A Wolfram Web Resource,
  11. 11.
    Bronstein, I.N., Semendjajew, K.A., Musiol, G., Mühlig, H.: Taschenbuch der Mathematik. Verlag Harri Deutsch, Frankfurt am Main, Thun (1999)Google Scholar
  12. 12.
    Shohat, J.A., Tamarkin, J.D.: The Problem of Moments. American Mathematical Society, Providence, Rhode Island (1943)Google Scholar
  13. 13.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Péter Vaderna
    • 1
  • Tamás Éltető
    • 1
  1. 1.Traffic LaboratoryEricsson ResearchBudapestHungary

Personalised recommendations