Premium
Decentralized maximum‐flow protocols
Author(s) -
Segall Adrian
Publication year - 1982
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230120302
Subject(s) - computer science , computation , node (physics) , distributed computing , protocol (science) , maximum flow problem , flow network , flow control (data) , flow (mathematics) , computer network , theoretical computer science , algorithm , parallel computing , mathematical optimization , mathematics , engineering , medicine , alternative medicine , geometry , structural engineering , pathology
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.