Efficient estimation of overflow probabilities in queues with breakdowns

Share/Save/Bookmark

Kroese, Dirk P. and Nicola, Victor F. (1999) Efficient estimation of overflow probabilities in queues with breakdowns. Performance Evaluation, 36-37 . pp. 471-484. ISSN 0166-5316

[img] PDF
Restricted to UT campus only
: Request a copy
127kB
Abstract:Efficient importance sampling methods are proposed for the simulation of a single server queue with server breakdowns. The server is assumed to alternate between the operational and failure states according to a continuous time Markov chain. Both, continuous (fluid flow) and discrete (single arrivals) sources are considered. In the fluid flow model, we consider Markov-modulated fluid sources and a constant output rate when the server is operational. In the discrete arrivals model, we consider Markov-modulated Poisson sources and generally distributed service time when the server is operational. We show how known results on Markov additive processes may be applied to determine the optimal (exponentially tilted) change of measure for both models. The concept of effective bandwidth is used in models with multiple independent sources. Empirical studies demonstrate the effectiveness of the proposed change of measures when used in importance sampling simulations.
Item Type:Article
Copyright:© 1999 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/74030
Official URL:http://dx.doi.org/10.1016/S0166-5316(99)00036-X
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 111782