Why flow-completion time is the right metric for congestion control

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Why flow-completion time is the right metric for congestion control

Full text

Pdf (596 KB)

Source

ACM SIGCOMM Computer Communication Review archive
Volume 36 , Issue 1 (January 2006) table of contents

COLUMN: Editorial zone table of contents

Pages: 59 - 62

Year of Publication: 2006

ISSN:0146-4833

Authors

Nandita Dukkipati	Stanford University, Stanford, CA
Nick McKeown	Stanford University, Stanford, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 51, Citation Count: 10

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1111322.1111336 What is a DOI?

ABSTRACT

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

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A.M. Odlyzko, "The Internet and other networks: Utilization rates and their implications," In Information Economic and Policy, 12 (2000), Pages 341--365.
	2	David A. Patterson, Latency lags bandwith, Communications of the ACM, v.47 n.10, p.71-75, October 2004 [doi>10.1145/1022594.1022596]
	3	J. Du , J. Y.-I. Leung , G. H. Young, Minimizing mean flow time with release time constraint, Theoretical Computer Science, v.75 n.3, p.347-355, Oct. 1990 [doi>10.1016/0304-3975(90)90100-V]
	4	Dina Katabi , Mark Handley , Charlie Rohrs, Congestion control for high bandwidth-delay product networks, Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, August 19-23, 2002, Pittsburgh, Pennsylvania, USA
	5	N. Dukkipati, M. Kobayashi, R. Zhang-Shen, N. McKeown, "Processor Sharing Flows in the Internet," In Thirteenth International Workshop on Quality of Service (IWQoS), Passau, Germany, June 2005.
	6	N. Dukkipati, N. McKeow, "Processor Sharing Flows in the Internet," In http://yuba.stanford.edu/tr.html, Stanford HPNG Technical Report TR04-HPNG-061604, June 2004.
	7	N. Dukkipati, N. McKeow, "Why Flow-Completion Time is the Right metric for Congestion Control and why this means we need new algorithms," In http://yuba.stanford.edu/tr.html, Staford HPNG Technical Report TR05-HPNG-112102, November 2005.

CITED BY 10

	Marios Lestas , Andreas Pitsillides , Petros Ioannou , George Hadjipollas, Adaptive congestion protocol: A congestion control protocol with learning capability, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.51 n.13, p.3773-3798, September, 2007
	Frank Kelly , Gaurav Raina , Thomas Voice, Stability and fairness of explicit congestion control with small buffers, ACM SIGCOMM Computer Communication Review, v.38 n.3, July 2008
	Joel Sommers , Paul Barford , Albert Greenberg , Walter Willinger, An SLA perspective on the router buffer sizing problem, ACM SIGMETRICS Performance Evaluation Review, v.35 n.4, p.40-51, March 2008
	Christophe De Vleeschouwer , Pascal Frossard, Loss-resilient window-based congestion control, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.52 n.7, p.1473-1491, May, 2008
	R. G. Addie, 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, March 03-07, 2008, Marseille, France
	Amit Mondal , Aleksandar Kuzmanovic, Removing exponential backoff from TCP, ACM SIGCOMM Computer Communication Review, v.38 n.5, October 2008
	Ashvin Lakshmikantha , R. Srikant , Nandita Dukkipati , Nick McKeown , Carolyn Beck, Buffer sizing results for RCP congestion control under connection arrivals and departures, ACM SIGCOMM Computer Communication Review, v.39 n.1, January 2009
	Yitzhak Birk , Vladimir Zdornov, Improving communication-phase completion times in HPC clusters through congestion mitigation, Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference, May 04-April 06, 2009, Haifa, Israel
	Magnus Proebster , Michael Scharf , Simon Hauger, Performance comparison of router assisted congestion control protocols: XCP vs. RCP, Proceedings of the 2nd International Conference on Simulation Tools and Techniques, March 02-06, 2009, Rome, Italy
	Sándor Molnár , Balázs Sonkoly , Tuan Anh Trinh, A comprehensive TCP fairness analysis in high speed networks, Computer Communications, v.32 n.13-14, p.1460-1484, August, 2009