Message-optimal protocols for reliable broadcasts in networks with crash failures

Author

Tzeng, Hong-Yi ; Kai-Yeung Sin

Author_Institution

Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA

fYear

1994

fDate

27 Jun-1 Jul 1994

Firstpage

410

Abstract

We consider reliable broadcast protocols in both weakly synchronous and totally asynchronous distributed systems with point-to-point communication links. We present protocols that, in an n-process system subject to at most t crash failures, guarantees the delivery of a message from any process to other nonfaulty processes. In the absence of failures, our protocols require (n+t-1) messages in the weakly synchronous model and (t+1)(n-1-½) messages in the totally asynchronous model. Moreover, we show that the message complexity of our protocol is optimal

Keywords

broadcasting; communication complexity; computer network reliability; distributed processing; failure analysis; fault tolerant computing; message switching; protocols; asynchronous distributed systems; crash failures; fault tolerant distributed applications; message complexity; message delivery guarantee; message-optimal protocols; point-to-point communication links; reliable broadcast protocols; synchronous distributed systems; Broadcasting; Computer crashes; Computer network reliability; Computer networks; Distributed computing; Fault tolerance; Fault tolerant systems; Intelligent networks; Protocols; Reliability engineering;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Conference_Location

Trondheim

Print_ISBN

0-7803-2015-8

Type

conf

DOI

10.1109/ISIT.1994.395025

Filename

395025