LSRP: local stabilization in shortest path routing
Anish Arora, Hongwei Zhang · 2004
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 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 in shortest path routing. LSRP achieves local via two techniques. First, it layers system computation into three diffusing waves each having a different propagation speed, i.e., stabilization with the lowest speed, with intermediate speed, and with the highest speed. The containment wave contains the mistakenly initiated 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 in shortest path routing.