Analysis of nonpreemptive priority queues with multiple servers and two priority classes

European Journal of Operational Research

Volumn 118, Issue 1, 1999, Pages 181-193

  Kao, Edward P C ^a   Wilson, Sandra D ^b  

^a UNIVERSITY OF HOUSTON   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; VALUE ENGINEERING;

LOGARITHMIC REDUCTION ALGORITHMS; MULTISERVER QUEUEING SYSTEMS; NONPREEMPTIVE PRIORITY QUEUES;

QUEUEING THEORY;

EID: 0032654880     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00280-X     Document Type: Article

References (18)

1. H.R. Gail, S.L. Hantler, B.A. Taylor, Analysis of a nonpreemptive priority multiserver queue, Advances in Applied Probability 20 (1988) 852-879.
2. E.P.C. Kao, K.S. Narayanan, Computing steady-state probabilities of a nonpreemptive priority multiserver queue, ORSA Journal on Computing 2 (1990) 211-218.
3. M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models, Johns Hopkins University Press, Baltimore, MD, 1981.
4. W.K. Grassman, M.J. Taksar, D.P. Heyman, Regenerative analysis and steady state distributions for Markov chains, Operations Research 33 (1985) 1107-1116.
5. E.P.C. Kao, Using state reduction for computing steady state probabilities of queues, ORSA Jounral on Computing 3 (1991) 231-240.
6. G. Latouche, Algorithms for infinite Markov chains with repeating columns, in: C.D. Meyer, R.J. Plemmons (Eds.), Linear Algebra, Markov Chains and Queueing Models, Springer, New York, 1993, pp. 231-265.
7. G. Latouche, V. Ramaswami, Introduction to Matrix Analytic Methods, SIAM, Philadelphia, PA (to appear).
8. E.P.C. Kao, A comparison of alternative approaches for numerical solutions of GI/PH/1 queues, INFORMS Journal on Computing 8 (1996) 74-85.
9. C.A. O'Cinneide, Entrywise perturbation theory and error analysis for Markov chains, Numerische Mathematik 65 (1993) 109-120.
10. G. Latouche, V. Ramaswami, A logarithmic reduction algorithm for quasi-birth-and-death processes, Journal of Applied Probability 30 (1993) 650-674.
11. G. Hooghiemstra, M. Keane, S.V.D. Ree, Power series for stationary distributions of coupled processor models, SIAM Journal on Applied Mathematics 48 (1988) 1159-1166.
12. J.P.C. Blanc, Performance evaluation of polling systems by means of the power-series algorithm, Annals of Operations Research 35 (1992) 155-186.
13. J.P.C. Blanc, Performance analysis and optimization model with the power series algorithm, in: L. Donatiello (Ed.), Performance Analysis and Optimization with Power Series Algorithm, Springer, Berlin, 1993, pp. 53-80.
14. T.G. Robertazzi, Computer Networks and Systems, 2nd ed., Springer, New York, 1994.
15. J.P.C. Blanc, On a numerical method for calculating state probabilities for queueing systems with more than one waiting line, Jounral of Computational and Applied Mathematics 20 (1987) 119-125.
16. P. Wynn, On the convergence and stability of the epsilon algorithm, SIAM Journal on Numerical Analysis 3 (1966) 91-122.
17. C. Brezinski, M.R. Zaglia, Extrapolation Methods, North-Holland, Amsterdam, 1991.
18. M.F. Neuts, The caudal characteristic curve of queues, Advances in Applied Probabilities 18 (1986) 221-254.