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- 1/2 ) messages in the totally asynchronous model. Moreover, we show that the message complexity of our protocol is optimal. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
