摘要
证明了n-维广义超立方体网络Q(m1,m2,…,mn)中,任意两个节点x和y之间存在长度均不超过H(x,y)+2的m1+m2+…+mn-n条内点不交的路由,其中有H(x,y)条长度不超过H(x,y),此处H(x,y)表示x到y的汉明距离.并在此基础上讨论了广义超立方体网络的容错路由问题.证明了即使无效点很多,但只要存在某个(n-1)-维广义超子立方体中无效节点较少,则该n-维广义超立方体中的任意两个有效节点之间可以找到最优路由或接近最优路由的有效路由.
This paper shows that there are m1＋m2＋…＋mn vertex-disjoint routes between any two nodesxandy, with length less than or equal to H（x,y） ＋ 2 in n-dimension ~：~eneralized Hypercube networks Q（m1,m2,…,mn） in which there exists H（x,y） routes betweenxandywith length equal to H（x,y）. here H（x,y） denotes Hamming distance betweenxandy. Based on this kind of topological structure, the issue of fault-tolerance routes is discussed in n-dimension Generalized Hypercube networks. When there are many faulty nodes, there is a feasible route arriving or approaching the optimum route if there exist fewer faulty nodes in one of the （n-1）-dimension Generalized Hypercubes.
出处
《数学的实践与认识》
CSCD
北大核心
2006年第9期244-249,共6页
Mathematics in Practice and Theory
基金
国家自然科学基金(10371048)
关键词
广义超立方体
内点不交
容错路由
最优路由
generalized hypercube
vertex-disjoint
fault-tolerance route
optimum route
