Traffic engineering with equal-cost-multipath: An algorithmic perspective

IEEE/ACM Transactions on Networking

Volumn 25, Issue 2, 2017, Pages 779-792

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

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

approximation algorithms; multicommodity flow; Traffic engineering

Indexed keywords

APPROXIMATION ALGORITHMS; SCHEDULING ALGORITHMS; TRAFFIC CONTROL;

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

COST ENGINEERING;

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

References (35)

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, p. 19.
2. C. Hopps, Analysis of an Equal-Cost Multi-Path Algorithm, document RFC 2992, IETF, 2000. [Online]. Available: http://www.ietf.org/rfc/rfc2992.txt
3. J. Moy, OSPF Version 2, document RFC 2328, IETF, 1998. [Online]. Available: 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. IEEE INFOCOM, vol. 1. Mar. 2000, pp. 332-341.
5. B. Fortz, J. Rexford, and M. Thorup, "Traffic engineering with traditional IP routing protocols," IEEE Commun. Mag., vol. 40, no. 10, pp. 118-124, Oct. 2002.
6. A. G. Greenberg et al., "VL2: A scalable and flexible data center network," Commun. ACM, vol. 54, no. 3, pp. 95-104, Mar. 2011.
7. Cisco. (2011). OSPF Design Guide. [Online]. Available: 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. IEEE INFOCOM, vol. 2. Mar. 2000, pp. 519-528.
9. B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS weights in a changing world," IEEE J. Sel. A. Commun., vol. 20, no. 4, pp. 756-767, May 2006.
10. B. Fortz and M. Thorup, "Increasing internet capacity using local search," Comput. Optim. Appl., vol. 29, no. 1, pp. 13-48, Oct. 2004.
11. J. R. Lee and A. Naor, "Embedding the diamond graph in LP and dimension reduction in L1," Geometric Funct. Anal., vol. 14, no. 4, pp. 745-747, Aug. 2004.
12. C. Guo et al., "BCube: A high performance, server-centric network architecture for modular data centers," in Proc. SIGCOMM, 2009, pp. 63-74.
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, pp. 25-36.
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. IEEE INFOCOM, Apr. 2013, pp. 2130-2138.
15. A. R. Curtis et al., "DevoFlow: Scaling flow management for highperformance networks," in Proc. SIGCOMM, Aug. 2011, pp. 254-265.
16. M. Chiesa, G. Kindler, and M. Schapira. Traffic Engineering With ECMP: An Algorithmic Perspective, accessed on Oct. 4, 2016. [Online]. Available: 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. J. Håstad, "Some optimal inapproximability results," J. ACM, vol. 48, no. 4, pp. 798-859, 2001.
19. M. Bellare, O. Goldreich, and M. Sudan, "Free bits, pcps, and nonapproximability-Towards tight results," SIAM J. Comput., vol. 27, no. 3, pp. 804-915, 1996.
20. M. Al-Fares, A. Loukissas, and A. Vahdat, "A scalable, commodity data center network architecture," ACM SIGCOMM Comput. Commun. Rev., vol. 38, no. 4, pp. 63-74, 2008.
21. 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, pp. 337-348.
22. I. Holyer, "The NP-completeness of Edge-coloring," SIAM J. Comput., vol. 10, no. 4, pp. 718-720, 1981.
23. Source Code for Comparison Among ECMP, Equilibrium, and Hedera-SA, accessed on Oct. 04, 2016. [Online]. Available: http://www.github.com/marchiesa/equilibrium-data-center
24. A. Altin, B. Fortz, and H. Umit, "Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty," Networks, vol. 60, no. 2, pp. 132-139, Sep. 2012.
25. J. Rexford, "Route optimization in IP networks," in Handbook of Optimization in Telecommunications. Boston, MA, USA: Springer, 2006.
26. P. Siripongwutikorn, S. Banerjee, and D. Tipper, "A survey of adaptive bandwidth control algorithms," IEEE Commun. Surveys Tuts., vol. 5, no. 1, pp. 14-26, 3rd Quart., 2003.
27. A. Parmar, S. Ahmed, and J. Sokol, "An integer programming approach to the OSPF weight setting problem," School Ind. Syst. Eng., Georgia Inst. Technol., Atlanta, GA, USA, Tech. Rep., 2006. [Online]. Available: https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/1081
28. L. S. Buriol, M. G. C. Resende, C. C. Ribeiro, and M. Thorup, "A memetic algorithm for OSPF routing," in Proc. 6th INFORMS Telecom, 2002, pp. 187-188
29. M. Ericsson, M. G. C. Resende, and P. M. Pardalos, "A genetic algorithm for the weight setting problem in OSPF routing," J. Combinat. Optim., vol. 6, no. 3, pp. 299-333, Sep. 2002.
30. W. Dally and B. Towles, Principles and Practices of Interconnection Networks. San Francisco, CA, USA: Morgan Kaufmann, 2003.
31. 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, Art. no. 41.
32. J. Cao et al., "Per-packet load-balanced, low-latency routing for clos-based data center networks," in Proc. CoNEXT, 2013, pp. 49-60.
33. A. Chakrabarti, C. Chekuri, A. Gupta, and A. Kumar, "Approximation algorithms for the unsplittable flow problem," in Proc. APPROX, 2002, pp. 51-66.
34. W. Wang et al., "Freeway: Adaptively isolating the elephant and mice flows on different transmission paths," in Proc. IEEE ICNP, Oct. 2014, pp. 362-367.
35. A. Singla, C.-Y. Hong, L. Popa, and P. B. Godfrey, "Jellyfish: Networking data centers randomly," in Proc. NSDI, 2012, pp. 225-238.