This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks
July 1988 (vol. 37 no. 7)
pp. 779-787
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

[1] G. M. Baudet, "Asynchronous iterative methods for multiprocessors,"J. ACM, vol. 25, no. 2, pp. 226-244, Apr. 1978.
[2] K. Bharath-Kumar and J. Jaffe, "A new approach to performance-oriented flow control,"IEEE Trans. Commun., vol. COM-29, pp. 427-435, 1981.
[3] D. Chazan and W. Miranker, "Chaotic relaxation,"Lin. Alg. its Applications, vol. 2, pp. 199-222, 1969.
[4] R. G. Gallager, "A minimum delay routing algorithm using distributed computation,"IEEE Trans. Commun., vol. COM-25, no. 1, pp. 73-85, Jan. 1977.
[5] M. Gerla and L. Kleinrock, "Flow control, a comparative study,"IEEE Trans. Commun., vol. COM-28, pp. 553-574, Apr. 1980.
[6] M. Gerla, H. Chan, and J. Boisson De Marca, "Routing, flow control and fairness in computer networks," presented at ORSA-TIMS, Orlando, FL, 1983 and ICC, 1984.
[7] S. J. Golestaani, "A unified theory of flow-control and routing in data-communication networks," M.I.T. LIDS Rep. TH-963, Jan. 1980.
[8] L. Kleinrock,Queueing Systems Vol. II: Computer Applications. New York: Wiley, 1976.
[9] B. Lubachevsky and D. Mitra, "A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius,"J. ACM, vol. 33, pp. 130-150, 1986.
[10] B. T. Poljak and Y. Z. Tsypkin, "Pseudogradient adaptation and training algorithms,"Automat. Remote Contr., no. 3, pp. 45-68, 1973.
[11] B. Sanders, "Decentralized resource allocation algorithms with applications to flow control of communication networks," Ph.D. dissertation, Division Appl. Sci., Harvard Univ., 1985.
[12] B. Sanders, "An incentive compatible flow control algorithm for fair rate allocation in computer/communication networks," inProc. Sixth Int. Conf. Distributed Comput. Syst., May 1986, pp. 314-120.
[13] B. Sanders, "A private good/public good decomposition for optimal flow control of an M/M/1 queue,"IEEE Trans. Automat. Contr., vol. AC-30, pp. 1143-1145, Oct. 1985.
[14] A. Tannenbaum,Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1981.
[15] J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans, "Distributed asynchronous deterministic and stochastic gradient optimization algorithms," M.I.T. Lab. Inform. Decision Syst. Rep. LIDS-P-1361, Jan. 1984.
[16] L. R. Tymes, "TYMNET-A terminal oriented communication network," in1971 Spring Joint Comput. Conf. AFIPS Conf. Proc., vol. 38. Montvale, NJ: AFIPS Press, 1971, pp. 211-216.

Index Terms:
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.
Citation:
B.A. Sanders, "An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks," IEEE Transactions on Computers, vol. 37, no. 7, pp. 779-787, July 1988, doi:10.1109/12.2223
Usage of this product signifies your acceptance of the Terms of Use.