Distributed algorithms in faulty networks

Author

Masuzawa, T. ; Hagihara, K. ; Tokura, N.

Author_Institution

Educ. Center for Inf. Process., Osaka Univ., Japan

fYear

1988

fDate

7-9 Jun 1988

Firstpage

555

Abstract

The authors present research on fault-tolerant distributed algorithms. The following problems in faulty networks are discussed: (1) spanning tree construction; (2) fault detection for a processor; and (3) fault detection for a link. These problems are not necessarily solvable in faulty networks. It is shown that the solvability is dependent on how much global information on the network each processor has a priori and whether the network is synchronous or not

Keywords

algorithm theory; distributed processing; fault tolerant computing; fault detection; fault-tolerant distributed algorithms; faulty networks; global information; processor network; solvability; spanning tree construction; Algorithm design and analysis; Bidirectional control; Distributed algorithms; Fault detection; Fault tolerance; Information processing; Intelligent networks; Joining processes; Network topology; Nominations and elections;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1988., IEEE International Symposium on

Conference_Location

Espoo

Type

conf

DOI

10.1109/ISCAS.1988.14987

Filename

14987

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1828971