作者: Shuming Zhou , Ni Du , Baoxing Chen
DOI: 10.1016/J.JPDC.2005.06.002
关键词:
摘要: We propose a new family of interconnection networks WG"n^m that are Cayley graphs with fixed degrees any odd number greater than or equal to three. When the generator set is chosen properly, they isomorphic wreath product Z"[email protected]?S"n. In case m>=3 and n>=3, we investigate their different algebraic properties give routing algorithm diameter upper bounded by 98n^2-14n+2. Some embedding also derived. Finally, compare proposed some popular topologies.