On the solution to QBD processes with finite state space

Stochastic Analysis and Applications

Volumn 25, Issue 4, 2007, Pages 763-779

  Elhafsi, Essia H ^a   Molle, Mart ^a  

^a University of California Riverside   (United States)

Author keywords

Closed form solution; Computation complexity; Markov chain; Matrix geometric

Indexed keywords

EID: 34347330097     PISSN: 07362994     EISSN: 15329356     Source Type: Journal    
DOI: 10.1080/07362990701419946     Document Type: Article

References (16)

1. de Nitto Persone, V., and Grassi, V. 1996. Solution of finite QBD processes. Journal of Applied Probability 33(4):1003-1010.
2. El-Rayes, A., Kwiatkowska, M., and Norman, G. 1999. Solving infinite stochastic process algebra models through matrix-geometric methods. In Proceedings of 7th Process Algebras and Performance Modelling Workshop (PAPM 99). University of Zaragoza, 41-62.
3. Elhafsi, E.H., and Molle, M. 2006. The effect of queue structure and asymmetric downstream path delays on the performance of dynamic routing. Technical Report, Computer Science Department, University of California, Riverside, CR-CS-2006-05029, December.
4. Elhafsi, E.H., Molle, M., and Manjunath, D. 2005. Can we use product-form solution techniques in networks with asymmetric paths'? In Proceedings of the International Symposium on Performance Evaluation of Computer and Telecommuniaction Systems (SPECTS 2005), 1-2.
5. Gun, L., and Makowski, A.M. 1987. Matrix-geometric solution for finite capacity queues with phase-type distributions. Proceedings of Performance 87. Brussels, Belgium, 269-282.
6. Gun, L., and Makowski, A.M. 1987. Matrix-geometric solution for two node tandem queueing systems with phase-type servers subject to blocking and failures. SRC Technical Report 87-210. Systems Research Center, University of Maryland, College Park, MD.
7. Hajek, B. 1982. Birth-and-death processes on the integers with phases and general boundaries. Journal of Applied Probability 19(3):488-499.
8. Lin, W., and Kumar, P.R. 1984. Optimal control of a queueing system with two heterogeneous servers. IEEE Transactions on Automatic Control 29:696-703.
9. Neuts, M.F. 1980. Matrix Geometric Solutions in Stochastic Models. John Hopkins University Press, Baltimore.
10. Neuts, M.F., and Lacantoni, D.M. 1979. A Markovian queue with N servers subject to breakdowns and repairs. Management Science 25:849-861.
11. Rao, B.M., and Posner, MJ.M. 1977. Algorithmic and approximation analyses of the shorter queue model. Naval Research Logistics 34:381-398.
12. Riska, A., and Smirni, E. 2002. M/G/1-type markov processes: A tutorial. http://www.cs.wm.edu/riska/paper-MGl-tutorial.pdf.
13. Li, S. 1989. Overload control in a finite message storage buffer. IEEE Transactions on Communications 37(12): 1330-1338.
14. Tandra, R., Hemachandra, N., and Manjunath, D. 2002. Join minimum cost queue for multi-class customers: Stability and performance bounds. In Probability in the Engineering and Informational Sciences. Cambridge University Press, New York, vol. 18, 445-472.
15. van Houtoum, G.J., Adan, I.J.B.F., Wessesl, J., and Zijm, W.H.M. 2000. Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism. OR Specktrum 23:411-428.
16. Le Boudec, J.Y. 1991. An efficient solution method for Markov models of ATM links with loss priorities. IEEE Journal on Selected Areas in Communications 9(3):408-417.