The quasi-birth-death type markov chain with a tree structure
From MaRDI portal
Publication:4267514
DOI10.1080/15326349908807556zbMath0942.60085OpenAlexW1990108844MaRDI QIDQ4267514
Raymond W. Yeung, Attahiru Sule Alfa
Publication date: 16 August 2000
Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326349908807556
Related Items (10)
Solving nonlinear matrix equations arising in tree-like stochastic processes. ⋮ Analyzing priority queues with 3 classes using tree-like processes ⋮ QBD Markov chains on binomial-like trees and its application to multilevel feedback queues ⋮ 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: The quasi-birth-death type markov chain with a tree structure
