交叉立方体环互连网络虫洞路由广播算法

摘要

交叉立方体环网络是一类层次性互连网络，具有易于扩展其规模的特性。为了提高这种网络在虫洞通信模式下的广播通信性能，提出了一个先环上广播再交叉立方体内部广播的策略，并结合递归分解交叉立方体的方法，进而提出了在虫洞路由模型下时间步为o（n/log2（n＋1）＋log3m）的广播路由算法。研究表明，该算法可保证通信各路径是不交叉的，从而有效提高了通信性能。%As a kind of hierarchical ring interconnection networks (HRN), the crossed cube-con-nected ring interconnection network ( CRN) has the property that its scale can be easily extended.To improve the performance of wormhole-routed broadcast in this kind of networks , a broadcast algo-rithm of o ( n/log2 ( n +1) +log3 m) rounds is presented , which firstly broadcasts in the ring and then broadcasts in the crossed cubes by recursively decomposing a crossed cube into several disjoint sub-cubes.Theoretical analysis results show that the algorithm can ensure all broadcast paths to be disjoint, thus to effectively improve the performance of broadcast .