Flexible Queueing Architectures
暂无分享,去创建一个
[1] John Frank Charles Kingman,et al. The single server queue in heavy traffic , 1961, Mathematical Proceedings of the Cambridge Philosophical Society.
[2] J. Kingman. Some inequalities for the queue GI/G/1 , 1962 .
[3] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[4] Carl M. Harris,et al. Fundamentals of queueing theory , 1975 .
[5] Ward Whitt,et al. Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..
[6] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[7] William C. Jordan,et al. Principles on the benefits of manufacturing process flexibility , 1995 .
[8] Jean C. Walrand,et al. Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[9] Avishai Mandelbaum,et al. On Pooling in Queueing Networks , 1998 .
[10] R. Häggkvist,et al. Bipartite graphs and their applications , 1998 .
[11] J. Michael Harrison,et al. Heavy traffic resource pooling in parallel‐server systems , 1999, Queueing Syst. Theory Appl..
[12] Ronald J. Williams,et al. Dynamic Scheduling of a System with Two Parallel Servers in Heavy Traffic with Resource Pooling: Asy , 2001 .
[13] R. Srikant,et al. Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management , 2001, SIGCOMM '01.
[14] Saif Benjaafar,et al. Modeling and analysis of flexible queueing systems , 2004 .
[15] Ward Whitt,et al. A Staffing Algorithm for Call Centers with Skill-Based Routing , 2005, Manuf. Serv. Oper. Manag..
[16] Avishai Mandelbaum,et al. Statistical Analysis of a Telephone Call Center , 2005 .
[17] Seyed M. R. Iravani,et al. Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations , 2005, Manag. Sci..
[18] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .
[19] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[20] Ashvin Goel,et al. Database replication policies for dynamic content applications , 2006, EuroSys.
[21] Eytan Modiano,et al. Logarithmic delay for N × N packet switches under the crossbar constraint , 2007, TNET.
[22] Ward Whitt,et al. Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing , 2008, Manag. Sci..
[23] J. Tsitsiklis,et al. Bin Packing with Queues , 2008, Journal of Applied Probability.
[24] Albert G. Greenberg,et al. The nature of data center traffic: measurements & analysis , 2009, IMC '09.
[25] Chung-Piaw Teo,et al. Design for Process Flexibility: Efficiency of the Long Chain and Sparse Structure , 2010, Oper. Res..
[26] Chung-Piaw Teo,et al. Process Flexibility Revisited: The Graph Expander and Its Applications , 2011, Oper. Res..
[27] David Simchi-Levi,et al. Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility , 2012, Oper. Res..
[28] Laurent Massoulié,et al. Bipartite graph structures for efficient balancing of heterogeneous loads , 2012, SIGMETRICS '12.
[29] Ramandeep S. Randhawa,et al. A Little Flexibility is All You Need: On the Asymptotic Value of Flexible Capacity in Parallel Queuing Systems , 2012, Oper. Res..
[30] Gideon Weiss,et al. A product form solution to a system with multi-type jobs and multi-type servers , 2012, Queueing Syst. Theory Appl..
[31] John N. Tsitsiklis,et al. On the Power of (Even a Little) Resource Pooling , 2012 .
[32] John N. Tsitsiklis,et al. Queueing system topologies with limited flexibility , 2013, SIGMETRICS '13.
[33] Kuang Xu,et al. On the power of (even a little) flexibility in dynamic resource allocation , 2014 .
[34] Xi Chen,et al. Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders , 2015, Oper. Res..