Dynamics of distributed shortest-path routing algorithms
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
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
Experience in black-box OSPF measurement
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
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
The case for separating routing from routers
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Issues on loop prevention in MPLS networks
IEEE Communications Magazine
A speed-up technique for distributed shortest paths computation
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part II
Resilient and low stretch routing through embedding into tree metrics
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Data-driven network connectivity
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
On the feasibility and efficacy of protection routing in IP networks
IEEE/ACM Transactions on Networking (TON)
Selecting shorter alternate paths for tunnel-based IP Fast ReRoute in linear time
Computer Networks: The International Journal of Computer and Telecommunications Networking
Engineering a new loop-free shortest paths routing algorithm
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Design of multi-path data routing algorithm based on network reliability
Computers and Electrical Engineering
Enhancing the computation of distributed shortest paths on real dynamic networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Ensuring connectivity via data plane mechanisms
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
A loop-free shortest-path routing algorithm for dynamic networks
Theoretical Computer Science
| Hi-index | 0.00 |
Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We present a new algorithm, Distributed Path Computation with Intermediate Variables (DIV), which can be combined with any distributed routing algorithm to guarantee that the directed graph induced by the routing decisions remains acyclic at all times. The key contribution of DIV, besides its ability to operate with any routing algorithm, is an update mechanism using simple message exchanges between neighboring nodes that guarantees loop-freedom at all times. DIV provably outperforms existing loop-prevention algorithms in several key metrics such as frequency of synchronous updates and the ability to maintain paths during transitions. Simulation results quantifying these gains in the context of shortest path routing are presented. In addition, DIV's universal applicability is illustrated by studying its use with a routing that operates according to a nonshortest path objective. Specifically, the routing seeks robustness against failures by maximizing the number of next-hops available at each node for each destination.