Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models

DOI10.1016/S0167-6377(99)00057-7zbMath0946.90105MaRDI QIDQ1977260

Qi-Ming He

Publication date: 9 May 2000

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

Lyapunov functionMarkov processqueueing theorynull recurrencepositive recurrencetree structuremean drift methodtranscience

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

Related Items

A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure ⋮ The classification of matrix GI/M/1-type Markov chains with a tree structure and its applications to queueing ⋮ STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN ⋮ Matrix Product-Form Solutions for LCFs Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams ⋮ On the link between Markovian trees and tree-structured Markov chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov chains and stochastic stability
• The \(MMAP[K/PH[K]/1\) queues with a last-come-first-served preemptive service discipline]
• Markov chains with marked transitions
• A versatile Markovian point process
• Interacting strings of symbols
• Matrix product-form solutions for Markov chains with a tree structure
• Topics in the Constructive Theory of Countable Markov Chains
• A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
• Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies
• Classification of Markov chains describing the evolution of random strings
• Queues with marked customers