Engineering a new loop-free shortest paths routing algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Engineering a new loop-free shortest paths routing algorithm


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 Phi is the total number of nodes affected by a set of updates to the network, and phi is the maximum number of destinations for which a node is affected, then LFR requires O(Phi*Delta) messages and O(n + phi*Delta) space per node, where Delta 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(Phi*Delta) messages and Θ(n*Delta) 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 require- ments, while in terms of messages LFR outperforms DUAL on real-world instances, whereas DUAL is the best choice on artificial instances.
Fichier principal
Vignette du fichier
main.pdf (188.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00729005 , version 1 (07-09-2012)



Gianlorenzo d'Angelo, Mattia d'Emidio, Daniele Frigioni, Vinicio Maurizio. Engineering a new loop-free shortest paths routing algorithm. 11th International Symposium on Experimental Algorithms (SEA2012), Jun 2012, Bordeaux, France. pp.123-134, ⟨10.1007/978-3-642-30850-5_12⟩. ⟨hal-00729005⟩
147 View
247 Download



Gmail Facebook Twitter LinkedIn More