| Summary: | 碩士 === 國立中正大學 === 資訊工程研究所 === 100 === 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 recursively analyze the cycle structure to create unidirectional path until that n<5 or the cycle structure only has pure cycles. Eventually，the unidirectional path between any two nodes in USn which length always no more than 2n. Obviously our scheme specifies a much shorter routing path than the routing algorithm proposed by Day and Tripathi, and these feasible routing paths are nearly optimal.
|
|---|
