Q-SR: An Extensible Optimization Framework for Segment Routing

Segment routing (SR) combines the advantages of source routing supported by centralized software-defined networking (SDN) paradigm and hop-by-hop routing applied in distributed IP network infrastructure. However, because of the computation inefficiency, it is nearly impossible to evaluate whether various types of networks will benefit from the SR with multiple segments using conventional approaches. In this paper, we propose a flexible Q-SR model as well as its formulation in order to fully explore the potential of SR from an algorithmic perspective. The model leads to a highly extensible framework to design and evaluate algorithms that can be adapted to various network topologies and traffic matrices. For the offline setting, we develop a fully polynomial time approximation scheme (FPTAS) which can finds a (1+ω)-approximation solution for any specified ω > 0 in time that is a polynomial function of the network size. To the best of our knowledge, the proposed FPTAS is the first algorithm that can compute arbitrarily accurate solution. For the online setting, we develop an online primal-dual algorithm that proves O(1)-competitive and violates link capacities by a factor of O(log n), where n is the node number. We also prove performance bounds for the proposed algorithms. We conduct simulations on realistic topologies to validate SR parameters and algorithmic parameters in both offline and online scenarios. Keywords-Segment Routing (SR), Traffic Engineering, Approximation Algorithm, Online Algorithm, Software-Defined Networking (SDN)

[1]  P. Castoldi,et al.  Experimental demonstration of multi-domain segment routing , 2015, 2015 European Conference on Optical Communication (ECOC).

[2]  Mung Chiang,et al.  DEFT: Distributed Exponentially-Weighted Flow Splitting , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[3]  Filippo Cugini,et al.  Traffic engineering in segment routing networks , 2017, Comput. Networks.

[4]  Jochen Könemann,et al.  Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems , 2007, SIAM J. Comput..

[5]  Pedro Sousa,et al.  Traffic Engineering With Three-Segments Routing , 2020, IEEE Transactions on Network and Service Management.

[6]  Jennifer Rexford,et al.  Multi-Commodity Flow with In-Network Processing , 2018, ALGOCLOUD.

[7]  Acee Lindem,et al.  Segment Routing Prefix Segment Identifier Extensions for BGP , 2019, RFC.

[8]  Clarence Filsfils,et al.  Segment Routing Centralized BGP Egress Peer Engineering , 2017, RFC.

[9]  Weihua Zhuang,et al.  Robust Online Composition, Routing and NF Placement for NFV-Enabled Services , 2020, IEEE Journal on Selected Areas in Communications.

[10]  Marco Listanti,et al.  Incremental Deployment of Segment Routing Into an ISP Network: a Traffic Engineering Perspective , 2017, IEEE/ACM Transactions on Networking.

[11]  George Karakostas,et al.  Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.

[12]  IJsbrand Wijnands,et al.  Multicast Using Bit Index Explicit Replication (BIER) , 2017, RFC.

[13]  Stefano Salsano,et al.  Segment Routing: A Comprehensive Survey of Research Activities, Standardization Efforts, and Implementation Results , 2019, IEEE Communications Surveys & Tutorials.

[14]  Imtiaz Ahmad,et al.  Segment Routing in Software Defined Networks: A Survey , 2019, IEEE Communications Surveys & Tutorials.

[15]  Mung Chiang,et al.  Link-State Routing With Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering , 2011, IEEE/ACM Trans. Netw..

[16]  Optimizing restoration with segment routing , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[17]  Markus Chimani,et al.  Failure Resiliency With Only a Few Tunnels - Enabling Segment Routing for Traffic Engineering , 2020 .

[18]  Olivier Bonaventure,et al.  A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks , 2015, SIGCOMM.

[19]  Jon Mitchell,et al.  Use of BGP for Routing in Large-Scale Data Centers , 2016, RFC.

[20]  P. Castoldi,et al.  Segment routing for effective recovery and multi-domain traffic engineering , 2017, IEEE/OSA Journal of Optical Communications and Networking.

[21]  David Dietrich,et al.  Multi-Provider Service Chain Embedding With Nestor , 2017, IEEE Transactions on Network and Service Management.

[22]  Clarence Filsfils,et al.  BGP Prefix Segment in Large-Scale Data Centers , 2019, RFC.

[23]  Hong Xu,et al.  Node-Constrained Traffic Engineering: Theory and Applications , 2019, IEEE/ACM Transactions on Networking.

[24]  Stefano Vissicchio,et al.  Expect the unexpected: Sub-second optimization for segment routing , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[25]  T. V. Lakshman,et al.  Optimized network traffic engineering using segment routing , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[26]  Minghua Chen,et al.  Peer-to-Peer Streaming Capacity , 2011, IEEE Transactions on Information Theory.

[27]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[28]  fangwei hu,et al.  Inter-domain Use Cases of Segment Routing with MPLS Data Plane for Transport Network , 2019 .

[29]  Luigi Iannone,et al.  Chaining your Virtual Private Clouds with Segment Routing , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[30]  Cristel Pelsser,et al.  Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think , 2020, 2020 IEEE 19th International Symposium on Network Computing and Applications (NCA).

[31]  Markus Chimani,et al.  Traffic Engineering Using Segment Routing and Considering Requirements of a Carrier IP Network , 2018, IEEE/ACM Transactions on Networking.

[32]  Djamal-Eddine Meddour,et al.  On cross-domain Service Function Chain orchestration: An architectural framework , 2021, Comput. Networks.

[33]  Yusheng Ji,et al.  A Computation-Efficient Approach for Segment Routing Traffic Engineering , 2019, IEEE Access.

[34]  Mung Chiang,et al.  Link-State Routing with Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[35]  Carlo Cavazzoni,et al.  Demonstration of SDN-based orchestration for multi-domain Segment Routing networks , 2016, 2016 18th International Conference on Transparent Optical Networks (ICTON).

[36]  Chi-Han Lin,et al.  Live Video Multicast for Dynamic Users via Segment Routing in 5G Networks , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[37]  Clarence Filsfils,et al.  The Segment Routing Architecture , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

[38]  Weifa Liang,et al.  Throughput Maximization of NFV-Enabled Multicasting in Mobile Edge Cloud Networks , 2020, IEEE Transactions on Parallel and Distributed Systems.

[39]  Xiaoning Zhang,et al.  Segment Routing Optimization for VNF Chaining , 2019, ICC 2019 - 2019 IEEE International Conference on Communications (ICC).

[40]  Olivier Bonaventure,et al.  CG4SR: Near Optimal Traffic Engineering for Segment Routing with Column Generation , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[41]  Experience with implementing VNF chains with Segment Routing and PCEP , 2021 .

[42]  Weifa Liang,et al.  Throughput optimization for admitting NFV-enabled requests in cloud networks , 2018, Comput. Networks.

[43]  Kwan L. Yeung,et al.  Traffic Engineering in Segment Routing Networks Using MILP , 2020, IEEE Transactions on Network and Service Management.

[44]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..