Yuan-Heng Yen
Chia-Hung Wang
ABSTRACT
Stationary probabilities are fundamental in response to various measures of performance in queueing networks. Solving stationary probabilities in Quasi-Birth-and-Death (QBD) with phase-type distribution normally are dependent on the structure of the queueing network. In this paper, a new computing scheme is developed for attaining stationary probabilities in queueing networks with multiple servers. This scheme provides a general approach of considering the complexity of computing algorithm. The result becomes more significant when a large matrix is involved in computation. The background theorem of this approach is proved and provided with an illustrative example in this paper.
- Bitran, G. R., Dasu, S., Analysis of the ∑Ph/Ph/1 queue. Operations Research, Vol. 42, No. 1, pp. 158--174, 1994.Google Scholar
Digital Library
- Bodrog, L., Horvath, A., Telek, M., Moment characterization of matrix exponential and Markovian arrival processes. Annals of operations Reseach, to appear, 2008.Google Scholar
- Chuan, Y. W., Luh, H., Solving a two-node closed queueing network by a new approach, International Journal of Information and Management Sciences, Vol. 16, No. 4, pp. 49--62, 2004.Google Scholar
- Curry, G. L., Gautam, N., Characterizing the departure process from a two server Markovian queue: A non-renewal approach, Proceedings of the 2008 Winter Simulation Conference, pp. 2075--2082, 2008. Google ScholarDigital Library
- El-Rayes, A., Kwiatkowska, M., Norman, G., Solving infinite stochastic process algebra model through martix-geometric methods, Proceedings of 7th Process Algebras and Performance Modelling Workshop (PAPM99), J. Hillston and M. Silva (Eds.), pp. 41--62, University of Zaragoza, 1999.Google Scholar
- Gene H. Golub, Charles F. Van Loan, Matrix Computations, 3rd Edition, The Johns Hopkins University Press, 1996. Google ScholarDigital Library
- Latouche, G., Ramaswami, V., Introduction to Matrix Analytic Methods in Stochastic Modeling, ASA-SIAM Series on Statistics and Applied Probability (SIAM) Society for Industrial Mathematics, Philadelphia, PA 2000.Google Scholar
- Neuts, M. F., Matrix-Geometric Solutions in Stochastic Models, The John Hopkins University Press, 1981.Google Scholar
- Roger, A. H., Charles, R. J., Matrix analysis, 4th Edition, The Press Syndicate of the University of Cambrige, 1990.Google Scholar
- Sikdar, K., Gupta, U. C., The queue length distributions in the finite buffer bulk-service MAP/G/1 queue with multple vacations, Sociedad de Estadistica e Investigacion Operativa, Vol. 13, No. 1 pp. 75--103, 2005.Google Scholar
- Telek, M., Horvath, G., A minimal representation of Markov arrival processes and a moments matching method. Performance Evaluation, Vol. 64, pp. 1153--1168, 2007. Google ScholarDigital Library
- Whitt, W., The queueing network analyzer, The Bell system Technical Journal, Vol. 62, No. 9, pp. 2779--2814, 1983.Google Scholar
- The MathWorks Company, MATLAB The Language of Technical Computing: Using MALTAB, Version 6 2002.Google Scholar
- Promodel Corp., Promodel User Guide, Promodel Corp., 2001.Google Scholar
Index Terms
- A matrix decomposition approach for solving state balance equations of a phase-type queueing model with multiple servers
Recommendations
On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes
We consider a queueing system with multiple servers and two classes of customers operating under a preemptive resume priority rule. The arrival process for each class is Poisson, and the service times are exponentially distributed with different means. ...
First-come-first-served queues with multiple servers and customer classes
AbstractWe present a simple approach to the solution of a multi-server FCFS queueing system with several classes of customers and phase-type service time distributions. The proposed solution relies on solving a single two-class model in which ...
A Phase-Type Representation for the Queue Length Distribution of a Semi-Markovian Queue
QEST '10: Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of SystemsIn this paper we study a broad class of semi-Markovian queues introduced by Sengupta. This class contains many classical queues such as the GI/M/1 queue, SM/MAP/1 queue and others, as well as queues with correlated inter-arrival and service times. ...
Comments