Skip to main content
Log in

From the matrix-geometric to the matrix-exponential

  • Invited Paper
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider the single server queuesN/G/1 andGI/N/1 respectively in which the arrival process or the service process is a Neuts Process, and derive the matrix-exponential forms of the solution of relevant nonlinear matrix equations for such queues. We thereby generalize the matrix-exponential results of Sengupta forGI/PH/1 and of Neuts forMMPP/G/1 to substantially more general models. Our derivation of the results also establishes the equivalence of the methods of Neuts and those of Sengupta. A detailed analysis of the queueGI/N/1 is given, and it is noted that not only the stationary distribution at arrivals but also at an arbitrary time is matrix-geometric. Matrix-exponential steady state distributions are established for the waiting times in the queueGI/N/1. From this, by appealing to the duality theorem of Ramaswami, it is deduced that the stationary virtual and actual waiting times in aGI/PH/1 queue are of phase type.

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

Access this article

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, Matrix representation of ladder height distributions, to appear.

  2. S. Asmussen and V. Ramaswami, Probabilistic interpretations of some duality results for the matrix paradigms in queueing theory, to appear.

  3. D.M. Lucantoni and V. Ramaswami, Efficient algorithms for solving the nonlinear matrix equations arising in phase type queues, Stochastic Models 1 (1985) 29–52.

    Google Scholar 

  4. D.M. Lucantoni, K.S. Meier-Hellstern and M.F. Neuts, A single server queue with server vacations and a class of non-renewal arrival processes, J. Appl. Prob., to appear.

  5. D.M. Lucantoni and M.F. Neuts, The batch Markovian arrival process: Examples and properties, to appear.

  6. D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, to appear in Stochastic Models (1990).

  7. M.F. Neuts, The Markov renewal branching process, in:Proc. Conf. on Mathematical Methodology of Queues, Kalamazoo, Michigan (Springer Verlag, New York, 1974).

    Google Scholar 

  8. M.F. Neuts, Moment formulas for the Markov renewal branching process, Adv. Appl. Prob. 8 (1976) 690–711.

    Article  Google Scholar 

  9. M.F. Neuts, Markov chains with applications in queueing theory, which have a matrix-geometric invariant vector, Adv. Appl. Prob. 10 (1978) 185–212.

    Article  Google Scholar 

  10. M.F. Neuts, A versatile Markovian point process, J. Appl. Prob. 10 (1978) 185–212.

    Article  Google Scholar 

  11. M.F. Neuts, Queues solvable without Rouche's Theorem, Oper. Res. 27 (1979) 767–781.

    Article  Google Scholar 

  12. M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models — An Algorithmic Approach (The Johns Hopkins Univ. Press, Baltimore, London, 1981).

    Google Scholar 

  13. M.F. Neuts, The c-server queue with constant service times and a versatile Markovian arrival process, in:Applied Probability — Computer Science, the Interface, vol. 1 (Birkhäuser, Boston, 1982) pp. 31–67.

    Google Scholar 

  14. M.F. Neuts,Structured Stochastic Matrices of M/G/1 Type and Their Applications (Marcel Dekker, New York and Basel, 1989).

    Google Scholar 

  15. M.F. Neuts, The fundamental period of the queue with Markov-modulated arrivals, in:Probability, Statistics and Mathematics: Papers in Honor of Samuel Karlin (Academic Press, 1989).

  16. N.U. Prabhu and Y. Zhu, Markov-modulated queueing systems, to appear in Queueing Systems (1989).

  17. V. Ramaswami, A note on Neuts' Versatile Markovian Point Process, Drexel University TM 7–79 (1979).

  18. V. Ramaswami, TheN/G/1 queue and its detailed analysis, Adv. Appl. Prob. 12 (1980) 222–261.

    Article  Google Scholar 

  19. V. Ramaswami and D.M. Lucantoni, Algorithmic analysis of a dynamic priority queue, in:Applied Probability — Computer Science, the Interface, vol. 2 (Birkhäuser, Boston, 1982) pp. 157–204.

    Google Scholar 

  20. V. Ramaswami, The busy period of queues which have a matrix-geometric steady state probability vector, Opsearch 19 (1982) 238–261.

    Google Scholar 

  21. V. Ramaswami and D.M. Lucantoni, Stationary waiting time distributions in queues with phase type service and in quasi-birth-and-death processes, Stochastic Models 1 (1985) 126–138.

    Google Scholar 

  22. V. Ramaswami and D.M. Lucantoni, Algorithms for the multi-server queue with phase type service, Stochastic Models 1 (1985) 393–418.

    Google Scholar 

  23. V. Ramaswami, Nonlinear matrix equations in applied probability — Solution techniques and open problems, SIAM Rev. 30 (1988) 256–263.

    Article  Google Scholar 

  24. V. Ramaswami and G. Latouche, An experimental evaluation of the matrix-geometric method for theGI/PH/1 queue, Stochastic Models (1989) to appear.

  25. V. Ramaswami, A duality theorem for the matrix paradigms in queueing theory, Stochastic Models, to appear.

  26. B. Sengupta, Markov processes whose steady state distribution is matrix-exponential with an application to theGI/PH/1 queue, Adv. Appl. Prob. 22 (1989) 159–180.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ramaswami, V. From the matrix-geometric to the matrix-exponential. Queueing Syst 6, 229–260 (1990). https://doi.org/10.1007/BF02411476

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02411476

Keywords

Navigation