Show simple item record

dc.contributor.authorHayden, Marken_US
dc.contributor.authorBirman, Kennethen_US
dc.date.accessioned2007-04-23T18:08:08Z
dc.date.available2007-04-23T18:08:08Z
dc.date.issued1996-09en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR96-1606en_US
dc.identifier.urihttps://hdl.handle.net/1813/7261
dc.description.abstractWe present a class of scalable and probabilisticly reliable communication protocols. The protocols are based on a probabilistic system model and thus their properties tend to be probabilistic in nature. The protocols are scalable in two senses. First, the message costs and latencies of the protocols grow slowly with the system size. Second, the reliability of the protocols, expressed in terms of the probability of a failed run of a protocol, approaches 0 exponentially fast as the number of processes is increased. This scalable reliability is achieved through a form of gossip protocol which is strongly self-stabilizing in a sense similar, although not identical to, the notion of self stabilizing systems proposed by Dijkstra.en_US
dc.format.extent277011 bytes
dc.format.extent207490 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleProbabilistic Broadcasten_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics