Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Routing in the Internet
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Crash failures can drive protocols to arbitrary states
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Elements of network protocol design
Elements of network protocol design
Routing stability in congested networks: experimentation and analysis
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Distributed Algorithms
Observation and analysis of BGP behavior under stress
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
ICDCS '99 Workshop on Self-stabilizing Systems
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
GS3: scalable self-configuration and self-healing in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
GS3: scalable self-configuration and self-healing in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Self-managing energy-efficient multicast support in MANETs under end-to-end reliability constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.01 |
We formulate a notion of local stabilization, by which a system self-stabilizes in time proportional to the size of any perturbation that changes the network topology or the state of nodes. The notion implies that the part of the network involved in the stabilization includes at most the nodes whose distance from the perturbed nodes is proportional to the perturbation size. Also, we present LSRP, a protocol for local stabilization in shortest path routing. LSRP achieves local stabilization via two techniques. First, it layers system computation into three diffusing waves each having a different propagation speed, i.e., "stabilization wave" with the lowest speed, "containment wave" with intermediate speed, and "super-containment wave" with the highest speed. The containment wave contains the mistakenly initiated stabilization wave, the super-containment wave contains the mistakenly initiated containment wave, and the super-containment wave self-stabilizes itself locally. Second, LSRP avoids forming loops during stabilization, and it removes all transient loops within small constant time. To the best of our knowledge, LSRP is the first protocol that achieves local stabilization in shortest path routing.