Heavy-Traffic Limit of the GI/GI/1 Stationary Departure Process and Its Variance Function

References

• Abate J, Whitt W (1987) Transient behavior of regulated Brownian motion I: Starting at the origin. Adv. Appl. Probab. 19(3):560–598.Google Scholar
• Abate J, Whitt W (1988) The correlation functions of RBM and M/M/1. Stochastic Models 4(2):315–359.Google Scholar
• Abate J, Whitt W (1992) The Fourier-series method for inverting transforms of probability distributions. Queueing Systems 10(1–2):5–88.Google Scholar
• Abate J, Whitt W (1995) Numerical inversion of Laplace transforms of probability distributions. ORSA J. Comput. 7(1):36–43.Link, Google Scholar
• Aras AK, Chen C, Liu Y (2018) Many-server Gaussian limits for overloaded non-Markovian queues with customer abandonment. Queueing Systems, ePub ahead of print March 28, https://doi.org/10.1007/s11134-018-9575-0.Google Scholar
• Aras K, Liu Y, Whitt W (2017b) Heavy-traffic limit for the initial content process. Stochastic Systems 7(1):95–142.Link, Google Scholar
• Asmussen S (2003) Applied Probability and Queues, 2nd ed. (Springer, New York).Google Scholar
• Bandi C, Bertsimas D, Youssef N (2015) Robust queueing theory. Oper. Res. 63(3):676–700.Link, Google Scholar
• Berger AW, Whitt W (1992) The Brownian approximation for rate-control throttles and the G/G/1/C queue. J. Discrete Event Dynam. Systems 2(1):7–60.Google Scholar
• Bertsimas D, Nakazato D (1990) The departure process from a GI/G/1 queue and its applications to the analysis of tandem queues. Operations Research Center Report OR 245-91, MIT, Cambridge, MA.Google Scholar
• Borovkov AA (1965) Some limit theorems in the theory of mass service, II. Theor. Probab. Appl. 10(3):375–400.Google Scholar
• Budhiraja A, Lee C (2009) Stationary distribution convergence for generalized Jackson networks in heavy traffic. Math. Oper. Res. 34(1):45–56.Link, Google Scholar
• Burke PJ (1956) The output of a queueing system. Oper. Res. 4(6):699–704.Link, Google Scholar
• Chow S-N, Hale JK (2012) Methods of Bifurcation Theory, Vol. 251 (Springer, New York).Google Scholar
• Cohen JW (1982) The Single Server Queue, 2nd ed. (North-Holland, Amsterdam).Google Scholar
• Cox DR, Lewis PAW (1966) The Statistical Analysis of Series of Events (Methuen, London).Google Scholar
• Daley D, Vere-Jones D (2008) An Introduction to the Theory of Point Processes, 2nd ed. (Springer, New York).Google Scholar
• Daley DJ (1971) Weakly stationary point processes and random measures. J. Roy. Statist. Soc. 33(3):406–428.Google Scholar
• Daley DJ (1975) Further second-order properties of certain single-server queueing systems. Stoch. Proc. Appl. 3(2):185–191.Google Scholar
• Daley DJ (1976) Queueing output processes. Adv. Appl. Prob. 8(2):395–415.Google Scholar
• Feller W (1971) An Introduction to Probability Theory and Its Applications, 2nd ed. (John Wiley & Sons, New York).Google Scholar
• Fendick KW, Whitt W (1989) Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queue. Proc. IEEE 71(1):171–194.Google Scholar
• Ferng H-W, Chang J-F (2001) Departure processes of BMAP/G/1 queues. Queueing Systems 39(1):109–135.Google Scholar
• Gamarnik D, Goldberg DA (2013) Steady-state GI/GI/n queue in the Halfin-Whitt regime. Ann. Appl. Probab. 23(6):2382–2419.Google Scholar
• Gamarnik D, Zeevi A (2006) Validity of heavy traffic steady-state approximations in generalized Jackson networks. Ann. Appl. Probab. 16(1):56–90.Google Scholar
• Hanbali AA, Mandjes M, Nazarathy Y, Whitt W (2011) The asymptotic variance of departures in critically loaded queues. Adv. Appl. Prob. 43(1):243–263.Google Scholar
• Harrison JM (1985) Brownian Motion and Stochastic Flow Systems (John Wiley & Sons, New York).Google Scholar
• Harrison JM, Williams RJ (1990) On the quasireversibility of a multiclass Brownian service station. Ann. Probab. 18(3):1249–1268.Google Scholar
• Harrison JM, Williams RJ (1992) Brownian models of feedforward queueing networks: Quasireversibility and product-form solutions. Ann. Appl. Prob. 2(2):263–293.Google Scholar
• Hautphenne S, Kerner Y, Nazarathy Y, Taylor P (2015) The intercept term of the asymptotic variance curve for some queueing output processes. Eur. J. Oper. Res. 242(2):455–464.Google Scholar
• Hu JQ (1996) The departure process of the GI/G/1 queue and its Maclaurin series. Oper. Res. 44(5):810–815.Link, Google Scholar
• Iglehart DL, Whitt W (1970a) Multiple channel queues in heavy traffic, I. Adv. Appl. Probab. 2(1):150–177.Google Scholar
• Iglehart DL, Whitt W (1970b) Multiple channel queues in heavy traffic, II: Sequences, networks and batches. Adv. Appl. Probab. 2(2):355–369.Google Scholar
• Karpelevich FI, Kreinin AY (1994) Heavy-Traffic Limits for Multiphase Queues, Vol. 137 (American Mathematical Society, Providence, RI).Google Scholar
• Kim S (2011a) Modeling cross correlation in three-moment four-parameter decomposition approximation of queueing networks. Oper. Res. 59(2):480–497.Link, Google Scholar
• Kim S (2011b) The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes. Queueing Systems 68(2):193–216.Google Scholar
• Kingman JFC (1961) The single server queue in heavy traffic. Proc. Camb. Phil. Soc. 57(4):902–904.Google Scholar
• Nazarathy Y (2011) The variance of departure processes: Puzzling behavior and open problems. Queueing Systems 68(3–4):385–394.Google Scholar
• Nieuwenhuis G (1989) Equivalence of functional limit theorems for stationary point processes and their Palm distributions. Probab. Theory and Related Fields 81(4):593–608.Google Scholar
• O’Connell N, Yor M (2001) Brownian analogues of Burke’s theorem. Stoch. Proc. Appl. 96(2):285–304.Google Scholar
• Reiman MI (1984) Open queueing networks in heavy traffic. Math. Oper. Res. 9(3):441–458.Link, Google Scholar
• Ross SM (1996) Stochastic Processes, 2nd ed. (John Wiley & Sons, New York).Google Scholar
• Sigman K (1995) Stationary Marked Point Processes: An Intuitive Approach (Chapman and Hall, New York).Google Scholar
• Szczotka W (1990) Exponential approximation of waiting time and queue length for queues in heavy traffic. Adv. Appl. Probab. 22(1):230–240.Google Scholar
• Takacs L (1962) Introduction to the Theory of Queues (Oxford University Press, New York).Google Scholar
• Whitt W (1982) Approximating a point process by a renewal process: Two basic methods. Oper. Res. 30(1):125–147.Link, Google Scholar
• Whitt W (1983) The queueing network analyzer. Bell Laboratories Tech. J. 62(9):2779–2815.Google Scholar
• Whitt W (1984) Departures from a queue with many busy servers. Math. Oper. Res. 9(4):534–544.Link, Google Scholar
• Whitt W (1995) Variability functions for parametric-decomposition approximations of queueing networks. Management Sci. 41(10):1704–1715.Link, Google Scholar
• Whitt W (2002) Stochastic-Process Limits (Springer, New York).Google Scholar
• Whitt W, You W (2018a) Using robust queueing to expose the impact of dependence in single-server queues. Oper. Res. 66(1):184–199.Link, Google Scholar
• Whitt W, You W (2018b) Algorithms to compute the index of dispersion of a stationary point process. In preparation, Columbia University, http://www.columbia.edu/˜ww2040/allpapers.html.Google Scholar
• Whitt W, You W (2018c) A robust queueing network analyzer based on indices of dispersion. In preparation, Columbia University, http://www.columbia.edu/˜ww2040/allpapers.html.Google Scholar
• Williams RJ (1992) Asymptotic variance parameters for the boundary local times of reflected Brownian motion on a compact interval. J. Appl. Probab. 29(4):996–1002.Google Scholar
• Zhang Q, Heindle A, Smirni E (2005) Characterizing the BMAP/MAP/1 departure process via the ETAQA truncation. Stochastic Models 21(2–3):821–846.Google Scholar