### Abstract

We present an algorithm that constructs subnetworks from an n-dimensional crossed cube, denoted CQ _{n}, so that for any given κ, 2 ≤ κ ≤ n - 1, the algorithm can generate a κ-connected subnetwork that contains all 2 ^{n} original nodes of CQ _{n} and preserves the symmetrical structure. The κ-connected subnetworks constructed are all optimal in the sense that they use the minimum number of links to maintain the required connectivity. Being able to construct κ-connected, all-node subnetworks are important in many applications, such as computing in the presence of faulty links, or diagnosing the system with a lower fault bound. Links that are not used by the induced subnetworks could be used in parallel by some other computing tasks, improving the overall resource utilization of the system.

Original language | English |
---|---|

Pages (from-to) | 86-93 |

Number of pages | 8 |

Journal | Networks |

Volume | 60 |

Issue number | 2 |

DOIs | |

State | Published - 1 Sep 2012 |

### Keywords

- connectivity
- crossed cube
- induced subgraph
- interconnection architectures
- network topology

### Cite this

}

*Networks*, vol. 60, no. 2, pp. 86-93. https://doi.org/10.1002/net.20462

**Constructing optimal subnetworks for the crossed cube network.** / Wang, Dajin.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Constructing optimal subnetworks for the crossed cube network

AU - Wang, Dajin

PY - 2012/9/1

Y1 - 2012/9/1

N2 - We present an algorithm that constructs subnetworks from an n-dimensional crossed cube, denoted CQ n, so that for any given κ, 2 ≤ κ ≤ n - 1, the algorithm can generate a κ-connected subnetwork that contains all 2 n original nodes of CQ n and preserves the symmetrical structure. The κ-connected subnetworks constructed are all optimal in the sense that they use the minimum number of links to maintain the required connectivity. Being able to construct κ-connected, all-node subnetworks are important in many applications, such as computing in the presence of faulty links, or diagnosing the system with a lower fault bound. Links that are not used by the induced subnetworks could be used in parallel by some other computing tasks, improving the overall resource utilization of the system.

AB - We present an algorithm that constructs subnetworks from an n-dimensional crossed cube, denoted CQ n, so that for any given κ, 2 ≤ κ ≤ n - 1, the algorithm can generate a κ-connected subnetwork that contains all 2 n original nodes of CQ n and preserves the symmetrical structure. The κ-connected subnetworks constructed are all optimal in the sense that they use the minimum number of links to maintain the required connectivity. Being able to construct κ-connected, all-node subnetworks are important in many applications, such as computing in the presence of faulty links, or diagnosing the system with a lower fault bound. Links that are not used by the induced subnetworks could be used in parallel by some other computing tasks, improving the overall resource utilization of the system.

KW - connectivity

KW - crossed cube

KW - induced subgraph

KW - interconnection architectures

KW - network topology

UR - http://www.scopus.com/inward/record.url?scp=84864754540&partnerID=8YFLogxK

U2 - 10.1002/net.20462

DO - 10.1002/net.20462

M3 - Article

AN - SCOPUS:84864754540

VL - 60

SP - 86

EP - 93

JO - Networks

JF - Networks

SN - 0028-3045

IS - 2

ER -