基于环状网络的Oblivious路由算法  

Oblivious routing algorithm based on rings network

作　　者：李旭瑞 段新明[1] LI Xu-rui;DUAN Xin-ming(School of Computer Science and Technology,Tianjin Polytechnic University,Tianjin 300387,China)

机构地区：[1]天津工业大学计算机科学与软件学院

出　　处：《计算机工程与设计》2019年第10期2752-2756,共5页Computer Engineering and Design

摘　　要：对最优Oblivious路由算法的研究中,由于在Torus拓扑结构中具有最优吞吐率,基于路径权重的选择对WRD路由算法进行优化并称作WRDth,使其在一维环状拓扑结构中沿最短和非最短方向都具有最佳流量分布,在不同的通讯模式下,拥有最佳吞吐率,保证最小平均跳数。通过理论推导与证明得到新的最坏情况下最优的吞吐率和最小跳步数,仿真实验结果表明,在平均情况下,该方法优于WRD算法7%。在不同的通讯模式下,当网络基数为4时,在Tornado模式下,该方法优于WRD算法10.3%。In the research of the optimal Oblivious routing algorithm,because of the optimal throughput in the Torus topology,the WRD routing algorithm was optimized based on the path weight selection and called WRDth,which made it have optimize distribution of traffic along the minimum and non-minimum directions,in different communication modes,the best throughput and the minimum average hop count were ensured.Through theoretical derivation and proof,the optimal worst-case throughput and minimum average hop count were obtained.Simulation results verify that,the performance of the proposed method is better than that of the WRD algorithm by 7% on average.In different traffic patterns,when the network base is 4 in Tornado mode,its performance is better than that of WRD algorithm by 10.3%.

关 键 词：环形拓扑 随机路由 路由算法 吞吐率 平均跳步数 

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