On the Rate of Convergence and Truncations for a Class of Markovian Queueing Systems

We deal with nonstationary continuous-time Markov chains for Markovian queues with bulk arrivals and group services. Under the assumption that arrival and service rates do not depend on the length of the queue, we suggest the approach of obtaining the sharp bounds on the rate of convergence to the l...

Full description

Saved in:
Bibliographic Details
Published inTheory of probability and its applications Vol. 57; no. 3; pp. 529 - 539
Main Authors Satin, Ya. A., Zeifman, A. I., Korotysheva, A. V.
Format Journal Article
LanguageEnglish
Published Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
Subjects
Approximation
Arrivals
Constraining
Convergence
Markov analysis
Markov chains
Markov processes
Pedagogy
Queues
Online AccessGet full text

Cover

More Information
Summary:We deal with nonstationary continuous-time Markov chains for Markovian queues with bulk arrivals and group services. Under the assumption that arrival and service rates do not depend on the length of the queue, we suggest the approach of obtaining the sharp bounds on the rate of convergence to the limiting regime. We also study the approximations of the limiting characteristics of the queue-length process. [PUBLICATION ABSTRACT]
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0040-585X
1095-7219
DOI:10.1137/S0040585X97986151