Time-Scaling Limits for Markov-Modulated Infinite-Server Queues
Authors:
- 30 January 2013
- journal article
- research article
- Published by Taylor & Francis in Stochastic Models
- Vol. 29 (1) , 112-127
Abstract
This article examines semi-Markov modulated M/M/∞ queues, which are to be understood as infinite-server systems in which the Poisson input rate is modulated by a Markovian background process (where the times spent in each of its states are assumed deterministic), and the service times are exponential. Two specific scalings are considered, both in terms of transient and steady-state behavior. In the former the transition times of the background process are divided by N, and then N is sent to ∞; a Poisson limit is obtained. In the latter both the transition times and the Poissonian input rates are scaled, but the background process is sped up more than the arrival process; here a central-limit type regime applies. The accuracy and convergence rate of the limiting results are demonstrated with numerical experiments.Keywords
This publication has 9 references indexed in Scilit:
- Transcription Stochasticity of Complex Gene Regulation ModelsBiophysical Journal, 2012
- Semi-Markov-Modulated Infinite-Server Queues: Approximations by Time-ScalingStochastic Models, 2012
- An infinite-server queue influenced by a semi-Markovian environmentQueueing Systems, 2008
- M/M/∞ queues in semi-Markovian random environmentQueueing Systems, 2008
- Stochastic Decomposition in M/M/∞ Queues with Markov Modulated Service RatesQueueing Systems, 2004
- Stochastic Networks and Queues2003
- Stochastic-Process Limits2002
- Large Deviations Techniques and Applications1998
- The M/M/∞ queue in a random environmentJournal of Applied Probability, 1986