Abstract-Data center switches need to satisfy stringent lowdelay and high-capacity requirements. To do so, they rely on small switch buffers. However, in case of congestion, data center switches can incur 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, even though HCF can store packets of a same flow in different queues, we also prove that it prevents packet reordering.
Shpiner and Keslassy REF proposed a new architecture called Hashed Credits Fair (HCF) to avoid TCP throughput collapse in data centers.
A switch-based approach to throughput collapse and starvation in data centers
2010 IEEE 18th International Workshop on Quality of Service (IWQoS)
2010 IEEE 18th International Workshop on Quality of Service (IWQoS)
Computer Science