We present an algorithm that constructs subnetworks from an n-dimensional crossed cube, denoted CQn, so that for any given κ, 2 ≤ κ ≤ n − 1, the algorithm can generate a κ-connected subnetwork that contains all 2n original nodes of CQn 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
If you can't find a tool you're looking for, please click the link at the top of the page to "Go to old article view". Alternatively, view our Knowledge Base articles for additional help. Your feedback is important to us, so please let us know if you have comments or ideas for improvement.