DocumentCode :
1839131
Title :
Scalable TCP congestion control
Author :
Morris, Robert
Author_Institution :
Harvard Univ., MA, USA
Volume :
3
fYear :
2000
fDate :
26-30 Mar 2000
Firstpage :
1176
Abstract :
The packet losses imposed by IP networks can cause long and erratic recovery delays, since senders must often use conservative loss detection and retransmission mechanisms. This paper proposes a model to explain and predict loss rates for TCP traffic. Based on that model, the paper describes a new router buffering algorithm, flow-proportional queuing (FPQ), that handles heavy TCP loads without imposing high loss rates. FPQ controls TCP by varying the router´s queue length in proportion to the number of active TCP connections. Simulation results show that FPQ produces the same average transfer delays as existing schemes, but makes the delays more predictable and fairer
Keywords :
Internet; buffer storage; packet switching; queueing theory; telecommunication congestion control; telecommunication network routing; telecommunication traffic; transport protocols; FPQ; IP networks; TCP traffic; active TCP connections; average transfer delays; conservative loss detection; erratic recovery delays; flow-proportional queuing; loss rate prediction; packet losses; retransmission mechanisms; router buffering algorithm; router queue length; scalable TCP congestion control; Art; Communication system traffic control; Delay; Feedback; IP networks; Internet; Predictive models; Proportional control; TCPIP; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Conference_Location :
Tel Aviv
ISSN :
0743-166X
Print_ISBN :
0-7803-5880-5
Type :
conf
DOI :
10.1109/INFCOM.2000.832487
Filename :
832487
Link To Document :
بازگشت