论文信息 - Some shortest path algorithms with decentralized information and communication requirements

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.

I. Rhodes | J. Abram | I. Rhodes | J. Abram

[1] M. Schwartz,et al. Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[2] Michael Athans,et al. Survey of decentralized control methods for large scale systems , 1978 .

[3] I. Richer,et al. A Review of the Development and Performance of the ARPANET Routing Algorithm , 1978, IEEE Trans. Commun..

[4] Pravin Varaiya,et al. Decentralized information and control: A network flow example , 1972 .

[5] I. W. Sandberg,et al. On conditions under which it is possible to synchronize digital transmission systems , 1969 .

[6] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[7] Adrian Segall,et al. A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..

[8] Robert G. Gallager,et al. A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[9] Robert E. Kahn,et al. Resource-sharing computer communications networks , 1972 .