Law of large numbers limits for many-server queues

[5] Ethier, S. N. and Kurtz, T. G. (1986). <i>Markov Processes</i>: <i>Characterization and Convergence</i>. Wiley, New York.

[10] Jacod, J. and Shiryaev, A. N. (1987). <i>Limit Theorems for Stochastic Processes. Grundlehren der Mathematischen Wissenschaften</i> [<i>Fundamental Principles of Mathematical Sciences</i>] <b>288</b>. Springer, Berlin.

[1] Asmussen, S. (2003). <i>Applied Probability and Queues</i>, 2nd ed. <i>Applications of Mathematics</i> (<i>New York</i>) <b>51</b>. Springer, New York.

[4] Dupuis, P. and Ellis, R. S. (1997). <i>A Weak Convergence Approach to the Theory of Large Deviations</i>. Wiley, New York.

[9] Harrison, J. M. (1985). <i>Brownian Motion and Stochastic Flow Systems</i>. Wiley, New York.

[13] Kang, W. and Ramanan, K. (2011). Asymptotic approximations for the stationary distributions of many-server queues. <i>Ann. Appl. Probab.</i> To appear.

[14] Kaspi, H. and Ramanan, K. (2010). SPDE limits of many server queues. Preprint.

[20] Rudin, W. (1974). <i>Real and Complex Analysis</i>, 2nd ed. McGraw-Hill, New York.

[21] Shilov, G. E. (1968). <i>Generalized Functions and Partial Differential Equations</i>. Gordon and Breach, New York.

[22] Whitt, W. (2006). Fluid models for multiserver queues with abandonments. <i>Oper. Res.</i> <b>54</b> 37–54.

[2] Brown, L., Gans, N., Mandelbaum, A., Sakov, A., Shen, H., Zeltyn, S. and Zhao, L. (2005). Statistical analysis of a telephone call center: A queueing-science perspective. <i>J. Amer. Statist. Assoc.</i> <b>100</b> 36–50.

[3] Decreusefond, L. and Moyal, P. (2008). Fluid limit of a heavily loaded EDF queue with impatient customers. <i>Markov Process. Related Fields</i> <b>14</b> 131–158.

[6] Gromoll, H. C., Puha, A. L. and Williams, R. J. (2002). The fluid limit of a heavily loaded processor sharing queue. <i>Ann. Appl. Probab.</i> <b>12</b> 797–859.

[7] Gromoll, H. C., Robert, P. and Zwart, B. (2008). Fluid limits for processor-sharing queues with impatience. <i>Math. Oper. Res.</i> <b>33</b> 375–402.

[8] Halfin, S. and Whitt, W. (1981). Heavy-traffic limits for queues with many exponential servers. <i>Oper. Res.</i> <b>29</b> 567–588.

[11] Jakubowski, A. (1986). On the Skorokhod topology. <i>Ann. Inst. H. Poincaré Probab. Statist.</i> <b>22</b> 263–285.

[12] Kang, W. and Ramanan, K. (2010). Fluid limits of many-server queues with reneging. <i>Ann. Appl. Probab.</i> <b>20</b> 2204–2260.

[15] Mandelbaum, A., Massey, W. A. and Reiman, M. I. (1998). Strong approximations for Markovian service networks. <i>Queueing Syst.</i> <b>30</b> 149–201.

[16] Parthasarathy, K. R. (1967). <i>Probability Measures on Metric Spaces. Probability and Mathematical Statistics</i> <b>3</b>. Academic Press, New York.

[17] Pang, G., Talreja, R. and Whitt, W. (2007). Martingale proofs of many-server heavy-traffic limits for Markovian queues. <i>Probab. Surv.</i> <b>4</b> 193–267.

[18] Ramanan, K. and Reiman, M. I. (2003). Fluid and heavy traffic diffusion limits for a generalized processor sharing model. <i>Ann. Appl. Probab.</i> <b>13</b> 100–139.

[19] Reed, J. (2009). The <i>G</i>∕<i>GI</i>∕<i>N</i> queue in the Halfin–Whitt regime. <i>Ann. Appl. Probab.</i> <b>19</b> 2211–2269.