Please use this identifier to cite or link to this item:
Title: An extended fault-tolerant link-state routing protocol in the internet
Authors: Wu, J
Lin, X
Cao, J 
Keywords: Fault tolerant computing, telecommunication network routing, protocols, Internet
Issue Date: 2001
Publisher: Institute of Electrical and Electronics Engineers
Source: Proceedings of the Eighth International Conference on Parallel and Distributed Systems (ICPADS'2001), KyongJu City, Korea, 29 June 2001, p. 331-337 How to cite?
Abstract: Link-state routing protocols, such as OSPF and IS-IS, are widely used on the Internet. In link-state routing protocols, global network topology is first collected at each node. A shortest path tree (SPT) is then constructed by applying Dijkstra's shortest path algorithm at each node. Link-state protocols normally require the flooding of new information to the entire (sub)network after changes in any link state (including link faults). Narvaez et al. (2000) proposed a fault-tolerant link-state routing protocol without flooding. The idea is to construct a shortest restoration path for each uni-directional link fault. Faulty link information is distributed only to the nodes in the restoration path and only one restoration path is constructed. It is shown that this approach is loop-free. However, the approach of Narvaez et al. is inefficient when a link failure is bi-directional, because a restoration path is uni-directional and routing tables of nodes in the path are partially updated. In addition, two restoration paths may be generated for each bi-directional link fault. We extend the Narvaez protocol to efficiently handle a bi-directional link fault by making the restoration path bi-directional. Several desirable properties of the proposed extended routing protocol are also explored.
ISBN: 0-7695-1153-8 (print)
ISSN: 1521-9097
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Nov 12, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.