ROUTING ALGORITHM FOR THE ROTATION-EXCHANGE NETWORK  

作　　者：ChenBaoxing XiaoWenjun 

机构地区：[1]DepartmentofComputerScience,ZhangzhouTeacher＇sCollege,Zhangzhou363000／／DeptofComputerScience,SouthChinaUniversityofTechnology,Guangzhou510641 [2]DepartmentofMathematics,XiamenUniversity Xiamen361005

出　　处：《Journal of Electronics(China)》2005年第3期255-260,共6页电子科学学刊（英文版）

基　　金：Supported by the Natural Science Foundation of Fujian Province(No.F0110012) and theScientific Research Foundation of Fujian Provincial Education Department(No.JA03142).

摘　　要：The paper proposes a new routing algorithm for the Rotation-Exchange (REn) network. The length of the path between any two nodes given by the algorithm is not more than (3/8)n2 + O(n), that is, the diameter of REn is not more than (3/8)n2 + O(n). This improves on a (1/2)n2 + O(n) routing algorithm proposed earlier.The paper proposes a new routing algorithm for the Rotation-Exchange (REn) network. The length of the path between any two nodes given by the algorithm is not more than (3/8)n2 + O(n), that is, the diameter of REn is not more than (3/8)n2 + O(n). This improves on a (1/2)n2 + O(n) routing algorithm proposed earlier.

关 键 词：Cayley graph Rotation-Exchange (REn) network Fixed degree ROUTING 

分 类 号：TN915.04[电子电信—通信与信息系统]