| Summary: | 碩士 === 國立中正大學 === 資訊工程所 === 96 === In this paper, we propose a routing algorithm between any two nodes in the unidirectional star graph upon the specific cycle representation, called the feasible routing cycle structure (RCS), which is equivalently transformed from the cycle structure. We prove that the feasible routing path can accomplish the routing effectively in the unidirectional n-star graph USn, and also derive that the diameter is no more than 2n for n 5 in USn. We also show that our routing algorithm could be performed in time O(n2). The result shows a great improvement to the corresponding result of distributed routing algorithm (DRA) proposed by Day and Tripathi (the maximal routing distance is 5n-9 in USn. That is, the previous known bound for the diameter of USn is substantially improved and nearly optimal. Moreover, the upper bound of the maximal routing distance is the same as the calculated diameters for 5 n 12 in USn.
|
|---|
