An efficient link protection scheme for link-state routing networks

To enhance the network reliability without incurring significant extra overhead, we propose a novel link protection scheme, Hybrid Link Protection (HLP), to achieve failure resilient routing. Compared to previous schemes, HLP ensures high network availability in a more efficient way, and also provides other features such as load balancing. HLP is implemented in two stages. Stage one provides Multiple Next-hop Protection (MNP), where only one single Shortest Path Tree (SPT) needs to be constructed on each node to find multiple next hops for any destination. Stage two provides Backup Path Protection (BPP), where only a minimum number of links need to be protected, using special paths and packet headers, to meet the network availability requirement. We evaluate these algorithms in a wide spread of relevant topologies, both real and synthetic, and the results reveal that HLP can achieve high network availability without introducing conspicuous overhead.

[1]  Chen-Nee Chuah,et al.  Characterization of Failures in an Operational IP Backbone Network , 2008, IEEE/ACM Transactions on Networking.

[2]  Alia Atlas,et al.  Basic Specification for IP Fast Reroute: Loop-Free Alternates , 2008, RFC.

[3]  J. Wolfowitz Review: William Feller, An introduction to probability theory and its applications. Vol. I , 1951 .

[4]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[5]  Xiaowei Yang,et al.  Source selectable path diversity via routing deflections , 2006, SIGCOMM.

[6]  Michael Menth,et al.  Loop-free alternates and not-via addresses: A proper combination for IP fast reroute? , 2010, Comput. Networks.

[7]  Santosh S. Vempala,et al.  Path splicing , 2008, SIGCOMM '08.

[8]  Stewart Bryant,et al.  Internet Engineering Task Force (ietf) a Framework for Ip and Mpls Fast Reroute Using Not-via Addresses , 2022 .

[9]  Srinivasan Ramasubramanian,et al.  Independent Directed Acyclic Graphs for Resilient Multipath Routing , 2012, IEEE/ACM Transactions on Networking.

[10]  Olivier Bonaventure,et al.  Achieving sub-second IGP convergence in large IP networks , 2005, CCRV.

[11]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[12]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[13]  Olivier Bonaventure,et al.  An evaluation of IP-based fast reroute techniques , 2005, CoNEXT '05.

[14]  Olivier Bonaventure,et al.  An efficient algorithm to enable path diversity in link state routing networks , 2011, Comput. Networks.