Reconciling mice and elephants in data center networks
- 1 October 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 119-124
Abstract
Small switch buffers, high-speed links, short round-trip times and the composite nature of the traffic in data center networks (DCN) lead to several congestion problems that are not handled well by traditional congestion control mechanisms such as TCP. In this paper we design a simple switch-driven, flow-aware, congestion control algorithm to deal with such congestion issues. The basic idea of the proposed mechanism is reminiscent of classic congestion control in flow-aware networks such as ATM-ABR, where the switch sets a field in packet headers to enforce the sending rate at the source; less classic though are the challenges faced in designing such flow-awareness in the flow-aversive IP environment without modifying the TCP sender and receiver algorithm, to enable deployment in public data centers. We discuss in this paper our algorithm and give numerical results from NS-2 simulations to show its effectiveness in achieving high throughput overall, a good fairness and short flow completion times for delay-sensitive flows1.Keywords
This publication has 5 references indexed in Scilit:
- ICTCP: Incast Congestion Control for TCP in Data-Center NetworksIEEE/ACM Transactions on Networking, 2012
- Data center TCP (DCTCP)2010
- Understanding TCP incast throughput collapse in datacenter networks2009
- Safe and effective fine-grained TCP retransmissions for datacenter communication2009
- Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to REDACM SIGCOMM Computer Communication Review, 2000