An Optimal Fault Tolerant Routing Algorithm on Weighted Double Loop Networks

• Main Authors: Yu-Liang Liu, 劉育良
• Other Authors: Yue-Li Wang
• Format: Others
• Language: en_US
• Published: 1999
• Online Access: http://ndltd.ncl.edu.tw/handle/14134514320695269741

碩士 === 國立臺灣科技大學 === 管理研究所資訊管理學程 === 87 === A weighted double loop network can be modeled by a directed graph G(n;h1,h2;w1,w2) with vertex set Zn={0,1,…,n-1}and edge set the union of E1 = {(u,u+h1)|u Zn } and E2 = {(u,u+h2)|u Zn }. Assume that the weight of each edge in E1 is w1, and the weight of each edge in E2 is w2. In this thesis, we present an optimal routing algorithm on weighted double loop networks under the case where there is at most one faulty element. Our algorithm is based on the fact that the shortest path from a vertex to any other vertex in a weighted double loop network is in the so-called L shape region.