|国家预印本平台
首页|基于Clos架构数据中心网络中多跳路由和调度算法研究

基于Clos架构数据中心网络中多跳路由和调度算法研究

Research on Multi-Hop Routing and Scheduling algorithm in Clos networks for DCNs

中文摘要英文摘要

本文研究了基于多级Clos数据中心网络的光电交换架构下的流量调度算法,以减少数据传输时延,并同时也保证100%的吞吐量。传统ADAPT调度算法能实现加速比最小化,但仍然有一些空闲时间槽,而造成带宽未被充分利用。为了解决此问题,本研究在多级Clos网络中,提出了一个多跳路由和调度算法,该算法可以在不增加加速比的同时充分利用空闲的带宽。和ADAPT算法类似,MHRS先将流量矩阵分解为商矩阵和余矩阵,然后实现两步调度,即将单跳作为第一步,而将多跳作为第二步。第一步将余矩阵中的一些数据包调度到商矩阵所形成的配置矩阵的空闲时间槽中,而当这些数据包不能在第一步中被直接调度时,则采用第二步绕道的多跳调度过程传输数据包。仿真结果证明在多级Clos网络中MHRS算法比ADAPT算法性能更好。

he traffic scheduling in optical-electrical switching fabrics was studied in Data Center Networks (DCNs) based on multi-stage Clos networks to minimize data transmission delay and ensure 100% throughput. The existing classical ADAPT scheduling algorithm can minimize the speedup (the radio of the internal transmission rate inside the optical switch to the external line-rate), but still has some idle time-slots (i.e., not-yet-utilized slots),especially for uneven traffic distribution. So a Multi-Hop Routing and Scheduling (MHRS) algorithm by utilizing idle bandwidths without increasing the speedup in multi-stage Clos networks for DCNs was proposed. MHRS divides traffic matrix into quotient and residual matrices. And it includes two steps: single scheduling in Clos-hop scheduling as the first and multi-hop scheduling as the second. The first step is to schedule packets in the residual matrix to the idle time-slots of configuration matrices generated from the quotient matrix. When those packets cannot be directly scheduled in the first step, the second step will invoke a multi-hop scheduling process by making a detour for transmission. Simulation results confirm that MHRS can achieve a better performance in multi-stage Clos networks as compared with ADAPT.

张水波、赵志鹏、胡振宇

光电子技术通信计算技术、计算机技术

数据中心网络los 架构多跳路由和调度

data center networksClos networksmulti-hop routing and scheduling

张水波,赵志鹏,胡振宇.基于Clos架构数据中心网络中多跳路由和调度算法研究[EB/OL].(2017-09-30)[2025-08-18].http://www.paper.edu.cn/releasepaper/content/201709-129.点此复制

评论