A New Family of Interconnection Networks of Fixed Degree Three

A new family of interconnection networks WG_n is proposed, that is constantdegree 3 Cayley graph, and is isomorphic to a Cayley graph of the wreath product Z_2\S_n when thegenerator set is chosen properly. Its different algebraic properties is investigated and a routingalgorithm is given with the diameter upper bounded by 3n^2 - 6n + 4. The embedding properties andthe fault tolerance are devired. In conclusion, we present a comparison of some familiar networkswith constant degree 3.

一类新的固定度为3的互联网络

在构造网络时，通常考虑处理器有固定数目接口的网络模型，即固定度网络。正因为Cayley图有较好的正则性和对称性，才具有更为广泛的实用性。本文提出了一类新的固定度为3的正则互联网络WGn。它同构于循环群Z2和对称群Sn的圈积的Cayley图。