Implementing network protocols at user level
IEEE/ACM Transactions on Networking (TON)
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Analyzing stability in wide-area network performance
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Experiences implementing a high performance TCP in user-space
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Modeling the throughput of TCP Vegas
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Part III: routers with very small buffers
ACM SIGCOMM Computer Communication Review
FAST TCP: motivation, architecture, algorithms, performance
IEEE/ACM Transactions on Networking (TON)
Dynamically tuning level of parallelism in wide area data transfers
DADC '08 Proceedings of the 2008 international workshop on Data-aware distributed computing
Balancing TCP buffer vs parallel streams in application level throughput optimization
Proceedings of the second international workshop on Data-aware distributed computing
A data throughput prediction and optimization service for widely distributed many-task computing
Proceedings of the 2nd Workshop on Many-Task Computing on Grids and Supercomputers
| Hi-index | 0.00 |
Recent congestion control protocols such as XCP and RCP achieve fair bandwidth sharing, high utilization, small queue sizes and nearly zero packet loss by implementing an explicit bandwidth share mechanism in the network routers. This paper develops new quantitative techniques for achieving the same results using only end-host measures. We develop new methods of computing bottleneck link characteristics, a new technique for sharing bandwidth fairly with Reno flows, and a new approach for rapidly converging to bandwidth share. A new transport protocol, TCP-Madison, that employs the new bandwidth sharing techniques is also defined in the paper. Experiments comparing TCP-Madison with FAST TCP, BIC-TCP and TCP-Reno over hundreds of PlanetLab and other live Internet paths show that the new protocol achieves the stated bandwidth sharing properties, is easily configured for near-optimal performance over all paths, and significantly outperforms the previous protocols.