摘要
本文讨论具有大量错误结点的超立方体网络中的单播路由算法 .假定 Hn是一个局部 3-维子立方体连通的 n-维超立方体网络并且每一个基本的 3-维子立方体中分别最多有 1个和 2个错误结点 ,本文提出的单播路由算法能够在线性时间找到路径长度分别为源结点和目的结点之间大约 1.5倍和 2倍海明距离的次优路径 .我们提出的单播路由算法只需要结点知道其邻结点的状态 ,而无需知道整个网络信息 ,也就是说 ,该算法是基于局部信息的 ,因而该算法具有很强的实际意义 .
In this paper, we consider unicast routing algorithms on hypercube networks with a large number of faulty nodes. Suppose H n is a locally 3 subcube connected n dimensional hypercube network, in which every basic 3 subcube has at most one and two faulty nodes respectively, our unicast routing algorithms can find nearly optimal routing paths with length bounded by about 1.5 and 2 times the Hamming distance between the source node and the destination node respectively in linear time. Our unicast routing algorithms are local information based in the sense that each node in the network knows only its neighbors status and no global information of the network is required by the algorithms.
出处
《小型微型计算机系统》
CSCD
北大核心
2002年第8期920-925,共6页
Journal of Chinese Computer Systems
基金
国家海外杰出青年自然科学基金 ( 6 992 82 0 1)资助
教育部高等学校骨干教师资助计划和长江学者奖励计划资助
