Routing in the Unidirectional Star Graph

• Main Authors: Min-You Cheng, 鄭民侑
• Other Authors: Wei-Kuo Chiang
• Format: Others
• Language: en_US
• Online Access: http://ndltd.ncl.edu.tw/handle/68813435835731674640

碩士 === 國立中正大學 === 資訊工程所 === 94 === The star graph has been recognized as an attractive alternative to the hypercube. It possesses many attractive topological properties, such as recursive structure, symmetry, maximal fault tolerance and a simple routing algorithm. In addition, the unidirectional star graph also supports high speed networking and high performance distributed computing. Motivated by the investigations on the unidirectional interconnection networks, this paper improves the previous result on routing in USn. In this paper, we equivalently transform the cycle structure into a specific cycle representation, the Routing cycle structure, and develop a scheme to specify the feasible routing paths upon the Routing cycle structure. The feasible routing paths accomplish the routing effectively in USn, and we conclud that the length of any feasible routing path is no more than [5(n-1)/2]+4. Obviously our scheme specifies a much shorter routing path than the routing algorithm proposed by Day and Tripathi (the maximal routing distance is 5n-9 in USn), and these feasible routing paths are nearly optimal.