TY - JOUR
T1 - One more bit is enough
AU - Xia, Yong
AU - Subramanian, Lakshminarayanan
AU - Stoica, Ion
AU - Kalyanaraman, Shivkumar
N1 - Funding Information:
Manuscript received November 11, 2007; revised January 23, 2008. First published March 3, 2008; current version published December 17, 2008. Approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor F. Paganini. This work was supported in part by the National Science Foundation (NSF) under Grants ITR-00225660, ANI-0515259, NSF Career Award ANI-0133811, NSF-ITR 0313095, in part by the Defense Advanced Research Projects Agency (DARPA) under Contract F30602-00-2-0537, in part by the California MICRO Program, in part by the Air Force ESC Hanscom, in part by MIT Lincoln Laboratory Letter No. 14-S-06-0206, and in part by Grants from Intel and AT&T Laboratories Research. An earlier verion of this paper appeared in ACM SIG-COMM 2005.
PY - 2008
Y1 - 2008
N2 - Achieving efficient and fair bandwidth allocation while minimizing packet loss and bottleneck queue in high bandwidth-delay product networks has long been a daunting challenge. Existing end-to-end congestion control (e.g., TCP) and traditional congestion notification schemes (e.g., TCP+AQM/ECN) have significant limitations in achieving this goal. While the XCP protocol addresses this challenge, it requires multiple bits to encode the congestion-related information exchanged between routers and end-hosts. Unfortunately, there is no space in the IP header for these bits, and solving this problem involves a non-trivial and time-consuming standardization process. In this paper, we design and implement a simple, low-complexity protocol, called Variable-structure congestion Control Protocol (VCP), that leverages only the existing two ECN bits for network congestion feedback, and yet achieves comparable performance to XCP, i.e., high utilization, negligible packet loss rate, low persistent queue length, and reasonable fairness. On the downside, VCP converges significantly slower to a fair allocation than XCP. We evaluate the performance of VCP using extensive ns2 simulations over a wide range of network scenarios and find that it significantly outperforms many recently-proposed TCP variants, such as HSTCP, FAST, CUBIC, etc. To gain insight into the behavior of VCP, we analyze a simplified fluid model and prove its global stability for the case of a single bottleneck shared by synchronous flows with identical round-trip times.
AB - Achieving efficient and fair bandwidth allocation while minimizing packet loss and bottleneck queue in high bandwidth-delay product networks has long been a daunting challenge. Existing end-to-end congestion control (e.g., TCP) and traditional congestion notification schemes (e.g., TCP+AQM/ECN) have significant limitations in achieving this goal. While the XCP protocol addresses this challenge, it requires multiple bits to encode the congestion-related information exchanged between routers and end-hosts. Unfortunately, there is no space in the IP header for these bits, and solving this problem involves a non-trivial and time-consuming standardization process. In this paper, we design and implement a simple, low-complexity protocol, called Variable-structure congestion Control Protocol (VCP), that leverages only the existing two ECN bits for network congestion feedback, and yet achieves comparable performance to XCP, i.e., high utilization, negligible packet loss rate, low persistent queue length, and reasonable fairness. On the downside, VCP converges significantly slower to a fair allocation than XCP. We evaluate the performance of VCP using extensive ns2 simulations over a wide range of network scenarios and find that it significantly outperforms many recently-proposed TCP variants, such as HSTCP, FAST, CUBIC, etc. To gain insight into the behavior of VCP, we analyze a simplified fluid model and prove its global stability for the case of a single bottleneck shared by synchronous flows with identical round-trip times.
KW - AQM
KW - Congestion control
KW - ECN
KW - Stability
KW - TCP
UR - http://www.scopus.com/inward/record.url?scp=57949088008&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=57949088008&partnerID=8YFLogxK
U2 - 10.1109/TNET.2007.912037
DO - 10.1109/TNET.2007.912037
M3 - Article
AN - SCOPUS:57949088008
SN - 1063-6692
VL - 16
SP - 1281
EP - 1294
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 6
ER -