Traffic engineering with Equal-Cost-Multipath: An algorithmic perspective

Proceedings - IEEE INFOCOM

Volumn , Issue , 2014, Pages 1590-1598

  Chiesa, Marco ^a   Kindler, Guy ^b   Schapira, Michael ^b  

^a ROMA TRE UNIVERSITY   (Italy)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING; SCHEDULING ALGORITHMS; TRAFFIC CONTROL;

CONSTANT RATIO; DATA CENTER NETWORKS; EMPIRICAL STUDIES; LINK WEIGHTS; NETWORK RESOURCE; OPERATIONAL ASPECTS; THE STANDARD MODEL; TRAFFIC ENGINEERING;

APPROXIMATION ALGORITHMS;

EID: 84904430604     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2014.6848095     Document Type: Conference Paper

References (30)

1. M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat, "Hedera: Dynamic flow scheduling for data center networks," in Proc. NSDI, 2010.
2. C. Hopps, "Analysis of an Equal-Cost Multi-Path Algorithm," RFC 2992, IETF, 2000, http://www.ietf.org/rfc/rfc2992.txt.
3. J. Moy, "OSPF Version 2," RFC 2328, IETF, 1998, http://www.ietf.org/rfc/rfc2328.txt.
4. Z. Cao, Z. Wang, and E. W. Zegura, "Performance of Hashing-Based Schemes for Internet Load Balancing," in Proc. INFOCOM, 2000.
5. B. Fortz, J. Rexford, and M. Thorup, "Traffic engineering with traditional IP routing protocols," IEEE Communications Magazine, vol. 40, pp. 118-124, 2002.
6. A. G. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. A. Maltz, P. Patel, and S. Sengupta, "VL2: a scalable and flexible data center network," Commun. ACM, vol. 54, no. 3, pp. 95-104, 2011.
7. Cisco, "OSPF Design Guide," 2011, http://www.cisco.com/image/ gif/paws/7039/1.pdf.
8. B. Fortz and M. Thorup, "Internet Traffic Engineering by Optimizing OSPF Weights," in Proc. INFOCOM, 2000.
9. -, "Optimizing OSPF/IS-IS Weights in a Changing World," IEEE J.Sel. A. Commun., vol. 20, no. 4, pp. 756-767, Sep. 2006.
10. -, "Increasing Internet Capacity Using Local Search," Comp. Opt. and Appl., vol. 29, no. 1, pp. 13-48, 2004.
11. J. R. Lee and A. Naor, "Embedding the Diamond Graph in LP and Dimension Reduction in L1," Geometric & Functional Analysis, 2004.
12. C. Guo, G. Lu, D. Li, H. Wu, X. Zhang, Y. Shi, C. Tian, Y. Zhang, and S. Lu, "BCube: A High Performance, Server-centric Network Architecture for Modular Data Centers," in Proc. SIGCOMM, 2009.
13. H. Wu, G. Lu, D. Li, C. Guo, and Y. Zhang, "MDCube: A High Performance Network Structure for Modular Data Center Interconnection," in Proc. CoNEXT, 2009.
14. A. A. Dixit, P. Prakash, Y. C. Hu, and R. R. Kompella, "On the impact of packet spraying in data center networks." in Proc. INFOCOM, 2013.
15. A. R. Curtis, J. C. Mogul, J. Tourrilhes, P. Yalagandula, P. Sharma, and S. Banerjee, "DevoFlow: Scaling Flow Management for Highperformance Networks," SIGCOMM Comput. Commun. Rev., vol. 41, no. 4, pp. 254-265, Aug. 2011.
16. http://www.dia.uniroma3.it/~compunet/www/docs/ chiesa/ecmp.pdf.
17. A. Sridharan, R. Guérin, and C. Diot, "Achieving Near-optimal Traffic Engineering Solutions for Current OSPF/IS-IS Networks," IEEE/ACM Trans. Netw., vol. 13, no. 2, pp. 234-247, Apr. 2005.
18. M. Al-Fares, A. Loukissas, and A. Vahdat, "A Scalable, Commodity Data Center Network Architecture," SIGCOMM Comput. Commun. Rev., vol. 38, no. 4, pp. 63-74, Aug. 2008.
19. X. Yuan, W. Nienaber, Z. Duan, and R. Melhem, "Oblivious Routing for Fat-tree Based System Area Networks with Uncertain Traffic Demands," in Proc. SIGMETRICS, 2007.
20. I. Holyer, "The NP-Completeness of Edge-Coloring," SIAM J. Comput., vol. 10, no. 4, pp. 718-720, 1981.
21. A. Altin, B. Fortz, and H. Umit, "Oblivious OSPF Routing with Weight Optimization under Polyhedral Demand Uncertainty," Netw., vol. 60, no. 2, pp. 132-139, Sep. 2012.
22. J. Rexford, "Route optimization in IP networks," in Handbook of Optimization in Telecommunications, Springer Science + Business. Kluwer Academic Publishers, 2006.
23. P. Siripongwutikorn, S. Banerjee, and D. Tipper, "A Survey of Adaptive Bandwidth Control Algorithms," IEEE Communications Surveys and Tutorials, vol. 5, no. 1, pp. 14-26, 2003.
24. A. Parmar, S. Ahmedy, and J. Sokol, "An Integer Programming Approach to the OSPF Weight Setting Problem," Georgia Institute of Technology, Tech. Rep., 2006.
25. L. S. Buriol, M. G. C. Resende, C. C. Ribeiro, and M. Thorup, "A Memetic Algorithm for OSPF Routing," 2002.
26. M. Ericsson, M. G. C. Resende, and P. M. Pardalos, "A Genetic Algorithm for the Weight Setting Problem in OSPF Routing," Journal of Combinatorial Optimization, vol. 6, pp. 299-333, 2002.
27. W. Dally and B. Towles, Principles and Practices of Interconnection Networks. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2003.
28. J. H. Ahn, N. Binkert, A. Davis, M. McLaren, and R. S. Schreiber, "HyperX: Topology, Routing, and Packaging of Efficient Large-scale Networks," in Proc. SC, 2009.
29. A. Chakrabarti, C. Chekuri, A. Gupta, and A. Kumar, "Approximation Algorithms for the Unsplittable Flow Problem," in Proc. APPROX, 2002.
30. A. Singla, C.-Y. Hong, L. Popa, and P. B. Godfrey, "Jellyfish: Networking data centers randomly," in Proc. NSDI, 2012.