TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
The effects of systemic packet loss on aggregate TCP flows
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
TCP Nice: a mechanism for background transfers
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
FAST TCP: motivation, architecture, algorithms, performance
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
High-speed organizational networks running over leased fiber-optic lines or VPNs suffer from the well-known limitations of TCP over long-fat pipes. High-performance protocols like XCP require changes in the network. Other protocols like FastTCP assume nothing about the network but may not perform as well as network-aware protocols. In this paper, we present a new transport protocol that exploits the fact that these networks can offer priority queuing, thus finding the sweet spot between assuming too much and too little about the network. Our protocol splits a given transport flow into two prioritized flows. The higher priority flow operates with the legacy congestion control while the lower priority flow aggressively exploits spare capacity in the network while not interfering with the other participating flows. This isolation of the aggressive flow into strictly lower priority queues gives us more latitude in how to operate the aggressive component. We show through Emulab experiments of our implementation as well as simulations that this protocol can produce near-perfect goodputs in lossy networks, can considerably improve the completion time of short flows, and can sustain a high bottleneck utilization even in changing network conditions.