A new family of interconnection networks of fixed degree three

Authors:
Shu-Ming Zhou;Wen-Jun Xiao
Affiliations:
Department of Mathematics, Xiamen University, Xiamen 361005, P.R. China;Department of Mathematics, Xiamen University, Xiamen 361005, P.R. China and College of Computer Science, South China University of Technology, Guangzhou 510641, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2004

Citing 7
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Cayley Graphs With Optimal Fault Tolerance

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
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new family of interconnection networks WGn is proposed, that is constant degree 3 Cayley graph, and is isomorphic to a Cayley graph of the wreath product Z2∫Sn when the generator set is chosen properly. Its different algebraic properties is investigated and a routing algorithm is given with the diameter upper bounded by 3n2 - 6n + 4. The embedding properties and the fault tolerance are devired. In conclusion, we present a comparison of some familiar networks with constant degree 3.