Segment Routing: a Comprehensive Survey of Research Activities, Standardization Efforts and Implementation Results

Ventre, Pier Luigi; Polverini, Marco; Cianfrani, Antonio; Abdelsalam, Ahmed K.; Filsfils, Clarence; Camarillo, Pablo; Clad, François

doi:10.48550/arxiv.1904.03471

Cited by 6 publications

(9 citation statements)

References 82 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Segment Routing attracted a lot of interest from the research community. A table referencing most SR-related work can be found in Ventre et al [68]. While some SR-TE works are related to tactical TE problems (like minimizing the maximum link utilisation) taking indirectly into account some delay concerns [37,35], most of the works related to SR do not focus on DCLC, but rather bandwidth optimization [11,25,13], network resiliency [22,34], monitoring [48,10], limiting energy consumption [14] or path encoding (the translation of path to segment lists) [31,28].…”

Section: Segment Routing Background and Practical Usagesmentioning

confidence: 99%

See 1 more Smart Citation

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

Luttringer¹,

Alfroy²,

Mérindol³

et al. 2021

Preprint

View full text Add to dashboard Cite

With a growing demand 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 like MPLS have proven laborious to deploy, Segment Routing (SR) drastically eases the deployment of TE paths and is thus increasingly adopted by Internet Service Providers (ISP). There is now a clear need in computing and deploying Delay-Constrained Least-Cost paths (DCLC) with SR for real-time interactive services requiring both low delay and high bandwidth routes. However, most current DCLC solutions are not tailored for SR. They also often lack efficiency (particularly exact schemes) or guarantees (by relying on unbounded heuristics). Similarly to approximation schemes, we argue that the actual challenge is to design an algorithm providing both performances and strong guarantees. However, conversely to most of these schemes, we also consider operational constraints to provide a practical, high-performance implementation.In this work, we leverage inherent limitations in the accuracy of delay measurements and account for the operational constraint added by SR to design a new algorithm, BEST2COP, providing guarantees and performance in all cases. Our proposal efficiently deals with the complexity of DCLC in SR domains (DCLC-SR) thanks to simple but efficient data structures and amortized procedures specifically tailored to deal with the three metrics (delay, IGP cost, and the number of segments). We show that BEST2COP outperforms a state-of-the-art algorithm on both random and real networks of up to 1000 nodes. Relying on commodity hardware with a single thread, our algorithm retrieves all non-superfluous 3-dimensional routes in only 250ms and 100ms respectively. This execution time is further reduced using multiple threads, as the design of BEST2COP enables a speedup almost linear in the number of cores. The computing load is uniformly balanced across cores. Finally, we extend BEST2COP to deal with massive scale ISP by leveraging the multiarea partitioning of these deployments. Thanks to our new topology generator specifically designed to model realistic patterns in such massive IP networks, we show that BEST2COP can solve DCLC-SR in approximately 1 second even for ISP having more than 100 000 routers.

show abstract

Section: Segment Routing Background and Practical Usagesmentioning

confidence: 99%

“…Segment Routing & DCLC's rebirth. Segment Routing (SR) is a vibrant technology gathering traction from router vendors, network operators and academic communities [53,68]. Relying on a combination of strict and loose source routing, SR enables to deviate the traffic from the shortest IGP paths through a selected set of nodes and/or links.…”

Section: Introductionmentioning

confidence: 99%

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

Luttringer¹,

Alfroy²,

Mérindol³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Indeed, good evidence of this is provided by the number of extensions to the basic SRv6 architecture proposed in literature. A comprehensive survey of the research effort can be found in [27]. Among all the reported literature works, a considerable number is related to our work, like the ones focusing on optimizations [28][29][30] [31].…”

Section: Related Work a Srv6 Protocol Extensions And Optimizationsmentioning

confidence: 99%

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

Tulumello

Mayer

Bonola

et al. 2020

2020 16th International Conference on Network and Service Management (CNSM)

Self Cite

View full text Add to dashboard Cite

The Segment Routing (SR) architecture is based on loose source routing. A list of instructions, called segments can be added to the packet headers, to influence the forwarding and the processing of the packets in an SR enabled network. In SRv6 (Segment Routing over IPv6 data plane) the segments are represented with IPv6 addresses, which are 16 bytes long. There are some SRv6 service scenarios that may require to carry a large number of segments in the IPv6 packet headers. Reducing the size of these overheads is useful to minimize the impact on MTU (Maximum Transfer Unit) and to enable SRv6 on legacy hardware devices with limited processing capabilities that could suffer the long headers. In this paper we present the Micro SID solution for the efficient representation of segment identifiers. With this solution, the length of the segment list can be drastically reduced.

show abstract

“…II-B). A deeper introduction to SRv6 technology can be found in [8]. Table I shows the support of the SRv6 networking programming concepts and its extensions [24], [25], [26], [27] in the Linux kernel and in VPP software router.…”

Section: Srv6 Software Implementationsmentioning

confidence: 99%

“…SR-MPLS has been the first instantiation of the SR architecture to be rolled out, which allowed to partially leverage the SR benefits ( [6] and [7]), while the recent interest and developments are focusing on SRv6. The SRv6 implementations have drawn a lot of attention to researchers from academia and industry, as witnessed by the publication of several research activities [8]. A strong open source ecosystem is supporting SRv6 advances.…”

Section: Introductionmentioning

confidence: 99%

SRPerf: a Performance Evaluation Framework for IPv6 Segment Routing

Abdelsalam¹,

Ventre²,

Scarpitta³

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

Segment Routing is a form of loose source routing. It provides the ability to include a list of instructions (called segments), in the packet headers. The Segment Routing architecture has been first implemented with the MPLS dataplane and then, quite recently, with the IPv6 dataplane (SRv6). IPv6 Segment Routing (SRv6) is a promising solution to support advanced services such as Traffic Engineering, Service Function Chaining, Virtual Private Networks, and Load Balancing. The SRv6 data-plane is supported in many different software forwarding engines including the Linux kernel and VPP software router, as well as in hardware devices. In this paper, we present SRPerf, a performance evaluation framework for software and hardware implementations of SRv6. SRPerf is able to perform different benchmarking tests such as throughput and latency. For throughput tests, we use the Partial Drop Rate (PDR) to characterize a system under test. The architecture of SRPerf can be easily extended to support new benchmarking methodologies as well as different SRv6 implementations. We have used SRPerf to evaluate the performance of the SRv6 implementation in the Linux kernel and in VPP. SRPerf is a valuable tool in the context of software forwarding engines where new features can be added at fast pace, as it helps experimenters to validate their work. In particular, we describe how we have leveraged SRPerf to validate the implementation of some SRv6 behaviors that were missing or wrongly implemented in the Linux kernel mainline.

show abstract

Segment Routing: a Comprehensive Survey of Research Activities, Standardization Efforts and Implementation Results

Cited by 6 publications

References 82 publications

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

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

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

SRPerf: a Performance Evaluation Framework for IPv6 Segment Routing

Contact Info

Product

Resources

About