Fault-tolerant reconfiguration of trees and rings in networks

Author

Arora, Anish ; Singhai, Ashish

Author_Institution

Dept. of Comput. Sci., Ohio State Univ., Columbus, OH, USA

fYear

1994

fDate

25-28 Oct 1994

Firstpage

221

Lastpage

228

Abstract

We design two protocols that maintain the nodes of any computer network in a rooted spanning tree and in a unidirectional ring, respectively, in the presence of any finite number of fail-stop failures and repairs of network nodes and communication channels. Our protocols are fully distributed, have optimal time and space complexity, and illustrate two different methods for the design of nonmasking fault-tolerant protocols

Keywords

computational complexity; computer network reliability; distributed processing; fault tolerant computing; fault trees; protocols; communication channels; computer network; distributed protocol; fail-stop failures; fault-tolerant reconfiguration; network nodes; nonmasking fault-tolerant protocols; optimal space complexity; optimal time complexity; protocols; reliability; repairs; ring networks; rooted spanning tree; unidirectional ring; Communication channels; Computer network reliability; Computer networks; Computer science; Design methodology; Fault tolerance; Intelligent networks; Network operating systems; Protocols; Telecommunication network reliability;

fLanguage

English

Publisher

ieee

Conference_Titel

Network Protocols, 1994. Proceedings., 1994 International Conference on

Conference_Location

Boston, MA

Print_ISBN

0-8186-6685-4

Type

conf

DOI

10.1109/ICNP.1994.344357

Filename

344357