期刊文献+

Clos交换结构的基于相异代表组的路由控制算法

A Routing Control Algorithm Based on SDR for Unbuffered Clos-network Switches
下载PDF
导出
摘要 Clos交换结构作为多级结构的典型代表在以大数据、数据中心网络为特征的云计算时代再次受到业界的关注,但目前应用于Clos交换结构的分组控制算法(或调度算法)却较难以适应大数据及数据中心网络的低延迟,低能耗等的性能需求。因此,根据Clos交换结构中分组调度的本质,利用相异代表组(SDR)基本思想为每个分组分配不同中间级交换模块,从而实现无阻塞交换,同时以示例和理论上证明了该算法的可行性及算法实现。由于该控制算法有效避免了大量的仲裁信息,因此能有效降低交换延迟,提高交换吞吐率。 The Clos-network switch,as a typical representative of multi-stage switching architectures,is gaining con-siderable research interest and momentum again both from academia and industry in cloud-computing era with the characteristics of big data and data center networks. However, most existing control algorithms ( or scheduling algo-rithms )applied to Clos-switches cannot well satisfy the performance requirements of low latency and low power con-sumption in big data and data center networks. Therefore, according to the scheduling process of packets in Clos- switches ,a control algorithm based on system distinct representative (SDR) is proposed in this paper to dispatch deferent central switching module (CM) for each arrived packet so as to realize non-broking switching. Moreover, the theoretical proof and an example are provided on the validity of the proposed control algorithm. Since the control algorithm does not need to exchange much arbitration information, it can effectively reduce the switching delay and improve the throughput.
作者 刘晓锋
出处 《西华师范大学学报(自然科学版)》 2016年第3期354-360,共7页 Journal of China West Normal University(Natural Sciences)
基金 西华师范大学博士启动基金项目(15E013,11B026) 四川省教育厅重点项目(16ZA0174)
关键词 分组交换 相异代表组 CLOS网络 控制算法 packet switching system distinct representative (SDR) Clos-network control algorithm
  • 相关文献

参考文献12

  • 1CLOS C. A study of non-blocking switching networks [J]. Bell systems technical journal, 1953 ,32(3) : 406-424.
  • 2BENWS V E. On rearrangeable three-stage connecting networks[J] . Bell Systems Technical Journal, 1962 ,41 ( 5) : 1481-1492.
  • 3刘晓锋,吴亚娟.Clos交换网络的一种基于矩阵分解的路由指派算法[J].西华师范大学学报(自然科学版),2015,36(4):404-410. 被引量:1
  • 4HOPCROFT J E, KARP R M. An n5/2 algorithm for maximum matching in bipartite graph [J] . SIAM Journal on Computing,1973,2(4) :225-231.
  • 5MCKEOWN N,MEKKITTIKUL A,ANANTHARAM V,et al. Achieving 100% throughput in an input-queued sw itch[J], IEEETransactions on Communications , 1999 ,47 ( 8 ) : 1260-1267.
  • 6OKI E , JING Z G,CESSA-R R,et al. Concurrent round-robin-based dispatching schemes for Clos-network switches[J]. IEEE/ACM Transactions On Networking,2002,10(6) :830-844.
  • 7ANDERSON T E , OWICKI S S , SAXE J B , et al. High-speed switch scheduling for local - area networks [J] . ACM Transactionson Computer Systems, 1993,11 (4) :319-352.
  • 8MCKEOWN N. The iSLIP scheduling algorithm for input-queued switches[J]. IEEE/ACM Transactions on Networking, 1999 ,7(2) :188-201.
  • 9BCHAO H J,JING Z G,LIEW S Y. Matching algorithms for three-stage bufferless Clos network switches[J]. IEEE CommunicationsMagazine ,2003 ,41 (10) :46-54.
  • 10PUN K,HAMDI M. Distro: a distributed static round-robin scheduling algorithm for bufferless Clos-network switches [C] / /Proc. of IEEE Globecom,Taipei :2002,3 :2298-2302.

二级参考文献16

  • 1CLOS C. A Study of Non-blocking Switching Networks[J],Bell Systems Technical Journal, 1953 , 32(2) ; 406 - 424.
  • 2LIU Y, MUPPALA J K, VEERARAGHAVAN M,et al. Data Center Networks - topologies,Architectures and Fault-toleranceCharacteristics[ M]. New York: Springer, 2013 : 1 - 5.
  • 3AL-FARES M,LOUKISSAS A, VAHDAT A. A Scalable, Commodity Data Center Network Architecture [ C]//Proc. of theACM SIGCOMM, Seattle, USA, 2008: 63 -74.
  • 4GREENBEG A, HAMILTON J R,JAIN N,et al. VL2 : A Scalable and FlexibleData Center Network[J]. Communications ofThe ACM,2011,54(3) ; 95 - 104.
  • 5CHANG C S, LEE D S. Principles, Architectures and Mathematical Theory of High Performance Packet Switches[ M] . NationalTsinghua University Press,Taiwan,2008 :3 -4.
  • 6BENES V E. On rearrangeable three-stage Connecting Networking: J]. Bell Systems Technical Journal, 1962 , 41(5) : 1481 -1492.
  • 7HOOPCROFT J E, KARP R M. An ns/: Algorithm for Maximum Matching in Bipartite Graph[ J]. SIAM Journal on Computing, 1973, 2(4) :225 -231.
  • 8LEE H Y,HWANG F K,CARPINELI J D. A New Decomposition Algorithms for Rearrangeable Clos Interconnection Networks[J]. IEEE Transactions on Communications, 1996 , 44(11) : 1572 - 1578.
  • 9JAJSZCZYK A. A Simple Algorithm for the Control of Rearrangeable Switching Network[J]. IEEE Transactions on Communica-tions ,1985,COM -33(2) :169 -171.
  • 10CARDOT C. Comments on “A Simple Algorithm for the Control of Rearrangeable Switching Networks” [J]. IEEE Transactionson Communications, 1986 , COM -34(4) :395.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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