4th International IEEE Conference on Broadband Communications, Networks, Systems

Research Article

Redundant Trees for Fast IP Recovery

  • @INPROCEEDINGS{10.1109/BROADNETS.2007.4550419,
        author={Tarik Cicic and Audun Fosselie Hansen and Ole Kristoffer  Apeland},
        title={Redundant Trees for Fast IP Recovery},
        proceedings={4th International IEEE Conference on Broadband Communications, Networks, Systems},
        proceedings_a={BROADNETS},
        year={2008},
        month={6},
        keywords={Convergence  IP networks  Laboratories  Measurement  Multiprotocol label switching  Proposals  Protection  Research and development  Routing  Web and internet services},
        doi={10.1109/BROADNETS.2007.4550419}
    }
    
  • Tarik Cicic
    Audun Fosselie Hansen
    Ole Kristoffer Apeland
    Year: 2008
    Redundant Trees for Fast IP Recovery
    BROADNETS
    IEEE
    DOI: 10.1109/BROADNETS.2007.4550419
Tarik Cicic1,*, Audun Fosselie Hansen1,2,*, Ole Kristoffer Apeland1,*
  • 1: Simula Research Laboratory, Oslo, Norway
  • 2: Telenor R&D, Oslo, Norway
*Contact email: tarikc@simula.no, audunh@simula.no, oleap@simula.no

Abstract

Slow convergence of IP routing in case of network component failures represents a problem for emerging timecritical network applications. It has motivated work on IP fast reroute mechanisms that use local, proactive recovery in order to immediately provide alternative routes for the affected data packets. We present a new mechanism for IP fast recovery called IP Redundant Trees (IPRT). IPRT builds two redundant trees per network destination and pre-calculates backup next hops based on them. Combined with a smart forwarding scheme, IPRT provides proactive, local and loop-free recovery in connectionless IP networks. IPRT is simple and flexible, and requires a low increase of the routing state amount. We evaluate several key performance metrics in IPRT and other actual IP fast recovery proposals and argue that IPRT indeed has very attractive properties.