Issue No. 07 - July (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2223
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
asynchronous flow control; distributed flow control algorithm; rate allocation; computer networks; virtual circuit routing; gradient hill-climbing algorithm; control packets; optimization; computer networks; distributed processing.
B. Sanders, "An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks," in IEEE Transactions on Computers, vol. 37, no. , pp. 779-787, 1988.