An Approximate Analysis of Load Balancing Using Stale State Information for Servers in Parallel

Proceedings of the Second IASTED International Conference on Communications, Internet, and Information Technology

Volumn , Issue , 2003, Pages 720-726

  Cao, Jianhua ^a   Nyberg, Christian ^a  

^a LUND INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Load Balancing; Queueing Systems; Stale Information

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECISION THEORY; QUEUEING THEORY; ROUTERS; SERVERS;

LOAD BALANCING; QUEUEING SYSTEMS; STALE INFORMATION;

INFORMATION TECHNOLOGY;

EID: 1542538750     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Colin E. Bell and Shaler Stidham Jr. Individual versus social optimization in the allocation of customers to alternative servers. Management Science, 29(7): 831-839, July 1983.
2. Dimitri P. Bertsekas. Optimal routing and flow control methods for communication networks. In A. Bensoussan and J. L. Lions, editors, Analysis and Optimization of Systems, volume 44 of Lecture Notes in Control and Information Science, pages 615-643. Springer-Verlag, 1982.
3. Tony Bourke. Server Load Balancing. O'Reilly & Associates, 2001. 2nd edition.
4. Joel E. Cohen and Frank P. Kelly. A paradox of congestion in a queuing network. Journal of Applied Proabbility, 27:730-734, 1990.
5. Michael Dahlin. Interpreting stale load information. IEEE Transactions on Parallel and Distributed System, 11(10):1033-1047, October 2001.
6. Pradeep Dubey. Inefficiency of nash equilibria. Mathematics of Operation Research, 11:1-8, 1986.
7. Derek L. Eager, Edward D. Lazowska, and John Zahorjan. Adaptive load sharing in homogeneous distributed systems. IEEE Transactions on Software Engineering, SE-12(5):662-675, May 1986.
8. Frank A. Haight. Two queues in parallel. Biometrika, 45(3/4):401-410, December 1958.
9. Refael Hassin and Moshe Haviv. To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems. Kluwer Academic Publishers, 2003.
10. Alan C. Hindmarsh. Scientific Computing, chapter ODEPACK, A Systematized Collection of ODE Solvers. North-Holland, Amsterdam, 1983.
11. Gisli Hjalmtysson and Ward Whitt. Periodic load balancing. Queueing Systems, 30:203-250, 1998.
12. John F. C. Kingman. Two similar queues in parallel. Annals of Mathematical Statistics, 32(4):1314-1323, December 1961.
13. Chandra Kopparapu. Load Balancing Servers, Firewalls, * Caches. John Wiley & Sons, 2002.
14. Michael Mitzenmacher. How useful is old information? IEEE Transactions On Parallel and Distributed Systems, 11(1):6-20, January 2000.
15. Roger B. Myerson. Game Theory, Analysis of Conflicit. Harvard University Press, 1991.
16. IBM Redbooks. Load-Balancing Internet Servers. IBM Corp., 1998.
17. IBM Redbooks. Load Balancing for eNetwork Communications Servers. IBM Corp, 1999.
18. Keith W. Ross and David D. Yao. Optimal load balancing and scheduling in a distributed computer system. Journal of the ACM, 38(3):676-690, July 1991.
19. Asser N. Tantawi and Don Towsley. Optimal static load balancing in distributed computer systems. Journal of the ACM, 32(2):445-465, April 1985.
20. Richard R. Weber. On the optimal assignment of customers to parallel servers. Journal of Applied Probability, 15:406-413, 1978.
21. Ward Whitt. Deciding which queue to join: Some counterexamples. Operations Research, 34(1):55-62, January-February 1986.
22. Wayne Winston. Optimality of the shortest line discipline. Journal of Applied Probability, 14:181-189, 1977.
23. Songnian Zhou. A trace-driven simulation study of dynamic load balancing. IEEE Transactions On Software Engineering, 14(9):1327-1341, September 1988.