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

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 516; s. 1 - 19
Hlavní autoři: DʼAngelo, Gianlorenzo, DʼEmidio, Mattia, Frigioni, Daniele
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 09.01.2014
Témata:
Distributed networks
Dynamic algorithms
Loop-free routing
Shortest-path
Shortest-path
Dynamic algorithms
Distributed networks
Loop-free routing
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2013.11.001