Analysis of real datasets to characterize the local stability properties of the Internet routing paths suggests that extending the route selection criteria to account for such property would not increase the routing path length. Nevertheless, even if selecting a more stable routing path could be considered as valuable from a routing perspective, it does not necessarily imply that the associated forwarding path would be more stable. Hence, if the dynamics of the Internet routing and forwarding system show different properties, then one can not straightforwardly derive the one from the other. If this assumption is verified, then the relationship between the stability of the forwarding path (followed by the traffic) and the corresponding routing path as selected by the path-vector routing algorithm requires further characterization. For this purpose, we locally relate, i.e., at the router level, the stability properties of routing path with the corresponding forwarding path. The proposed stability model and measurement results verify this assumption and show that, although the main cause of instability results from the forwarding plane, a second order effect relates forwarding and routing path instability events. This observation provides the first indication that differential stability can safely be taken into account as part of the route selection process.


    Access

    Download


    Export, share and cite



    Title :

    Internet routing paths stability model and relation to forwarding paths


    Contributors:

    Publication date :

    2013-01-01


    Remarks:

    9th International Conference on Design of Reliable Communication Networks, Proceedings ; ISBN: 9781479900497


    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    Robustly disjoint paths with segment routing

    Aubry, François / Vissicchio, Stefano / Bonaventure, Olivier et al. | BASE | 2018

    Free access

    Hub location and routing problem with alternative paths

    da Costa Fontes, Fabio Francisco / Goncalves, Gilles | IEEE | 2015


    On Routing Disjoint Paths in Bounded Treewidth Graphs

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

    Free access

    Finding Routing Paths for Alternate Routing in All-Optical WDM Networks

    Lin, H.-C. / Wang, S.-W. / Hung, M.-L. | British Library Online Contents | 2008


    Cube Routing: Finding Paths through 3-dimensional Data Sets

    Strauß, Clemens | Online Contents | 2010