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 differe...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.展开更多
文摘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.
