Abstract
A law of iterated logarithm (LIL) is established for a multiclass queueing model, having a preemptive priority service discipline, one server and \(K\) customer classes, with each class characterized by a renewal arrival process and i.i.d. service times. The LIL limits quantify the magnitude of asymptotic stochastic fluctuations of the stochastic processes compensated by their deterministic fluid limits. The LIL is established in three cases: underloaded, critically loaded, and overloaded, for five performance measures: queue length, workload, busy time, idle time, and number of departures. The proof of the LIL is based on a strong approximation approach, which approximates discrete performance processes with reflected Brownian motions. We conduct numerical examples to provide insights on these LIL results.
Similar content being viewed by others
References
Bramson, M., Dai, J.G.: Heavy traffic limits for some queueing networks. Ann. Appl. Probab. 11(1), 49–90 (2001)
Harrison, M.: A limit theorem for priority queues in heavy traffic. J. Appl. Probab. 10(4), 907–912 (1973)
Whitt, W.: Weak convergence theorems for priority queues: preemptive-Resume discipline. J. Appl. Probab. 8(1), 74–94 (1971)
Chen, H., Zhang, H.Q.: A sufficient condition and a necessary condition for the diffusion approximations of multiclass queueing networks under priority service disciplines. Queueing Syst. 34(1–4), 237–268 (2000)
Peterson, W.P.: A heavy traffic limit theorem for networks of queues with multiple customer types. Math. Oper. Res. 16(1), 90–118 (1991)
Chen, H.: Fluid approximations and stability of multiclass queueing networks I: work-conserving disciplines. Ann. Appl. Probab. 5(3), 637–665 (1995)
Chen, H., Shen, X.: Strong approximations for multiclass feedforward queueing networks. Ann. Appl. Probab. 10(3), 828–876 (2000)
Dai, J.G.: On the positive Harris recurrence for multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Probab. 5(1), 49–77 (1995)
Zhang, H.Q., Hsu, G.X.: Strong approximations for priority queues: head-of-the-line-first discipline. Queueing Syst. 10(3), 213–234 (1992)
Lévy, P.: Théorie de l’addition des variables aléatories. Gauthier-Villars, Paris (1937)
Lévy, P.: Procesus stochastique et mouvement Brownien. Gauthier-Villars, Paris (1948)
Csörgő, M., Révész, P.: How big are the increments of a Wiener process? Ann. Probab. 7(4), 731–737 (1979)
Csörgő, M., Révész, P.: Strong Approximations in Probability and Statistics. Academic Press, New York (1981)
Iglehart, G.L.: Multiple channel queues in heavy traffic: IV. Law of the iterated logarithm. Z.Wahrscheinlichkeitstheorie verw. Geb. 17, 168–180 (1971)
Minkevičius, S.: On the law of the iterated logarithm in multiserver open queueing networks. Stoch. Int. J. Probab. Stoch. Process. 86(1), 46–59 (2014)
Sakalauskas, L.L., Minkevičius, S.: On the law of the iterated logarithm in open queueing networks. Eur. J. Oper. Res. 120(3), 632–640 (2000)
Minkevičius, S., Steišūnas, S.: A law of the iterated logarithm for global values of waiting time in multiphase queues. Statist. Probab. Lett. 61(4), 359–371 (2003)
Chen, H., Yao, D.D.: Fundamentals of Queueing Networks. Springer-Verlag, New York (2001)
Chen, H., Mandelbaum, A.: Hierarchical modeling of stochastic network, part II: strong approximations. In: Yao, D.D. (Eds.) Stochastic Modeling and Analysis of Manufacturing Systems, 107–131 (1994)
Strassen, V.: An invariance principle for the law of the iterated logarith. Z. Wahrscheinlichkeitstheorie verw. Geb. 3(3), 211–226 (1964)
Whitt, W.: Stochastic-Process Limits. Springer, Berlin (2002)
Glynn, P.W., Whitt, W.: A central-limit-theorem version of \(L=\lambda W\). Queueing Syst. 1(2), 191–215 (1986)
Glynn, P.W., Whitt, W.: Sufficient conditions for functional limit theorem versions of \(L=\lambda W\). Queueing Syst. 1(3), 279–287 (1987)
Glynn, P.W., Whitt, W.: An LIL version of \(L=\lambda W\). Math. Oper. Res. 13(4), 693–710 (1988)
Horváth, L.: Strong approximation of renewal processes. Stoch. Process. Appl. 18(1), 127–138 (1984)
Horváth, L.: Strong approximation of extended renewal processes. Ann. Probab. 12(4), 1149–1166 (1984)
Csörgő, M., Deheuvels, P., Horváth, L.: An approximation of stopped sums with applications in queueing theory. Adv. Appl. Probab. 19(3), 674–690 (1987)
Csörgő, M., Horváth, L.: Weighted Approximations in Probability and Statistics. Wiley, New York (1993)
Glynn, P.W., Whitt, W.: A new view of the heavy-traffic limit for infinite-server queues. Adv. Appl. Probab. 23(1), 188–209 (1991)
Zhang, H.Q., Hsu, G.X., Wang, R.X.: Strong approximations for multiple channels in heavy traffic. J. Appl. Probab. 27(3), 658–670 (1990)
Glynn, P.W., Whitt, W.: Departures from many queues in series. Ann. Appl. Probab. 1(4), 546–572 (1991)
Horváth, L.: Strong approximations of open oueueing networks. Math. Oper. Res. 17(2), 487–508 (1992)
Zhang, H.Q.: Strong approximations of irreducible closed queueing networks. Adv. Appl. Probab. 29(2), 498–522 (1997)
Mandelbaum, A., Massey, W.A.: Strong approximations for time-dependent queues. Math. Oper. Res. 20(1), 33–64 (1995)
Mandelbaum, A., Massey, W.A., Reiman, M.: Strong approximations for Markovian service networks. Queueing Syst. 30, 149–201 (1998)
Dai, J.G.: Stability of Fluid and Stochastic Processing Networks, vol. 9. MaPhySto Miscellanea Publication, Aarhus, Denmark (1999)
Chen, H.: Rate of convergence of the fluid approximation for generalized Jackson networks. J. Appl. Probab. 33(3), 804–814 (1996)
Acknowledgments
We thank Prof. Ward Whitt, Prof. Junfei Huang and the anonymous referees for providing constructive comments. Both authors were supported by NSFC grant 11471053. The first author also acknowledges support from NSFC grant 11101050. The second author also acknowledges support from NSF Grant CMMI 1362310.
Author information
Authors and Affiliations
Corresponding author
Appendix: Overview
Appendix: Overview
This appendix contains additional materials supplementing the main paper. In Sect. 1 we provide an alternative definition for the one-dimensional ORM in (14). In Sect. 1 we provide the analytic solutions to the fluid Eq. (13). In Sect. 1, more numerical examples are given to supplement Sect. 5. In Sect. 1 we further analyze Corollary 1 in two cases. Finally, in Sect. 1 we prove Lemma 2.
1.1 The one-dimensional oblique reflection mapping
We now provide an alternative definition of the ORM in (14).
Definition 1
For any function \(x \in \mathbb {D}_0\), if there exists a unique pair of functions \(z, y\in \mathbb {D}_0\) satisfying
-
(i)
\(z(t)=x(t)+y(t)\ge 0;\)
-
(ii)
\(y\) is non-decreasing and \(y(0)=0\);
-
(iii)
\(\int _0^\infty z(t)\mathsf{d}y(t)=0\),
is called the one-dimensional oblique reflection mapping, denoted by \((z,y)=(\varPhi ,\varPsi )(x)\).
1.2 Fluid solution to (13)
We provide analytic solutions to (13) in three cases: (i) \(\rho _1> 1\), (ii) there exists an integer \(k_0: 1<k_0<K\) such that \(\sum _{l=1}^{k_0}\rho _l\le 1\) and \(\sum _{l=1}^{k_0+1}\rho _l>1\), and (iii) \(\rho <1\).
Case \((i)\): If \(\rho _1>1\), then the solution of (13) is
and \(\bar{X}_k(t)=\bar{Q}_k(t)\) and \(\bar{D}_1(t)=\mu _1t\) and \(\bar{D}_k(t)=0\) for all \(k=2,3,\dots ,K\).
Case \((ii)\): If there exists an integer \(k_0: 1<k_0<K\) such that \(\sum _{l=1}^{k_0}\rho _l\le 1\) and \(\sum _{l=1}^{k_0+1}\rho _l>1\), then the solution of (13) is
Finally, we also note that
Case \((iii)\): If \(\rho <1\), all fluid functions satisfy the fluid functions in case (ii) with \(k_0\) replaced by \(K\).
1.3 More numerical examples
1.3.1 A type-1 OL example
Example 3
(Discontinuities of the LIL limits in the class index) Consider a 6-queue example \(\lambda _{k}=1\), \(\mu _{k}=3\), \(c_{a,k}=c_{s,k}=1\) for all \(1\le k\le K=6\). This example belongs to the type-1 OL case because \(k_0=3\), \(\sum _{k=1}^{3} \rho _k =1\) and \(\sum _{k=1}^{4} \rho _k= 4/3>1\).
According to Theorem 4, we compute the LIL limits in Table 2 and plot these limits as functions of \(k\) in Fig. 4. The vertical line in 4 serving as a “benchmark” for \(\rho =1\) (because \(\sum _{k=1}^{3} \rho _k =1\) and \(\sum _{k=1}^{4}\rho _k > 1\)). We see that all LIL limits jump at \(k_0\) and \(k_0+1\). The LIL limits \(Q^{*}_{k}\), \(Z^{*}_{k}\), \(B^{*}_{k}\), and \(D^{*}_{k}\) all peak at \(k_0=3\) and \(k_0+1=4\), where stochastic processes \(Q_k\), \(Z_k\), \(B_k\), and \(D_k\) experiencing the largest asymptotical stochastic variability. The LIL \(I^{*}_k\) increases in \(k\) and peak at \(k=k_0=3\), it then drops to 0. This is so because the variability of \(I_k\) is cumulative (thus increasing) for \(1\le k\le k_0\) and then \(I_k\) becomes asymptotically negligible for all \(k_0< k\le K\). See Remark 5 for more discussions.
We plot the LIL limits as functions of \(k\) in Fig. 4.
1.3.2 LIL formulas for Example 2
We next provide the explicit LIL limits for Example 2. These limits are piecewise functions. The LIL limits for \(Q\) are
The LIL limits for \(Z\) are
The LIL limits for \(B\) are
The LIL limits for \(I\) are
The LIL limits for \(D\) are
1.4 More discussion on Corollary 1
Using the analytic solutions to (13), we transform the results of Corollary 1 to more detailed formulas. We consider two cases: (1) \(\rho <1\) and (2) there exists \(k_0: 1<k_0<K\) such that \(\sum _{l=1}^{k_0}\rho _l\le 1\) and \(\sum _{l=1}^{k_0+1}\rho _l> 1\).
Case 1. If \(\rho \le 1\), then \(\bar{Q}_k(t)=0\) and \(\bar{B}_k(t)=\rho _kt\) for \(k=1,2,\dots ,K\). Hence (29) and (30) are the following
Case 2. If there exists \(1<k_0<K\) such that \(\sum _{l=1}^{k_0}\rho _l\le 1\) and \(\sum _{l=1}^{k_0+1}\rho _l> 1\), then \(\bar{Q}_k(t)=0\) and \(\bar{B}_k(t)=\rho _kt\) for \(k=1,2,\dots ,k_0\), and (60) and (61) hold for \(1,2,\dots ,k_0\). For \(k=k_0+1\), we note that \(\bar{Q}_{k_0+1}(t)=\bar{X}_{k_0+1}(t)=\mu _{k_0+1} (\sum _{l=1}^{k_0+1}\rho _l-1)t\) and \(\bar{B}_{k_0+1}(t)=(1-\sum _{l=1}^{k_0}\rho _l)t\). Hence,
and
For \(k=k_0+i,i=2,3,\dots ,K-k_0\), \(\bar{Q}_{k_0+i}(t)=\lambda _{k_0+i}t\), \(\bar{B}_{k_0+i}(t)=0\), we have
and
1.5 Proof of Lemma 2
According to (13), \(\bar{B}_k(t)=\rho _kt\) and \(\bar{X}_k(t)=-\theta _k t<0\) for \(k=1,2,\dots ,K\). Next, (27) implies that \(\widetilde{Q}_1(t)=\varPhi (\widetilde{X}_1)(t)\) is a reflected BM, where \(\widetilde{X}_1(t)=\bar{X}_1(t)+W_1(t)\) is a BM with negative drift \(-\theta _1\) and variance parameter \(\mu _1\sigma _1\). Theorem 6.2 in [18] implies that
We next consider \(k= 2, 3,\dots ,K\). For \(z\ge 0\),
where the first equality holds because \(\widetilde{X}_k(0)=0\) and the first inequality holds by (29). To bound the second term in (67), we have
with \(\delta _k\) given in Lemma 2.
We are now ready to prove (33) for \(2\le k\le K\). We use induction. First, when \(k=2\), using (67), (68) and the fact that \(\delta _k\le \frac{1}{2}\), we have
where the second inequality holds by (66) and Lemma 5.5 in [18] (with \(\bar{X}_2(t)+W_2(t)\) being a BM with negative drift \(-\theta _2\) and variance parameter \(\mu _2\sigma _2\)).
Next, assume (33) holds for classes \(2,\ldots ,k\). For class \(k+1\), we have
where the first inequality holds by (67), (50), and the fact that \(\delta _k\le 1/2\), and the second inequality holds by the induction hypothesis and Lemma 5.5 in [18] (with \(\bar{X}_{k+1}(t)+W_{k+1}(t)\) being a BM with negative drift \(-\theta _{k+1}\) and variance parameter \(\mu _{k+1}\sigma _{k+1}\)). \(\square \)
Rights and permissions
About this article
Cite this article
Guo, Y., Liu, Y. A law of iterated logarithm for multiclass queues with preemptive priority service discipline. Queueing Syst 79, 251–291 (2015). https://doi.org/10.1007/s11134-014-9419-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-014-9419-5
Keywords
- Law of iterated logarithm
- Multiclass queues
- Priority queues
- Preemptive-resume discipline
- Non-Markovian queues
- Strong approximation