Some shortest path algorithms with decentralized information and communication requirements

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.