使用多级交换网络进行高性能路由器设计  

Using Multi-Stage Switch Fabric in High Performance Router Design

作　　者：管剑波[1] 孙志刚[1] 卢锡城[1] 

机构地区：[1]国防科学技术大学计算机学院,长沙410073

出　　处：《计算机研究与发展》2005年第6期965-970,共6页Journal of Computer Research and Development

基　　金：国家"九七三"重点基础研究发展规划基金项目(2003CB314800);国家自然科学基金项目(90104001)

摘　　要：拓扑结构和路由算法是影响多级交换网络性能的重要因素.在比较多种多级互连拓扑属性的基础上,提出将3DTorus结构应用于大规模交换网络设计.然后针对3DTorus交换网络中报文路由面临的两个关键问题:多路径负载均衡和报文保序,提出一种基于维序的多路径路由算法DMR(dimensionorderbasedmultipathrouting).该算法可在保证报文顺序的同时在多条路径上平衡负载,提高交换网络吞吐率.最后通过模拟验证了算法的性能,并与维序路由和随机路由算法进行了比较.模拟结果表明,DMR算法的性能优于维序路由算法,能够达到随机路由算法性能水平,同时具有随机路由算法所不具备的报文保序特性.Traditional single-stage switch architectures cannot scale up well, so multi-stage architectures are widely considered in large scale switching fabric designs. Topology and packet routing style of multi-stage switching fabrics influence the performance heavily. Based on the comparison of several popular k-ary n-cube structures used in MPP systems it is argued that the 3D Torus network is most suitable for implementing large switching fabrics. Then a novel routing algorithm DMR is proposed. It can achieve high throughput and high availability by balancing traffic loads on multiple paths while at the same time it can maintain packets order in one flow. The performance of DMR routing algorithm is studied using a simulation approach and is compared with two other routing algorithms, the e-cube routing and the random routing. The results show that the performance of the DMR algorithm is almost the same as that of the random routing and much better than the e-cube routing. At the same time the DMR algorithm can maintain the packets order in one flow while the random routing cannot.

关 键 词：多级交换网络 3D TORUS 路由算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]