An efficient priority-driven congestion control algorithm for data center networks

Abstract

With the emerging diverse applications in data centers, the demands on quality of service in data centers also become diverse, such as high throughput of elephant flows and low latency of deadline-sensitive flows. However, traditional TCPs are ill-suited to such situations and always result in the inefficiency (e.g. missing the flow deadline, inevitable throughput collapse) of data transfers. This further degrades the user-perceived quality of service (QoS) in data centers. To reduce the flow completion time of mice and deadline-sensitive flows along with promoting the throughput of elephant flows, an efficient and deadline-aware priority-driven congestion control (PCC) protocol, which grants mice and deadline-sensitive flows the highest priority, is proposed in this paper. Specifically, PCC computes the priority of different flows according to the size of transmitted data, the remaining data volume, and the flows' deadline. Then PCC adjusts the congestion window according to the flow priority and the degree of network congestion. Furthermore, switches in data centers control the input/output of packets based on the flow priority and the queue length. Different from existing TCPs, to speed up the data transfers of mice and deadline-sensitive flows, PCC provides an effective method to compute and encode the flow priority explicitly. According to the flow priority, switches can manage packets efficiently and ensure the data transfers of high priority flows through a weighted priority scheduling with minor modification. The experimental results prove that PCC can improve the data transfer performance of mice and deadline-sensitive flows while guaranting the throughput of elephant flows.