Optimization problems in congestion control
Karp, R.
Koutsoupias, E.
Papadimitriou, C.
Shenker, S.
Inst. of Int. Comput. Sci., California Univ., Berkeley, CA;
This paper appears in: Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on
Publication Date: 2000
On page(s): 66-74
Meeting Date: 11/12/2000 - 11/14/2000
Location: Redondo Beach, CA, USA
ISBN: 0-7695-0850-2
References Cited: 5
INSPEC Accession Number: 6784292
Digital Object Identifier: 10.1109/SFCS.2000.892066
Current Version Published: 2002-08-06
Abstract
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
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
