QPS-ToR：一种用于可重构光数据中心交换的并行迭代交换算法

中文摘要 AI 辅助

可重构光数据中心网络（RODCNs）已成为扩展数据中心网络（DCN）容量的有前景的解决方案，然而其调度机制仍然是性能瓶颈：流量无关的方案本质上限制了吞吐量，而最先进的流量感知方案NegotiaToR使用单次迭代的iSLIP作为其调度引擎，这将其吞吐量限制在约60%，并且无论队列长度如何，对所有源-目的节点对都给予同等优先级。我们提出了QPS-ToR，它用SW-QPS替换了NegotiaToR的调度逻辑，SW-QPS是一种最初为交叉开关调度提出的滑动窗口算法，通过单次低复杂度迭代即可实现约90%的吞吐量。QPS-ToR在NegotiaToR现有工作流程内运行，仅需将调度周期从三步的请求-授权-接受（RGA）修改为带滑动窗口机制的两步请求-授权（RG）。在128个ToR且采用真实数据中心工作负载的流级模拟中，与NegotiaToR相比，QPS-ToR实现了高达36%的吞吐量提升和82%的流完成时间（FCT）降低，并且在并行网络拓扑上始终优于具有代表性的流量无关方案RotorNet。

英文摘要

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.

发表机构

• Georgia Tech（佐治亚理工学院）

机构由 AI 辅助整理，请以论文原文为准。