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

DOI10.1016/J.TCS.2013.11.001MaRDI QIDQ385951zbMATH OpenOpenAlexWikidataFDO

Authors 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

distributed networksdynamic algorithmsloop-free routingshortest-path

Mathematics Subject Classification ID

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

Recommendations

• Enhancing the computation of distributed shortest paths on real dynamic networks
• Engineering a new algorithm for distributed shortest paths on dynamic networks
• On the distributed Bellman-Ford algorithm and the looping problem
• Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
• A minimum-hop routing algorithm based on distributed information

Cites work

• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• A fully dynamic algorithm for distributed shortest paths.
• Another adaptive distributed shortest path algorithm
• Distributed shortest-path protocols for time-dependent networks
• Engineering a new algorithm for distributed shortest paths on dynamic networks
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• On finding and updating shortest paths distributively
• Partially dynamic efficient algorithms for distributed shortest paths
• Random graphs.
• Termination detection for diffusing computations

Cited in

(11)

• On the algebraic theory of loop free routing
• On the distributed Bellman-Ford algorithm and the looping problem
• Fully Dynamic 2-Hop Cover Labeling
• A Dynamic Algorithm for Network Propagation
• Efficient use of route requests for loop-free on-demand routing in ad hoc networks
• Mitigating transient loops through interface-specific forwarding
• scientific article; zbMATH DE number 1505488 (Why is no real title available?)
• Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
• A new approach to on-demand loop-free routing in networks using sequence numbers
• Loop-free alternates and not-via addresses: a proper combination for IP fast reroute?
• Enhancing the computation of distributed shortest paths on real dynamic networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385951)