Selective Precomputation of Alternate Routes Using Link-State Information for IP Fast Restoration

Kazuya SUZUKI  Masahiro JIBIKI  Kenichi YOSHIDA  

IEICE TRANSACTIONS on Communications   Vol.E93-B   No.5   pp.1085-1094
Publication Date: 2010/05/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E93.B.1085
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Section on Technology and Architecture for Sustainable Growth of the Internet)
IP fast restoration,  link-state routing,  

Full Text: PDF(989.2KB)>>
Buy this Article

The availability of IP networks has increased its importance due to the evolving use of real-time and mission-critical applications on IP networks. Methods for preparing alternate routing tables that can be used for fast restoration from link failures have been investigated. In such methods, each node has to compute a number of alternate routing tables in advance since they have to prepare for each potential failure. The resulting huge number of alternate routing tables has prevented these methods from being deployed. In this paper, we propose a method for reducing the number of alternate routing tables for link failure. It analyzes three types of shortest path trees on the basis of link-state information. We show that the number of alternate routing tables can be reduced to 1/100, on average, from that with the conventional method, and that they are small enough to be stored in the memory of IP routers.