Time-Communication Tradeoffs for Reliable Broadcast Protocols
| dc.contributor.author | Babaoglu, Ozalp | en_US |
| dc.contributor.author | Drummond, Rogerio | en_US |
| dc.date.accessioned | 2007-04-23T17:09:56Z | |
| dc.date.available | 2007-04-23T17:09:56Z | |
| dc.date.issued | 1985-06 | en_US |
| dc.description.abstract | In the Reliable Broadcast Problem, a processor disseminates a value to all other processors in a distributed system where both processors and communication components are subject to failures. Solutions to this Reliable Broadcast problem are at the heart of most fault-tolerant applications. We characterize the execution of Reliable Broadcast protocols as a function of the properties of the underlying communication network. The class of networks considered includes familiar communication structures constructed out of 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. The execution time of the protocol is a linear function of the two parameters that characterize each network instance. 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. | en_US |
| dc.format.extent | 1642975 bytes | |
| dc.format.extent | 420994 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-687 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6527 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Time-Communication Tradeoffs for Reliable Broadcast Protocols | en_US |
| dc.type | technical report | en_US |