The Community for Technology Leaders
Green Image
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.A. Sanders, "An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks", IEEE Transactions on Computers, vol. 37, no. , pp. 779-787, July 1988, doi:10.1109/12.2223
86 ms
(Ver 3.3 (11022016))