期刊文献+

数据中心网络光电交换架构下的流调度算法研究 被引量:4

Research on flow scheduling algorithm in optical-electrical switching fabrics for data center networks
下载PDF
导出
摘要 研究了基于多级Clos数据中心网络的光电交换架构下的流量调度算法,以减少数据传输时延,同时也保证无丢包。传统ADAPT调度算法能实现加速比最小化,但仍然有一些空闲时间槽,而造成带宽未被充分利用。为了解决该问题,在多级Clos网络中,提出了一个多跳路由和调度(Multi-Hop Routing and Scheduling,MHRS)算法,该算法可以在不增加加速比的同时充分利用空闲的带宽。与ADAPT算法类似,MHRS算法先将流量矩阵分解为商矩阵和余矩阵,然后实现两步调度,即将单跳作为第一步,将多跳作为第二步。第一步将余矩阵中的一些数据包调度到商矩阵所形成的配置矩阵的空闲时间槽中,而当这些数据包不能在第一步中被直接调度时,则采用第二步绕道的多跳调度过程传输数据包。仿真结果证明,在多级Clos网络中MHRS算法比ADAPT算法性能更好。 This paper studies the flow scheduling algorithm based on the optical-electrical switching fabric in the data center networks featured with multi-stage Clos to reduce the data transmission delay while causing no packet loss.The traditional ADAPT scheduling algorithm can minimize speedup,but there are still some idle time slots,resulting in the underutilization of bandwidth.In order to solve this problem,this paper proposes a Multi-Hop Routing and Scheduling(MHRS)algorithm,which can make full use of the idle bandwidth without increasing the speedup.Similar to the ADAPT algorithm,the MHRS first decomposes the traffic matrix into a quotient matrix and a residual matrix,and then implements two-step scheduling.The single hop is the first step and the multi-hop is the second step.In the first step,some packets in the residual matrix are scheduled to the idle time slot of the configuration matrix formed by the quotient matrix.When these data packets cannot be directly scheduled in the first step,a multi-hop scheduling process will be adopted by making a detour to transmit the data packets in the second step.The simulation results show that the MHRS algorithm performs better than the ADAPT algorithm in the multi-stage Clos networks.
作者 周忠华 彭智朝 赵志鹏 ZHOU Zhonghua;PENG Zhichao;ZHAO Zhipeng(Network Information Center,Guangdong University of Finance & Economics,Guangzhou 510320,China;School of Information,Hunan University of Humanities,Science and Technology,Loudi,Hunan 417000,China;School of Computer Science and Technology,Tianjin University,Tianjin 300350,China)
出处 《计算机工程与应用》 CSCD 北大核心 2018年第16期107-112,共6页 Computer Engineering and Applications
基金 广东省高校自然科学研究项目(No.2013KYCX0084)
关键词 数据中心网络(DCN) 光电交换架构 多跳路由和调度 data center network(DCN) optical-electrical switching fabric multi-hop routing and scheduling
  • 相关文献

参考文献5

二级参考文献105

  • 1刘建军,尹浩.多路径负载均衡性能仿真分析[J].小型微型计算机系统,2007,28(2):233-236. 被引量:2
  • 2[1]KAROL M,HLUCHYJ M,MORGAN S.Input versus output queuing on a space-division packet switch[J].IEEE Trans on Communications,987,12(35):1347-1356. 被引量:1
  • 3[2]ANDERSON T,OWICKI S,SAXES J,THACKER C.High speed switches scheduling for local area network[J].ACM Transactions on Computer Systems,1993,11(4):319-352. 被引量:1
  • 4[3]MEKKITTIKUI A,MCKEOWN N.A practical scheduling algorithm to achieve 100% throughout in input-queued switches[C]//IEEE INFOCOM'98.San Francisco,CA,1998:23-28. 被引量:1
  • 5[4]MCKEOWN N,IZZARD M,MEKKITTIKUL A,et al.The tiny-tera:a packet switches core[J].IEEE Micro Magazine,1997,17(1):26-33. 被引量:1
  • 6[5]Cisco Inc.Cisco 12000 series-Internet Router.Product Overview[EB/OL].[2001-10-10].http://www.Cisco.com. 被引量:1
  • 7[6]MCKEOWN N.The iSLIP scheduling algorithm for input-queued switches[J].IEEE/ACM Transactions on Networking,1999,7(2):188-201. 被引量:1
  • 8[7]MCKEOWN N.A fast switched backplane for a Gigabit switched router[J].Business Communications Review,1997,27(12):1-30. 被引量:1
  • 9[8]HOPCROFT J E,KARP R M.An O(n5/2) algorithm for maximum matching in bipartite graphs[J].Society for Industrial and Applied Mathematics Comput,1973(1):225-231. 被引量:1
  • 10[9]MCKEOWN N,MEKKITTIKUI A,ANANTHARAM V,WALRAND J.Achieving 100% throughput in an input-queued switch[J].IEEE Transaction Communication,1999,47(8):1260-1267. 被引量:1

共引文献69

同被引文献27

引证文献4

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部