This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks
September 1988 (vol. 37 no. 9)
pp. 1067-1072
ASCII Text
x 
 
B.A. Sanders, "An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks," IEEE Transactions on Computers, vol. 37, no. 9, pp. 1067-1072, September, 1988.
 
 
BibTex
x
 
@article{ 10.1109/12.2257,
author = {B.A. Sanders},
title = {An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks},
journal ={IEEE Transactions on Computers},
volume = {37},
number = {9},
issn = {0018-9340},
year = {1988},
pages = {1067-1072},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.2257},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks
IS - 9
SN - 0018-9340
SP1067
EP1072
EPD - 1067-1072
A1 - B.A. Sanders,
PY - 1988
KW - incentive compatible; flow control algorithm; rate allocation; computer networks; dynamic resource sharing; communication channel; optimization; computer networks; optimisation; scheduling.
VL - 37
JA - IEEE Transactions on Computers
ER -
 
The dynamic resource sharing that is a characteristic of store-and-forward computer/communication networks allows efficient use of the communication channel but may result in congestion and unfairness with high utilizations. A flow control algorithm is presented to prevent these effects by fairly allocating input rates to the users of the network. The allocation of rates is posed as an optimiza

[1] K. Bharath-Kumar and J. Jaffe, "A new approach to performance-oriented flow control,"IEEE Trans. Commun., vol. COM-29, pp. 427-435, 1981.
[2] R. G. Gallager, "A minimum delay routing algorithm using distributed computation,"IEEE Trans. Commun., vol. COM-25, no. 1, pp. 73-85, Jan. 1977.
[3] M. Gerla and L. Kleinrock, "Flow control, a comparative study,"IEEE Trans. Commun., vol. COM-28, pp. 553-574, Apr. 1980.
[4] 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.
[5] S. J. Golestaani, "A unified theory of flow-control and routing in datacommunication networks," M.I.T. LIDS Rep. TH-963, Jan. 1980.
[6] J. Green and J.-J. Laffont,Incentives in Public Decision Making. Amsterdam, The Netherlands: North-Holland, 1979.
[7] Y.-C. Ho, P. Luh, and G. J. Olsder, "A control-theoretic view of incentives,"Automatica, vol. 18, 1982.
[8] L. Kleinrock,Queueing Systems Vol II: Computer Applications. New York: Wiley, 1976.
[9] B. Sanders, "An asynchronous, distributed flow control algorithm for rate allocation in computer networks,"IEEE Trans. Commun., vol. COM-37, pp. 779-787, July 1988.
[10] 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.
[11] L. Servi and Y.-C. Yo, "An incentive compatible modification of the Heal algorithm,"Opt. Contr. Appl. Methods, vol. 4, 1983.
[12] S. Stidham, "Optimal control of admissions to a queueing system,"IEEE Trans. Automat. Contr., vol. AC-30, Aug. 1985.
[13] A. Tannenbaum,Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1981.

Index Terms:
incentive compatible; flow control algorithm; rate allocation; computer networks; dynamic resource sharing; communication channel; optimization; computer networks; optimisation; scheduling.
Citation:
B.A. Sanders, "An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks," IEEE Transactions on Computers, vol. 37, no. 9, pp. 1067-1072, Sept. 1988, doi:10.1109/12.2257
Usage of this product signifies your acceptance of the Terms of Use.