Classification of Markov Processes of Matrix M/G/l type with a Tree Structure and its Applications to the MMAP[K]/G[K]/1 Queues

References

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