On the law of iterated logarithm for extreme queue length in an open queueing network

References

• S. Asmussen, Extreme value theory for queues via cycle maxima, Extremes 1(2) (1998), pp. 137–168.
   Google Scholar
• A. Berger and W. Whitt, Maximum values in queueing processes, Probab. Eng. Informational Sci. 9 (1995), pp. 375–409.
   Google Scholar
• P. Billingsley, Convergence of Probability Measures, Wiley, New York, 1968.
   Google Scholar
• P. Billingsley, Convergence of Probability Measures, 2nd ed., Wiley, New York, 1999.
   Google Scholar
• A. Borovkov, Stochastic Processes in Queueing Theory, Nauka, Moscow, 1972. p. 367 (in Russian).
   Google Scholar
• A. Borovkov, Asymptotic Methods in Theory of Queues, Nauka, Moscow, 1980. p. 352 (in Russian).
   Google Scholar
• A.A. Borovkov, Limit theorems for queueing networks, Theory Probab. Appl. 31 (1986), pp. 413–427.
   Web of Science ®Google Scholar
• A. Braverman, J.G. Dai and M. Miyazawa, Heavy traffic approximation for the stationary distribution of a generalized Jackson network: the BAR approach, Stoch. Syst. 7 (1) (2017), pp. 143–196.
   Google Scholar
• J. Cohen, Asymptotic relations in queueing theory, Stoch. Processes Appl. 1 (1973), pp. 107–124.
   Google Scholar
• G. Falin and S. Yu, Singularly perturbed equations and an asymptotic study of the stationary characteristics of systems with repeated calls, Vestnik Moskov. Univ. Ser. I Mat. Mekh. 5 (7-10) (1988), pp. 103.
   Google Scholar
• D. Gamarnik and A.L. Stolyar, Multiclass multi-server queueing system in the Halfin-Whitt heavy traffic regime: asymptotics of the stationary distribution, Queueing Syst. 71 (1-2) (2012), pp. 25–51.
   Web of Science ®Google Scholar
• P.W. Glynn and W. Whitt, Heavy-traffic extreme-value limits for queues, Oper. Res. Lett. 18 (1995), pp. 107–111.
   Web of Science ®Google Scholar
• I. Gurvich, Validity of Heavy-Traffic Steady-State approximations in multiclass queueing networks: the case of Queue-Ratio disciplines, Math. Oper. Res. 39 (1) (2013), pp. 121–162.
   Web of Science ®Google Scholar
• J. Huang and I. Gurvich, Beyond Heavy-Traffic regimes: universal bounds and controls for the Single-Server queue, Oper. Res. 66(4) (2018), pp. 1168–1188.
   Web of Science ®Google Scholar
• D.L. Iglehart, Extreme values in the GI/G/1 queue, Ann. Math. Stat. 43(1972), pp. 627–635.
   Google Scholar
• J.R. Jackson, Jobshop-like queueing systems, Manage. Sci. 10(1963), pp. 131–142.
   Web of Science ®Google Scholar
• F.P. Kelly, Reversibility and Stochastic Networks, Wiley, New York, 1987.
   Google Scholar
• P. Konstantopoulps and J. Walrand, Stationarity and stability of fork-join networks, J. Appl. Probab.26(1989), pp. 604–614.
   Web of Science ®Google Scholar
• P. Konstantopoulps and J. Walrand, On the ergodicity of networks of -/GI/l/N queues, Adv. Appl. Probab. 22(1990), pp. 263–267.
   Web of Science ®Google Scholar
• C. Kuo-Hwa. Extreme and high-level sojourns of the single server queue in heavy traffic, Queueing Syst.: Theory Appl. 27 (1-2) (1997), pp. 17–35.
   Web of Science ®Google Scholar
• S.T. Maguluri, S.K. Burle and R. Srikant, Optimal Heavy-Traffic Queue Length Scaling in an Incompletely Saturated Switch, SIGMETRICS '16 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, (2016) pp. 13 – 24.
   Google Scholar
• M.G. Markakis, E. Modiano and J.N. Tsitsiklis, Max-Weight scheduling in queueing networks with Heavy-Tailed traffic, IEEE/ACM Trans. Networking 22(1) (2014), pp. 257–270.
   Web of Science ®Google Scholar
• W. McCormick and P.Y. Sung, Approximating the distribution of the maximum queue length for M/M/s queues, Queueing and related models, Oxford Statist. Sci. Ser., Vol. 9, Oxford Univ. Press, New York, 1992, pp. 240–261.
   Google Scholar
• S. Minkevičius, Compound transient phenomena in multiphase queueing systems, Lit. Mat. J.37(1999), pp. 392–401.
   Google Scholar
• S. Minkevičius, On a law of the iterated logarithm in multiserver open queueing networks, Stochastics 86(2014), pp. 46–59.
   Google Scholar
• S. Minkevičius and V. Dolgopolov, A mixed-component open Jackson network in heavy traffic, submitted, Informatica. 2019.
   Google Scholar
• M.I. Reiman, Open queueing networks in heavy traffic, Math. Oper. Res. 9(1984), pp. 441–459.
   Web of Science ®Google Scholar
• L.L. Sakalauskas and S. Minkevičius, On the law of the iterated logarithm in open queueing networks, Eur. J. Oper. Res. 120(2000), pp. 632–640.
   Web of Science ®Google Scholar
• R. Serfozo, Extreme values of birth and death processes and queues, Stoch. Processes Appl. 27(1988), pp. 291–306.
   Web of Science ®Google Scholar
• R. Serfozo, Extreme values of queue length in M/G/1 and GI/M/1 systems, Math. Oper. Res. 13(2) (2000), pp. 349–357.
   Google Scholar
• V. Strassen, An invariance principle for the law of the iterated logarithm, Zeit. Fur Wahr. 3(1964), pp. 211–226.
   Google Scholar
• P.Y. Sung, Asymptotic distributions of maximum queue lengths for M/G/1 and GI/M/1 systems, J. Korean Statist. Soc. 24(1) (1994), pp. 19–29.
   Google Scholar
• W. Wang, S.T. Maguluri, R. Srikant and L. Ying, Heavy-Traffic delay insensitivity in Connection-Level models of data transfer with proportionally fair bandwidth sharing, ACM SIGMETRICS Perform. Evaluation Rev. 45(3) (2017), pp. 232–245.
   Google Scholar
• W. Wang, K. Zhu, L. Ying, J. Tan and L. Zhang, MapTask scheduling in map reduce with data locality: throughput and heavy-traffic optimality, IEEE/ACM Trans. Networking 24(1) (2016), pp. 190–203.
   Web of Science ®Google Scholar
• W Whitt, Heavy traffic limit theorems for queues: a survey. In: Lecture Notes in Economics and Mathematical Systems Vol. 98, Springer-Verlag, Berlin, Heidelberg, New York, 1974.
   Google Scholar
• W. Whitt and W. You, Heavy-Traffic limit of the GI/GI/1 stationary departure process and its variance function, Stoch. Syst. 8(2) (2018), pp. 91–165.
   Google Scholar
• R.J. Williams, Stochastic processing networks, Annu. Rev. Stat. Appl. 3(2016), pp. 323–345.
   Web of Science ®Google Scholar
• Y. Wu, L. Bui and R. Johari, Heavy traffic approximation of equilibria in resource sharing games, IEEE J. Selected Areas Commun. 30(11) (2013), pp. 2200–2209.
   Web of Science ®Google Scholar
• X. Zhou, J. Tan and N. Shroff, Flexible load balancing with multidimensional state-space collapse: throughput and heavy-traffic delay optimality, Perform. Evaluation 127–128(2018), pp. 176–193.
   Web of Science ®Google Scholar