Translating Traffic Engineering outcome into Segment Routing paths: The Encoding problem

Traffic Engineering (TE) algorithms aims at determining the packet routing paths in order to satisfy specific QoS requirements. These paths are normally established through control procedures e.g., exchange of RSVP messages in MPLS networks or links weights modification in pure IP networks. An increase of control traffic or long convergence time intervals, respectively, are the drawbacks of these solutions. Segment Routing (SR) is a new network paradigm able to implement TE routing strategies over legacy IP/MPLS networks with no need of dedicated signaling procedures. This result is obtained by inserting in each packet header an ordered list of instructions, called Segments List, that indicates the path to be crossed. This paper provides the formulation of the Segment List Encoding problem i.e., the detection of the proper Segment Lists to obtain TE network paths minimizing the Segment Lists sizes. The SL encoding procedure is composed of two steps: i) the creation of an auxiliary graph representing the forwarding paths between the couple of source and destination nodes; ii) the solution of a Multi-commodity Flow (MCF) problem over the auxiliary graph. The performance evaluation shows that properly performing SL encoding allows to implement TE outcome with a reduced reconfiguration cost with respect to E2E tunneling and Hop-by-Hop solutions; moreover a significant advantage in terms of packets overhead is obtained.

[1]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[2]  Piero Castoldi,et al.  Efficient label encoding in segment-routing enabled optical networks , 2015, 2015 International Conference on Optical Network Design and Modeling (ONDM).

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

[4]  Clarence Filsfils,et al.  Segment Routing Architecture , 2018, RFC.

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

[6]  Michal Pioro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010 .

[7]  Carlos M. Pignataro,et al.  The Segment Routing Architecture , 2014, GLOBECOM 2014.

[8]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Y. Ebihara.  Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).