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 ...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.展开更多
基金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.
