摘要： 讨论了基于广播Banyan网作为路由网的点到多点通信问题,即传输信元的二进制地址到三进制地址的合并算法,本算法采用临近区域分类的集合递归合并的方法,将二进制地址有效地合并成三进制地址。分析表明此算法可以有效地减少网络内部占用的链路数,提高了使用网络资源的效率。

关键词: 广播Banyan网, 路由合并, 二进制

Abstract: This article discusses the communication problem from one point to many points based on the broadcast Banyan network and puts forward a union algorithm which can change cell from binary address to ternary address. This algorithm adopts the set recursion to incorporate binary address to ternary address efficiently, which is based on the classification in the adjacent area. This algorithm can efficiently reduce the link occupation in the network and enhance the efficiency of making use of the network resource.

中图分类号: 

• TP301.6