Abstract
We study the bandwidth allocation problem
Maximize U(x), subject to
Ax ≤ c; x ≥ 0
where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
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)
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)
Garg, N., Young, N.: On-line, end-to-end congestion control. In: IEEE Foundations of Computer Science, pp. 303–312 (2002)
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)
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)
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)
Hardy, G.H., Littlewood, J.E., Polya, G.: Some simple inequalities satisfied by convex functions. Messenger Math. 58, 145–152 (1929)
Hardy, G.H., Littlewood, J.E., Polya, G.: Inequalities, 1st edn., 2nd edn. Cambridge University Press, London (1934/1952)
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)
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)
Kumar, A., Kleinberg, J.: Fairness measures for resource allocation. In: Proceedings of 41st IEEE Symposium on Foundations of Computer Science (2000)
Low, S., Peterson, L., Wang, L.: Understanding TCP Vegas: a duality model. In: Proceedings of ACM Sigmetrics (2001)
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)
Marshall, A.W., Olkin, I.: Inequalities: theory of majorization and its applications. Mathematics in Science and Engineering, vol. 143. Academic Press, London (1979)
Plotkin, S., Shmoys, D., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Math of Oper. Research, 257–301 (1994)
Tamir, A.: Least majorized elements and generalized polymatroids. Mathematics of Operations Research 20(3), 583–589 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cho, Sw., Goel, A. (2005). Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives. In: López-Ortiz, A., Hamel, A.M. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2004. Lecture Notes in Computer Science, vol 3405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527954_4
Download citation
DOI: https://doi.org/10.1007/11527954_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27873-3
Online ISBN: 978-3-540-31860-6
eBook Packages: Computer ScienceComputer Science (R0)