Digital Library

of the European Council for Modelling and Simulation

Title:	*Bounds For Markovian Queues With Possible Catastrophes*
Authors:	Alexander Zeifman, Anna Korotysheva, Yacov Satin, Ksenia Kiseleva, Victor Korolev, Sergey Shorgin
Published in:	(2017).ECMS 2017 Proceedings Edited by: Zita Zoltay Paprika, Péter Horák, Kata Váradi, Péter Tamás Zwierczyk, Ágnes Vidovics-Dancs, János Péter Rádics European Council for Modeling and Simulation. doi:10.7148/2017 ISBN: 978-0-9932440-4-9/ ISBN: 978-0-9932440-5-6 (CD) 31st European Conference on Modelling and Simulation, Budapest, Hungary, May 23^rd – May 26^th, 2017
Citation format:	Alexander Zeifman, Anna Korotysheva, Yacov Satin, Ksenia Kiseleva, Victor Korolev, Sergey Shorgin (2017). Bounds For Markovian Queues With Possible Catastrophes, ECMS 2017 Proceedings Edited by: Zita Zoltay Paprika, Péter Horák, Kata Váradi, Péter Tamás Zwierczyk, Ágnes Vidovics-Dancs, János Péter Rádics European Council for Modeling and Simulation. doi: 10.7148/2017-0628
DOI:	https://doi.org/10.7148/2017-0628
Abstract:	We consider a general Markovian queueing model with possible catastrophes and obtain new and sharp bounds on the rate of convergence. Some special classes of such models are studied in details, namely, (a) the queueing system with S servers, batch arrivals and possible catastrophes and (b) the queueing model with “attracted” customers and possible catastrophes. A numerical example illustrates the calculations. Our approach can be used in modeling information flows related to high-performance computing.
Full text: