Data networks (2nd ed.)
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
Understanding and mitigating the effects of count to infinity in Ethernet networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Paths with loops, even transient ones, pose significant stability problems in networks. As a result, much effort has been devoted over the past thirty years to designing distributed algorithms capable of avoiding loops. We present a new algorithm, Distributed Path Computation with Intermediate Variables (DIV), that guarantees that no loops, transient or steady-state, can ever form. DIV's novelty is in that it is not restricted to shortest paths, can easily handle arbitrary sequences of changes and updates, and provably outperforms earlier approaches in several key metrics. In addition, when used with distance-vector style path computation algorithms, DIV also prevents counting-to-infinity; hence further improving convergence. The paper introduces DIV and its key properties. Simulation quantifying its performance gains are also presented.