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
From MaRDI portal
Publication:4526202
DOI10.1080/15326340008807598zbMath0977.60095OpenAlexW2038319224MaRDI QIDQ4526202
Publication date: 4 January 2002
Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326340008807598
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (4)
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
This page was built for publication: 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
