A new family of interconnection networks of odd fixed degrees

Zhou, Shuming; Du, Nan; Chen, Baoxing

doi:10.1016/j.jpdc.2005.06.002

Cited by 7 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, many interconnection networks and their properties have been studied in the literature [2,4,[9][10][11][12][13][14][15][16][19][20][21][22][23][24][25]29].…”

Section: Introductionmentioning

confidence: 99%

Embedding meshes into crossed cubes

Fan

Jia

2007

Information Sciences

View full text Add to dashboard Cite

“…Recently, many interconnection networks and their properties have been studied in the literature [2,4,[9][10][11][12][13][14][15][16][19][20][21][22][23][24][25]29].…”

Section: Introductionmentioning

confidence: 99%

Embedding meshes into crossed cubes

Fan

Jia

2007

Information Sciences

View full text Add to dashboard Cite

“…The design and analysis of interconnection networks plays an important role in parallel computing, cloud computing, VLSI, etc. In the literature, many network structures have been proposed and studied [2,6,7,17,25,28,33,34] for different purposes. Various factors need to be considered in order to achieve high performance and low construction costs of an interconnection network.…”

Section: Introductionmentioning

confidence: 99%

Recursive cubes of rings as models for interconnection networks

Mokhtar

Zhou

2017

Discrete Applied Mathematics

View full text Add to dashboard Cite

We study recursive cubes of rings as models for interconnection networks. We first redefine each of them as a Cayley graph on the semidirect product of an elementary abelian group by a cyclic group in order to facilitate the study of them by using algebraic tools. We give an algorithm for computing shortest paths and the distance between any two vertices in recursive cubes of rings, and obtain the exact value of their diameters. We obtain sharp bounds on the Wiener index, vertex-forwarding index, edge-forwarding index and bisection width of recursive cubes of rings. The cube-connected cycles and cube-of-rings are special recursive cubes of rings, and hence all results obtained in the paper apply to these well-known networks.

show abstract

“…The shortest path routing and embedding of a Hamiltonian cycle, meshes, and hypercubes are also discussed in [10]. New classes of interconnection networks with odd fix degrees are also developed in [7,22]. Hsieh and Hsiao develop a new family Cayley graph G k,n with k-degree, which possess a useful property in that the degree of each vertex is fixed by a general positive integer k without regard to the number of vertices [12].…”

mentioning

confidence: 99%

A new family of Cayley graph interconnection networks based on wreath product and its topological properties

Zhang

Xiao

2011

Cluster Comput

View full text Add to dashboard Cite

This paper introduces a new type of Cayley graphs for building large-scale interconnection networks, namely WG 2m n , whose vertex degree is m + 3 when n ≥ 3 and is m + 2 when n = 2. A routing algorithm for the proposed graph is also presented, and the upper bound of the diameter is deduced as 5n/2 . Moreover, the embedding properties and maximal fault tolerance are also analyzed. Finally, we compare the proposed networks with some other similar network topologies. It is found that WG 2m n is superior to other interconnection networks because it helps to construct large-scale networks with lower cost.

show abstract

A new family of interconnection networks of odd fixed degrees

Cited by 7 publications

References 11 publications

Embedding meshes into crossed cubes

Embedding meshes into crossed cubes

Recursive cubes of rings as models for interconnection networks

A new family of Cayley graph interconnection networks based on wreath product and its topological properties

Contact Info

Product

Resources

About