Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation

IEEE/ACM Transactions on Networking

Volumn 16, Issue 5, 2008, Pages 1015-1024

  Allalouf, Miriam ^a   Shavitt, Yuval ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Bandwidth allocation; Distributed algorithm; Max min fairness criteria; Maximum concurrent multi commodity flow problem

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BANDWIDTH; BOOLEAN FUNCTIONS; COMPUTER NETWORKS; FREQUENCY ALLOCATION; HIGHWAY ENGINEERING; PARALLEL ALGORITHMS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SYSTEMS;

BANDWIDTH ALLOCATION; DISTRIBUTED ALGORITHM; DISTRIBUTED ALGORITHMS; FAIR ALLOCATIONS; FAIR BANDWIDTH ALLOCATIONS; FAIR RATE ALLOCATIONS; FLOW ROUTING; MAX-MIN; MAX-MIN FAIRNESS CRITERIA; MAXIMUM CONCURRENT MULTI-COMMODITY FLOW PROBLEM; MULTIPLE PATHS; POLYNOMIAL NUMBERS; PRIMAL-DUAL; ROUTING; SOURCE ROUTERS; TRAFFIC ENGINEERINGS;

ROUTING ALGORITHMS;

EID: 54549100157     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.905605     Document Type: Article

References (22)

1. B. Shmoys,, D. S. Hochbaum, Ed., "Cut problems and their application to divide-and-conquer," in Approximation Algorithms for NP-Hard Problems. Boston, MA: PWS Pub. Co., 1997, ch. 5.
2. D. Bertsekas and R. Gallager,, E.-W. Cliffs, Ed., Data Networks, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1992.
3. Y. Afek, Y. Mansour, and Z. Ostfeld, "Phantom: A simple and effective flowcontrol scheme," Comput. Netw., vol. 32, no. 3, pp. 277-305, 2000.
4. B. Awerbuch and Y. Shavitt, "Converging to approximated max-min flow fairness in logarithmic time," in Proc. IEEE INFOCOM, 1998, pp. 1350-1357.
5. Y. Bartal, M. Farach-Colton, S. Yooseph, and L. Zhang, "Fast, fair, and frugal bandwidth allocation in ATM networks," Algorithmica, vol. 33, Special Issue on Internet Algorithms, no. 3, pp. 272-286, 2002.
6. Y. Bartal, J. Byers, and D. Raz, "Global optimization using local information with applications to flow control," in Proc. 38th Ann. IEEE Symp. Foundations of Computer Science (FOSC), 1997, pp. 303-312.
7. F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, "Rate control for communication networks: Shadow prices, proportional fairness and stability," Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
8. J. Mo and J. Warland, "Fair end-to-end window-based congestion control," IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 556-567, Oct. 2000.
9. S. Chen and K. Nahrstedt, "Maxmin fair routing in connection-oriented networks," in Proc. Euro-Parallel and Distributed Systems Conf. (Euro-PDS'98), 1998, pp. 163-168.
10. J. M. Kleinberg, Y. Rabani, and E. Tardos, "Fairness in routing and load balancing," in Proc. IEEE Symp. Foundations of Computer Science 1999, pp. 568-578.
11. N. Megiddo, "Optimal flows in networks with sources and sinks," Math. Programming 7, pp. 97-107, 1974.
12. A. Goel, A. Meyerson, and S. Plotkin, "Combining fairness with throughput: Online routing with multiple objectives," in Proc. 32nd Ann. ACM Symp. Theory of Computing, 2000, pp. 670-679.
13. N. Buchbinder and J. Naor, "Fair online load balancing," in Proc. 18th Ann. ACM Symp. Parallelism in Algorithms and Architectures (SPAA'06), 2006, pp. 291-298.
14. Y. T. Hou, Y. Shi, and H. D. Sherali, "Rate allocation in wireless sensor networks with network lifetime requirement," in Proc. 5th ACM Int. Symp. Mobile Ad Hoc Networking and Computing (MobiHoc'04), 2004, pp. 67-77.
15. V. V. Vazirani, Approximation Algorithms. Berlin, Germany: Springer-Verlag, 2001.
16. F. Shahroki and D. W. Manila, "The maximum concurrent flow problem," J. ACM, vol. 37, pp. 318-334, 1990.
17. N. Young, "Randomized rounding without solving the linear program," in Proc. 6th Ann. ACM-SIAM Symp. Discrete Algorithms, 1995, pp. 170-178.
18. N. Garg and J. Konemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," in Proc. IEEE Symp. Foundations of Computer Science, 1998, pp. 300-309.
19. L. Fleischer, "Approximating fractional multicommodity flow independent of the number of commodities," SIAM J. Discrete Math., vol. 13, no. 4, pp. 505-520, 2000.
20. G. Karakostas, "Faster approximation schemes for fractional multicommodity flow problems," in Proc. ACM SODA, 2002, pp. 166-173.
21. M. Allalouf and Y. Shavitt, "Maximum flow routing with weighted max-min fairness," in Proc. 1st Int. Workshop QoS Routing (WQoSR 2004), Barcelona, Spain, Oct. 2004, pp. 279-285.
22. M. Allalouf and Y. Shavitt, "Centralized and distributed approximation algorithms for routing and weighted max-min fair bandwidth allocation," in Proc. IEEE Workshop on High Performance Switching and Routing (HPSR'05), Hong Kong, May 2005, pp. 306-311.