A Spectrum of TCP-friendly Window-based Congestion Control Algorithms

A Spectrum of TCP-friendly Window-based Congestion Control Algorithms (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Shudong Jin , Liang Guo , Ibrahim Matta , Azer Bestavros

Venue:	IEEE/ACM Transactions on Networking
Citations:	21 - 4 self

Versions

Version History

Metadata Version 2

Datum	Value	Source
TITLE	A spectrum of TCP-friendly window-based congestion control algorithms	INFERENCE
AUTHOR NAME	Shudong Jin	SVM HeaderParse 0.1
AUTHOR AFFIL	Computer Science Department; Boston University	SVM HeaderParse 0.2
AUTHOR ADDR	Boston, MA 02215	SVM HeaderParse 0.1
AUTHOR NAME	Liang Guo	SVM HeaderParse 0.1
AUTHOR AFFIL	Computer Science Department; Boston University	SVM HeaderParse 0.2
AUTHOR ADDR	Boston, MA 02215	SVM HeaderParse 0.1
AUTHOR NAME	Ibrahim Matta	SVM HeaderParse 0.1
AUTHOR AFFIL	Computer Science Department; Boston University	SVM HeaderParse 0.2
AUTHOR ADDR	Boston, MA 02215	SVM HeaderParse 0.1
AUTHOR NAME	Azer Bestavros	SVM HeaderParse 0.1
AUTHOR AFFIL	Computer Science Department; Boston University	SVM HeaderParse 0.2
AUTHOR ADDR	Boston, MA 02215	SVM HeaderParse 0.1
ABSTRACT	The increasing diversity of Internet application requirements has spurred recent interest in transport protocols with flexible transmission controls. In window-based congestion control schemes, increase rules determine how to probe available bandwidth, whereas decrease rules determine how to back off when losses due to congestion are detected. The control rules are parameterized so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and loss rate. This paper presents a comprehensive study of a new spectrum of window-based congestion controls, which are TCP-friendly as well as TCP-compatible under RED. Our controls utilize history information in their control rules. By doing so, they improve the transient behavior, compared to recently proposed slowly-responsive congestion controls such as general AIMD and binomial controls. Our controls can achieve better tradeoffs among smoothness, aggressiveness, and responsiveness, and they can achieve faster convergence. We demonstrate analytically and through extensive ns simulations the steadystate and transient behavior of several instances of this new spectrum.	SVM HeaderParse 0.1
YEAR	2001	INFERENCE
VENUE	IEEE/ACM Transactions on Networking (TON	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
VOLUME	11	INFERENCE
TECH	Tech. Rep. BU-CS-2001-015	INFERENCE
CITATIONS	32 found	ParsCit 1.0