A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure

REFERENCES

• Athreya , K.B. and Ney , P.E. 1972 . Branching Processes New York : Springer-Verlag .
   Google Scholar
• Cohen , J.W. 1982 . The Single Server Queue New York : North-Holland Publishing Company .
   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
• 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 . Stochastic Models , 10 : 1 – 43 .
   Google Scholar
• Gail , H.R. , Hantler , S.L. and Taylor , B.A. 1997 . Non-skip-free M/G/1 and G/M/1 type Markov chains . Adv. Appl. Probab. , 29 : 733 – 758 .
   Web of Science ®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 . Usp. Matematicheskih Nauk , 50 ( 2 ) : 5 – 24 .
   Google Scholar
• Gantmacher , F.R. 1959 . The Theory of Matrices New York : Chelsea .
   Google Scholar
• Garcia , C.B. and Zangwill , W.I. 1981 . Pathways to Solutions, Fixed Points, and Equilibria N.J. : Prentice-Hall .
   Google Scholar
• Goebel , K. and Kirk , W.A. 1990 . Topics in Metric Fixed Point Theory Cambridge : Cambridge University Press .
   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 . Eur. J. Oper. Res. , 120 ( 3 ) : 641 – 656 .
   Web of Science ®Google Scholar
• He , Q.-M. 2000 . Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models . Oper. Res. Lett. , 26 : 67 – 80 .
   Web of Science ®Google Scholar
• He , Q.-M. 2000 . Classification of Markov processes of matrix M/G/1 type with a tree structure and its applications to queueing models . Stochastic Models , 16 ( 5 ) : 407 – 433 .
   Google Scholar
• He , Q.-M. and Alfa , A.S. 1998 . The MMAP[K]/PH[K]/1 queue with a last-come-first-served preemptive service discipline . Queueing Syst. , 28 : 269 – 291 .
   Google Scholar
• Latouche , G. and Ramaswami , V. 1999 . Introduction to Matrix Analytic Methods in Stochastic Modelling Philadelphia, USA : ASA & SIAM .
   Google Scholar
• Lloyd , N.G. 1978 . Degree Theory London : Cambridge University Press .
   Google Scholar
• Malyshev , V.A. 1997 . Interacting strings of symbols . Russ. Math. Surv. , 52 ( 2 ) : 59 – 86 .
   Web of Science ®Google Scholar
• in press .
   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/1 Type and Their Applications New York : Marcel Dekker .
   Google Scholar
• Rockafellar , R.T. 1972 . Convex Analysis New Jersey : Princeton University Press .
   Google Scholar
• Seneta , E. 1973 . Non-negative Matrices: An Introduction to Theory and Applications New York : John Wiley & Sons .
   Google Scholar
• Takine , T. , Sengupta , B. and Yeung , R.W. 1995 . A generalization of the matrix M/G/1 paradigm for Markov chains with a tree structure . Stochastic Models , 11 : 411 – 421 .
   Google Scholar
• Van Houdt , B. and Blondia , C. 2001 . Stability and performance of stack algorithms for random access communication modeled as a tree structured QBD Markov chain . Stochastic Models , 17 : 247 – 270 .
   Google Scholar
• Yeung , R.W. and Sengupta , B. 1994 . Matrix product-form solutions for Markov chains with a tree structure . Adv. Appl. Prob. , 26 ( 4 ) : 965 – 987 .
   Web of Science ®Google Scholar