Redondo Beach, California
Nov. 12, 2000 to Nov. 14, 2000
E. Koutsoupias , Inst. of Int. Comput. Sci., California Univ., Berkeley, CA, USA
C. Papadimitriou , Inst. of Int. Comput. Sci., California Univ., Berkeley, CA, USA
R. Karp , 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.
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
E. Koutsoupias, C. Papadimitriou, R. Karp, "Optimization problems in congestion control", FOCS, 2000, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2000, pp. 66, doi:10.1109/SFCS.2000.892066