Article

Optimization problems in congestion control

Authors:

R. Karp,

E. Koutsoupias,

C. Papadimitriou,

S. ShenkerAuthors Info & Claims

FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science

Page 66

Published: 12 November 2000 Publication History

Publisher Site

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.

Cited By

View all

Gabale VDutta PKokku RKalyanaraman S(2012)InSiteProceedings of the 2012 IEEE 20th International Workshop on Quality of Service10.5555/2330748.2330756(1-9)Online publication date: 4-Jun-2012
https://dl.acm.org/doi/10.5555/2330748.2330756
Epstein LKleiman ESonenberg LStone PTumer KYolum P(2011)On the quality and complexity of pareto equilibria in the job scheduling gameThe 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 210.5555/2031678.2031692(525-532)Online publication date: 2-May-2011
https://dl.acm.org/doi/10.5555/2031678.2031692
Efraimidis PTsavlidis LMertzios G(2010)Window-games between TCP flowsTheoretical Computer Science10.1016/j.tcs.2010.03.031411:31-33(2798-2817)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1016/j.tcs.2010.03.031
Show More Cited By

Index Terms

Optimization problems in congestion control

Index terms have been assigned to the content through auto-classification.

Recommendations

Efficient congestion avoidance mechanism
LCN '00: Proceedings of the 25th Annual IEEE Conference on Local Computer Networks

Increasing uncontrolled best-effort traffic deteriorates the ability of TCP to control congestion and is a source of high drop rates. This paper proposes an efficient congestion avoidance mechanism (ECAM) suitable for uncontrolled unicast and multicast ...
TCP tunnels: avoiding congestion collapse
LCN '00: Proceedings of the 25th Annual IEEE Conference on Local Computer Networks

This paper examines the attributes of TCP tunnels which are TCP circuits that carry IP packets and benefit from the congestion control mechanism of TCP/IP. The deployment of TCP tunnels reduces the many flows situation on the Internet to that of a few ...
TCP-Friendly CBR-Like Rate Control
ICNP '08: Proceedings of the 2008 IEEE International Conference on Network Protocols

While the current definition of TCP friendliness has enabled a wide variety of traffic control protocols other than TCP, it still considerably restricts the design space of TCP-friendly traffic control protocols. For example, some multimedia streaming ...

Comments

Information & Contributors

Information

Published In

FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science

November 2000

ISBN:0769508502

Publisher

IEEE Computer Society

United States

Publication History

Published: 12 November 2000

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gabale VDutta PKokku RKalyanaraman S(2012)InSiteProceedings of the 2012 IEEE 20th International Workshop on Quality of Service10.5555/2330748.2330756(1-9)Online publication date: 4-Jun-2012
https://dl.acm.org/doi/10.5555/2330748.2330756
Epstein LKleiman ESonenberg LStone PTumer KYolum P(2011)On the quality and complexity of pareto equilibria in the job scheduling gameThe 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 210.5555/2031678.2031692(525-532)Online publication date: 2-May-2011
https://dl.acm.org/doi/10.5555/2031678.2031692
Efraimidis PTsavlidis LMertzios G(2010)Window-games between TCP flowsTheoretical Computer Science10.1016/j.tcs.2010.03.031411:31-33(2798-2817)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1016/j.tcs.2010.03.031
Even-dar EMansour YNadav UMitzenmacher M(2009)On the convergence of regret minimization dynamics in concave gamesProceedings of the forty-first annual ACM symposium on Theory of computing10.1145/1536414.1536486(523-532)Online publication date: 31-May-2009
https://dl.acm.org/doi/10.1145/1536414.1536486
Epstein LLevin A(2009)On Equilibria for ADM Minimization GamesProceedings of the 2nd International Symposium on Algorithmic Game Theory10.1007/978-3-642-04645-2_31(347-358)Online publication date: 13-Oct-2009
https://dl.acm.org/doi/10.1007/978-3-642-04645-2_31
Awerbuch BKhandekar RGupta IWattenhofer R(2007)Greedy distributed optimization of multi-commodity flowsProceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing10.1145/1281100.1281140(274-283)Online publication date: 12-Aug-2007
https://dl.acm.org/doi/10.1145/1281100.1281140
Tan CChiu DLui JYau D(2007)A Distributed Throttling Approach for Handling High Bandwidth AggregatesIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2007.103418:7(983-995)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1109/TPDS.2007.1034
Karp RNierhoff TTantau T(2006)Optimal flow distribution among multiple channels with unknown capacitiesTheoretical Computer Science10.5555/2168303.2168307(111-128)Online publication date: 1-Jan-2006
https://dl.acm.org/doi/10.5555/2168303.2168307
Schmid SWattenhofer R(2006)A TCP with guaranteed performance in networks with dynamic congestion and random wireless lossesProceedings of the 2nd annual international workshop on Wireless internet10.1145/1234161.1234170(9-es)Online publication date: 2-Aug-2006
https://dl.acm.org/doi/10.1145/1234161.1234170
Schmid SWattenhofer R(2006)Dynamic internet congestion with burstsProceedings of the 13th international conference on High Performance Computing10.1007/11945918_20(159-170)Online publication date: 18-Dec-2006
https://dl.acm.org/doi/10.1007/11945918_20
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Efficient congestion avoidance mechanism

TCP tunnels: avoiding congestion collapse

TCP-Friendly CBR-Like Rate Control

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations