论文信息 - Decentralized maximum-flow protocols

Decentralized maximum-flow protocols

This article presents three protocols for obtaining maximum flow in a network by using distributed computation. Each node in the network has memory and processing capabilities and coordinates the algorithm with its neighbors by means of control messages. In the order presented, each protocol employs less communication than the previous one, but requires more time and node computation.

Adrian Segall | A. Segall

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

[2] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[3] L.G. Roberts,et al. The evolution of packet switching , 1978, Proceedings of the IEEE.

[4] Yogen K. Dalal,et al. Broadcast protocols in packet switched computer networks , 1977 .

[5] Pierre A. Humblet. A Distributed Shortest - Path Algorithm , 1978 .

[6] Adrian Segall,et al. Optimal Distributed Routing for Virtual Line-Switched Data Networks , 1979, IEEE Trans. Commun..

[7] Adrian Segall. Advances in Verifiable Fail-Safe Routing Procedures , 1981, IEEE Trans. Commun..

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

[9] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[10] Decision Systems.,et al. A recoverable protocol for loop-free distributed routing , 1978 .

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

[12] Philip M. Spira,et al. Communication Complexity of Distributed Minimum Spanning Tree Algorithms , 1977, Berkeley Workshop.

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