Price of anarchy in non-cooperative load balancing

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Ayesta, U ^a   Brun, O ^a   Prabhu, B J ^a  

^a UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

Atomic games; Load balancing; Price of anarchy; Processor sharing

Indexed keywords

HOLDING COSTS; INCOMING TRAFFIC; LOAD-BALANCING; NASH EQUILIBRIUM; NON-COOPERATIVE; PERFORMANCE CRITERION; PRICE OF ANARCHY; PROCESSOR SHARING; SERVICE RATES; SYMMETRIC GAMES; WEIGHTED MEAN;

NANOTECHNOLOGY; PARALLEL ARCHITECTURES; SERVERS;

COSTS;

EID: 77953312241     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462195     Document Type: Conference Paper

References (21)

1. E. Altman, U. Ayesta, and B. J. Prabhu. Load balancing in processor sharing systems. To appear in Telecommunication Systems, 2009.
2. U. Ayesta, O. Brun, and B. J. Prabhu. Price of anarchy in noncooperative server-farms, 2009. LAAS Research Report. Available at http://www.laas.fr/~run/ loadbalancing.pdf.
3. C. H. Bell and S. Stidham. Individual versus social optimization in the allocation of customers to alternative servers. Management Science, 29:831-839, 1983.
4. S. C. Borst. Optimal probabilistic allocation of customer types to servers. In Proceedings of ACM SIGMETRICS, pages 116-125, Sept. 1995.
5. V. Cardellini, E. Casalicchio, M. Colajanni, and P. S. Yu. The state of the art in locally distributed web-server systems. ACM Computing Surveys, 34(2):263-311, 2001.
6. H. L. Chen, J. Marden, and A. Wierman. The effect of local scheduling in load balancing designs. In Proceedings of IEEE Infocom, 2009.
7. Y.-C. Chow and W. H. Kohler. Models for dynamic load balancing in a heterogeneous multiple processor system. IEEE Transactions on Computers, 28(5):354-361, 1979.
8. R. Cominetti, J. R. Correa, and N. E. Stier-Moses. The impact of oligopolistic competition in networks. Operations Research, Published online in Articles in Advance, DOI: 10.1287/opre.1080.0653, June 2009.
9. A. Czumaj, P. Krysta, and B. Vocking. Selfish traffic allocation for server farms. In Proceedings of STOC, 2002.
10. S. El-Zoghdy, H. Kameda, and J. Li. Comparison of dynamic vs. static load-balancing policies in a mainframe-personal computer network model. Information, 5(4):431-446, 2002.
11. H. Feng, V. Misra, and D. Rubenstein. Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems. Performance Evaluation, 62(1-4):36-39, 2005.
12. V. Gupta, M. Harchol-Balter, K. Sigman, and W. Whitt. Analysis of join-the-shortest-queue routing for web server farms. In Proceedings of Performance, 2007.
13. M. Haviv and T. Roughgarden. The price of anarchy in an exponential multi-server. Operations Research Letters, 35:421-426, 2007.
14. H. Kameda, J. Li, C. Kim, and Y. Zhang. Optimal load balancing in distributed computer systems. Springer-Verlag, 1997.
15. Y. Korilis, A. Lazar, and A. Orda. Capacity allocation under noncooperative routing. IEEE Transactions on Automatic Control, 42(3):309-325, March 1997.
16. E. Koutsoupias and C. H. Papadimitriou. Worst-case equilibria. In STACS 1999, 1999.
17. D. Monderer and L. S. Shapley. Potential games. Games and Econ. Behavior, 14:124-143, 1996.
18. L. M. Ni and K. Hwang. Optimal load balancing in a multiple processor with many job classes. IEEE Trans. Software Eng., 11(5):491-496, 1985.
19. A. Orda, R. Rom, and N. Shimkin. Competitive routing in multiuser communication networks. IEEE/ACM Transactions on Networking, 1:510-521, October 1993.
20. B. Shirazi, A. Hurson, and K. Kavi. Scheduling and load-balancing in parallel and distributed systems. Silver Spring, MD: IEEE Computer Society Press, 1995.
21. T. Wu and D. Starobinski. A comparative analysis of server selection in content replication networks. IEEE/ACM Trans. Netw., 16(6):1461-1474, 2008.