基于有故障区域的Mesh网络目标结点间的最短路由算法

发布时间：2018-06-29 02:05

  本文选题：最短路由算法 + 容错路由算法　； 参考：《计算机科学》2017年S1期

【摘要】：Mesh网络是较早研究的且现在仍然是最为重要的、最有吸引力的网络模型之一。因其结构、规则简单及良好的可扩展性,易于VLSI(超大规模集成电路)的实现,网格(Mesh)网络不仅成为了许多理论研究的基础模型,而且也是许多大型多处理器并行计算机系统所采用的拓扑结构。给出了两种故障情形下的最短路由算法:1)当Mesh的行数大于等于3且列数大于等于3、出现一个矩形故障区域时,给出了任意两个无故障结点间的最短路由算法,并且计算出了路径长度;2)当Mesh的行数≥3且列数≥3、某个结点及其k跳以内的邻居结点出现故障时,给出了任意两个无故障结点间的最短路由算法,并且计算出了路径长度。
[Abstract]:Mesh network is one of the most important and attractive network models. Due to its simple structure, simple rules and good scalability, it is easy to implement VLSI (VLSI). Mesh network is not only the basic model of many theoretical studies. It is also a topology used in many large multiprocessor parallel computer systems. In this paper, the shortest routing algorithm for two kinds of fault cases: 1) when the number of rows of mesh is greater than or equal to 3 and the number of columns is greater than or equal to 3, the shortest routing algorithm between any two faultless nodes is given when there is a rectangular fault area. The shortest routing algorithm between any two faultless nodes is given and the path length is calculated when the number of rows of mesh is 鈮，

本文编号：2080346