Abstract
We consider an infinite-server queue, where the arrival and service rates are both governed by a semi-Markov process that is independent of all other aspects of the queue. In particular, we derive a system of equations that are satisfied by various “parts” of the generating function of the steady-state queue-length, while assuming that all arrivals bring an amount of work to the system that is either Erlang or hyperexponentially distributed. These equations are then used to show how to derive all moments of the steady-state queue-length. We then conclude by showing how these results can be slightly extended, and used, along with a transient version of Little’s law, to generate rigorous approximations of the steady-state queue-length in the case that the amount of work brought by a given arrival is of an arbitrary distribution.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Asmussen, S.: Applied Probability and Queues. Springer, New York (2003)
Baccelli, F., Brémaud, P.: Elements of Queueing Theory: Palm–Martingale Calculus and Stochastic Recurrences. Springer, New York (2003)
Baykal-Gursoy, M., Xiao, W.: Stochastic decomposition in M/M/∞ queues with Markov-modulated service rates. Queueing Syst. 48, 75–88 (2004)
D’Auria, B.: M/M/∞ queues with on/off service speeds. Technical report, EURANDOM, Eindhoven, The Netherlands (2005)
D’Auria, B.: Stochastic decomposition of the M/G/∞ queue in a random environment. Oper. Res. Lett. 35, 805–812 (2007)
D’Auria, B.: M/M/∞ queues in semi-Markovian random environment. Queueing Syst. 58, 221–237 (2008)
Falin, G.: The M/M/∞ queue in a random environment. Queueing Syst. 58, 65–76 (2008)
Fralix, B.H., Riano, G., Serfozo, R.F.: Time-dependent Palm probabilities and queueing applications. Technical report, EURANDOM, Eindhoven, The Netherlands (2007)
Kallenberg, O.: Random Measures. Akademie-Verlag, Berlin (1983)
Kallenberg, O.: Foundations of Modern Probability. Springer, New York (2002)
Keilson, J., Servi, L.D.: The matrix M/M/∞ system: retrial models and Markov-modulated sources. Adv. Appl. Probab. 25, 453–471 (1993)
Nain, P., Nunez-Queija, R.: An M/M/1 queue in a semi-Markovian environment. In: ACM Sigmetrics 2001/Performance 2001, Cambridge, MA, June 17–20, 2001
O’Cinneide, C.A., Purdue, P.: The M/M/∞ queue in a random environment. J. Appl. Probab. 23, 175–184 (1986)
Serfozo, R.F.: Introduction to Stochastic Networks. Springer, New York (1999)
Serfozo, R.F.: Basics of Applied Stochastic Processes (2008, in progress)
Takine, T.: Single-server queues with Markov-modulated arrivals and service speed. Queueing Syst. 49, 7–22 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Fralix, B.H., Adan, I.J.B.F. An infinite-server queue influenced by a semi-Markovian environment. Queueing Syst 61, 65–84 (2009). https://doi.org/10.1007/s11134-008-9100-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-008-9100-y