Rate control protocol (rcp): congestion control to make flows complete quickly

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.

[1]  Eitan Altman,et al.  Robust rate control for ABR sources , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[2]  Qian Zhang,et al.  Compound TCP: A scalable and TCP-friendly congestion control for high-speed networks , 2006 .

[3]  Moshe Zukerman,et al.  MaxNet: a congestion control architecture , 2002, IEEE Communications Letters.

[4]  Aaron Falk,et al.  Specification for the Explicit Control Protocol (XCP) , 2007 .

[5]  Adam Wierman,et al.  The Foreground-Background queue: A survey , 2008, Perform. Evaluation.

[6]  Cathy A. Fulton,et al.  Ut: abr feedback control with tracking , 1994, INFOCOM 1994.

[7]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[8]  Injong Rhee,et al.  Binary increase congestion control (BIC) for fast long-distance networks , 2004, IEEE INFOCOM 2004.

[9]  Tom Kelly,et al.  Scalable TCP: improving performance in highspeed wide area networks , 2003, CCRV.

[10]  Randy H. Katz,et al.  TCP Performance over Satellite Channels , 1999 .

[11]  Pablo Molinero-Fernández,et al.  Systems with multiple servers under heavy-tailed workloads , 2005, Perform. Evaluation.

[12]  A. Charny,et al.  An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback , 1994 .

[13]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[14]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[15]  Richard Nelson,et al.  Congestion control advancements in Linux , 2005 .

[16]  Andrew Odlyzko.  Internet TV: Implications for the long distance network , 2001 .

[17]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[18]  Andrew M. Odlyzko.  The Internet and other networks: utilization rates and their implications , 2000, Inf. Econ. Policy.

[19]  Guido Appenzeller,et al.  Sizing router buffers , 2004, SIGCOMM '04.

[20]  Sally Floyd,et al.  Wide-area traffic: the failure of Poisson modeling , 1994 .

[21]  Martín Casado,et al.  Reconfigurable networking hardware: a classroom tool , 2005, 13th Symposium on High Performance Interconnects (HOTI'05).

[22]  Nick McKeown,et al.  Stability Analysis of Explicit Congestion Control Protocols , 2007, IEEE Communications Letters.

[23]  George Varghese,et al.  New directions in traffic measurement and accounting , 2002, CCRV.

[24]  David A. Patterson,et al.  Latency Lags Bandwidth , 2005, ICCD.

[25]  Gene F. Franklin,et al.  Feedback Control of Dynamic Systems , 1986 .

[26]  Nick McKeown,et al.  Processor Sharing Flows in the Internet , 2005, IWQoS.

[27]  Derong Liu.  The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

[28]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM.

[29]  Douglas J. Leith,et al.  H-TCP : TCP for high-speed and long-distance networks , 2004 .

[30]  W. Richard Stevens,et al.  TCP/IP Illustrated, Volume 1: The Protocols , 1994 .

[31]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[32]  Thomas Voice,et al.  Stability and fairness of explicit congestion control with small buffers , 2008, CCRV.

[33]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

[34]  Rui Zhang-Shen.  Typical versus Worst Case Design in Networking , 2005 .

[35]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[36]  Sally Floyd,et al.  Quick-Start for TCP and IP , 2007, RFC.

[37]  Linus Schrage,et al.  The Queue M/G/1 with the Shortest Remaining Processing Time Discipline , 1966, Oper. Res..

[38]  Ren Wang,et al.  TCP westwood: Bandwidth estimation for enhanced transport over wireless links , 2001, MobiCom '01.

[39]  Sally Floyd,et al.  Simulation-based comparisons of Tahoe, Reno and SACK TCP , 1996, CCRV.

[40]  Martín Casado,et al.  Teaching networking hardware , 2005, ITiCSE '05.

[41]  Nick McKeown,et al.  Why flow-completion time is the right metric for congestion control , 2006, CCRV.

[42]  Nirwan Ansari,et al.  TCP in wireless environments: problems and solutions , 2005, IEEE Communications Magazine.

[43]  Konstantinos Psounis,et al.  SIFT : A simple algorithm for tracking elephant flows , and taking advantage of power laws , 2005 .

[44]  Joy Kuri,et al.  Optimal Resource Allocation in Packet Networks that use Rate Based Schedulers , 2022 .

[45]  Ioannis Stavrakakis,et al.  Optimal call admission control on a single link with a GPS scheduler , 2004, IEEE/ACM Transactions on Networking.

[46]  T. V. Lakshman,et al.  SRED: stabilized RED , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[47]  Sally Floyd,et al.  Measuring the evolution of transport protocols in the internet , 2005, CCRV.

[48]  Mor Harchol-Balter,et al.  Analysis of SRPT scheduling: investigating unfairness , 2001, SIGMETRICS '01.

[49]  Fouad A. Tobagi,et al.  Improving the performance of TCP applications using network-assisted mechanisms , 2002 .

[50]  Fernando Paganini,et al.  Dynamics of TCP/RED and a scalable control , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[51]  Fernando Paganini,et al.  Linear stability of TCP/RED and a scalable control , 2003, Comput. Networks.

[52]  Joy Kuri,et al.  Optimal call admission control in generalized processor sharing (GPS) schedulers , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[53]  Raj Jain,et al.  The ERICA switch algorithm for ABR traffic management in ATM networks , 1998, TNET.

[54]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[55]  Cheng Jin,et al.  FAST TCP: Motivation, Architecture, Algorithms, Performance , 2006, IEEE/ACM Transactions on Networking.

[56]  Fred Baker,et al.  Requirements for IP Version 4 Routers , 1995, RFC.

[57]  Sally Floyd,et al.  Increasing TCP's Initial Window , 1998, RFC.

[58]  Cheng Song,et al.  High performance TCP in ANSNET , 1994, CCRV.

[59]  Yunhong Gu.  A Survey of Transport Protocols other than Standard TCP , 2005 .

[60]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[61]  Joseph Y.-T. Leung,et al.  Minimizing Mean Flow Time with Release Time Constraint , 1990, Theor. Comput. Sci..

[62]  Alexandre Proutière,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[63]  Jiang Zhu,et al.  Making Large Scale Deployment of RCP Practical for Real Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[64]  Thomas E. Anderson,et al.  PCP: Efficient Endpoint Congestion Control , 2006, NSDI.

[65]  Glen Gibb,et al.  Building a RCP (Rate Control Protocol) Test Network , 2007, 15th Annual IEEE Symposium on High-Performance Interconnects (HOTI 2007).