Mahmoud Parham
Klaus-Tycho Foerster
Stefan Schmid
ABSTRACT
Most ISPs use sophisticated traffic engineering strategies based on link weight optimizations to efficiently provision their backbone network and to serve intra-domain traffic. While traditionally, traffic is split among the shortest weighted paths using ECMP, recently, an additional dimension for optimization arose in the context of segment routing: traffic can be steered away from congested shortest paths by inserting intermediate destinations, so-called waypoints.
This paper investigates the benefits of jointly optimizing the link weights and waypoints for traffic engineering both analytically and empirically. In particular, we formulate the joint optimization problem and formally quantify the benefits of joint optimizations over separate link-weights and waypoints optimizations, using a rigorous analysis. We also present an efficient joint optimization algorithm and evaluate its performance in realistic and synthetic scenarios.
Supplemental Material
Available for Download
Supplemental files.
- Nick Feamster, Jennifer Rexford, and Ellen Zegura. The road to sdn: an intellectual history of programmable networks. ACM SIGCOMM Computer Communication Review, 44(2):87--98, 2014.Google Scholar
Digital Library
- Bernard Fortz and Mikkel Thorup. Internet traffic engineering by optimizing OSPF weights. In INFOCOM, pages 519--528. IEEE Computer Society, 2000.Google ScholarCross Ref
- Clarence Filsfils, Stefano Previdi, Bruno Decraene, Stephane Litkowski, and Rob Shakir. Segment routing architecture. In IETF Internet-Draft, 2017.Google Scholar
- Clarence Filsfils, Pierre Francois, Stefano Previdi, Bruno Decraene, Stephane Litkowski, Martin Horneffer, Igor Milojevic, Rob Shakir, Saku Ytti, Wim Henderickx, Jeff Tantsura, Sriganesh Kini, and Edward Crabbe. Segment routing architecture. In Segment Routing Use Cases, IETF Internet-Draft, 2014.Google ScholarCross Ref
- Clarence Filsfils, Stefano Previdi, John Leddy, S. Matsushima, and D. Voyer. IPv6 Segment Routing Header (SRH). Internet-Draft draft-ietf-6man-segment-routing-header-14, Internet Engineering Task Force, June 2018. Work in Progress.Google Scholar
- Pier Luigi Ventre, Stefano Salsano, Marco Polverini, Antonio Cianfrani, Ahmed Abdelsalam, Clarence Filsfils, Pablo Camarillo, and François Clad. Segment routing: A comprehensive survey of research activities, standardization efforts, and implementation results. IEEE Commun. Surv. Tutorials, 23(1):182--221, 2021.Google ScholarCross Ref
- Renaud Hartert. Fast and scalable optimization for segment routing. PhD thesis, UCLouvain, 2018.Google Scholar
- FranÁois Aubry. Models and Algorithms for Network Optimization with Segment Routing. PhD thesis, UCLouvain, 2020.Google Scholar
- A. Sgambelluri, F. Paolucci, A. Giorgetti, F. Cugini, and P. Castoldi. Experimental demonstration of segment routing. Journal of Lightwave Technology, 34(1):205--212, 2016.Google ScholarCross Ref
- Randeep Bhatia, Fang Hao, Murali Kodialam, and TV Lakshman. Optimized network traffic engineering using segment routing. In 2015 IEEE Conference on Computer Communications (INFOCOM), pages 657--665. IEEE, 2015.Google ScholarCross Ref
- Bernard Fortz and Mikkel Thorup. Increasing Internet Capacity Using Local Search. Computational Optimization and Applications, 29(1):13--48, 2004.Google ScholarDigital Library
- J. Moy. Ospf version 2. Technical report, April 1998.Google Scholar
- C. Hopps. Analysis of an equal-cost multi-path algorithm. rfc 2992. Technical report, April 2000.Google Scholar
- Advait Abhay Dixit, Pawan Prakash, and Ramana Rao Kompella. On the efficacy of fine-grained traffic splitting protocolsin data center networks. In SIGCOMM, pages 430--431. ACM, 2011.Google ScholarDigital Library
- Marco Chiesa, Guy Kindler, and Michael Schapira. Traffic engineering with equal-cost-multipath: An algorithmic perspective. IEEE/ACM Transactions on Networking, 25(2):779--792, 2017.Google ScholarDigital Library
- Cisco. Configuring ospf. Technical report, April 1997.Google Scholar
- Michal Pióro, Áron Szentesi, János Harmatos, Alpár Jüttner, Piotr Gajowniczek, and Stanislaw Kozdrowski. On open shortest path first related network optimisation problems. Perform. Evaluation, 48(1/4):201--223, 2002.Google ScholarDigital Library
- Thomas Fenz, Klaus-Tycho Förster, Mahmoud Parham, Stefan Schmid, and Nikolaus Süß. Traffic engineering with joint link weight and segment optimization. September 2021. https://whatif-tools.net/segment-routing.Google Scholar
- Xipeng Xiao, Alan Hannan, Brook Bailey, and Lionel M. Ni. Traffic engineering with MPLS in the internet. IEEE Netw., 14(2):28--33, 2000.Google ScholarDigital Library
- Sugam Agarwal, Murali S. Kodialam, and T. V. Lakshman. Traffic engineering in software defined networks. In INFOCOM, pages 2211--2219. IEEE, 2013.Google ScholarCross Ref
- Randeep Bhatia, Fang Hao, Murali S. Kodialam, and T. V. Lakshman. Optimized network traffic engineering using segment routing. In INFOCOM, pages 657--665. IEEE, 2015.Google ScholarCross Ref
- Eduardo Moreno, Alejandra Beghelli, and Filippo Cugini. Traffic engineering in segment routing networks. Computer Networks, 114:23--31, 2017.Google ScholarCross Ref
- François Aubry, Stefano Vissicchio, Olivier Bonaventure, and Yves Deville. Robustly disjoint paths with segment routing. In CoNEXT, pages 204--216. ACM, 2018.Google ScholarDigital Library
- Frank Göring. Short proof of menger's theorem. Discret. Math., 219(1-3):295--296, 2000.Google ScholarDigital Library
- Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms, and Applications. 1993.Google ScholarDigital Library
- Python 3.7.10, Last Accessed: 2021-06-28. https://www.python.org/downloads/release/python-3710/.Google Scholar
- Networkx 2.5.1, Last Accessed: 2021-06-28. networkx.github.io/documentation/networkx-2.5/.Google Scholar
- Networkit 8.1, Last Accessed: 2021-06-28. https://networkit.github.io/.Google Scholar
- Numpy 1.20.3, Last Accessed: 2021-06-28. https://numpy.org/devdocs/release/1.20.3-notes.html.Google Scholar
- Scipy 1.6.3, Last Accessed: 2021-06-28. https://docs.scipy.org/doc/scipy/reference/release.1.6.3.html.Google Scholar
- Gurobi optimizer 9.1.2, Last Accessed: 2021-06-28. https://support.gurobi.com/hc/en-us/articles/360060235871-Gurobi-9-1-2-released.Google Scholar
- Sebastian Orlowski, Roland Wessäly, Michal Pióro, and Artur Tomaszewski. Sndlib 1.0 - survivable network design library. Networks, 55(3):276--286, 2010.Google Scholar
- Sebastian Orlowski, Roland Wessäly, Michal Pióro, and Artur Tomaszewski. Sndlib 1.0---survivable network design library. Networks: An International Journal, 55(3):276--286, 2010.Google ScholarDigital Library
- Sndlib, Last Accessed: 2021-01-05. http://sndlib.zib.de/home.action?show=/docu.formats.gml.action.Google Scholar
- Simon Knight, Hung X. Nguyen, Nick Falkner, Rhys Alistair Bowden, and Matthew Roughan. The internet topology zoo. IEEE J. Sel. Areas Commun., 29(9):1765--1775, 2011.Google ScholarCross Ref
- Topology zoo, Last Accessed: 2021-01-05. http://www.topology-zoo.org/dataset.html.Google Scholar
- David LeBrun. Virtual networks testing framework (nanonet), Last Accessed: 2021-06-28. https://github.com/segment-routing/nanonet.Google Scholar
Index Terms
- Traffic engineering with joint link weight and segment optimization
Recommendations
Invited A new traffic engineering manager for DiffServ/MPLS networks: design and implementation on an IP QoS Testbed
In a multi-service network, different applications have varying QoS requirements. The IETF has proposed the DiffServ architecture as a scalable solution to provide Quality of Service (QoS) in IP Networks. In order to provide quantitative guarantees and ...
Traffic Engineering with Segment Routing: SDN-Based Architectural Design and Open Source Implementation
EWSDN '15: Proceedings of the 2015 Fourth European Workshop on Software Defined NetworksTraffic Engineering (TE) in IP carrier networks is one of the functions that can benefit from the Software Defined Networking paradigm. However traditional per-flow routing requires a direct interaction between the SDN controller and each node that is ...
Optimized Segment Routing Traffic Engineering with Multiple Segments
Wireless Algorithms, Systems, and ApplicationsAbstractNetwork traffic balancing plays a key role in improving network performance. Recently, a new source routing technology, segment routing (SR), has been proposed to increase the network programming ability. SR expresses an end-to-end logical path as ...
Comments