A unified approach to fault-tolerant routing

Author

El-Ghazawi, Tarek ; Youssef, Abdou

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC, USA

fYear

1992

fDate

9-12 Jun 1992

Firstpage

210

Lastpage

217

Abstract

A theoretical study of the connectivity and fault tolerance of Cartesian product networks is presented. The theoretical results are used to synthesize provably correct adaptive fault-tolerant algorithms from ones written for the component networks. The theoretical foundations that relate the connectivity of a Cartesian product network, the connectivity of the component networks, and the number of faulty components are established. It is shown that the connectivity of a product network is at least the sum of the connectivities of its factor networks. Based on the constructive connectivity proof, an adaptive, generic, distributed algorithm that can perform successful point-to-point routing in product networks, in the presence of faults, is devised. A proof of correctness of the algorithm is provided

Keywords

fault tolerant computing; multiprocessor interconnection networks; Cartesian product networks; connectivity; constructive connectivity proof; distributed algorithm; fault-tolerant routing; faulty components; point-to-point routing; proof of correctness; provably correct adaptive fault-tolerant algorithms; Algorithm design and analysis; Computer networks; Concurrent computing; Fault tolerance; Hypercubes; Multiprocessor interconnection networks; Network synthesis; Network topology; Parallel algorithms; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on

Conference_Location

Yokohama

Print_ISBN

0-8186-2865-0

Type

conf

DOI

10.1109/ICDCS.1992.235037

Filename

235037