Title :
Some shortest path algorithms with decentralized information and communication requirements
Author :
Abram, Jeffrey M. ; Rhodes, Ian B.
Author_Institution :
Advanced Information and Decision Systems, Mountain View, CA, USA
fDate :
6/1/1982 12:00:00 AM
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.
Keywords :
Communication system control; Graph theory; Networks; Application software; Control systems; Convergence; Heuristic algorithms; Large-scale systems; Network topology; Optimal control; Routing; Shortest path problem; Stability;
Journal_Title :
Automatic Control, IEEE Transactions on
DOI :
10.1109/TAC.1982.1102987
