A switch-based approach to throughput collapse and starvation in data centers

  • Authors:

  • Alexander Shpiner;Isaac Keslassy;Gabi Bracha;Eyal Dagan;Ofer Iny;Eyal Soha

  • Affiliations:

  • Department of Electrical Engineering, Technion - Israel Institute of Technology, Haifa 32000, Israel;Department of Electrical Engineering, Technion - Israel Institute of Technology, Haifa 32000, Israel;Broadcom, Yakum 60972, Israel;Broadcom, Yakum 60972, Israel;Broadcom, Yakum 60972, Israel;Broadcom, Yakum 60972, Israel

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data center switches need to satisfy stringent low-delay and high-capacity requirements. To do so, they rely on small switch buffers. However, in case of congestion, data center switches may suffer from throughput collapse for short TCP flows as well as temporary starvation for long TCP flows. In this paper, we introduce a lightweight hash-based algorithm called HCF (Hashed Credits Fair) to solve these problems at the switch level while being transparent to the end users. We show that it can be readily implemented in data center switches with O(1) complexity and negligible overhead. We illustrate using simulations how HCF mitigates the throughput collapse of short flows. We also show how HCF reduces unfairness and starvation for long-lived TCP flows as well as for short TCP flows, yet maximizes the utilization on the congested link. Last, HCF also prevents packet reordering.