加总线超立方网络上的容错寻径算法

    Research on the Fault-Tolerance Routing Algorithm on Hypercube Added with Buses

    • 摘要: 研究了加总线超立方网络的容错寻径问题.设BHn为一个已加总线的n维超立方网络,F为其故障结点集合,|F|≤ n.研究了BHn上任意两个非故障结点间的容错寻径问题.对于小规模的超立方网络,其直径由n+2降为3,而对于较大规模的超立方网络而言,其直径降到≤(n/3)+6.显然,当n>6时,n+2>(n/3)+6.因此,加总线后的超立方网络同时具有更好的容错性能.

       

      Abstract: The problem of fault-tolerant routing on hypercube is studied on the basis of the method of adding bus. Let BHn be a modified n-dimensional hypercube which is added with multiple buses, and F be the set of its faulty nodes,|F| ≤ n. According to the conclusion in this paper, the diameter of small system of BHn; reduces from n+2 to 3, and that of large system reduces to not more than (n/3) + 6. It is well known that, n + 2 > (n/3) + 6, for arbitrary n > 6, so the fault-tolerance capability of the modified hypercube is improved than that of hypercube when n > 6.

       

    /

    返回文章
    返回