The conditional node connectivity of the k-ary n-cube

被引：0

作者：

Day, K ^{[1
]}

Harous, S ^{[1
]}

Al-Ayyoub, AE ^{[1
]}

机构：

[1] Sultan Qaboos Univ, Dept Comp Sci, Masqat, Oman

来源：

INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOL VI, PROCEEDINGS | 1999年

关键词：

fault-tolerance; forbidden faulty sets; k-ary n-cube; node connectivity; conditional node connectivity;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We obtain 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 neighbour). We have shown that under this condition and for k greater than or equal to 4 and n greater than or equal to 2, the k-ary n-cube, whose connectivity is 2n, can tolerate up to 4n-3 faulty nodes without becoming disconnected therefore 2n faulty nodes may cause disconnection. However the network becomes disconnected only when all the 2n faulty nodes are neighbours of the same node which is very improbable.

引用

页码：2706 / 2710

页数：5

共 7 条

[1] LEE DISTANCE AND TOPOLOGICAL PROPERTIES OF K-ARY N-CUBES [J].