A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 846-854

  Danna, Emilie ^a   Mandal, Subhasree ^a   Singh, Arjun ^a  

^a GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IMPORTANCE WEIGHTS; LINEAR PROGRAMS; MAX-MIN; MAX-MIN FAIRNESS; NETWORK OPERATOR; NETWORK RESOURCE; PIECEWISE LINEAR; REAL NETWORKS; THROUGHPUT DEGRADATION; TRAFFIC ENGINEERING; UTILITY FUNCTIONS;

ALGORITHMS; DEGRADATION; HIGHWAY ENGINEERING; LINEAR PROGRAMMING;

THROUGHPUT;

EID: 84861639913     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195833     Document Type: Conference Paper

References (19)

1. N. Wang, K. Ho, G. Pavlou, and M. Howarth, "An overview of routing optimization for internet traffic engineering," IEEE Communications Surveys Tutorials, vol. 10, no. 1, pp. 36-56, 2008.
2. J. He, M. Chiang, and J. Rexford, "Can congestion control and traffic engineering be at odds?" in IEEE GLOBECOM, 2006.
3. T. Lan, D. Kao, M. Chiang, and A. Sabharwal, "An axiomatic theory of fairness in network resource allocation," in IEEE INFOCOM, 2010, pp. 1-9.
4. D. Bertsekas and R. Gallager, Data Networks. Prentice-Hall, 1992.
5. F. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: Shadow prices, proportional fairness and stability," The Journal of the Operational Research Society, vol. 49, no. 3, pp. 237-252, 1998.
6. J. Mo and J. Walrand, "Fair end-to-end window-based congestion control," IEEE/ACM Transactions on Networking, vol. 8, pp. 556-567, 2000.
7. M. Allalouf and Y. Shavitt, "Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation," IEEE/ACM Transactions on Networking, vol. 16, no. 5, pp. 1015-1024, 2008.
8. G. Rétvári, J. J. Bíró, and T. Cinkler, "Fairness in capacitated networks: a polyhedral approach," in IEEE INFOCOM, 2007.
9. D. Nace, "A linear programming based approach for computing optimal fair splittable routing," in Computers and Communications, ISCC 2002, 2002, pp. 468-474.
10. M. Pioro, P. Nilsson, E. Kubilinskas, and G. Fodor, "On efficient maxmin fair routing algorithms," in Computers and Communication, ISCC 2003, vol. 1, 2003, pp. 365-372.
11. O. K. Dritan Nace, Linh Nhat Doan and A. Bashllari, "Max-min fairness in multi-commodity flows," Computers and Operations Research, vol. 35, 2008.
12. D. Nace and M. Pioro, "Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial," IEEE Communications Surveys Tutorials, vol. 10, no. 4, pp. 5-17, 2008.
13. A. Goel, A. Meyerson, and S. Plotkin, "Combining fairness with throughput: Online routing with multiple objectives," Journal of Computer and System Sciences, vol. 63, no. 1, pp. 62-79, 2001.
14. M. T. Robert M. Freund, Robin Roundy, "Identifying the set of always-active constraints in a system of linear inequalities by a single linear program," MIT, Tech. Rep. 1674-85, 1985.
15. B. Fortz and M. Thorup, "Optimizing ospf/is-is weights in a changing world," IEEE Journal on Selected Areas in Communications, vol. 20, no. 4, pp. 756-767, 2002.
16. D. Xu, M. Chiang, and J. Rexford, "Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering," IEEE/ACM Transactions on Networking, 2011.
17. M. Suchara, D. Xu, R. Doverspike, D. Johnson, and J. Rexford, "Network architecture for joint failure recovery and traffic engineering,"in ACM SIGMETRICS, 2011, pp. 97-108.
18. "Abilene backbone network," http://abilene.internet2.edu.
19. "Clp: Coin-or linear programming," https://projects.coin-or. org/Clp.