A stable algorithm for stationary distribution calculation for a BMAP/SM/1 queueing system with Markovian arrival input of disasters
Authors:
- Alexander DudinADAlexander Dudin
- Olga SemenovaOSOlga Semenova
- 1 June 2004
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 41 (2) , 547-556
Abstract
Disaster arrival into a queueing system causes all customers to leave the system instantaneously. We present a numerically stable algorithm for calculating the stationary state distribution of an embedded Markov chain for the BMAP/SM/1 queue with a MAP input of disasters.Keywords
This publication has 10 references indexed in Scilit:
- On a tandem G-network with blockingAdvances in Applied Probability, 2002
- On a tandem G-network with blockingAdvances in Applied Probability, 2002
- G-networks: A versatile approach for work removal in queueing networksEuropean Journal of Operational Research, 2000
- A BMAP/SM/1 queueing system with Markovian arrival input of disastersJournal of Applied Probability, 1999
- Optimal multithreshold control for a BMAP/G/1 queue with N service modesQueueing Systems, 1998
- Product-form queueing networks with negative and positive customersJournal of Applied Probability, 1991
- New results on the single server queue with a batch markovian arrival processCommunications in Statistics. Stochastic Models, 1991
- Equilibrium distribution of block-structured Markov chains with repeating rowsJournal of Applied Probability, 1990
- Equilibrium distribution of block-structured Markov chains with repeating rowsJournal of Applied Probability, 1990
- A stable recursion for the steady state vector in markov chains of m/g/1 typeCommunications in Statistics. Stochastic Models, 1988