QPS-ToR: A Parallel Iterative Switching Algorithm for Reconfigurable Optical Datacenter Switching

2026-09-08

AI Summary

本文针对可重构光数据中心网络的调度机制性能瓶颈问题，提出了一种基于滑动窗口算法QPS-ToR的新方法，提高了吞吐量和降低了流完成时间。

Abstract

Reconfigurable optical data center networks (RODCNs) have emerged as a promising solution for scaling DCN capacity, yet their scheduling mechanisms remain a performance bottleneck: traffic-oblivious schemes inherently limit throughput, while the state-of-the-art traffic-aware scheme, NegotiaToR, uses single-iteration iSLIP as its scheduling engine, which limits throughput to around 60% and treats all source-destination pairs with equal priority regardless of queue length. We propose QPS-ToR, which replaces NegotiaToR's scheduling logic with SW-QPS, a sliding-window algorithm originally proposed for crossbar scheduling that achieves around 90% throughput with a single low-complexity iteration. QPS-ToR operates within NegotiaToR's existing workflow, requiring only a revision of the scheduling cycle from three-step Request-Grant-Accept (RGA) to two-step Request-Grant (RG) with a sliding window mechanism. In flow-level simulations with 128 ToRs under realistic datacenter workloads, QPS-ToR achieves up to 36% higher throughput and 82% lower flow completion time (FCT) compared to NegotiaToR, and consistently outperforms RotorNet, a representative traffic-oblivious scheme, on the parallel network topology.

Problem

• Reconfigurable Optical Datacenter Networks
• Scheduling Mechanisms
• Throughput Limitation
• Traffic-Aware Schemes

Innovation

• QPS-ToR
• sliding-window algorithm
• Reconfigurable Optical Datacenter Networks (RODCNs)
• throughput improvement
• flow completion time (FCT)