Another adaptive distributed shortest path algorithm

DOI10.1109/26.87189MaRDI QIDQ3986974zbMATH OpenOpenAlexFDO

Authors Pierre A. Humblet

Publication date 28 June 1992

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/2097e242dcb1555dbf9187e40a1a45d3e2ace4d1

zbMATH Keywords

shortest pathsdistributed algorithmchanging topology

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• scientific article; zbMATH DE number 1512693
• Partially dynamic efficient algorithms for distributed shortest paths
• A fully dynamic algorithm for distributed shortest paths.
• A distributed adaptive routing algorithm
• scientific article; zbMATH DE number 749816
• Improved distributed algorithms for exact shortest paths
• A distributed shortest path algorithm for a planar network
• Distributed approximation algorithms for weighted shortest paths

Cited in

(16)

• On the distributed Bellman-Ford algorithm and the looping problem
• scientific article; zbMATH DE number 1512693 (Why is no real title available?)
• Shortest route computation in distributed systems
• Distributed shortest-path protocols for time-dependent networks
• Engineering a new algorithm for distributed shortest paths on dynamic networks
• Partially dynamic efficient algorithms for distributed shortest paths
• Updating routing tables after resource failure in a distributed computer network
• A self-stabilizing algorithm for the shortest path problem in a distributed system
• A fully dynamic algorithm for distributed shortest paths.
• An Improved Distribution Algorithm for Shortest Paths Problem
• Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
• On finding and updating shortest paths distributively
• Enhancing the computation of distributed shortest paths on real dynamic networks
• Distributed computation on graphs
• A minimum-hop routing algorithm based on distributed information
• A loop-free shortest-path routing algorithm for dynamic networks

This page was built for publication: Another adaptive distributed shortest path algorithm

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