局部k-子立方连通的超立方网络中的广播容错算法  

Broadcast in the Locally K-subcube-connected Hypercube Networks with Fault Tolerance

作　　者：宋莹[1] 刘方爱[1] 

机构地区：[1]山东师范大学计算机系,济南250014

出　　处：《计算机工程》2004年第23期71-73,共3页Computer Engineering

基　　金：山东省自然科学基金资助项目(Y2002G03);国家自然科学基金资助项目(60373063)

摘　　要：基于局部k-子立方体连通性的概念,提出了在局部k-子立方连通的超立方体中的广播路由算法。该算法是分布的、基于局部信 息的,在容错性上有了很大的提高,能在线性时间内构造超立方体Hn中接近最优的路径。This paper introduces a broadcasting algorithm on locally k-subcube-connected hypercube networks under the above situation, based on the conception of locally k-subcube-connected hypercube. The algorithm is distributed and local-information-based. This is a much larger bound on the number of faulty nodes compared to the previous broadcast algorithms. The algorithm can find nearly optimal length path in hypercube Hn in linear time.

关 键 词：超立方体 容错性 连通 路由算法 在线 最优 网络 局部 线性 信息 

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