Abstract
In this paper we study the Markov-modulated M/M/\(\infty \) queue, with a focus on the correlation structure of the number of jobs in the system. The main results describe the system’s asymptotic behavior under a particular scaling of the model parameters in terms of a functional central limit theorem. More specifically, relying on the martingale central limit theorem, this result is established, covering the situation in which the arrival rates are sped up by a factor N and the transition rates of the background process by \(N^\alpha \), for some \(\alpha >0\). The results reveal an interesting dichotomy, with crucially different behavior for \(\alpha >1\) and \(\alpha <1\), respectively. The limiting Gaussian process, which is of the Ornstein–Uhlenbeck type, is explicitly identified, and it is shown to be in accordance with explicit results on the mean, variances and covariances of the number of jobs in the system.



Similar content being viewed by others
References
Anderson D, Blom J, Mandjes M, Thorsdottir H, de Turck K (2015) A functional central limit theorem for a Markov-modulated infinite-server queue. Methodol Comput Appl Probab. doi:10.1007/s11009-014-9405-8
Blom J, Mandjes M (2013) A large-deviations analysis of Markov-modulated inifinite-server queues. Oper Res Lett 41:220–225
Blom J, de Turck K, Mandjes M (2013a) A central limit theorem for Markov-modulated infinite-server queues. In: Dudin A, de Turck K (eds) Proceedings ASMTA 2013. Lecture Notes in Computer Science (LNCS) series, vol 7984, Ghent, Belgium, pp 81–95
Blom J, de Turck K, Mandjes M (2013b) Rare event analysis of Markov-modulated infinite-server queues: a Poisson limit. Stoch Models 29:463–474
Blom J, Kella O, Mandjes M, de Turck K (2014a) Tail asymptotics of a Markov-modulated infinite-server queue. Queueing Syst 78:337–357
Blom J, Kella O, Mandjes M, Thorsdottir H (2014b) Markov-modulated infinite server queues with general service times. Queueing Syst 76:403–424
Blom J, de Turck K, Mandjes M (2015) Analysis of Markov-modulated infinite-server queues in the central-limit regime. Probab Eng Inf Sci, FirstView, http://journals.cambridge.org/article_S026996481500008X
D’Auria B (2008) M/M/\(\infty \) queues in semi-Markovian random environment. Queueing Syst 58:221–237
Huang G, Jansen HM, Mandjes M, Spreij P, de Turck K (2014) Markov-modulated Ornstein–Uhlenbeck processes. Adv Appl Probab 48(1):235–254
Jacod J, Shiryayev A (1987) Limit theorems for stochastic processes. Springer, Berlin
Keilson J, Servi L (1993) The matrix M/M/\(\infty \) system: retrial models and Markov modulated sources. Adv Appl Probab 25:453–471
O’Cinneide C, Purdue P (1986) The M/M/\(\infty \) queue in a random environment. J Appl Probab 23:175–184
Whitt W (2007) Proofs of the martingale FCLT. Probab Surv 4:268–302
Acknowledgments
The authors thank Peter Spreij (Korteweg-de Vries Institute for Mathematics, University of Amsterdam) for useful suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
M. Mandjes’ research is partly funded by the NWO Gravitation project NETWORKS, Grant No. 024.002.003.
Appendices
Appendix 1
In this appendix we characterize the probability generating functions \(\Xi _{ij}(\cdot ,\cdot ,\cdot ,\cdot )\) by setting up a system of partial differential equations. The starting point for this is the system of Kolmogorov equations related to the transient probabilities of the number of jobs present (jointly with the background state) at two time epochs:
we suppress the u as this is held fixed for the moment. Standard arguments from Markov chain theory immediately yield the equations, for \(i,j\in \{1,\ldots ,d\},\,m,n\in \{0,1,2\ldots \}\), and \(q_i:=-q_{ii}\),
here \(p_{ij}(-1,n,t,u)\) and \(p_{ij}(m,-1,t,u)\) are to be understood as 0. As a consequence, with \(p_{ij}'(m,n,t,u)\) denoting the derivative of \(p_{ij}(m,n,t,u)\) with respect to t, it is readily obtained that the transient probabilities satisfy the following system of (ordinary) differential equations:
Our goal is to transform these differential equations into a system of partial differential equations for the corresponding probability generating functions. To this end, multiply both sides of the equation by \(z^mw^n\), and sum over \(m,n=0,1,2,\ldots \). This results in the following equation:
which in matrix notation coincides with Eq. (1).
Appendix 2
As will be proven in “Appendix 3” below, the statement (5) can be refined to, for some constant \(\kappa \) (whose precise form is irrelevant here),
Likewise, for any \(x\ge 0\),
In the sequel we write \(a(N):=N\varrho ^{({{{i}}})}+N^{1-\alpha }\kappa \). Applying an elementary time shift, we obtain that
By plugging in (14), the expression in the last display equals
where \(\xi _N(u):=a(N)(1-e^{-\mu _\infty u}).\) Now note that, due to the computations underlying (Blom et al. 2015, Thm. 2), with \(\varrho ^{({{{i}}})}(t)\) and \(\varsigma ^{({{{i}}})}(t)\) as defined in Section 3.2, and with \(\psi (N)=o(N^{\max \{1,2-\alpha \}}),\) that
We now turn our attention to characterizing the covariance between \(M^{(N)}(t)\) and \(M^{(N)}(t+u)\). Based on the above we have
A direct computation now yields that the zero-order terms cancel, and that we end up with (7).
Appendix 3
In this appendix, we establish (13). The idea is to manipulate differential equation (4), so as to characterize the behavior of \( {\pmb m}(t) \) for N large. The first step is to postmultiply the equation by the fundamental matrix \(F:=D+\Pi \). We obtain, multiplying the equation by \(N^{-\alpha }\) as well,
Iterate this equation once, we obtain
Iterating once again to replace all occurrences of \({\pmb m}(t)\) by \({\pmb m}(t) \Pi \), we obtain, with \({\pmb n}(t):={\pmb m}(t)\Pi \),
Now postmultiply this equation by \(N^\alpha \Pi {{\pmb 1}}\). Recalling that \(F{\pmb 1}={\pmb 1}\) and \(\Pi {\pmb 1}={\pmb 1}\), we obtain
which leads to, using \( {\pmb n}(t){\pmb 1}:=\phi (t)\) and \(\Pi ={\pmb 1}{\pmb \pi }^\mathrm{T}\),
We find that, with \(\phi (0)=0\),
Appendix 4
We first focus on the first term in the right hand side of (8). To this end, consider the following decomposition:
where \(M^{(1)}(t,t+u)\) are the jobs that arrived in [0, t) that are still present at time t but have left at time \(t+u,\,M^{(2)}(t,t+u)\) the jobs that have arrived in [0, t) that are still present at time \(t+u\), and \(M^{(3)}(t,t+u)\) the jobs that have arrived in \([t,t+u)\) that are still present at time \(t+u\). Observe that, conditional on J, these three random quantities are independent. As a result,
Mimicking the arguments used in D’Auria (2008), it is immediate that \(M^{(2)}(t,t+u)\), conditional on J, has a Poisson distribution with parameter
We conclude that
Now analyze the second term in the right hand side of (8). First observe that it can be written as
This decomposes into \(I_1+I_2\), where
Let us first evaluate \(\mathscr {K}_{ij}\equiv \mathscr {K}_{ij}(t,u).\) To this end, substitute \(w:=s-r\) (i.e., replace r by \(s-w\)), and then interchange the order of integration, so as to obtain
Performing the inner integral (i.e., the one over s) leads to
For \(\mathscr {L}_{ij}\equiv \mathscr {L}_{ij}(t,u)\), again by a substitution and by interchanging the order of integration, we obtain \(\mathscr {L}_{ij}^{(1)}+\mathscr {L}_{ij}^{(2)}\), where
which reduce to
Now Eq. (9) follows.
Rights and permissions
About this article
Cite this article
Blom, J., De Turck, K. & Mandjes, M. Functional central limit theorems for Markov-modulated infinite-server systems. Math Meth Oper Res 83, 351–372 (2016). https://doi.org/10.1007/s00186-016-0531-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-016-0531-7