Heavy-traffic Limit for the Initial Content Process

References

• Billingsley, P (1999). Convergence of Probability Measures, 2nd ed., Wiley, New York. MR1700749Google Scholar
• Bremaud, P. (1981). Point Processes and Queues: Martingale Dynamics, Springer-Verlag, New York. MR0636252Google Scholar
• Decreusefond, L. and Moyal, P. (2008). A functional central limit theorem for the M/GI/∞ queue. Ann. Appl. Probab. 18(6) 2156–2178. MR2473653Google Scholar
• Donsker, M. (1952). Justification and extension of Doob’s heuristic approach to the Kolmogorov-Smirnov theorems. Ann. Math. Statist. 23 277–281. MR0047288Google Scholar
• Duffield, N. and Whitt, W. (1997). Control and recovery from rare congestion events in a large multi-server system. Queueing Syst. 26 69–104. MR1480867Google Scholar
• Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York. MR0838085Google Scholar
• Feller, W. (1971). An Introduction to Probability Theory and its Applications, John Wiley and Sons, New York. MR0270403Google Scholar
• Gerhardt, I. and Nelson, B. (2009). Transforming renewal processes for simulation of nonstationary arrival processes. INFORMS J. Comput. 21(4) 630–640. MR2588345Link, Google Scholar
• Glynn, P. W. and Whitt, W. (1991). A new view of the heavy-traffic limit theorem for the infinite-server queue. Adv. in Appl. Probab. 23(1) 188–209. MR1091098Google Scholar
• Goldberg, D. and Whitt, W. (2008). The last departure time from an Mt/G/∞ queue with a terminating arrival process. Queueing Syst. 58(2) 77–104. MR2390269Google Scholar
• He, B., Liu, Y. and Whitt, W. (2016). Staffing a service system with non-Poisson nonstationary arrivals. Probability in the Engineering and Information Sciences. 30 593–621. MR3569137Google Scholar
• Gut, A. (2005). Probability: A Graduate Course. Springer, New York. MR2125120Google Scholar
• Halfin, S. and Whitt, W. (1981). Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3) 567–588. MR0629195Link, Google Scholar
• Iglehart, D. and Whitt, W. (1970). Multiple channel queues in heavy traffic II: Sequences, networks, and batches. Adv. in Appl. Probab. 2(2) 355–369. MR0282443Google Scholar
• Jacod, J. and Shiryaev, A. N. (1987). Limit Theorems for Stochastic Processes. Springer-Verlag, Berlin. MR0959133Google Scholar
• Kang, W. and Pang, G. (2014). Equivalence of fluid models for Gt/GI/N + GI queues. Working paper, Pennsylvania State University.Google Scholar
• Kang, W. and Ramanan, K. (2010). Fluid limits of many-server queues with reneging. Ann. Appl. Probab. 20(6) 2204–2260. MR2759733Google Scholar
• Kaspi, H. and Ramanan, K. (2011). Law of large numbers limits for many-server queues. Ann. Appl. Probab. 21(1) 33–114. MR2759196Google Scholar
• Kaspi, H. and Ramanan, K. (2013). SPDE limits of many-server queues. Ann. Appl. Probab. 23(1) 145–229. MR3059233Google Scholar
• Krichagina, E. V. and Puhalskii, A. A. (1997). A heavy-traffic analysis of a closed queueing system with a GI/∞ service center. Queueing Syst. 25 235–280. MR1458591Google Scholar
• Liu, R., Kuhl, M. E., Liu, Y. and Wilson, J. R. Modeling and simulation of nonstationary and non-Poisson processes. Working paper, North Carolina State University, 2017.Google Scholar
• Liu, Y. and Whitt, W. (2011). Large-time asymptotics for the Gt/Mt/st + GIt many-server fluid queue with abandonment. Queueing Systems 67 145–182. MR2771198Google Scholar
• Liu, Y. and Whitt, W. (2012). A many-server fluid limit for the Gt/GI/st + GI queueing model experiencing periods of overloading. Oper. Res. Lett. 40(5) 307–312. MR2956434Google Scholar
• Liu, Y. and Whitt, W. (2014). Many-server heavy-traffic limit for queues with time-varying parameters. Ann. Appl. Probab. 24(1) 378–421. MR3161651Google Scholar
• Liu, Y. and Whitt, W. (2014). Stabilizing performance in networks of queues with time-varying arrival rates. Prob. Engr. Inf. Sci. 28(4) 419–449. MR3256197Google Scholar
• Louchard, G. (1988). Large finite population queueing systems. Part 1: The infinite server model Comm. Statist. Stochastic Models 4(3) 473–505. MR0971602Google Scholar
• Marcus, M. B. and Zinn, J. (1984). The bounded law of the iterated logarithm for the weighted empirical distribution process in the non-i.i.d case. Ann. Probab. 12(2) 335–360. MR0735842Google Scholar
• Massey, W. A. and Whitt, W. (1994). Unstable asymptotics for nonstationary queues. Math. Oper. Res. 19(2) 267–291. MR1290501Link, Google Scholar
• Pang, G., Talreja, R. and Whitt, W. (2007). Martingale proofs of many-server heavy-traffic limits for Markovian queues. Probab. Surv. 4 193–267. MR2368951Google Scholar
• Pang, G. and Whitt, W. (2010). Two-parameter heavy-traffic limits for infinite-server queues. Queueing Syst. 65(4) 325–364. MR2671058Google Scholar
• Pang, G. and Whitt, W. (2013). Two-parameter heavy-traffic limits for infinite-server queues with dependent service times. Queueing Syst. 73(2) 119–146. MR3016577Google Scholar
• Puhalskii, A. A. and Reed, J. E. (2010). On many-server queues in heavy traffic. Ann. Appl. Probab. 20(1) 129–195. MR2582645Google Scholar
• Puhalskii, A. A. and Reiman, M. I. (2000). The multiclass GI/PH/N queue in the Halfin-Whitt regime. Adv. in Appl. Probab. 32(2) 564–595. MR1778580Google Scholar
• Reed, J. (2009). The G/GI/N queue in the Halfin-Whitt regime. Ann. Appl. Probab. 19(6) 2211–2269. MR2588244Google Scholar
• Reed, J. and Talreja, R. (2015). Distribution-valued heavy-traffic limits for the G/GI/∞ queue. Ann. Appl. Probab. 25(3) 1420–1474. MR3325278Google Scholar
• Shorack, G. R. and Wellner, J. A. (2009). Empirical Processes with Applications to Statistics. SIAM Classics 59 (Updated version of 1986 Wiley edition). MR3396731Google Scholar
• Skorohod, A. V. (1956). Limit theorems for stochastic processes. Theor. Probab. Appl. 1 261–290. MR0084897Google Scholar
• Talreja, R. and Whitt, W. (2009). Heavy-traffic limits for waiting times in many-server queues with abandonment. Ann. Appl. Probab. 19(6) 2137–2175. MR2588242Google Scholar
• Vapnik, V. N. and Cervonenkis, A. Y. (1971). On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications 16 264–280. MR0288823Google Scholar
• Whitt, W. (1982). On the heavy-traffic limit theorem for GI/G/∞ queues. Adv. Appl. Probab. 14(1) 171–190. MR0644013Google Scholar
• Whitt, W. (2002). Stochastic-Process Limits, Springer-Verlag, New York. MR1876437Google Scholar
• Whitt, W. (2005). Heavy-traffic limits for the GI/H2∗/n/m queue. Math. Oper. Res. 30(1) 1–27. MR2125135Link, Google Scholar
• Zhang, J. (2013). Fluid models of many-server queues with abandonment. Queueing Syst. 73(2) 147–193. MR3016578Google Scholar