On the distributed Bellman-Ford algorithm and the looping problem

DOI10.1287/IJOC.1060.0195MaRDI QIDQ2892366zbMATH OpenOpenAlexFDO

Authors Kevin R. Hutson, Terri L. Schlosser, Douglas R. Shier

Publication date 18 June 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1060.0195

zbMATH Keywords

adaptive routingcommunication networksdistributed computingshortest paths trees

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15) Traffic problems in operations research (90B20)

Recommendations

• Another adaptive distributed shortest path algorithm
• A minimum-hop routing algorithm based on distributed information
• Engineering a new algorithm for distributed shortest paths on dynamic networks
• Partially dynamic efficient algorithms for distributed shortest paths
• A loop-free shortest-path routing algorithm for dynamic networks

Cited in

(6)

• A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm
• A coding-based approach to robust shortest-path routing
• A loop-free shortest-path routing algorithm for dynamic networks
• A minimum-hop routing algorithm based on distributed information
• scientific article; zbMATH DE number 749212 (Why is no real title available?)
• Randomized Speedup of the Bellman–Ford Algorithm

This page was built for publication: On the distributed Bellman-Ford algorithm and the looping problem

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