Joint Coflow Optimization for Data Center Networks

Data parallel applications in data centers generate, process, and store huge volumes of data. Coflow Completion time (CCT) is one of the major performance metrics to capture application-level semantics. This paper is the first one to study the joint consideration of task placement, coflow bandwidth scheduling, and path choice to minimize the average CCT in intra-data center. This paper proposes a joint online scheduling framework, which first develops a 2-approximation algorithm to reduce the CCT of a single coflow, and then follows the Shortest Remaining Time First (SRTF) principle to schedule multiple coflows. Extensive simulations based on practical trace demonstrate that the proposed framework has better performance than the state-of-the-art works.