A new family of interconnection networks of odd fixed degrees

Authors:
Shuming Zhou;Ni Du;Baoxing Chen
Affiliations:
College of Mathematics and Computer Science, Fujian Normal University, Fuzhou, Fujian, 350007, China and School of Mathematics Science, Xiamen University, Xiamen, Fujian, 361005, China;School of Mathematics Science, Xiamen University, Xiamen, Fujian, 361005, China;Department of Computer Science, Zhangzhou Teachers' College, Zhangzhou, Fujian, 363000, China
Venue:
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
Year:
2006

Citing 10
Cited 2

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
On some properties and algorithms for the star and pancake interconnection networks

Journal of Parallel and Distributed Computing
Folded Petersen Cube Networks: New Competitors for the Hypercubes

IEEE Transactions on Parallel and Distributed Systems
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four

IEEE Transactions on Parallel and Distributed Systems
Sep: A Fixed Degree Regular Network for MassivelyParallel Systems

The Journal of Supercomputing
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees

IEEE Transactions on Parallel and Distributed Systems
Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm

IEEE Transactions on Parallel and Distributed Systems
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Cyclic-cubes and wrap-around butterflies

Information Processing Letters
Generalized Hypercube and Hyperbus Structures for a Computer Network

IEEE Transactions on Computers

Embedding meshes into crossed cubes

Information Sciences: an International Journal
Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new family of interconnection networks WG"n^m that are Cayley graphs with fixed degrees of any odd number greater than or equal to three. When the generator set is chosen properly, they are isomorphic to Cayley graphs of the wreath product Z"m@?S"n. In the case of m=3 and n=3, we investigate their different algebraic properties and give a routing algorithm with the diameter upper bounded by 98n^2-14n+2. Some embedding properties are also derived. Finally, we compare the proposed networks with some popular topologies.