A Poisson limit for the departure process from a queue with many busy servers
Tài liệu tham khảo
K. Aras, Y. Liu, W. Whitt, Heavy-traffic limit for the initial content process, Columbia University, 2014. http://www.columbia.edu/~ww2040/allpapers.html.
Bremaud, 1981
Disney, 1985, Queueing networks: a survey of their random processes, SIAM Rev., 27, 335, 10.1137/1027109
Eick, 1993, The physics of the Mt/G/∞ queue, Oper. Res., 41, 731, 10.1287/opre.41.4.731
Ethier, 1986
Garnett, 2002, Designing a call center with impatient customers, Manuf. Serv. Oper. Manage., 4, 208, 10.1287/msom.4.3.208.7753
Halfin, 1981, Heavy-traffic limits for queues with many exponential servers, Oper. Res., 29, 567, 10.1287/opre.29.3.567
Jacod, 1987
Jennings, 1996, Server staffing to meet time-varying demand, Manage. Sci., 42, 1383, 10.1287/mnsc.42.10.1383
Kang, 2010, Law of large number limit for many-server queues, Ann. Appl. Probab., 21, 33
Kaspi, 2011, Law of large number limit for many-server queues, Ann. Appl. Probab., 20, 2204
Krichagina, 1997, A heavy-traffic analysis of a closed queueing system with a GI/∞ service center, Queueing Syst., 25, 235, 10.1023/A:1019108502933
Liu, 2012, A many-server fluid limit for the Gt/GI/st+GI queueing model experiencing periods of overloading, Oper. Res. Lett., 40, 307, 10.1016/j.orl.2012.05.010
Liu, 2012, The Gt/GI/st+GI many-server fluid queue, Queueing Syst., 71, 405, 10.1007/s11134-012-9291-0
Liu, 2014, Many-server heavy-traffic limits for queues with time-varying parameters, Ann. Appl. Probab., 24, 378, 10.1214/13-AAP927
N. Ma, W. Whitt, A performance algorithm for periodic queues, Columbia University, Working paper, 2016.
Pang, 2007, Martingale proofs of many-server heavy-traffic limits for Markovian queues, Probab. Surv., 4, 193, 10.1214/06-PS091
Pang, 2010, Two-parameter heavy-traffic limits for infinite-server queues, Queueing Syst., 65, 325, 10.1007/s11134-010-9184-z
Pekoz, 2002, Poisson traffic flow in a general feedback queue, J. Appl. Probab., 39, 630, 10.1239/jap/1034082133
Sriram, 1986, Characterizing superposition arrival processes in packet multiplexers for voice and data, IEEE J. Sel. Areas Commun. SAC, 4, 833, 10.1109/JSAC.1986.1146402
Whitt, 1982, Approximating a point process by a renewal process: two basic methods, Oper. Res., 30, 125, 10.1287/opre.30.1.125
Whitt, 1984, Departures from a queue with many busy servers, Math. Oper. Res., 9, 534, 10.1287/moor.9.4.534
Whitt, 2002
Whitt, 1982, On the heavy-traffic limit theorem for GI/G/∞ queue, Adv. Appl. Probab., 14, 171, 10.2307/1426738