TCP_BITCP - 1 Binary Increase Congestion Control for Fast...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Abstract —High-speed networks with large delays present a unique environment where TCP may have a problem utilizing the full bandwidth. Several congestion control proposals have been suggested to remedy this problem. The protocols consider mainly two properties: TCP friendliness and bandwidth scalability. That is, a protocol should not take away too much bandwidth from TCP while utilizing the full bandwidth of high-speed networks. This paper presents another important constraint, namely, RTT (round trip time) unfairness where competing flows with different RTTs may consume vastly unfair bandwidth shares. Existing schemes have a severe RTT unfairness problem because the window increase rate gets larger as window grows – ironically the very reason that makes them more scalable. RTT unfairness for high speed networks occurs distinctly with drop tail routers where packet loss can be highly synchronized. After recognizing the RTT unfairness problem of existing protocols, this paper presents a new congestion control protocol that ensures linear RTT fairness under large windows while offering both scalability and TCP-friendliness. The protocol combines two schemes called additive increase and binary search increase . When the congestion window is large, additive increase with a large increment ensures linear RTT fairness as well as good scalability. Under small congestion windows, binary search increase is designed to provide TCP friendliness. The paper presents a performance study of the new protocol. Key words – Congestion control, High speed networks, RTT fairness, TCP friendliness, Scalability, Simulation, Protocol Design. I. INTRODUCTION he Internet is evolving. The networks, such as Abilene and ESNet, provisioned with a large amount of bandwidth ranging from 1 to 10Gbps are now sprawling to connect many research organizations around the world. As these networks run over a long distance, their round trip delays can rise beyond 200ms. The deployment of high-speed networks has helped push the frontiers of high performance computing that requires access to a vast amount of data as well as high computing power. Applications like scientific collaboration, telemedicine, and real-time environment monitoring benefit from this deployment. Typically they require transmission of high-bandwidth real time data, images, and video captured from remote sensors such as 1 Authors are with the Department of Computer Science, North Carolina State University, Raleigh, NC 27699 (email: [email protected] , [email protected] , [email protected] ). The work reported in this paper is sponsored in part by NSF CAREER ANI-9875651, NSF ANI- 0074012 satellite, radars, and echocardiography. These applications require not only high bandwidth, but also real time predictable, low latency data transfer.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/07/2011 for the course CSE 100 taught by Professor Staff during the Spring '08 term at UCSD.

Page1 / 13

TCP_BITCP - 1 Binary Increase Congestion Control for Fast...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online