面向双活数据中心的多跳路由和调度算法研究

Research on multi-hop routing and scheduling algorithm for dual live data centers

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

In this paper,a traffic scheduling algorithm based on multi-level dual live data center network is proposed to reduce the data transmission delay and ensure the throughput of 100%. The traditional ADAPT scheduling algorithm can achieve the speedup minimization,but there are still some idle slots,which makes the bandwidth not fully utilized. In order to solve this problem,a multi-hop routing and scheduling algorithm is proposed for multi-level dual active networks. The algorithm can make full use of idle bandwidth without increasing speedup. Similar to the ADAPT algorithm,MHRS first decomposes the traffic matrix into quotient matrix and residual matrix,and then implements the two step scheduling. The single hop is taken as the first step,and the multi-hop is taken as the second step. The first step is more than idle time slot allocation matrix data in packet scheduling to the quotient matrix of the formed,and when these packets cannot be scheduled directly in the first step,using multi-hop data transmission scheduling process of second step bypass package. The simulation results show that the MHRS algorithm performs better than the ADAPT algorithm in the multistage double live network.