Decentralized maximum‐flow protocols
- 1 September 1982
- Vol. 12 (3) , 213-230
- https://doi.org/10.1002/net.3230120302
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- Advances in Verifiable Fail-Safe Routing ProceduresIEEE Transactions on Communications, 1981
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- A Failsafe Distributed Routing ProtocolIEEE Transactions on Communications, 1979
- Optimal Distributed Routing for Virtual Line-Switched Data NetworksIEEE Transactions on Communications, 1979
- A Distributed Shortest - Path AlgorithmPublished by Defense Technical Information Center (DTIC) ,1978
- The evolution of packet switchingProceedings of the IEEE, 1978
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977
- Decentralized information and control: A network flow exampleIEEE Transactions on Automatic Control, 1972
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963