Bounds For Markovian Queues With Possible Catastrophes
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).
- Peoples' Friendship University of Russia Russian Federation
Bounds on the rate of convergence, 330, Queueing models, Inhomogeneous birth-death processes, 510
Bounds on the rate of convergence, 330, Queueing models, Inhomogeneous birth-death processes, 510
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!