Fair online load balancing

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn 2006, Issue , 2006, Pages 291-298

  Buchbinder, Niv ^a   Naor, Joseph ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Competitive analysis; Greedy algorithm; Load balancing; Online algorithms; Scheduling

Indexed keywords

ALGORITHMS; LOADS (FORCES); MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING;

COMPETITIVE ANALYSIS; GREEDY ALGORITHMS; LOAD BALANCING; ONLINE ALGORITHMS;

ONLINE SYSTEMS;

EID: 33749582286     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1148109.1148159     Document Type: Conference Paper

References (18)

1. Miriam Allalouf and Yuval Shavitt. Maximum flow routing with weighted max-min fairness. In First International Workshop on QoS Routing (WQoSR), 2004.
2. J. A. Aslam, A. Rasala, C. Stein, and N. Young. Improved bicriteria existence theorems for scheduling. In SODA: ACM-SIAM Symposium on Discrete Algorithms, pages 846-847, 1999.
3. James Aspnes, Yossi Azar, Amos Fiat, Serge Plotkin, and Orli Waarts. On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM, 44(3):486-504, 1997.
4. Yossi Azar. On-line load balancing. Online Algorithms - The State of the Art, Springer, (8):178-195, 1998.
5. Yossi Azar, Leah Epstein, Yossi Richter, and Gerhard J. Woeginger. All-norm approximation algorithms. J. Algorithms, 52(2): 120-133, 2004.
6. Yossi Azar, Joseph Naor, and Raphael Rom. The competitiveness of on-line assignments. Journal of Algorithms, 18:221-237, 1995.
7. Dimitri Bertsekas and Robert Gallager. Data networks. Prentice-Hall, Inc., 1987.
8. N. Buchbinder and J. Naor. A primal-dual approach to online routing and packing. In Manuscript, 2006.
9. John E. Littlewood Godfrey H. Hardy and George P'olya. Some simple inequalities satisfied by convex functions. In Messenger Math, pages 58:145-152, 1929.
10. Ashish Goel and Adam Meyerson. Simultaneous optimization via approximate majorization for concave profits or convex costs. 2005.
11. Ashish Goel, Adam Meyerson, and Serge A. Plotkin. Approximate majorization and fair online load balancing. In Symposium on Discrete Algorithms, pages 384-390, 2001.
12. Ashish Goel, Adam Meyerson, and Serge A. Plotkin. Combining fairness with throughput: Online routing with multiple objectives. J. Comput. Syst. Sci., 63(1):62-79, 2001.
13. J.M. Jaffe. Bottleneck flow control. IEEE Transactions on Communications, 29(7):954-962, 1981.
14. Jon Kleinberg, Eva Tardos, and Yuval Rabani. Fairness in routing and load balancing. In FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, page 568, 1999.
15. Amit Kumar and Jon M. Kleinberg. Fairness measures for resource allocation. In IEEE Symposium on Foundations of Computer Science, pages 75-85, 2000.
16. R. K. lain, Dab-Ming Chiu, and William Howe. A quantitative measure of fairness and discrimination for resource allocation in shared systems. In DEC Res. Rep. TR-301, 1984.
17. A. W. Marshal and I. Olkin. Inequalities: Theory of majorization and its applications. In volume 143 of Mathematics in Science and Engineering. Academic Press, New York, 1979.
18. Clifford Stein and Joel Wein. On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Technical Report TR96-295, 1996.