A stable algorithm for stationary distribution calculation for a BMAP/SM/1 queueing system with Markovian arrival input of disasters
From MaRDI portal
Publication:4819478
DOI10.1239/jap/1082999085zbMath1057.60084MaRDI QIDQ4819478
Olga V. Semenova, Alexander N. Dudin
Publication date: 24 September 2004
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/jap/1082999085
60K25: Queueing theory (aspects of probability theory)
60K30: Applications of queueing theory (congestion, allocation, storage, traffic, etc.)
Related Items
On a BMAP/G/1 Retrial System with Two Types of Search of Customers from the Orbit, Perturbation Bounds forMt/Mt/NQueue with Catastrophes, Markov Chains with Hybrid Repeating Rows - Upper-Hessenberg, Quasi-Toeplitz Structure of the Block Transition Probability Matrix, Research and optimization of semi-Markov queueing models, Analysis of BMAP/MSP/1 queue with MAP generated negative customers and disasters, On the bounds for a two-dimensional birth-death process with catastrophes, The FIFO single-server queue with disasters and multiple Markovian arrival streams, Performance models for wireless channels, Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks, Conditions for a product-form stationary distribution of one queueing system with batch transfers and a disaster flow, A catastrophic queueing model with delayed action, A disaster queue with Markovian arrivals and impatient customers, OR/MS research in disaster operations management
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal multithreshold control for a BMAP\(/G/1\) queue with \(N\) service modes
- \(G\)-networks: A versatile approach for work removal in queueing networks
- Equilibrium distribution of block-structured Markov chains with repeating rows
- New results on the single server queue with a batch markovian arrival process
- A stable recursion for the steady state vector in markov chains of m/g/1 type
- Product-form queueing networks with negative and positive customers
- On a tandem G-network with blocking
- A BMAP/SM/1 queueing system with Markovian arrival input of disasters