Optimal Partitioning of Traffic Demand for Coflow Scheduling in Hybrid Switches
File version
Accepted Manuscript (AM)
Author(s)
Shen, Hong
Tian, Hui
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
License
Abstract
In contemporary data center networks (DCNs), scheduling groups of parallel flows (coflows) has emerged as a critical task for improving application-level communication efficiency. Recently, research interest has shifted to hybrid-switched DCN architectures that integrate optical circuit switches (OCSs) and electrical packet switches (EPSs) to respectively manage both high-volume and low-volume traffic efficiently. To minimize the overall communication latency, it is essential to effectively coordinate coflows over hybrid network links. The complexity of this task, however, is substantially greater than that of scheduling on monolithic network links of either OCS or EPS. The complexity arises from allocating flows between OCS and EPS in a coordinated way, while considering both the reconfiguration delay of circuit switching in OCS and the bandwidth limitation of packet switching in EPS, and completing the transmission in the shortest time. The current solutions for scheduling coflows in hybrid-switched DCNs are primarily based on heuristics and lack formal performance guarantees. In this paper, we first establish a coflow scheduling framework for hybrid-switched DCNs, which can transform any given circuit schedule (denoted as SC) designed for pure OCS into a corresponding hybrid scheduling scheme SH. On this basis, we further present two approximation algorithms w.r.t SC under two primary reconfiguration models (i.e., all-stop model and not-all-stop model) of OCS to minimize the coflow completion time (CCT) in a hybrid-switched DCN. Theoretical analysis demonstrates that our algorithms can achieve the optimal traffic partitioning for hybrid switch environments w.r.t SC. Furthermore, we theoretically prove that the proposed algorithms can transform any SC for pure OCS with an approximation rate of λ into a corresponding coflow scheduling scheme SH tailored for hybrid switches with the approximation rate of λ+1. Extensive simulations utilizing Facebook data traces show that our algorithm performs well in minimizing the CCT compared to state-of-the-art schemes.
Journal Title
IEEE Transactions on Network and Service Management
Conference Title
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
This work is covered by copyright. You must assume that re-use is limited to personal use and that permission from the copyright owner must be obtained for all other uses. If the document is available under a specified licence, refer to the licence for details of permitted re-use. If you believe that this work infringes copyright please make a copyright takedown request using the form at https://www.griffith.edu.au/copyright-matters.
Item Access Status
Note
This publication has been entered in Griffith Research Online as an advance online version.
Access the data
Related item(s)
Subject
Persistent link to this record
Citation
Wang, X; Shen, H; Tian, H, Optimal Partitioning of Traffic Demand for Coflow Scheduling in Hybrid Switches, IEEE Transactions on Network and Service Management, 2025