Aubry, F;
Vissicchio, S;
Bonaventure, O;
Deville, Y;
(2018)
Robustly disjoint paths with segment routing.
In: Dimitropoulos, X and Dainotti, A and Vanbever, L and Benson, T, (eds.)
CoNEXT '18: Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies.
(pp. pp. 204-216).
Association for Computing Machinery (ACM): New York, NY, USA.
Preview |
Text
RobustlyDisjointPathsWithSegmentRouting_conext18.pdf - Accepted Version Download (368kB) | Preview |
Abstract
Motivated by conversations with operators and by possibilities to unlock future Internet-based applications, we study how to enable Internet Service Providers (ISPs) to reliably offer connectivity through disjoint paths as an advanced, value-added service. As ISPs are increasingly deploying Segment Routing (SR), we focus on implementing such service with SR. We introduce the concept of robustly disjoint paths, pairs of paths that are constructed to remain disjoint even after an input set of failures, with no external intervention (e.g., configuration change). We extend the routing theory, study the problem complexity, and design efficient algorithms to automatically compute SR-based robustly disjoint paths. Our algorithms enable a fully automated approach to offer the disjoint-path connectivity, based on configuration synthesis. Our evaluation on real topologies shows that such an approach is practical, and scales to large ISP networks.
| Type: | Proceedings paper |
|---|---|
| Title: | Robustly disjoint paths with segment routing |
| Event: | 14th International Conference on emerging Networking EXperiments and Technologies (CoNEXT '18) |
| Location: | Heraklion, GREECE |
| Dates: | 06 December 2018 - 07 December 2018 |
| ISBN-13: | 978-1-4503-6080-7 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1145/3281411.3281424 |
| Publisher version: | https://doi.org/10.1145/3281411.3281424 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10060665 |
Archive Staff Only
 |
View Item |
