Approximate majorization and fair online load balancing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 384-390

  Goel, Ashish ^a   Meyerson, Adam ^b   Plotkin, Serge ^b  

^a University of Southern California ^*  (United States)

^b Stanford University   (United States)

Author keywords

Algorithms; Measurement; Performance; Theory; Verification

Indexed keywords

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

References (16)

1. Yehuda Afek, Yishay Mansour, Zvi Ostfeld, Convergence complexity of optimistic rate based flow control algorithms (extended abstract), Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.89-98, May 22-24, 1996, Philadelphia, Pennsylvania, United States [doi〉10.1145/237814. 237837]
2. Yehuda Afek, Yishay Mansour, Zvi Ostfeld, Phantom: a simple and effective flow control scheme, Conference proceedings on Applications, technologies, architectures, and protocols for computer communications, p.169-182, August 28-30, 1996, Palo Alto, California, United States
3. James Aspnes, Yossi Azar, Amos Fiat, Serge Plotkin, Orli Waarts, On-line load balancing with applications to machine scheduling and virtual circuit routing, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.623-631, May 16-18, 1993, San Diego, California, United States [doi〉10.1145/167088.167248]
4. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput competitive online routing. 34th IEEE symposium on Foundations of Computer Science, pages 32-40, 1993.
5. B. Awerbuch and Y. Shavitt. Converging to approximated max-min flow fairness in logarithmic time. Proceedings of the 17th IEEE Infocom conference, pages 1350-57, 1998.
6. Yossi Azar, Joseph Naor, Raphael Rom, The competitiveness of on-line assignments, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.203-210, September 1992, Orlando, Florida, United States
7. A. Goel and P. Indyk. Stochastic load balancing with exponential jobs. IEEE Foundations of Computer Science, 1999.
8. A. Goel and A. Meyerson. Case studies in approximate majorization. Unpublished manuscript, 2000.
9. Ashish Goel, Adam Meyerson, Serge Plotkin, Combining fairness with throughput: online routing with multiple objectives, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.670-679, May 21-23, 2000, Portland, Oregon, United States [doi〉10.1145/335305.335400]
10. R. Graham. Bounds for certain multiprocessing anomalies. Bell System Tech. J., 45:1563-81, 1966.
11. G.H. Hardy, J.E. Littlewood, and G. Polya. Some simple inequalities satisfied by convex functions. Messenger Math., 58:145-152, 1929.
12. G.H. Hardy, J.E. Littlewood, and G. Polya. Inequalities. 1st ed., 2nd ed. Cambridge University Press, London and New York., 1934, 1952.
13. Jon Kleinberg, Yuval Rabani, Éva Tardos, Allocating bandwidth for bursty connections, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.664-673, May 04-06, 1997, El Paso, Texas, United States [doi〉10.1145/258533.258661]
14. Jon Kleinberg, Eva Tardos, Yuval Rabani, Fairness in Routing and Load Balancing, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.568, October 17-18, 1999
15. M.O. Lorenz. Methods of measuring concentrations of wealth. J. Amer. Statist. Assoc., 9:209-219, 1905.
16. A.W. Marshall and I. Olkin. Inequalities: theory of majorization and its applications. Academic Press (Volume 143 of Mathematics in Science and Engineering), 1979.