Classification of Markov processes of matrix M/G/1 type with a tree structure and its applications to the MMAP[K]/G[K]/1 queues

Communications in Statistics. Part C: Stochastic Models

Volumn 16, Issue 5, 2000, Pages 407-433

  He, Qi Ming ^a  

^a DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Discrete or continuous time queueing system; Lyapunov function; Markov process; Matrix analytic methods; Mean drift method; Tree structure

Indexed keywords

EID: 0001495404     PISSN: 08820287     EISSN: None     Source Type: Journal    
DOI: 10.1080/15326340008807598     Document Type: Article

References (21)

1. Asmussen, S. and G. Koole, Marked point processes as limits of Markovian arrival streams, J. Appl. Prob., 30 (1993), 365-372.
2. Fayolle, G., V.A Malyshev, and M.V. Menshikov, Topics in the Constructive Theory of Countable Markov Chains, Cambridge University Press, 1995.
3. Gajrat, A.S., V.A. Malyshev, M.V. Menshikov, and K.D. Pelih, Classification of Markov chains describing the evolution of a string of characters, Uspehi Matematicheskih Nauk, 50 (1995), No. 2, 5-24.
4. Gantmacher, F.R., The theory of matrices, New York: Chelsea, 1959.
5. Goebel, K, and W. A. Kirk, Topics In Metric Fixed Point Theory, Cambridge University, Press, Cambridge, 1990.
6. HE, Q-M, Queues with marked customers, Adv. Appl. Prob., 28 (1996), 567-587.
7. HE, Q-M, 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, 120/3 (2000), 641-656.
8. HE, Q-M, Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models, Operations Research Letters, 26 (2000), 67-80.
9. HE, Q-M, Classification of Markov processes of M/G/1 type with a tree structure and its applications to the MMAP[K]/G[K]/1 queues, Working paper #98-05, 1998, Department of Industrial Engineering, Dalhousie University.
10. HE, Q-M and A.S. Alfa, The MMAP[K]/PH[K]/1 queues with a last-come-first-served preemptive service discipline, Queueing Systems, 29 (1998), 269-291.
11. HE, Q-M and Neuts, M.F., Markov arrival processes with marked transitions, Stochastic Process and their Applications, 74/1 (1998), 37-52.
12. Loynes, R., The stability of a queue with non-independent inter-arrival and service times, Proc. of Cambridge Philosophical Society, 58 (1962), 497-520.
13. Malyshev, V.A., Interacting strings of symbols, Russian Math. Surveys, 52 (1997), No. 2, 59-86.
14. Malyshev, V.A., Stochastic evolution via graph grammars, INRIA Research Report #3380, 1998.
15. Meyn, S.P. and R. Tweedie, Markov Chains and Stochastic Stability, Springer Verlag, 1993.
16. Neuts, M.F., A versatile Markovian point process, J. Appl. Prob., 16 (1979), 764-779.
17. Neuts, M.F., Matrix-Geometric Solutions in Stochastic Models: An algorithmic Approach, The Johns Hopkins University Press, Baltimore, 1981.
18. Neuts, M.F., Structured Stochastic Matrices of M/G/1 type and Their Applications, Marcel Dekker, New York, 1989.
19. Takine, T. and T. Hasegawa, 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.
20. Takine, T., B. Sengupta, and R. W. Yeung, A generalization of the matrix M/G/1 paradigm for Markov chains with a tree structure, Stochastic Models, 11 (1995), 411-421.
21. Yeung, R.W. and A. S. Alfa, The quasi-birth-death type Markov chain with a tree structure, Stochastic Models, 15 (1999), 639-659.