ACM Computing Surveys (CSUR)
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
Elements of network protocol design
Elements of network protocol design
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The Triumph and Tribulation of System Stabilization
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Stabilization and pseudo-stabilization
Distributed Computing - Special issue: Self-stabilization
| Hi-index | 0.00 |
The Hello protocol in OSPF allows each router in a network to check whether it can exchange messages with neighboring routers in its network. This check is carried out by making each router periodically send hello messages to every neighboring router in the network. Associated with the Hello protocol are two time periods: the hello period and the dead period. The hello period is the time period between sending two successive hello messages to the same neighbor. The dead period is the time period after which a router can declare a neighbor dead if during this period the router does not receive any hello messages from that neighbor. The original Hello protocol restricts the hello and dead periods to be fixed over time and to be identical in all routers. Simulation studies have shown that these restrictions contribute to network instabilities and even to network collapse. To improve network stability, we present a flexible Hello protocol where the hello and dead periods change over time and become consistent (rather than identical) in all routers. To ensure the fault-tolerance of our Hello protocol, the protocol is designed to be stabilizing. That is, when started from an arbitrary initial state, the protocol converges to a legitimate state, and remains in legitimate states throughout the remainder of its execution.