Efficient fault-tolerant routing algorithms for forward loop backward hop networks

[1991] Proceedings 16th Conference on Local Computer Networks Pub Date : 1991-10-14 DOI:10.1109/LCN.1991.208093

P. Sheu, Wen-Tsuen Chen, J. Chiou

{"title":"Efficient fault-tolerant routing algorithms for forward loop backward hop networks","authors":"P. Sheu, Wen-Tsuen Chen, J. Chiou","doi":"10.1109/LCN.1991.208093","DOIUrl":null,"url":null,"abstract":"Forward loop backward hop (FLBH) networks, characterized by a forward loop connecting all the adjacent nodes and a backward loop connecting nodes separated by a distance of h hops, have a higher connectivity and therefore a higher potential for fault-tolerance than single-loop networks. How to devise efficient fault-tolerant routing algorithms is an important issue on designing FLBH networks. This paper proposes two new fault-tolerant routing algorithms. One is for optimal FLBH networks with h/sup 2/=N, where N is the number of nodes. The other is for arbitrary FLBH networks (i.e., 1<or=h<or=N-1). Both algorithms are theoretically shown to be able to guarantee that any packet is sure to reach its destination even when a faulty node exists. At the same time, they are simple and merely require local knowledge. A simple and effective rule, called the balancing rule, is used to determine the next node to which the incoming packet should be forwarded. The balancing rule enables the algorithms to find the shortest path between the source and the destination in most cases despite the presence of network faults. The results of computer simulations demonstrate that the average length of paths discovered by the authors' algorithms is shorter than that found by other algorithms and is near optimal solution. As a result, these algorithms are suitable for implementation on practical local computer networks, especially on large ones.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings 16th Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1991.208093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

Forward loop backward hop (FLBH) networks, characterized by a forward loop connecting all the adjacent nodes and a backward loop connecting nodes separated by a distance of h hops, have a higher connectivity and therefore a higher potential for fault-tolerance than single-loop networks. How to devise efficient fault-tolerant routing algorithms is an important issue on designing FLBH networks. This paper proposes two new fault-tolerant routing algorithms. One is for optimal FLBH networks with h/sup 2/=N, where N is the number of nodes. The other is for arbitrary FLBH networks (i.e., 1>

查看原文本刊更多论文

正向环反向跳网络的高效容错路由算法

前向环后向跳(FLBH)网络的特点是前向环连接所有相邻节点，后向环连接间隔h跳的节点，具有更高的连通性，因此比单环网络具有更高的容错潜力。如何设计高效的容错路由算法是FLBH网络设计中的一个重要问题。本文提出了两种新的容错路由算法。一种是h/sup 2/=N的最优FLBH网络，其中N为节点数。另一种是用于任意FLBH网络(即1>)

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1991] Proceedings 16th Conference on Local Computer Networks

自引率

0.00%

发文量