| Summary: | 博士 === 國立臺灣科技大學 === 資訊管理系 === 91 === This dissertation presents a new interconnection network called bi-rotator graph. The traditional rotator graph has many unidirectional edges, which sometimes will cause disadvantages. Our bi-rotator graph is constructed by making edges of the rotator graph bidirectional. The main benefits of these bidirectional edges are reducing the average routing distance and increasing the flexibility of applications applied on the graph. This dissertation will compare the bi-rotator graphs with rotator graph in the item of average routing length. We will also show that bi-rotator graphs have better embedding capability than rotator graphs. In this dissertation, we illustrate how to construct the bi-rotator graph and show the topological properties. We also present node-to-node routing algorithms, which provide two pair of routing paths from one node to another, and each pair of these paths are edge disjoint. In addition, the algorithms of finding Hamiltonian cycle are provided. We give a simple function to construct the Hamiltonian cycle for a bi-rotator graph. By using the bi-directional edges, we can provide dilation one algorithms for embedding any scale of cycle into a bi-rotator graph. Moreover, we prove that the bi-rotator graph has the property of Hamiltonian connected. In order to provide reliable transmission, the one-to-one and one-to-many parallel paths in the bi-rotator are proposed in this dissertation, where the parallel paths are proved to be node disjoint.
|
|---|
