摘要
基于广义超立方体图的局部连通性概念,讨论了具有局部连通性的广义超立方体网络的容错路由算法.一个局部连通的广义超立方体网络可以容许大量的错误结点比较均匀地存在于多个广义子立方体而仍保证其全局连通性.对失效结点比较集中的情况,给出了路由算法.
A new concept local generalized k-subcube-connectivity is provided, in which there are many fault nodes allowed. Also, an algorithm respect to such kind of connective generalized hypercube is supposed. Meanwhile, when the fault nodes locates in a generalized subcube, the fault-tolerant routing is given.
出处
《武汉理工大学学报(交通科学与工程版)》
2006年第4期682-685,共4页
Journal of Wuhan University of Technology(Transportation Science & Engineering)
基金
国家自然科学基金项目(批准号:10371048)
三峡大学创新基金资助
关键词
广义超立方体
容错
路由算法
局部连通性
generalized hypercube
fault-tolerance
routing
local generalized k-subcube connectivity