星图互联网络上的并行路径算法  

The Parallel Routing Algorithm in Star Networks

作　　者：王静[1] 郭大昌[1] 曾国林[2] 

机构地区：[1]广东工业大学应用数学学院,广东广州510006 [2]广东工业大学计算机学院,广东广州510006

出　　处：《计算机技术与发展》2011年第9期118-120,224,共4页Computer Technology and Development

基　　金：广东省自然科学基金(07001802)

摘　　要：为了提高星图互联网络中任意两个结点之间传输大量数据信息的效率以及当星图网络中出现结点故障或链路故障的情况下保证数据信息的正常传输,从群论的角度出发,重点采用循环置换的相关性质,给出了一种新的寻找星图互联网络中任意两点之间的所有并行路径的方法。由于在寻找的过程中,该方法将条件细化成不同的情况讨论,从而保证了在每种情况下给出的所有并行路径的长度构成的集合的上界都是最短的,同时也保证了该算法的有效性和最优性。In order to improve the transmission efficiency of large amounts of data information and ensure the normal transmission of data information in case of node failure or link failure between arbitrarily two distinct nodes in the star networks,a new method was given for finding parallel routings between any two distinct nodes in the star networks from the perspective of group theory,and focus on the relevant properties of cycle permutation.Because when finding the routings,the method discusses the problem under different conditions,thus ensuring the upper bound of the set for the length of all parallel routings is the shortest in all conditions,and also ensuring the algorithm is effective and optimal.

关 键 词：星图互联网络 并行路径 长度 上界 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]