Paper Info
Title
Tree-based link-state routing in the presence of routing information corruption
Abstract
Traditionally, link-state routing (LSR) uses two costly techniques to achieve its robustness and responsiveness: message forwarding on every communication link in the broadcast of network status updates, and the periodic broadcast of local status by every router. In this paper, we present a novel LSR protocol, called Tree-based LSR (T-LSR), which reduces the operational overhead of LSR as follows. A leader router is elected to periodically broadcast network status on behalf of all the other routers in the network, and a spanning tree is constructed to support these broadcasts. The spanning tree is used for most flooding operations, although the protocol reverts to conventional flooding during leader election and spanning tree construction. The T-LSR protocol distinguishes itself from previous tree-based, lightweight LSR methods by its fault-tolerance features: in addition to surviving network partitioning, the T-LSR protocol is shown to maintain consistent routing information and leader preferences throughout the network in the presence of undetected transmission/information corruption problems. The results of a simulation study demonstrate that the T-LSR protocol imposes a small fraction of the overhead of conventional LSR.
Year
DOI
Venue
1999
10.1016/S0140-3664(02)00202-5
Computer Communications
Keywords
DocType
Volume
Link-state routing,Protocol,Tree-based LSR
Conference
26
Issue
ISSN
Citations 
7
Computer Communications
3
PageRank 
References 
Authors
0.49
11
2
Name
Order
Citations
PageRank
Yih Huang1574.81
P. K. McKinley21397121.87