A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure

DOI10.1080/15326349508807353zbMath0829.60089OpenAlexW2026481539MaRDI QIDQ4849180

Tetsuya Takine, Raymond W. Yeung, Bhaskar Sengupta

Publication date: 15 January 1996

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349508807353

zbMATH Keywords

Markov chainmatrix equationssteady state probability

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (13)

Solving nonlinear matrix equations arising in tree-like stochastic processes. ⋮ A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure ⋮ Analyzing priority queues with 3 classes using tree-like processes ⋮ The classification of matrix GI/M/1-type Markov chains with a tree structure and its applications to queueing ⋮ QBD Markov chains on binomial-like trees and its application to multilevel feedback queues ⋮ 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 ⋮ Computational analysis ofMMAP[K/PH[K]/1 queues with a mixed FCFS and LCFS service discipline] ⋮ Tree Structured QBD Markov Chains and Tree‐Like QBD Processes ⋮ Throughput and delay analysis of an opportunistic tree algorithm ⋮ 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 ⋮ Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K/PH[K]/N/LCFS non-preemptive queue]

This page was built for publication: A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure