Analysis of join-the-shortest-queue routing for web server farms

[1]  Ward Whitt,et al.  Heavy-Traffic Limits for the G/H2*/n/mQueue , 2005, Math. Oper. Res..

[2]  W. Whitt.  Heavy-Traffic Limits for the G / H ∗ 2 / n / m Queue Ward Whitt , 2005 .

[3]  Mor Harchol-Balter,et al.  Size-based scheduling to improve web performance , 2003, TOCS.

[4]  Mor Harchol-Balter,et al.  Task assignment with unknown duration , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[5]  Mor Harchol-Balter,et al.  On Choosing a Task Assignment Policy for a Distributed Server System , 1998, J. Parallel Distributed Comput..

[6]  S. Stidham,et al.  Sample-Path Analysis of Queueing Systems , 1998 .

[7]  Paul Barford,et al.  Generating representative Web workloads for network and server performance evaluation , 1998, SIGMETRICS '98/PERFORMANCE '98.

[8]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[9]  Donald F. Towsley,et al.  Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: An Algorithmic Approach , 1995, IEEE Trans. Computers.

[10]  Ivo J. B. F. Adan,et al.  Upper and lower bounds for the waiting time in the symmetric shortest queue system , 1994, Ann. Oper. Res..

[11]  Ivo J. B. F. Adan,et al.  Matrix-geometric analysis of the shortest queue problem with threshold jockeying , 1993, Oper. Res. Lett..

[12]  Cauligi S. Raghavendra,et al.  An analysis of the join the shortest queue (JSQ) policy , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[13]  Ivo J. B. F. Adan,et al.  Analysis of the symmetric shortest queue problem , 1990 .

[14]  Flavio Bonomi,et al.  On Job Assignment for a Parallel System of Processor Sharing Queues , 1990, IEEE Trans. Computers.

[15]  Randolph D. Nelson,et al.  An approximation to the response time for shortest queue routing , 1989, SIGMETRICS '89.

[16]  J. W. Cohen,et al.  Boundary value problems in queueing theory , 1988, Queueing Syst. Theory Appl..

[17]  M. J. M. Posner,et al.  Algorithmic and approximation analyses of the shorter queue model , 1987 .

[18]  Charles Knessl,et al.  Two Parallel M/G/1 Queues where Arrivals Join the System with the Smaller Buffer Content , 1987, IEEE Trans. Commun..

[19]  B. Conolly.  The autostrada queueing problem , 1984, Journal of Applied Probability.

[20]  Tapani Lehtonen,et al.  On the optimality of the shortest line discipline , 1984 .

[21]  W. Whitt.  Comparison conjectures about the M/G/ s queue , 1983 .

[22]  Onno Boxma,et al.  Boundary value problems in queueing system analysis , 1983 .

[23]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[24]  P. Brémaud.  Point Processes and Queues , 1981 .

[25]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[26]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[27]  Wk Grassmann,et al.  Transient and steady state results for two parallel queues , 1980 .

[28]  R. Weber.  On the optimal assignment of customers to parallel servers , 1978, Journal of Applied Probability.

[29]  G. J. Foschini,et al.  A Basic Dynamic Routing Problem and Diffusion , 1978, IEEE Trans. Commun..

[30]  R. F. Brown,et al.  PERFORMANCE EVALUATION , 2019, ISO 22301:2019 and business continuity management – Understand how to plan, implement and enhance a business continuity management system (BCMS).

[31]  J. Hunter.  Two Queues in Parallel , 1969 .

[32]  J. Kingman.  Two Similar Queues in Parallel , 1961 .