首页 | 本学科首页   官方微博 | 高级检索  
     

广义超立方网络的容错寻径算法研究
引用本文:刘永峰,刘长河,寿玉亭. 广义超立方网络的容错寻径算法研究[J]. 北京工业大学学报, 2001, 27(3): 273-281
作者姓名:刘永峰  刘长河  寿玉亭
作者单位:1. 北京建筑工程学院机电系
2. 北京建筑工程学院基础部
基金项目:北京建筑工程学院校科研和教改项目;;
摘    要:给定一个广义超立方网络以G(m,r):N=mr(m≥2,r≥1),其上有若干条连线发生故障,F为其故障连线集合,且 G(m,r)-F是连通的,S和 D是 G(m,r)中任意两个结点(处理器),其汉明距离 H(S, D)=h.得出如下结论:(1)当|f|<d时,存在一条非故障路径P(S,D),且|P(S,D)|≤h+2; (2)当d≤|F|<m(d-m+1)时,存在一条非故障路径P(S,D),且|P(S,D)|≤ h+4m-2.这里,d是G(m,r)的度,|P(S,D)| 是路径P(S,D)的长度,P(S,D)是非故障的是指在其上的所有连线均非故障.给出了寻径算法.

关 键 词:广义超立方网络  容错  寻径算法
文章编号:02540037(2001)03027309
修稿时间:2001-01-16

Research on Fault-Tolerance Routing Algorithms on Generalized Hypercube Networks
LIU Yong-feng. LIU Chang-he,SHOU Yu-ting. Research on Fault-Tolerance Routing Algorithms on Generalized Hypercube Networks[J]. Journal of Beijing Polytechnic University, 2001, 27(3): 273-281
Authors:LIU Yong-feng. LIU Chang-he  SHOU Yu-ting
Abstract:The fault-tolerance routing algorithms on generalized hypercube networks with the set of faulty links are studied. Let G(m, r): N= mr (m ≥ 2, r ≥ 1), be a generalized hypercube networks with the set of faulty links F, |F| denotes the number of elements in F and the graph G(m, r) - F is connected. S and D are two nodes, between which the Hamming distance is H(S, D) = h. Then, there are conclusions as following:(1) If |F| < d, there is a fault-free path P(S, D), such that |P( S, D)| ≤h+2; (2) If d≤ |F|
Keywords:generalized hypercube networks  fault-tolerance  routing algorithm
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号