A loop-free shortest-path routing algorithm for dynamic networks

Authors:
Gianlorenzo Dangelo;Mattia Demidio;Daniele Frigioni
Affiliations:
Department of Mathematics and Informatics, University of Perugia, Via Vanvitelli, 1, I-06123 Perugia, Italy;Department of Information Engineering, Computer Science and Mathematics, University of LAquila, Via Gronchi, 18, I-67100 LAquila, Italy;Department of Information Engineering, Computer Science and Mathematics, University of LAquila, Via Gronchi, 18, I-67100 LAquila, Italy
Venue:
Theoretical Computer Science
Year:
2014

Citing 14
Cited 0

On finding and updating shortest paths distributively

Journal of Algorithms
Loop-free routing using diffusing computations

IEEE/ACM Transactions on Networking (TON)
Fully dynamic algorithms for maintaining shortest paths trees

Journal of Algorithms
New dynamic algorithms for shortest path tree computation

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

OSPF: Anatomy of an Internet Routing Protocol
Distributed Algorithms for Updating Shortest Paths (Extended Abstract)

WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
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
An extended fault-tolerant link-state routing protocol in the Internet

IEEE Transactions on Computers
Engineering a new loop-free shortest paths routing algorithm

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract

This work introduces Loop-Free Routing (LFR), a new loop-free distance-vector routing algorithm, which is able to update the shortest paths of a distributed network in fully dynamic scenarios. This work also provides an evaluation based on simulations of LFR and Diffuse Update ALgorithm (DUAL), one of the most popular loop-free distance-vector algorithms, which is part of CISCO@?s widely used Enhanced Interior Gateway Routing Protocol (EIGRP). The simulations are performed on dynamic scenarios based on both real-world and controlled instances. The simulations show that LFR is always the best choice in terms of memory requirements, while in terms of messages sent LFR outperforms DUAL on real-world networks, whereas DUAL is the best choice on controlled scenarios.