【摘要】 讨论了广义超立方体网络的容错路由问题。并在此基础上证明了当无效点很多时,只要存在某个(n-1)-维广立方体中无效节点不超过两个,则该n-维广义超立方体中的任意两个有效节点x和y之间的有效路由长度区间为[H(x,y),O(x,y)+4]。这里H(x,y)表示x到y的汉明距离,O(x,y)表示x到y的最优距离。更多还原

【Abstract】 In this paper,the issue of fault-tolerance routes is discussed in n-dimension generalized hypercube networks.Based on this,when there are many faulty nodes,there is a feasible route whose length band is [H(x,y),O(x,y)+4] between any two notes x and y,if there exists less than two faulty nodes in one of the(n-1)-dimension generalized hypercubes.Here H(x,y) denotes Hamming distance and O(x,y) denotes optimum distance.更多还原