Premium
Constructing optimal subnetworks for the crossed cube network
Author(s) -
Wang Dajin
Publication year - 2012
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20462
Subject(s) - subnetwork , computer science , construct (python library) , cube (algebra) , node (physics) , theoretical computer science , connected component , strongly connected component , algorithm , topology (electrical circuits) , distributed computing , mathematics , combinatorics , computer network , artificial intelligence , structural engineering , engineering
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. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012