Heavy-traffic limit for the initial content process

To understand the performance of a queueing system, it can be useful to focus on the evolution of the content that is initially in service at some time. That necessarily will be the case in service systems that provide service during normal working hours each day, with the system shutting down at some time, except that all customers already in service at the termination time are allowed to complete their service. Also, for infinite-server queues, it is often fruitful to partition the content into the initial content and the new input, because these can be analyzed separately. With i.i.d service times having a non-exponential distribution, the state of the initial content can be described by specifying the elapsed service times of the remaining initial customers. That initial content process is then a Markov process. This paper establishes a many-server heavy-traffic (MSHT) functional central limit theorem (FCLT) for the initial content process in the space 𝔻𝔻, assuming a FCLT for the initial age process, ...

[1]  Barry L. Nelson,et al.  Transforming Renewal Processes for Simulation of Nonstationary Arrival Processes , 2009, INFORMS J. Comput..

[2]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .

[3]  Ward Whitt,et al.  Heavy-Traffic Limits for the G/H2*/n/mQueue , 2005, Math. Oper. Res..

[4]  Ward Whitt,et al.  Large-time asymptotics for the Gt/Mt/st+GIt many-server fluid queue with abandonment , 2011, Queueing Syst. Theory Appl..

[5]  Anatolii A. Puhalskii,et al.  A heavy-traffic analysis of a closed queueing system with a GI/∞ service center , 1997, Queueing Syst. Theory Appl..

[6]  Guodong Pang,et al.  Two-parameter heavy-traffic limits for infinite-server queues with dependent service times , 2013, Queueing Syst. Theory Appl..

[7]  Ward Whitt,et al.  Approximate blocking probabilities in loss models with independence and distribution assumptions relaxed , 2014, Perform. Evaluation.

[8]  Kavita Ramanan,et al.  Law of large numbers limits for many-server queues , 2007, 0708.0952.

[9]  Ward Whitt,et al.  A many-server fluid limit for the Gt/G//st+G/ queueing model experiencing periods of overloading , 2012, Oper. Res. Lett..

[10]  Ward Whitt,et al.  Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..

[11]  M. Donsker.  Justification and Extension of Doob's Heuristic Approach to the Kolmogorov- Smirnov Theorems , 1952 .

[12]  A. Skorokhod.  Limit Theorems for Stochastic Processes , 1956 .

[13]  M. Reiman,et al.  The multiclass GI/PH/N queue in the Halfin-Whitt regime , 2000, Advances in Applied Probability.

[14]  J. Reed,et al.  The G/GI/N queue in the Halfin–Whitt regime , 2009, 0912.2837.

[15]  W. Whitt,et al.  Martingale proofs of many-server heavy-traffic limits for Markovian queues ∗ , 2007, 0712.4211.

[16]  A. Shiryaev,et al.  Limit Theorems for Stochastic Processes , 1987 .

[17]  Ward Whitt,et al.  Control and recovery from rare congestion events in a large multi-server system , 1997, Queueing Syst. Theory Appl..

[18]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[19]  P. Brémaud.  Point processes and queues, martingale dynamics , 1983 .

[20]  Avishai Mandelbaum,et al.  Queues with Many Servers and Impatient Customers , 2012, Math. Oper. Res..

[21]  Guodong Pang,et al.  Two-parameter heavy-traffic limits for infinite-server queues , 2008, Queueing Syst. Theory Appl..

[22]  Anatolii A. Puhalskii,et al.  On many-server queues in heavy traffic , 2010, 1001.2163.

[23]  Ward Whitt,et al.  Many-server heavy-traffic limit for queues with time-varying parameters , 2014, 1401.3933.

[24]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[25]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[26]  Guodong Pang,et al.  Equivalence of Fluid Models for Gt/GI/N +GI Queues , 2015, Modeling, Stochastic Control, Optimization, and Applications.

[27]  Jiheng Zhang.  Fluid models of many-server queues with abandonment , 2013, Queueing Syst. Theory Appl..

[28]  Ward Whitt,et al.  STAFFING A SERVICE SYSTEM WITH NON-POISSON NON-STATIONARY ARRIVALS , 2016 .

[29]  J. Reed,et al.  Distribution-valued heavy-traffic limits for the $\mathbf{{G/\mathit{GI}/\infty}}$ queue , 2009, 0902.2236.

[30]  Ward Whitt,et al.  Heavy-traffic limits for waiting times in many-server queues with abandonment , 2009 .

[31]  D. Iglehart,et al.  Multiple channel queues in heavy traffic. II: sequences, networks, and batches , 1970, Advances in Applied Probability.

[32]  P. Brémaud.  Point Processes and Queues , 1981 .

[33]  W. Whitt.  On the heavy-traffic limit theorem for GI/G/∞ queues , 1982 .

[34]  H. Kaspi,et al.  SPDE Limits of Many Server Queues , 2010, 1010.0330.

[35]  J. Reed,et al.  Distribution-valued heavy-traffic limits for the G/GI/∞ queue. , 2015 .

[36]  K. Ramanan,et al.  Fluid limits of many-server queues with reneging , 2010, 1011.2921.

[37]  Sandra Lowe,et al.  Probability A Graduate Course , 2016 .

[38]  Ard,et al.  STABILIZING PERFORMANCE IN NETWORKS OF QUEUES WITH TIME-VARYING ARRIVAL RATES , 2014 .

[39]  J. Wellner,et al.  Empirical Processes with Applications to Statistics , 2009 .

[40]  Ward Whitt,et al.  Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals , 2012, Oper. Res..

[41]  Joel Zinn,et al.  The Bounded Law of the Iterated Logarithm for the Weighted Empirical Distribution Process in the Non-I.I.D. Case , 1984 .

[42]  Ward Whitt,et al.  Coping with Time‐Varying Demand When Setting Staffing Requirements for a Service System , 2007 .

[43]  Ward Whitt,et al.  The last departure time from an Mt/G/∞ queue with a terminating arrival process , 2008, Queueing Syst. Theory Appl..

[44]  Ran Liu.  Modeling and Simulation of Nonstationary Non-Poisson Processes. , 2013 .

[45]  Guy Louchard.  Large finite population queueing systems part i: The infinite server model. , 1988 .

[46]  Laurent Decreusefond,et al.  A functional central limit theorem for the M/GI/infinity queue , 2006, math/0608258.

[47]  Yunan Liu,et al.  A Functional Weak Law of Large Numbers for the Time-Varying ( G t / GI / s t + GI ) m / M t Queueing Network , 2014 .

[48]  Guodong Pang,et al.  The Impact of Dependent Service Times on Large-Scale Service Systems , 2012, Manuf. Serv. Oper. Manag..

[49]  P. Glynn,et al.  A new view of the heavy-traffic limit theorem for infinite-server queues , 1991, Advances in Applied Probability.