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

Performance Evaluation

Volumn 64, Issue 9-12, 2007, Pages 1062-1081

  Gupta, Varun ^a   Harchol Balter, Mor ^a   Sigman, Karl ^b   Whitt, Ward ^b  

^a Carnegie Mellon University   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Insensitivity; JSQ; Processor sharing; Shortest queue routing; Single queue approximation

Indexed keywords

APPROXIMATION THEORY; MARKOV PROCESSES; QUEUEING NETWORKS; SENSITIVITY ANALYSIS; SERVERS; WORLD WIDE WEB;

PROCESSOR SHARING; SHORTEST QUEUE ROUTING; SINGLE-QUEUE APPROXIMATION;

NETWORK ROUTING;

EID: 34548130717     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2007.06.012     Document Type: Article

References (29)

1. Adan I.J.B.F., van Houtum G.J., and van der Wal J. Upper and lower bounds for the waiting time in the symmetric shortest queue system. Ann. Oper. Res. 48 (1994) 197-217
2. Adan I.J.B.F., Wessels J., and Zijm W.H.M. Analysis of the symmetric shortest queue problem. Stoch. Models 6 (1990) 691-713
3. Adan I.J.B.F., Wessels J., and Zijm W.H.M. Matrix-geometric analysis of the shortest queue problem with threshold jockeying. Oper. Res. Lett. 13 (1993) 107-112
4. P. Barford, M.E. Crovella, Generating representative Web workloads for network and server performance evaluation, in: Proceedings of Performance '98/SIGMETRICS'98, July 1998, pp. 151-160. Software for Surge is available from Mark Crovella's home page
5. Bonomi F. On job assignment for a parallel system of processor sharing queues. IEEE Trans. Comput. 39 7 (1990) 858-869
6. Boxma O.J., and Cohen J.W. Boundary Value Problems in Queueing System Analysis (1983), North Holland, Amsterdam
7. Brémaud P. Point Processes and Queues (1981), Springer-Verlag, New York
8. Conolly B.W. The autostrada queueing problem. J. Appl. Probab. 21 (1984) 394-403
9. Crovella M., Harchol-Balter M., and Murta C. On choosing a task assignment policy for a distributed server system. J. Parallel Distrib. Comput. 59 2 (1999) 204-228
10. M.E. Crovella, A. Bestavros, Self-similarity in World Wide Web traffic: Evidence and possible causes, in: Proceedings of the 1996 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, May 1996, pp. 160-169
11. Daley D., and Vere-Jones D. An Introduction to the Theory of Point Processes (1988), Springer, New York
12. El-Taha M., and Stidham S. Sample-Path Analysis of Queueing System (1999), Kluwer, Boston
13. Ephremides A., Varaiya P., and Walrand J. A simple dynamic routing problem. IEEE Trans. Automat. Control AC-25 4 (1980) 690-693
14. Flatto L., and McKean H.P. Two queues in parallel. Comm. Pure Appl. Math. 30 (1977) 255-263
15. Foschini G., and Salz J. A basic dynamic routing problem and diffusion. IEEE Trans. Commun. 26 3 (1978) 320-328
16. Grassmann W.K. Transient and steady state results for two parallel queues. Omega 8 (1980) 105-112
17. Harchol-Balter M. Task assignment with unknown duration. J. ACM 49 2 (2002) 260-288
18. Harchol-Balter M., Schroeder B., Bansal N., and Agrawal M. Size-based scheduling to improve web performance. ACM Trans. Comput. Syst. 21 2 (2003) 207-233
19. Kelly F.P. Reversibility and Stochastic Networks (1979), Wiley, Chichester
20. Kingman J.F.C. Two similar queues in parallel. Biometrika 48 (1961) 1316-1323
21. Knessl C., Matkowsky B.J., Schuss Z., and Tier C. Two parallel M / G / 1 queues where arrivals join the system with the smaller buffer content. IEEE Trans. Commun. 35 11 (1987) 1153-1158
22. H.C. Lin, C.S. Raghavendra, An analysis of the join the shortest queue (JSQ) policy, in: Proc. 12th Int'l Conf. Distributed Computing Systems, 1992, pp. 362-366
23. Lui J.C.S., Muntz R.R., and Towsley D.F. Bounding the mean response time of the minimum expected delay routing policy: An algorithmic approach. IEEE Trans. Comput. 44 12 (1995) 1371-1382
24. Nelson R.D., and Philips T.K. An approximation to the response time for shortest queue routing. ACM Perform. Eval. Review 17 (1989) 181-189
25. Rao B.M., and Posner M.J.M. Algorithmic and approximation analyses of the shorter queue model. Naval Res. Logist. 34 (1987) 381-398
26. Weber R.W. On optimal assignment of customers to parallel servers. J. Appl. Probab. 15 (1978) 406-413
27. Whitt W. Comparison conjectures about the M / G / s queue. Oper. Res. Lett. 2 5 (1983) 203-209
28. 2*/n/m queue. Math. Oper. Res. 30 1 (2005) 1-27
29. Winston W. Optimality of the shortest line discipline. J. Appl. Probab. 14 (1977) 181-189