Minimizing mean flow time with release time constraint
Theoretical Computer Science
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Communications of the ACM - Voting systems
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Adaptive congestion protocol: A congestion control protocol with learning capability
Computer Networks: The International Journal of Computer and Telecommunications Networking
Loss-resilient window-based congestion control
Computer Networks: The International Journal of Computer and Telecommunications Networking
An SLA perspective on the router buffer sizing problem
ACM SIGMETRICS Performance Evaluation Review
Stability and fairness of explicit congestion control with small buffers
ACM SIGCOMM Computer Communication Review
Snapshot simulation of internet traffic: fast and accurate for heavy-tailed flows
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Removing exponential backoff from TCP
ACM SIGCOMM Computer Communication Review
Buffer sizing results for RCP congestion control under connection arrivals and departures
ACM SIGCOMM Computer Communication Review
Improving communication-phase completion times in HPC clusters through congestion mitigation
SYSTOR '09 Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference
Performance comparison of router assisted congestion control protocols: XCP vs. RCP
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
A comprehensive TCP fairness analysis in high speed networks
Computer Communications
Design of congestion control based on instantaneous queue sizes in the routers
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Fast admission control for short TCP flows
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Scalable NIDS via negative pattern matching and exclusive pattern matching
INFOCOM'10 Proceedings of the 29th conference on Information communications
Enabling a bufferless core network using edge-to-edge packet-level FEC
INFOCOM'10 Proceedings of the 29th conference on Information communications
Automatica (Journal of IFAC)
Comparison of end-to-end and network-supported fast startup congestion control schemes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cross-layer flow and congestion control for datacenter networks
Proceedings of the 3rd Workshop on Data Center - Converged and Virtual Ethernet Switching
ASAP: a low-latency transport layer
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Making middleboxes someone else's problem: network processing as a cloud service
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Finishing flows quickly with preemptive scheduling
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Making middleboxes someone else's problem: network processing as a cloud service
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Finishing flows quickly with preemptive scheduling
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Rethinking end-to-end congestion control in software-defined networks
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
Reproducible network experiments using container-based emulation
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Inverting flow durations from sampled traffic
Proceedings of the 24th International Teletraffic Congress
SCDA: SLA-aware cloud datacenter architecture for efficient content storage and retrieval
Proceedings of the 22nd international symposium on High-performance parallel and distributed computing
EyeQ: practical network performance isolation at the edge
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
How to improve your network performance by asking your provider for worse service
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
Tiny packet programs for low-latency network control and monitoring
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
Recursively cautious congestion control
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
| Hi-index | 0.00 |
Users typically want their flows to complete as quickly as possible. This makes Flow Completion Time (FCT) an im portant - arguably the most important - performance metric for the user. Yet research on congestion control focuses almost entirely on maximizing link throughput, utilization and fairness, which matter more to the operator than the user. In this paper we show that with typical Internet flow sizes, existing (TCP Reno) and newly proposed (XCP) congestion control algorithms make flows last much longer than necessary - often by one or two orders of magnitude. In contrast, we show how a new and practical algorithm - RCP (Rate Control Protocol) - enables flows to complete close to the minimum possible