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

Kazuya Suzuki | Zendy; Masahiro Jibiki | Zendy; Kenichi Yoshida | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Kazuya Suzuki,

Masahiro Jibiki,

Kenichi Yoshida

Publication year - 2010

Publication title -

ieice transactions on communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.211

H-Index - 56

eISSN - 1745-1345

pISSN - 0916-8516

DOI - 10.1587/transcom.e93.b.1085

Subject(s) - computer science , precomputation , computer network , routing (electronic design automation) , routing table , node (physics) , loose source routing , link state routing protocol , ip forwarding , virtual routing and forwarding , link (geometry) , state (computer science) , routing protocol , static routing , distributed computing , algorithm , structural engineering , engineering , computation

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research