Advertisement

Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives

  • Sung-woo Cho
  • Ashish Goel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3405)

Abstract

We study the bandwidth allocation problem

Maximize U(x), subject to

Axc; x ≥ 0

where U is a utility function, x is a bandwidth allocation vector, and Axc represent the capacity constraints. We consider the class of canonical utility functions, consisting of functions U that are symmetric, non-decreasing, concave, and satisfy U(0) = 0. We present a single dual update subroutine that results in a primal solution which is a logarithmic approximation, simultaneously, for all canonical utility functions. The dual update subroutine lends itself to an efficient distributed implementation.

We then employ the fractional packing framework to prove that at most O(m log m) iterations of the dual update subroutine are required; here m is the number of edges in the network.

Keywords

Utility Function Dual Problem Approximation Ratio Packing Problem Bandwidth Allocation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Afek, Y., Mansour, Y., Ostfeld, Z.: Convergence complexity of optimistic rate based flow control algorithms. In: Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 89–98 (1996)Google Scholar
  2. 2.
    Awerbuch, B., Shavitt, Y.: Converging to approximated max-min flow fairness in logarithmic time. In: Proceedings of the 17th IEEE Infocom conference, pp. 1350–1357 (1998)Google Scholar
  3. 3.
    Bartal, Y., Byers, J., Raz, D.: Global optimization using local information with applications to flow control. In: 38th Annual Symposium on Foundations of Computer Science, pp. 303–312 (1997)Google Scholar
  4. 4.
    Bartal, Y., Farach-Colton, M., Andrews, M., Zhang, L.: Fast fair and frugal bandwidth allocation in atm networks. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 92–101 (1999)Google Scholar
  5. 5.
    Bhargava, R., Goel, A., Meyerson, A.: Using approximate majorization to characterize protocol fairness. In: Proceedings of ACM Sigmetrics, June 2001, pp. 330–331 (2001) (Poster paper)Google Scholar
  6. 6.
    Garg, N., Konemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: 39th Annual Symposium on Foundations of Computer Science, pp. 300–309 (1998)Google Scholar
  7. 7.
    Garg, N., Young, N.: On-line, end-to-end congestion control. In: IEEE Foundations of Computer Science, pp. 303–312 (2002)Google Scholar
  8. 8.
    Goel, A., Meyerson, A.: Simultaneous optimization via approximate majorization for concave profits or convex costs. Technical report CMU-CS-02-203, Computer Science Department, Carnegie Mellon University (December 2002)Google Scholar
  9. 9.
    Goel, A., Meyerson, A., Plotkin, S.: Approximate majorization and fair online load balancing. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 384–390 (2001)Google Scholar
  10. 10.
    Goel, A., Meyerson, A., Plotkin, S.: Combining fairness with throughput: Online routing with multiple objectives. Journal of Computer and Systems Sciences 63(1), 62–79 (2001); A preliminary version appeared in ACM Symposium on Theory of Computing (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Hardy, G.H., Littlewood, J.E., Polya, G.: Some simple inequalities satisfied by convex functions. Messenger Math. 58, 145–152 (1929)Google Scholar
  12. 12.
    Hardy, G.H., Littlewood, J.E., Polya, G.: Inequalities, 1st edn., 2nd edn. Cambridge University Press, London (1934/1952)Google Scholar
  13. 13.
    Kelly, F.P., Maulloo, A.K., Tan, D.K.H.: Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49, 237–252 (1998)zbMATHGoogle Scholar
  14. 14.
    Kleinberg, J., Rabani, Y., Tardos, E.: Fairness in routing and load balancing. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1999)Google Scholar
  15. 15.
    Kumar, A., Kleinberg, J.: Fairness measures for resource allocation. In: Proceedings of 41st IEEE Symposium on Foundations of Computer Science (2000)Google Scholar
  16. 16.
    Low, S., Peterson, L., Wang, L.: Understanding TCP Vegas: a duality model. In: Proceedings of ACM Sigmetrics (2001)Google Scholar
  17. 17.
    Luby, M., Nisan, N.: A parallel approximation algorithm for positive linear programming. In: Proceedings of 25th Annual Symposium on the Theory of Computing, pp. 448–457 (1993)Google Scholar
  18. 18.
    Marshall, A.W., Olkin, I.: Inequalities: theory of majorization and its applications. Mathematics in Science and Engineering, vol. 143. Academic Press, London (1979)zbMATHGoogle Scholar
  19. 19.
    Plotkin, S., Shmoys, D., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Math of Oper. Research, 257–301 (1994)Google Scholar
  20. 20.
    Tamir, A.: Least majorized elements and generalized polymatroids. Mathematics of Operations Research 20(3), 583–589 (1995)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Sung-woo Cho
    • 1
  • Ashish Goel
    • 2
  1. 1.Department of Computer ScienceUniversity of Southern
  2. 2.Department of Management Science and Engineering and (by courtesy) Computer ScienceStanford University 

Personalised recommendations