
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
B.A. Sanders, "An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks," IEEE Transactions on Computers, vol. 37, no. 7, pp. 779787, July, 1988.  
BibTex  x  
@article{ 10.1109/12.2223, author = {B.A. Sanders}, title = {An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks}, journal ={IEEE Transactions on Computers}, volume = {37}, number = {7}, issn = {00189340}, year = {1988}, pages = {779787}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.2223}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks IS  7 SN  00189340 SP779 EP787 EPD  779787 A1  B.A. Sanders, PY  1988 KW  asynchronous flow control; distributed flow control algorithm; rate allocation; computer networks; virtual circuit routing; gradient hillclimbing algorithm; control packets; optimization; computer networks; distributed processing. VL  37 JA  IEEE Transactions on Computers ER   
[1] G. M. Baudet, "Asynchronous iterative methods for multiprocessors,"J. ACM, vol. 25, no. 2, pp. 226244, Apr. 1978.
[2] K. BharathKumar and J. Jaffe, "A new approach to performanceoriented flow control,"IEEE Trans. Commun., vol. COM29, pp. 427435, 1981.
[3] D. Chazan and W. Miranker, "Chaotic relaxation,"Lin. Alg. its Applications, vol. 2, pp. 199222, 1969.
[4] R. G. Gallager, "A minimum delay routing algorithm using distributed computation,"IEEE Trans. Commun., vol. COM25, no. 1, pp. 7385, Jan. 1977.
[5] M. Gerla and L. Kleinrock, "Flow control, a comparative study,"IEEE Trans. Commun., vol. COM28, pp. 553574, Apr. 1980.
[6] M. Gerla, H. Chan, and J. Boisson De Marca, "Routing, flow control and fairness in computer networks," presented at ORSATIMS, Orlando, FL, 1983 and ICC, 1984.
[7] S. J. Golestaani, "A unified theory of flowcontrol and routing in datacommunication networks," M.I.T. LIDS Rep. TH963, 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. 130150, 1986.
[10] B. T. Poljak and Y. Z. Tsypkin, "Pseudogradient adaptation and training algorithms,"Automat. Remote Contr., no. 3, pp. 4568, 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. 314120.
[13] B. Sanders, "A private good/public good decomposition for optimal flow control of an M/M/1 queue,"IEEE Trans. Automat. Contr., vol. AC30, pp. 11431145, Oct. 1985.
[14] A. Tannenbaum,Computer Networks. Englewood Cliffs, NJ: PrenticeHall, 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. LIDSP1361, Jan. 1984.
[16] L. R. Tymes, "TYMNETA terminal oriented communication network," in1971 Spring Joint Comput. Conf. AFIPS Conf. Proc., vol. 38. Montvale, NJ: AFIPS Press, 1971, pp. 211216.