Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6594
Title: Reliable Broadcast Protocols and Network Architecture: Tradeoffs and Lower Bounds
Authors: Babaoglu, Ozalp
Drummond, Rogerio
Stephenson, Patrick
Keywords: computer science
technical report
Issue Date: May-1986
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-754
Abstract: Reliable Broadcast is a mechanism by which a processor in a distributed system disseminates a value to all other processors in the presence of both communication and processor failures. Protocols to achieve Reliable Broadcast are at the heart of most fault-tolerant applications. We characterize the execution time of Reliable Broadcast protocols as a function of the properties of the underlying communication network. The class of networks considered includes familiar communication structures such as fully-connected point-to-point graphs, linear chains, rings, broadcast networks (such as Ethernet) and buses. We derive a protocol that implements Reliable Broadcast for any member within this class. We present a novel proof technique to obtain lower bound results for Reliable Broadcast in this environment. This proof technique is based on graph mappings. The hardware-software tradeoffs that are revealed between performance, resiliency and network cost offer many new alternatives previously not considered in designing fault-tolerant systems.
URI: http://hdl.handle.net/1813/6594
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
86-754.pdf2.41 MBAdobe PDFView/Open
86-754.ps455.57 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us