Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue

European Journal of Operational Research

Volumn 120, Issue 3, 2000, Pages 641-656

  He, Qi Ming ^a  

^a DALHOUSIE UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; QUALITY ASSURANCE; TREES (MATHEMATICS); VALUE ENGINEERING;

LAST COME FIRST SERVED METHODS; MATRIX ANALYTIC METHODS; QUASI BIRTH AND DEATH MARKOV PROCESSES;

QUEUEING THEORY;

EID: 0033875805     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00396-8     Document Type: Article

References (22)

1. Asmussen S., Koole G. Marked point processes as limits of Markovian arrival streams. Journal of Applied Probability. 30:1993;365-372.
2. F.R. Gantmacher, The Theory of Matrices, Chelsea, New York, 1959.
3. Q.-M. He, Classification of Markov processes of matrix M/G/1 type with a tree structure and its applications to the MMAP[K]/G[K]/1 queue, Working paper #98-05, Department of Industrial Engineering, DalTech, Dalhousie University, 1998.
4. He Q.-M. Queues with marked customers. Advances in Applied Probability. 28:1996;567-587.
5. He Q.-M., Alfa A.S. The MMAP[K]/PH[K]/1 queue with a last-come-first-served preemptive service discipline. Queueing Systems. 29:1998;269-291.
6. He Q.-M., Neuts M.F. Markov arrival processes with marked transitions. Stochastic Processes and their Applications. 74:1998;37-52.
7. F.P. Kelly, Reversibility and Stochastic Networks, Wiley, New York, 1979.
8. Latouche G. A note on two matrices occurring in the solution of quasi-birth-and-death processes. Stochastic Models. 3:1987;251-257.
9. Latouche G., Ramaswami V. A logarithmic reduction algorithm for quasi birth and death processes. Journal of Applied Probability. 30:1993;650-674.
10. Lyons R. Random walks, capacity and percolation on trees. Annals of Probability. 20:1992;2043-2088.
11. Lucantoni D.M. New results on the single server queue with a batch Markovian arrival process. Stochastic Models. 7:1991;1-46.
12. Neuts M.F. A versatile Markovian point process. Journal of Applied Probability. 16:1979;764-779.
13. M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An algorithmic Approach, Johns Hopkins University Press, Baltimore, MD, 1981.
14. M.F. Neuts, Structured Stochastic Matrices of M/G/1 Type and Their Applications, Marcel Dekker, New York, 1989.
15. M.F. Neuts, The joint distribution of arrivals and departures in quasi-birth-and-death processes, 1989.
16. H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems, Part 1, Elsevier, Amsterdam, 1990.
17. H. Takagi, Queueing analysis of polling models: Progress in 1990-1994, in: J.H. Dshalalow (Ed.), Frontiers in Queueing, 1996, pp. 119-146.
18. Takine T., Hasegawa T. The workload in the MAP/G/1 queue with state-dependent services its application to a queue with preemptive resume priority. Stochastic Models. 10:1994;183-204.
19. Takine T., Sengupta B., Yeung R.W. A generalization of the matrix M/G/1 paradigm for Markov chains with a tree structure. Stochastic Models. 11:1995;411-421.
20. V. Ramaswami, P.G. Taylor, Some properties of the rate operators in level-dependent quasi-birth-and-death processes with a countable number of phases, Commun. Statist. Stochastic Models 12 (1) (1996).
21. R.W. Yeung, A.S. Alfa, The quasi-birth-and-death type Markov chain with a tree structure, submitted.
22. Yeung R.W., Sengupta B. Matrix product-form solutions for Markov chains with a tree structure. Advances in Applied Probability. 26(4):1994;965-987.