摘要： 基于局部k-子立方体连通性的概念,提出了在局部k-子立方连通的超立方体中的广播路由算法。该算法是分布的、基于局部信 息的,在容错性上有了很大的提高,能在线性时间内构造超立方体Hn中接近最优的路径。

关键词: 广播路由算法, 容错, 超立方体, 互联网络

Abstract: 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