One more bit is enough

Yong Xia, Lakshminarayanan Subramanian, Ion Stoica, Shivkumar Kalyanaraman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing end-to-end congestion control (eg TCP) and traditional congestion notification schemes (eg TCP+AQM/ECN) have significant limitations in achieving this goal. While the recently proposed XCP protocol addresses this challenge, XCP 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, ie high utilization, low persistent queue length, negligible packet loss rate, 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. To gain insight into the behavior of VCP, we analyze a simple fluid model, and prove a global stability result for the case of a single bottleneck link shared by flows with identical round-trip times.

Original languageEnglish (US)
Title of host publicationComputer Communication Review
Pages37-48
Number of pages12
Volume35
Edition4
DOIs
StatePublished - Oct 2005

Fingerprint

Packet loss
Frequency allocation
Routers
Standardization
Feedback
Bandwidth
Fluids

Keywords

  • AQM
  • Congestion control
  • ECN
  • Protocol
  • TCP
  • XCP

ASJC Scopus subject areas

  • Information Systems

Cite this

Xia, Y., Subramanian, L., Stoica, I., & Kalyanaraman, S. (2005). One more bit is enough. In Computer Communication Review (4 ed., Vol. 35, pp. 37-48) https://doi.org/10.1145/1090191.1080098

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

Computer Communication Review. Vol. 35 4. ed. 2005. p. 37-48.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xia, Y, Subramanian, L, Stoica, I & Kalyanaraman, S 2005, One more bit is enough. in Computer Communication Review. 4 edn, vol. 35, pp. 37-48. https://doi.org/10.1145/1090191.1080098
Xia Y, Subramanian L, Stoica I, Kalyanaraman S. One more bit is enough. In Computer Communication Review. 4 ed. Vol. 35. 2005. p. 37-48 https://doi.org/10.1145/1090191.1080098
Xia, Yong ; Subramanian, Lakshminarayanan ; Stoica, Ion ; Kalyanaraman, Shivkumar. / One more bit is enough. Computer Communication Review. Vol. 35 4. ed. 2005. pp. 37-48
@inproceedings{1a21251c67094c02932ce92987400eb5,
title = "One more bit is enough",
abstract = "Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing end-to-end congestion control (eg TCP) and traditional congestion notification schemes (eg TCP+AQM/ECN) have significant limitations in achieving this goal. While the recently proposed XCP protocol addresses this challenge, XCP 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, ie high utilization, low persistent queue length, negligible packet loss rate, 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. To gain insight into the behavior of VCP, we analyze a simple fluid model, and prove a global stability result for the case of a single bottleneck link shared by flows with identical round-trip times.",
keywords = "AQM, Congestion control, ECN, Protocol, TCP, XCP",
author = "Yong Xia and Lakshminarayanan Subramanian and Ion Stoica and Shivkumar Kalyanaraman",
year = "2005",
month = "10",
doi = "10.1145/1090191.1080098",
language = "English (US)",
volume = "35",
pages = "37--48",
booktitle = "Computer Communication Review",
edition = "4",

}

TY - GEN

T1 - One more bit is enough

AU - Xia, Yong

AU - Subramanian, Lakshminarayanan

AU - Stoica, Ion

AU - Kalyanaraman, Shivkumar

PY - 2005/10

Y1 - 2005/10

N2 - Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing end-to-end congestion control (eg TCP) and traditional congestion notification schemes (eg TCP+AQM/ECN) have significant limitations in achieving this goal. While the recently proposed XCP protocol addresses this challenge, XCP 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, ie high utilization, low persistent queue length, negligible packet loss rate, 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. To gain insight into the behavior of VCP, we analyze a simple fluid model, and prove a global stability result for the case of a single bottleneck link shared by flows with identical round-trip times.

AB - Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing end-to-end congestion control (eg TCP) and traditional congestion notification schemes (eg TCP+AQM/ECN) have significant limitations in achieving this goal. While the recently proposed XCP protocol addresses this challenge, XCP 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, ie high utilization, low persistent queue length, negligible packet loss rate, 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. To gain insight into the behavior of VCP, we analyze a simple fluid model, and prove a global stability result for the case of a single bottleneck link shared by flows with identical round-trip times.

KW - AQM

KW - Congestion control

KW - ECN

KW - Protocol

KW - TCP

KW - XCP

UR - http://www.scopus.com/inward/record.url?scp=33846078890&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846078890&partnerID=8YFLogxK

U2 - 10.1145/1090191.1080098

DO - 10.1145/1090191.1080098

M3 - Conference contribution

AN - SCOPUS:33846078890

VL - 35

SP - 37

EP - 48

BT - Computer Communication Review

ER -