Fault-tolerant routing in distributed loop networks

Author

Mukhopadhyaya, Krishnendu ; Sinha, Bhabani P.

Author_Institution

Dept. of Math., Jadavpur Univ., Calcutta, India

Volume

44

Issue

12

fYear

1995

fDate

12/1/1995 12:00:00 AM

Firstpage

1452

Lastpage

1456

Abstract

The ring network is a popular network topology for implementation in local area networks and other configurations. But it has a disadvantage of high diameter and large communication delay. So loop networks were introduced with fixed-jump links added over the ring. In this paper, we characterize some values for the number of nodes for which the lower bound on the diameter of loop networks is achieved. We also give an O(δ) time algorithm (where δ is the diameter of the graph) for finding a shortest path between any two nodes of a general loop network. We also propose a scheme to find a near optimal path (not more than one over the optimal) in case of a single node or link failure

Keywords

delays; fault tolerant computing; local area networks; token networks; communication delay; distributed loop networks; fault-tolerant routing; fixed-jump links; link failure; local area networks; near optimal path; network topology; node failure; ring network; shortest path; Delay; Fault tolerance; Graph theory; Intelligent networks; Local area networks; Mathematics; Network topology; Routing;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.477250

Filename

477250