3元n立方网络的2阶超连通性  

Second-extraconnectivity of 3-ary n-cube networks

作　　者：赵元庆[1] 金显华[2] 

机构地区：[1]安阳师范学院计算机与信息工程学院,河南安阳455002 [2]安阳师范学院公共计算机教学部,河南安阳455002

出　　处：《计算机应用》2013年第4期1036-1038,共3页journal of Computer Applications

基　　金：国家自然科学基金资助项目(41001251)

摘　　要：为了度量以3元n立方网络为底层拓扑结构的并行与分布式系统的连通性,通过构造其2阶超割的方法,计算出当n不小于2时,3元n立方网络的2阶超连通度是6n-7。证明了对于以3元n立方网络为底层拓扑结构的并行与分布式计算机系统,当有不超过6n-8个节点发生故障且每个连通分支至少还有3个健康的节点时,该并行与分布式系统的任意两个节点之间仍然有一条无故障的通信线路。To evaluate the connectivity of parallel and distributed computer systems which take 3-ary n-cubes as underlying topologies,by constructing the extra 2-cut of 3-ary n-cubes,the second-extraconnectivity of 3-ary n-cubes was proved to be equal to 6n-7 for an arbitrary integer n no less than 2.The result shows that for any two nodes of the parallel and distributed system which take the 3-ary n-cube as underlying topology,there is at least a fault-free path connecting them if the number of the faulty nodes in the system does not exceed 6n-8 and each connected branch still has at least three healthy nodes.

关 键 词：互连网络 3元n立方 容错 连通度 超连通度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]