One more bit is enough

Yong Xia, Lakshminarayanan Subramanian, Ion Stoica, Shivkumar Kalyanaraman

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)1281-1294
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume16
Issue number6
DOIs
StatePublished - 2008

Fingerprint

Packet loss
Frequency allocation
Routers
Standardization
Feedback
Bandwidth
Fluids

Keywords

  • AQM
  • Congestion control
  • ECN
  • Stability
  • TCP

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

One more bit is enough. / Xia, Yong; Subramanian, Lakshminarayanan; Stoica, Ion; Kalyanaraman, Shivkumar.

In: IEEE/ACM Transactions on Networking, Vol. 16, No. 6, 2008, p. 1281-1294.

Research output: Contribution to journalArticle

Xia, Y, Subramanian, L, Stoica, I & Kalyanaraman, S 2008, 'One more bit is enough', IEEE/ACM Transactions on Networking, vol. 16, no. 6, pp. 1281-1294. https://doi.org/10.1109/TNET.2007.912037
Xia, Yong ; Subramanian, Lakshminarayanan ; Stoica, Ion ; Kalyanaraman, Shivkumar. / One more bit is enough. In: IEEE/ACM Transactions on Networking. 2008 ; Vol. 16, No. 6. pp. 1281-1294.
@article{d8e7b36421934ee38fa753e2433ce1e4,
title = "One more bit is enough",
abstract = "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.",
keywords = "AQM, Congestion control, ECN, Stability, TCP",
author = "Yong Xia and Lakshminarayanan Subramanian and Ion Stoica and Shivkumar Kalyanaraman",
year = "2008",
doi = "10.1109/TNET.2007.912037",
language = "English (US)",
volume = "16",
pages = "1281--1294",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - One more bit is enough

AU - Xia, Yong

AU - Subramanian, Lakshminarayanan

AU - Stoica, Ion

AU - Kalyanaraman, Shivkumar

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

VL - 16

SP - 1281

EP - 1294

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 6

ER -