Asymptotic Optimality of Balanced Routing

References

• Altman E., Gaujal B., Hordijk A.Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity (2003) (Springer, Heidelberg, Germany) Crossref, Google Scholar
• Armony M. Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems: Theory Appl. (2005) 51(3–4):287–329Crossref, Google Scholar
• Ata B., Kumar S. Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies. Ann. Appl. Probab. (2005) 15(1A):331–391Crossref, Google Scholar
• Azar Y., Broder A., Karlin A., Upfal E. Balanced allocations. SIAM J. Comput. (1999) 29(1):180–200Crossref, Google Scholar
• Bell S. L., Williams R. J. Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probab. (2001) 11(3):608–649Crossref, Google Scholar
• Billingsley P.Convergence of Probability Measures (1968) (Wiley, New York) Google Scholar
• Bramson M. State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems, Theory Appl. (1998) 30(1–2):89–148Crossref, Google Scholar
• Chen H., Shanthikumar J. G. Fluid limits and diffusion approximations for networks of multi-server queues in heavy traffic. J. Discrete Event Dynam. Systems (1994) 4(3):269–291Crossref, Google Scholar
• Chen H., Yao D. D.Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization (2001) (Springer-Verlag, New York) Crossref, Google Scholar
• Ethier S. N., Kurtz T. G.Markov Processes (1986) (Wiley, New York) Crossref, Google Scholar
• Gupta V., Balter M. H., Sigman K., Whitt W. Analysis of join-the-shortest-queue routing for Web server farms. Performance Evaluation (2007) 64(9–12):1062–1081Crossref, Google Scholar
• Hajek B. External splittings of point processes. Math. Oper. Res. (1985) 10(4):543–556Link, Google Scholar
• Harrison J. M., López M. J. Heavy traffic resource pooling in parallel-server systems. Queueing Systems: Theory Appl. (1999) 33(4):339–368Crossref, Google Scholar
• He Y.-T., Down D. G. Limited choice and locality considerations for load balancing. Performance Evaluation (2008) 65(9):670–687Crossref, Google Scholar
• Kelly F. P., Laws C. N. Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Systems (1993) 13(1–3):47–86Crossref, Google Scholar
• Lin W., Kumar P. R. Optimal control of a queueing system with two heterogeneous servers. IEEE Trans. Automatic Control (1984) 29(8):696–703Crossref, Google Scholar
• Mandelbaum A., Stolyar A. L. Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. (2004) 52(6):836–855Link, Google Scholar
• Mitzenmacher M. The power of two choices in randomized load balancing. IEEE Trans. Parallel and Distributed Comput. (2001) 12(10):1094–1104Crossref, Google Scholar
• Mitzenmacher M., Richa A., Sitaraman R., Pardalos P., Rajasekaran S., Rolim J. The power of two random choices: A survey of techniques and results. Handbook of Randomized Computing (2001) I(Kluwer Academic Publishers, Dordrecht, The Netherlands) 255–312Crossref, Google Scholar
• Pollard D.Convergence of Stochastic Processes (1984) (Springer-Verlag, New York) Crossref, Google Scholar
• Reiman M. I., Baccelli F., Fayolle G. Some diffusion approximations with state space collapse. Modelling and Performance Evaluation Methodology (1984) (Springer-Verlag, Berlin) 209–240Crossref, Google Scholar
• Skorohod A. V. Limit theorems for stochastic processes. Theory Probab. Appl. (1956) 1(3):261–290Crossref, Google Scholar
• Stolyar A. L. Max-weight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. (2004) 14(1):1–53Crossref, Google Scholar
• Stolyar A. L. Optimal routing in output-queued flexible server systems. Probab. Engrg. Informational Sci. (2005) 19(2):141–189Crossref, Google Scholar
• Vvednskaya N. D., Dobrushin R. L., Karpelevich F. I. Queueing system with selection of the shortest of two queues: An asymptotic approach. Problems Inform. Transmission (1996) 32(1):15–27Google Scholar
• Whitt W. Some useful functions for functional limit theorems. Math. Oper. Res. (1980) 5(1):67–85Link, Google Scholar
• Whitt W. Deciding which queue to join: Some counterexamples. Oper. Res. (1986) 34(1):55–62Link, Google Scholar
• Williams R. J. Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Systems, Theory Appl. (1998) 30(1–2):27–88Crossref, Google Scholar
• Winston W. Optimality of the shortest line discipline. J. Appl. Probab. (1977) 14(1):181–189Crossref, Google Scholar
• Ye H. Q., Yao D. D. Heavy traffic optimality of stochastic networks under utility-maximizing resource control. Oper. Res. (2008) 56(2):453–470Link, Google Scholar
• Zhang H. Q., Hsu G. H., Wang R. Heavy traffic limit theorems for sequence of shortest queueing systems. Queueing Systems, Theory Appl. (1995) 21(1–2):217–238Crossref, Google Scholar