Scale Congestion Control to Ultra-High Speed Ethernet

Authors: Wanchun Jiang, Fengyuan Ren, Xin Yue, Chuang Lin

Abstract: Currently, Ethernet is broadly used in LAN, datacenter and enterprise networks, storage networks, high performance computing networks and so on. Along with the popularity of Ethernet comes the requirement of enhancing Ethernet with congestion control. On the other hand, Ethernet speed extends to 40Gbps and 100Gbps recently, and even 400Gbps in the near future. The ultra-high speed requires congestion control algorithms to adapt to the broad changes of bandwidth, and highlights the impacts of small delay by enlarging the bandwidth delay product. The state-of-art standard QCN is heuristically designed for the 1Gbps and 10Gbps Ethernet, and unaware of the challenges accompanying the ultra-high speed. To scale congestion control to ultra-high speed Ethernet, we propose the Adaptive Sliding Mode (ASM) congestion control algorithm, which is simple, stable, has fast and smooth convergence process, can tolerate the impacts of delay and adapt to the wide changes of bandwidth. Real experiments and simulations confirm these good properties and show that ASM outperforms QCN. Designing ASM, we find that the derivative of queue length is helpful to rate adjustment because it reflects the difference between bandwidth and aggregated sending rate. We also argue for enforcing congestion control system staying at the congestion boundary line, along which it automatically slides to stable point. These insights are also valuable to develop other congestion control algorithms in ultra-high speed networks.

Submitted to arXiv on 06 May. 2014

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Beta

Look for similar papers (in beta version)

We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.