Bounds for markovian queues with possible catastrophes

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. © ECMS Zita Zoltay Paprika, Péter Horák, Kata Váradi,Péter Tamás Zwierczyk, Ágnes Vidovics-Dancs, János Péter Rádics (Editors).

Authors
Zeifman A.1, 2 , Korotysheva A.1 , Satin Y.1 , Kiseleva K. 3 , Korolev V.2, 4, 5 , Shorgin S.6
Conference proceedings
Proceedings - 31st European Conference on Modelling and Simulation, ECMS 2017
Publisher
European Council for Modelling and Simulation
Language
English
Pages
628-634
Status
Published
Year
2017
Organizations
  • 1 Vologda State University, Vologda, Russian Federation
  • 2 IPI FRC CSC RAS, ISEDT RAS, Moscow, Russian Federation
  • 3 RUDN University, Moscow, Russian Federation
  • 4 Moscow State University, Moscow, Russian Federation
  • 5 Hangzhou Dianzi University, Hangzhou, China
  • 6 Institute of Informatics Problems of the FRC CSC RAS, Moscow, Russian Federation
Keywords
Bounds on the rate of convergence; Inhomogeneous birth-death processes; Queueing models
Date of creation
19.10.2018
Date of change
19.10.2018
Short link
https://repository.rudn.ru/en/records/article/record/6313/
Share

Other records