The classification of matrix GI/M/1-type Markov chains with a tree structure and its applications to queueing

DOI10.1239/jap/1067436102zbMath1057.60071OpenAlexW1963526003MaRDI QIDQ4819517

Qi-Ming He

Publication date: 27 September 2004

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5f08a347cd3282f4c7ad031ef446db43c59a93aa

zbMATH Keywords

Markov chainmatrix-analytic methodsqueueing theoryfixed-point theorytree structuresGI/M/1-type Markov chain

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (2)

Zero-automatic queues and product form ⋮ Matrix Product-Form Solutions for LCFs Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models
• STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN
• Matrix product-form solutions for Markov chains with a tree structure
• 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]
• A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure
• A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
• Classification of Markov chains describing the evolution of random strings

This page was built for publication: The classification of matrix GI/M/1-type Markov chains with a tree structure and its applications to queueing