R. Karp, E. Koutsoupias, C. Papadimitriou, and S. Shenker.
Combinatorial optimization in congestion control.
In Proceedings of the 41th Annual Symposium on
Foundations of Computer Science, pages 66--74, Redondo Beach, CA,
12--14 November 2000.
Abstract
One of the crucial elements in the Internet's success is its ability to adequately control congestion. This 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.Bib
@string{FOCS00 = {Proceedings of the 41th Annual Symposium on Foundations of Computer Science}} @InProceedings{KKPS00, author = {R. Karp and E. Koutsoupias and C. Papadimitriou and S. Shenker}, title = {Combinatorial optimization in congestion control}, booktitle = FOCS00, year = 2000, month = {12--14 } # nov, pages = {66--74}, address = {Redondo Beach, CA}, }