Topological Properties of Hypercubes
IEEE Transactions on Computers
Analysis of interconnection networks based on Cayley graphs related to permutation groups
Analysis of interconnection networks based on Cayley graphs related to permutation groups
Trivalent Cayley graphs for interconnection networks
Information Processing Letters
Shortest routing in trivalent Cayley graph network
Information Processing Letters
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four
IEEE Transactions on Parallel and Distributed Systems
One-to-all broadcast algorithm for constant degree 4 Cayley graphs
Parallel Computing
| Hi-index | 0.00 |
In the past years, various network architectures for parallel computers have been proposed, for instance, hyper cubes or star graphs. These classes of networks are known as Cayley graphs. In recent years, there have been some proposals of new families of interconnection networks, namely, constant degree networks. In this paper, we propose a new interconnection network named extended star graphs, and we prove the extended star graphs have hypercube's structure. We also propose routing algorithms for node-to-node communication on extended star graphs. Based on the algorithms, we obtain an upper bound 2n - 1 on the diameter for the n-th order extended star graph.