Distributed shortest-path protocols for time-dependent networks

DOI10.1007/s004460050023zbMath1448.68153OpenAlexW2035017516MaRDI QIDQ5137327

Raphael Rom, Ariel Orda

Publication date: 2 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004460050023

zbMATH Keywords

shortest pathtime-dependencydistributed protocolsinterval scheme

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (8)

Path Problems in Complex Networks ⋮ A loop-free shortest-path routing algorithm for dynamic networks ⋮ A fully dynamic algorithm for distributed shortest paths. ⋮ How fast can we reach a target vertex in stochastic temporal graphs? ⋮ Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios ⋮ Partially dynamic efficient algorithms for distributed shortest paths ⋮ How fast can we reach a target vertex in stochastic temporal graphs ⋮ Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Location of central nodes in time varying computer networks
• Distributed network protocols
• Shortest-path algorithms: Taxonomy and annotation
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Optimal Congestion Control in Single Destination Networks
• Complexity of network synchronization
• A Class of Continuous Network Flow Problems
• Minimum weight paths in time-dependent networks
• An Appraisal of Some Shortest-Path Algorithms
• Continuous-Time Flows in Networks

This page was built for publication: Distributed shortest-path protocols for time-dependent networks