Stochastic convex ordering for multiplicative decrease internet congestion control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance comparison of router assisted congestion control protocols: XCP vs. RCP
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Performance Evaluation of Fast Startup Congestion Control Schemes
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Design of congestion control based on instantaneous queue sizes in the routers
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On the design of load factor based congestion control protocols for next-generation networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Comparison of end-to-end and network-supported fast startup congestion control schemes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Better never than late: meeting deadlines in datacenter networks
Proceedings of the ACM SIGCOMM 2011 conference
Brief paper: Self-clocking principle for congestion control in the Internet
Automatica (Journal of IFAC)
Chatty tenants and the cloud network sharing problem
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Deadline-based resource management for information-centric networks
Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking
| Hi-index | 0.00 |
Users typically want their flows to complete as quickly as possible. This makes Flow Completion Time (FCT) an important—arguably the most important—performance metric for the user. Yet research on congestion control focuses entirely on maximizing link throughput, utilization and fairness, which matter more to the operator than the user. This thesis is about a new congestion control algorithm-Rate Control Protocol (RCP)-designed for fast download times (i.e., aka user response times, or flow completion times). Whereas other modifications to (or replacements of) TCP (e.g., STCP, Fast TCP, XCP) are designed to work for specialized applications that use long-lived flows (scientific applications and supercomputer centers), RCP is designed for the typical flows of typical users in the Internet today. We will show that with typical Internet flow sizes, existing (TCP Sack) and newly proposed (XCP) congestion control algorithms make flows last much longer than necessary—often by one or two orders of magnitude. In contrast, RCP makes flows finish close to the minimum possible, leading to a perceptible improvement for web users, distributed computing, and distributed file-systems. We also address several theoretical as well as practical issues under RCP—how RCP's flow completion times compare with TCP, XCP and ideal Processor Sharing, the impact of RCP's short FCTs for the general Internet, stability of an RCP network and how RCP copes with sudden network changes such as flash-crowds, RCP's buffering requirements at routers, implementation of RCP in routers and end-hosts, and how RCP can be incrementally deployed in real networks.