On a tandem G-network with blocking
From MaRDI portal
Publication:4804611
DOI10.1239/aap/1033662169zbMath1020.60084MaRDI QIDQ4804611
No author found.
Publication date: 24 September 2003
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1033662169
phase-type distribution; departure process; Markov renewal theory; disaster; steady state analysis; Markovian arrival processes; negative arrival
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
60K15: Markov renewal processes, semi-Markov processes
60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)
Related Items
Sojourn times in a two-stage queueing network with blocking, A stable algorithm for stationary distribution calculation for a BMAP/SM/1 queueing system with Markovian arrival input of disasters, OPTIMAL ENERGY DISTRIBUTION WITH ENERGY PACKET NETWORKS, A RANDOM ACCESS G-NETWORK: STABILITY, STABLE THROUGHPUT, AND QUEUEING ANALYSIS, The Batch Markovian Arrival Process Subject to Renewal Generated Geometric Catastrophes, Investigation of the \(\mathrm{BMAP}/G/1\to\cdot/PH/1/M\) tandem queue with retrials and losses, Marked Markovian arrivals in a tandem G-network with blocking, Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks, A tandem \(\text{BMAP}/G/1 \to \bullet/M/N/0\) queue with group occupation of servers at the second station, Tandem queueing system with infinite and finite intermediate buffers and generalized phase-type service time distribution, Tandem service system with batch Markov flow and repeated calls, A disaster queue with Markovian arrivals and impatient customers, On bulk-service MAP/PH\(^{L,N}\)/1/N G-queues with repeated attempts, A tandem retrial queueing system with two Markovian flows and reservation of channels, Retrial Tandem Queue with BMAP-Input and Semi-Markovian Service Process, Diffusion Approximation of State-Dependent G-Networks Under Heavy Traffic
