Approximations of general discrete time queues by discrete time queues with arrivals modulated by finite chains

Approximations of general discrete time queues by discrete time queues with arrivals modulated by finite chains

0.00 Avg rating0 Votes
Article ID: iaor20012987
Country: United States
Volume: 29
Issue: 4
Start Page Number: 1039
End Page Number: 1059
Publication Date: Dec 1997
Journal: Advances in Applied Probability
Authors:
Keywords: markov processes
Abstract:

Recently, Asmussen and Koole showed that any discrete or continuous time marked point process can be approximated by a sequence of arrival streams modulated by finite state continuous time Markov chains. If the original process is customer (time) stationary then so are the approximating processes. Also, the moments in the stationary case converge. For discrete marked point processes we construct a sequence of discrete processes modulated by discrete time finite state Markov chains. All the above features of approximating sequences of Asmussen and Koole continue to hold. For discrete arrival sequences (to a queue) which are modulated by a countable state Markov chain we form a different sequence of approximating arrival streams by which, unlike in the Asmussen and Koole case, even the stationary moments of waiting times can be approximated. Explicit constructions for the output process of a queue and the total input process of a discrete time Jackson network with these characteristics are obtained.

Reviews

Required fields are marked *. Your email address will not be published.