Flexible Queueing Architectures

References

• Bassamboo A, Randhawa RS, Mieghem JAV (2012) A little flexibility is all you need: On the asymptotic value of flexible capacity in parallel queuing systems. Oper. Res. 60(6):1423–1435.Link, Google Scholar
• Bell SL, Williams RJ (2001) Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probab. 11(3):608–649.Crossref, Google Scholar
• Brown L, Gans N, Mandelbaum A, Sakov A, Shen H, Zeltyn S, Zhao L (2005) Statistical analysis of a telephone call center: A queueing-science perspective. J. Amer. Statist. Assoc. 100(469):36–50.Crossref, Google Scholar
• Chen X, Zhang J, Zhou Y (2015) Optimal sparse designs for process flexibility via probabilistic expanders. Oper. Res. 63(5):1159–1176.Link, Google Scholar
• Chou M, Teo C-P, Zheng H (2011) Process flexibility revisited: The graph expander and its applications. Oper. Res. 59(5):1090–1105.Link, Google Scholar
• Chou M, Chua GA, Teo C-P, Zheng H (2010) Design for process flexibility: Efficiency of the long chain and sparse structure. Oper. Res. 58(1):43–58.Link, Google Scholar
• Gurumurthi S, Benjaafar S (2003) Modeling and analysis of flexible queueing systems. Naval Res. Logist. 51(5):755–782.Crossref, Google Scholar
• Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.Link, Google Scholar
• Harrison JM, Lopez MJ (1999) Heavy traffic resource pooling in parallel-server systems. Queueing Systems 33(4):339–368.Crossref, Google Scholar
• Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58(301):13–30.Crossref, Google Scholar
• Hoory S, Linial N, Wigderson A (2006) Expander graphs and their applications. Bull. Amer. Math. Soc. 43(4):439–561.Crossref, Google Scholar
• Iravani SM, Oyen MPV, Sims KT (2005) Structural flexibility: A new perspective on the design of manufacturing and service operations. Management Sci. 51(2):151–166.Link, Google Scholar
• Jordan W, Graves SC (1995) Principles on the benefits of manufacturing process flexibility. Management Sci. 41(4):577–594.Link, Google Scholar
• Kandula S, Sengupta S, Greenberg A, Patel P, Chaiken R (2009) The nature of data center traffic: Measurements and analysis. Felmann A, Mathy L, eds. Proc. 9th ACM SIGCOMM Conf. Internet Measurement, IMC ’09 (ACM, New York), 202–208.Crossref, Google Scholar
• Kingman J (1962) Some inequalities for the queue GI/G/1. Biometrika 49(3/4):315–324.Crossref, Google Scholar
• Kunniyur S, Srikant R (2001) Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management. Cruz RL, Varghese G, eds. Proc. ACM SIGCOMM Conf., SIGCOMM ’01 (ACM, New York), 123–134.Crossref, Google Scholar
• Leconte M, Lelarge M, Massoulie L (2012) Bipartite graph structures for efficient balancing of heterogeneous loads. ACM SIGMETRICS Performance Evaluation Rev. 40(1):41–52.Crossref, Google Scholar
• Mandelbaum A, Reiman MI (1998) On pooling in queueing networks. Management Sci. 44(7):971–981.Link, Google Scholar
• McKeown N, Mekkittikul A, Anantharam V, Walrand J (1999) Achieving 100% throughput in an input-queued switch. IEEE Trans. Comm. 47(8):1260–1267.Crossref, Google Scholar
• Neely M, Modiano E, Cheng Y (2007) Logarithmic delay for n × n packet switches under the crossbar constraint. IEEE/ACM Trans. Networking 15(3):657–668.Crossref, Google Scholar
• Shah D, Tsitsiklis JN (2008) Bin packing with queues. J. Appl. Probab. 45(4):922–939.Crossref, Google Scholar
• Simchi-Levi D, Wei Y (2012) Understanding the performance of the long chain and sparse designs in process flexibility. Oper. Res. 60(5):1125–1141.Link, Google Scholar
• Soundararajan G, Amza C, Goel A (2006) Database replication policies for dynamic content applications. ACM SIGOPS Operating Systems Rev., 40(4):89–102.Crossref, Google Scholar
• Talreja R, Whitt W (2008) Fluid models for overloaded multiclass many-server queueing systems with first-come, first-served routing. Management Sci. 54(8):1513–1527.Link, Google Scholar
• Tsitsiklis JN, Xu K (2012) On the power of (even a little) resource pooling. Stochastic Systems 2(1):1–66.Link, Google Scholar
• Tsitsiklis JN, Xu K (2013) Queueing system topologies with limited flexibility. ACM SIGMETRICS Performance Evaluation Rev. 41(1):167–178.Crossref, Google Scholar
• Visschers J, Adan I, Weiss G (2012) A product form solution to a system with multi-type jobs and multi-type servers. Queueing Systems 70(3):269–298.Crossref, Google Scholar
• Wallace R, Whitt W (2005) A staffing algorithm for call centers with skill-based routing. Manufacturing Service Oper. Management 7(4):276–294.Link, Google Scholar
• Xu K (2014) On the power of (even a little) flexibility in dynamic resource allocation. PhD thesis, Massachusetts Institute of Technology. http://hdl.handle.net/1721.1/91101.Google Scholar