Engineering a new loop-free shortest paths routing algorithm

Authors:
Gianlorenzo D'Angelo;Mattia D'Emidio;Daniele Frigioni;Vinicio Maurizio
Affiliations:
MASCOTTE Project, I3S(CNRS/UNSA)/INRIA, France;Department of Electrical and Information Engineering, University of L'Aquila, Italy;Department of Electrical and Information Engineering, University of L'Aquila, Italy;Department of Electrical and Information Engineering, University of L'Aquila, Italy
Venue:
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Year:
2012

Citing 10
Cited 2

On finding and updating shortest paths distributively

Journal of Algorithms
Loop-free routing using diffusing computations

IEEE/ACM Transactions on Networking (TON)
OSPF: Anatomy of an Internet Routing Protocol

OSPF: Anatomy of an Internet Routing Protocol
A fully dynamic algorithm for distributed shortest paths

Theoretical Computer Science - Latin American theoretical informatics
Distributed shortest-path protocols for time-dependent networks

Distributed Computing
Partially dynamic efficient algorithms for distributed shortest paths

Theoretical Computer Science
A more efficient diffusing update algorithm for loop-free routing

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Always acyclic distributed path computation

IEEE/ACM Transactions on Networking (TON)
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
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

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
A loop-free shortest-path routing algorithm for dynamic networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present LFR (Loop Free Routing), a new loop-free distance vector routing algorithm, which is able to update the shortest paths of a distributed network with n nodes in fully dynamic scenarios. If Φ is the total number of nodes affected by a set of updates to the network, and φ is the maximum number of destinations for which a node is affected, then LFR requires O(Φ ·Δ) messages and O(n+φ ·Δ) space per node, where Δ is the maximum degree of the nodes of the network. We experimentally compare LFR with DUAL, one of the most popular loop-free distance vector algorithms, which is part of CISCO's EIGRP protocol and requires O(Φ ·Δ) messages and Θ(n ·Δ) space per node. The experiments are based on both real-world and artificial instances and show that LFR is always the best choice in terms of memory requirements, while in terms of messages LFR outperforms DUAL on real-world instances, whereas DUAL is the best choice on artificial instances.