Some shortest path algorithms with decentralized information and communication requirements
Abstract
This paper presents several decentralized algorithms for finding all shortest paths in a network. Both static and dynamic networks are discussed. Each algorithm has localized information and communication requirements, operates asynchronously, and converges to the optimum in finite time.
- Publication:
-
IEEE Transactions on Automatic Control
- Pub Date:
- June 1982
- Bibcode:
- 1982ITAC...27..570A
- Keywords:
-
- Algorithms;
- Communication Networks;
- Convergence;
- Run Time (Computers);
- Signal Flow Graphs;
- Trajectory Optimization;
- Information Theory;
- Network Analysis;
- Operations Research;
- Signal Processing;
- Topology;
- Electronics and Electrical Engineering