Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think

by   Jean-Romain Luttringer, et al.

With the growth of demands for quasi-instantaneous communication services such as real-time video streaming, cloud gaming, and industry 4.0 applications, multi-constraint Traffic Engineering (TE) becomes increasingly important. While legacy TE management planes have proven laborious to deploy, Segment Routing (SR) drastically eases the deployment of TE paths and thus became the most appropriate technology for many operators. The flexibility of SR sparked demands in ways to compute more elaborate paths. In particular, there exists a clear need in computing and deploying Delay-Constrained Least-Cost paths (DCLC) for real-time applications requiring both low delay and high bandwidth routes. However, most current DCLC solutions are heuristics not specifically tailored for SR. In this work, we leverage both inherent limitations in the accuracy of delay measurements and an operational constraint added by SR. We include these characteristics in the design of BEST2COP, an exact but efficient ECMP-aware algorithm that natively solves DCLC in SR domains. Through an extensive performance evaluation, we first show that BEST2COP scales well even in large random networks. In real networks having up to thousands of destinations, our algorithm returns all DCLC solutions encoded as SR paths in way less than a second.


Deploying Near-Optimal Delay-Constrained Paths with Segment Routing in Massive-Scale Networks

With a growing demand for quasi-instantaneous communication services suc...

Micro SIDs: a solution for Efficient Representation of Segment IDs in SRv6 Networks

The Segment Routing (SR) architecture is based on loose source routing. ...

An Efficient Linux Kernel Implementation of Service Function Chaining for legacy VNFs based on IPv6 Segment Routing

We consider the IPv6 Segment Routing (SRv6) technology for Service Funct...

Multiple Constrained Routing Algorithms in Large-Scaled Software Defined Networks

In this paper, we consider the bandwidth-delay-hop constrained routing p...

Q-SR: An Extensible Optimization Framework for Segment Routing

Segment routing (SR) combines the advantages of source routing supported...

An SR Flip-Flop based Physical Unclonable Functions for Hardware Security

Physical Unclonable Functions (PUFs) have emerged as a promising solutio...

Planning a Cost-Effective Delay-Constrained Passive Optical Network for 5G Fronthaul

With the rapid growth in the telecommunications industry moving towards ...