Skip to content
Book Open access

Coflow Scheduling in Hybrid-Switched Data Center Networks under Not-All-Stop Reconfiguration

Sep 2026 · Proceedings of the International Conference on Parallel Processing · 0 citations · 14 references

TL;DR

This paper presents the first approximation algorithm with an \(\mathcal {O}(\tau _D)\) performance guarantee for single-coflow scheduling in an N × N hybrid-switched DCN under the not-all-stop setting, and extends to the multiple-coflow setting and proposes a heuristic algorithm that converts specific pure-EPS schedulers into a hybrid OCS-EPS scheduler.

Abstract

Scheduling parallel data flows (a coflow) across two computation stages of a job over data center networks (DCNs) is crucial to the completion of the job. To meet the growing demands of data-intensive applications, the hybrid-switched design combining an optical circuit switch (OCS) and an electrical packet switch (EPS) has emerged as a promising solution. The architecture enables high-throughput OCS transmission for large-volume traffic and utilizes EPS to handle small-volume residual demand. The key challenge is to minimize the coflow completion time (CCT) while accounting for the OCS reconfiguration delay and the EPS bandwidth constraint. Existing solutions are typically either heuristic or provide performance guarantees only under the all-stop (synchronous) reconfiguration setting, which requires pausing all circuits during any reconfiguration. This paper considers the more flexible and realistic setting of not-all-stop (asynchronous) reconfiguration, in which only affected ports are interrupted during reconfiguration. We present the first approximation algorithm with an \(\mathcal {O}(\tau _D)\) performance guarantee for single-coflow scheduling in an N × N hybrid-switched DCN under the not-all-stop setting, where τD ≤ N is the maximum number of nonzero entries in any row or column of the coflow demand matrix D. We then extend our study to the multiple-coflow setting and propose a heuristic algorithm that converts specific pure-EPS schedulers into a hybrid OCS-EPS scheduler. Experimental results on real-world Facebook data traces demonstrate the superiority of our coflow scheduling algorithms over state-of-the-art schemes, achieving shorter (total weighted) CCT.

Read PDF

Similar papers

2026

Embedded Reconfiguration of TSN: Dual Reconfiguration with Dropping and Reclaiming

The original challenge submission is extended with a formal algorithm description, a comprehensive experimental evaluation using Gurobi, and the priority-driven last-resort mechanism.

Álex Gracia, A. G. Torres-Macías, J. Segarra et al. · 0 citations
Open access 2026

5G-Aware Incremental Routing and Scheduling for Dynamic Time-Triggered Flow Admission in Time-Sensitive Networks

: Mobile edge services require deterministic communication across Time-Sensitive Networking (TSN) and 5G access, where the standardized integration architecture exposes the 5G System (5GS) to the TSN controller as a logical bridge. We study dynamic admission of time-triggered (TT) flows using reported 5GS bridge delay...

Zhi-Hao Liu, Yi Zhang, Wei Zhang et al. · 0 citations
Preprint Aug 2026

SbDN: Source-based TSN-Grade Deterministic Networking using Commodity Switches

SbDN is presented, a Multi-Agent Source-based architecture that achieves TSN-grade determinism using commodity Ethernet switches and provides two methods: Temporal Network Partitioning (TNP), which provides strict temporal isolation on pure FIFO switches, and Traffic Prioritization (TP), which leverages strict-priority...

Mohammadparsa Karimi, Majid Nabi, Andrew Nelson et al. · 0 citations
Book Open access May 2026

Revisiting Bruck: Phase-Efficient All-to-All Collective Communication in Reconfigurable Networks

ReTri, a bidirectional All-to-All schedule for ORNs based on the Trivance algorithm is presented, a bidirectional All-to-All schedule for ORNs based on the Trivance algorithm that improves completion time and improves reconfigurable Bruck by up to 2.1×.

Anton Juerss, Stefan Schmid · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.