Distributed shortest-path protocols for time-dependent networks

DOI10.1007/S004460050023MaRDI QIDQ5137327zbMATH OpenOpenAlexFDO

Authors 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 algorithms (68W15) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Another adaptive distributed shortest path algorithm
• Shortest paths in piecewise continuous time-dependent networks
• On the complexity of time-dependent shortest paths
• On the complexity of time-dependent shortest paths

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• A Class of Continuous Network Flow Problems
• A note on two problems in connexion with graphs
• An Appraisal of Some Shortest-Path Algorithms
• Complexity of network synchronization
• Continuous-Time Flows in Networks
• Distributed network protocols
• Location of central nodes in time varying computer networks
• Minimum weight paths in time-dependent networks
• Optimal Congestion Control in Single Destination Networks
• Shortest-path algorithms: Taxonomy and annotation
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Cited in

(13)

• How fast can we reach a target vertex in stochastic temporal graphs?
• DMT of Multihop Networks: End Points and Computational Tools
• Time versus cost tradeoffs for deterministic rendezvous in networks
• DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
• How fast can we reach a target vertex in stochastic temporal graphs?
• Partially dynamic efficient algorithms for distributed shortest paths
• scientific article; zbMATH DE number 1953051 (Why is no real title available?)
• A fully dynamic algorithm for distributed shortest paths.
• Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
• Path Problems in Complex Networks
• A loop-free shortest-path routing algorithm for dynamic networks
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

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

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