基于有故障区域的Mesh网络目标结点间的最短路由算法-计算机科学.PDF

第 44 卷第6A 期 Vo l. 44 No. 6A 计算机科学 2017 年 6 月 CO岛1PUTER SCIENCE June 2017 基于有故障区域的 Mesh 网络目标结点间的最短路由算法 林政宽王铭成郭莉莉杜满意 (苏州大学计算机科学与技术学院 苏州 215006) 摘 要 Mesh 网络是较早研究的且现在仍然是最为重要的、最有吸引力的网络模型之一。因其结构、规则简单及良 好的可扩展性，易于 VLSI(超大规模集成电路)的实现，网格(Mesh) 网络不仅成为了许多理论研究的基础模型，而且 也是许多大型多处理器并行计算机系统所采用的拓扑结构。给出了两种故障情形下的最短路由算法:1)当 Mesh 的 行数大于等于 3 且列数大于等于 3、出现一个矩形故障区域时，给出了任意两个无故障结点间的最短路由算法，并且 计算出了路径长度;2) 当 Mesh 的行数二三3 且列数二三3 、某个结点及其是跳以内的邻居结点出现故障时，给出了任意两 个元故障结点间的最短路由算法，并且计算出了路径长度。 关键词 最短路由算法，容错路由算法，网格网络 中图法分类号 TP393 文献标识码 A Shortest Routing Algorithm ßased on Target Node in Mesh Network with Faulty Area L卧~ Cheng-kuan WANG Ming-cheng GUO Li-li DU Man-yi (School of Computer Science and Technology ,Soochow University ,Suzhou 215006 ,China) Abstract Mesh network is studied early and it is still one of the most important and attractive network models at pre- sent. Because of its simple ,regular and scalable structure ,and it is useful for the implementation of VLSI (Very Large Scale Integrated Circuit) ,Mesh network has not only become the basic model of many theoretical studies ,but also the topology structure of many large multiprocessor and parallel computer systems. A mesh with m rows and n columns is denoted by 品化， n In this paper ,we gave the shortest routing algorithm under two different kinds of faulty area. 1)We gave a routing algorithm to find the shortest path between any two fault-free nodes in Mm ,n with m注3 and n二刃， and calculated the length of the path obtained by the algorithm when there is a rectangular faulty regio几 2)We gave a