An asynchronous, distributed flow control algorithm for rate allocation in computer networks
- 1 July 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 37 (7) , 779-787
- https://doi.org/10.1109/12.2223
Abstract
An asynchronous, distributed algorithm is presented that determines the optimal transmission rate allocation in computer networks with virtual circuit routing. The flow control problem is formulated as a gradient hill-climbing algorithm. It is distributed, since the entry node for each virtual circuit iteratively computes the rate allocation for that virtual circuit. The entry node communicates with the associated user during each interaction and obtains information about the rest of the network by sending control packets along the virtual circuit. It is shown that all of the necessary information to solve the optimization problem can be obtained in this fashion and that the algorithm will converge, even though there is no synchronization between nodes and some computations are made with outdated information.Keywords
This publication has 8 references indexed in Scilit:
- A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radiusJournal of the ACM, 1986
- A private good/public good decomposition for optimal flow control of anM/M/1queueIEEE Transactions on Automatic Control, 1985
- A new approach to performance-oriented flow controlIEEE Transactions on Communications, 1981
- Flow Control: A Comparative SurveyIEEE Transactions on Communications, 1980
- Asynchronous Iterative Methods for MultiprocessorsJournal of the ACM, 1978
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977
- TYMNETPublished by Association for Computing Machinery (ACM) ,1971
- Chaotic relaxationLinear Algebra and its Applications, 1969