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.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Robustly disjoint paths with segment routing



    Erscheinungsdatum :

    2018-01-01



    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    629



    On Routing Disjoint Paths in Bounded Treewidth Graphs

    Ene, Alina / Mnich, Matthias / Pilipczuk, Marcin et al. | BASE | 2016

    Freier Zugriff

    The Complexity of Packing Edge-Disjoint Paths

    Dreier, Jan / Fuchs, Janosch / Hartmann, Tim A. et al. | BASE | 2019

    Freier Zugriff

    Disjoint Multipath Routing and Failure Recovery

    Oh Lee, Yong / Narasimha Reddy, A.L. | BASE | 2010

    Freier Zugriff

    Segment Routing

    Lius, Teemu | BASE | 2021

    Freier Zugriff

    Robustly Estimating Changes in Image Appearance

    Black, M. J. / Fleet, D. J. / Yacoob, Y. | British Library Online Contents | 2000