不完全超立方网络上加总线的方法  

A Method for Installing Bus on Incomplete Hypercubes

作　　者：刘长河 黄忠臣 

出　　处：《北京建筑工程学院学报》1999年第3期14-22,共9页Journal of Beijing Institute of Civil Engineering and Architecture

基　　金：北京建筑工程学院博士启动基金

摘　　要：本文给出在不完全超立方网络上加总线的方法．加总线后的网络既保存了可扩充性强的优点，又使其直径从n减小到．同时，给出了加总线不完全超立方网络上任意两结点间的寻径算法．对于具有偶数多个结点的不完全超立方网络．给出了加总线后其上任意两结点间的两条平行路径的寻径算法．这样，如果将所要传送的信息复制成两份，分别沿这两条路径传送，则允许有一条路径上有结点或连线发生故障，从而提高了其容错能力．A method for installing bus on Incomplete Hypercubes is proposed, which makes such networks with bus both contain thcir specialty of being extended easily and reduce the diameter of I(Incomplete Hypercube with N nodes) from n to In the meantime, a routing algorithm for finding the sole path between arbitrary two nodes S and D on the modified networks and a routing algorithm for finding two parallel paths between them are given. Such, when the message need to be send between S and D is duplicated two pieces and send along this two parallel paths respectively, it allows some nodes and links be fault in one of this two paths, then the ability of fault-tolerance is improved.

关 键 词：编码理论 不完全 超立方网络 寻径算法 总线 

分 类 号：O157.5[理学—数学] TP393[理学—基础数学]