The Conditional Node Connectivity Of The k-Ary n-Cube
The Conditional Node Connectivity Of The k-Ary n-Cube
复制标题
DOI：
10.1142/s0219265904001003
复制
发表时间：
2004-03
期刊：
影响因子：
--
通讯作者：
K. Day
中科院分区：
文献类型：
--
作者：
K. Day
本文导出了禁止故障集条件下（即假设每个非故障处理器至少有一个非故障邻居）k-ary n-cube互连网络的条件节点连通性。结果表明，在此条件下，当k≥4且n≥2时，连通性为2n的k-ary n-cube最多可以容忍4n-3个故障节点而不断开。因此，在这种情况下，条件节点连接是4n-2。当k=3且n≥2时，建立的条件节点连通性为4n-3。剩下的较小的k和n值的结果也得到了。
This paper derives the conditional node connectivity of the k-ary n-cube interconnection network under the condition of forbidden faulty sets (i.e. assuming that each non-faulty processor has at least one non-faulty neighbor). It is shown that under this condition and for k≥4 and n≥2, the k-ary n-cube, whose connectivity is 2n, can tolerate up to 4n-3 faulty nodes without becoming disconnected. The conditional node connectivity in this case is therefore 4n-2. For k=3 and n≥2 the established conditional node connectivity is 4n-3. The result for the remaining smaller values of k and n are also obtained.