Spectral analysis of M/G/1 and G/M/1 type Markov chains

Advances in Applied Probability

Volumn 28, Issue 1, 1996, Pages 114-165

  Gail, H R ^a   Hantler, S L ^a   Taylor, B A ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Martin exit boundary; Matrix analytic methods; Random walk; Shift operator; Transform methods; Wiener Hopf equations

Indexed keywords

EID: 0000466822     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0001867800027300     Document Type: Article

References (22)

1. m,n′)-matrix. J. Appl. Math. Simul. 1, 13-24.
2. ASMUSSEN, S. (1987) Applied Probability and Queues. Wiley, New York.
3. BAILEY, N. T. J. (1954) On queueing processes with bulk service. J. Royal Stat. Soc. B 16, 80-87.
4. CHAUDHRY, M. L., HARRIS, C. M. AND MARCHAL, W. G. (1990) Robustness of rootfinding in single-server queueing models. ORSA J. Comput 2, 273-286.
5. ÇINLAR, E. (1967) Time dependence of queues with semi-Markovian services. J. Appl. Prob. 4, 356-364.
6. ÇINLAR, E. (1967) Queues with semi-Markovian arrivals. J. Appl. Prob. 4, 365-379.
7. DAIGLE, J. N. AND LUCANTONI, D. M. (1991) Queueing systems having phase-dependent arrival and service rates. In Numerical Solution of Markov Chains. pp. 161-202. ed. W. J. Stewart. Marcel Dekker, New York.
8. FELLER, W. (1956) Boundaries induced by non-negative matrices. Trans. Amer. Math. Soc. 83, 19-54.
9. GAIL, H. R., HANTLER, S. L. AND TAYLOR, B. A. (1992) On a preemptive Markovian queue with multiple servers and two priority classes. Math. Operat. Res. 17, 365-391.
10. GAIL, H. R., HANTLER, S. L. AND TAYLOR, B. A. (1992) Spectral analysis of M/G/1 type Markov chains. IBM Research Report RC 17765.
11. GAIL, H. R., HANTLER, S. L. AND TAYLOR, B. A. (1994) Solutions of the basic matrix equation for M/G/1 and G/M/1 type Markov chains. Commun. Statist. Stoch. Models 10, 1-43.
12. GANTMACHER, F. R. (1959) Applications of the Theory of Matrices. Interscience, New York.
13. GOHBERG, I. C. AND FEL'DMAN, I. A. (1974) Convolution Equations and Projection Methods for their Solution. American Mathematical Society, Providence, RI.
14. GOHBERG, I., LANCASTER, P. AND RODMAN, L. (1982) Matrix Polynomials. Academic Press, New York.
15. KEMENY, J. G., SNELL, J. L. AND KNAPP, A. W. (1966) Denumerable Markov Chains. Van Nostrand, New York.
16. LATOUCHE, G. AND RAMASWAMI, V. (1993) A logarithmic reduction algorithm for quasi-birth-death processes. J. Appl. Prob. 30, 650-674.
17. MEYER, C. D. (1989) Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems. SIAM Rev. 31, 240-272.
18. MITRANI, I. AND MITRA, D. (1992) A spectral expansion method for random walks on semi-infinite strips. In Iterative Methods in Linear Algebra. pp. 141-149. ed. R. Beauwens and P. de Groen. North-Holland, Amsterdam.
19. MURTHY, G. R., KIM, M. AND COYLE, E. J. (1991) Equilibrium analysis of skip free Markov chains: nonlinear matrix equations. Commun. Statist. Stoch. Models 7, 547-571.
20. NEUTS, M. F. (1966) The single server queue with Poisson input and semi-Markov service times. J. Appl. Prob. 3, 202-230.
21. NEUTS, M. F. (1981) Matrix-Geometric Solutions in Stochastic Models. The Johns Hopkins University Press, Baltimore.
22. NEUTS, M. F. (1989) Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker, New York.