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

DOI10.1016/j.tcs.2013.11.001zbMath1277.68037OpenAlexW2067574653WikidataQ115036544 ScholiaQ115036544MaRDI QIDQ385951

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni

Publication date: 13 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.001

zbMATH Keywords

dynamic algorithmsdistributed networksloop-free routingshortest-path

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (2)

Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios ⋮ Fully Dynamic 2-Hop Cover Labeling

Cites Work

• Unnamed Item
• Unnamed Item
• Termination detection for diffusing computations
• A fully dynamic algorithm for distributed shortest paths.
• Engineering a new algorithm for distributed shortest paths on dynamic networks
• Partially dynamic efficient algorithms for distributed shortest paths
• Another adaptive distributed shortest path algorithm
• On finding and updating shortest paths distributively
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Distributed shortest-path protocols for time-dependent networks

This page was built for publication: A loop-free shortest-path routing algorithm for dynamic networks