A loop-free shortest-path routing algorithm for dynamic networks. D'Angelo, G.; D'Emidio, M.; and Frigioni, D. Theoretical Computer Science, 2014.
abstract   bibtex   
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. © 2013 Elsevier B.V.
@article{
 title = {A loop-free shortest-path routing algorithm for dynamic networks},
 type = {article},
 year = {2014},
 identifiers = {[object Object]},
 keywords = {Distributed networks,Dynamic algorithms,Loop-free routing,Shortest-path},
 volume = {516},
 id = {4a1d9fcb-fe58-3980-a3e9-27e128f67b7c},
 created = {2018-10-08T12:08:11.388Z},
 file_attached = {false},
 profile_id = {84ce8429-76d1-3854-b705-aea791bb12b7},
 group_id = {f21b0253-3968-3a3c-94e9-8d6f3fa6acf2},
 last_modified = {2018-10-08T12:08:11.499Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 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. © 2013 Elsevier B.V.},
 bibtype = {article},
 author = {D'Angelo, G. and D'Emidio, M. and Frigioni, D.},
 journal = {Theoretical Computer Science}
}
Downloads: 0