This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
41st Annual Symposium on Foundations of Computer Science
Optimization problems in congestion control
Redondo Beach, California
November 12-November 14
ISBN: 0-7695-0850-2
R. Karp, Inst. of Int. Comput. Sci., California Univ., Berkeley, CA, USA
E. Koutsoupias, Inst. of Int. Comput. Sci., California Univ., Berkeley, CA, USA
C. Papadimitriou, Inst. of Int. Comput. Sci., California Univ., Berkeley, CA, USA
S. Shenker, Inst. of Int. Comput. Sci., California Univ., Berkeley, CA, USA
One of the crucial elements in the Internet's success is its ability to adequately control congestion. The paper defines and solves several optimization problems related to Internet congestion control, as a step toward understanding the virtues of the TCP congestion control algorithm currently used and comparing it with alternative algorithms. We focus on regulating the rate of a single unicast flow when the bandwidth available to it is unknown and may change over time. We determine near-optimal policies when the available bandwidth is unchanging, and near-optimal competitive policies when the available bandwidth is changing in a restricted manner under the control of an adversary.
Index Terms:
optimisation; telecommunication congestion control; Internet; optimization problems; Internet congestion control; TCP congestion control algorithm; single unicast flow; near-optimal policies; near-optimal competitive policies; available bandwidth
Citation:
R. Karp, E. Koutsoupias, C. Papadimitriou, S. Shenker, "Optimization problems in congestion control," focs, pp.66, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.