DocumentCode
2267568
Title
RCP-AC: Congestion Control to Make Flows Complete Quickly in Any Environment
Author
Dukkipati, Nandita ; McKeown, Nick ; Fraser, Alexander G.
Author_Institution
Comput. Syst. Lab., Stanford Univ., Stanford, CA
fYear
2006
fDate
23-29 April 2006
Firstpage
1
Lastpage
5
Abstract
We believe that a congestion control algorithm should make flows finish quickly - as quickly as possible, while staying stable and fair among flows. Recently, we proposed RCP (Rate Control Protocol) which enables typical Internet-sized flows to complete one to two orders of magnitude faster than the existing (TCP Reno) and the proposed (XCP) congestion control algorithm. Like XCP, RCP uses explicit feedback from routers, but doesn´t require per-packet calculations. A router maintains just one rate that it gives to all flows, making it simple and inherently fair. Flows finish quickly because RCP aggressively gives excess bandwidth to flows, making it work well in the common case. However - and this is a design tradeoff - RCP will experience short-term transient overflows when network conditions change quickly (e.g. a route change or flash crowds). In this paper we extend RCP and propose RCP-AC (Rate Control Protocol with Acceleration Control) that allows the aggressiveness of RCP to be tuned, enabling fast completion of flows over a broad set of operating conditions.
Keywords
Internet; acceleration control; telecommunication congestion control; telecommunication network routing; transport protocols; TCP; congestion control; internet-sized flows; rate control protocol; routers; Acceleration; Bandwidth; Communication system traffic control; Control systems; Feedback; Internet; Measurement; Protocols; Size control; Spine;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings
Conference_Location
Barcelona
ISSN
0743-166X
Print_ISBN
1-4244-0221-2
Type
conf
DOI
10.1109/INFOCOM.2006.18
Filename
4146671
Link To Document