CDFS: A Centralized Dynamic Flow Scheduling Mechanism in Data Centers

Abstract

Abstract. This paper aims to present CDFS, a centralized, dynamic flow schedule mechanism to maximize network throughput and to minimize the conflict between elephant and mice flows. CDFS schedules elephant flows with a scalable "Max-min Weight" scheme, which is adaptive to the available bandwidth of links. Meanwhile, switches route mice flows with multipath routing method. Experiment results show that CDFS improves network throughput by 10% when mice flows dominate the network traffic, and reduces mice flow latency by at least 60% compared to the standard OpenFlow model.