Computer Networks and ISDN Systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Vulnerabilities of network control protocols: an example
ACM SIGCOMM Computer Communication Review
The stability of paths in a dynamic network
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
| Hi-index | 0.24 |
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.