Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast
| dc.contributor.author | Aguilera, Marcos Kawazoe | en_US |
| dc.contributor.author | Toueg, Sam | en_US |
| dc.contributor.author | Deianov, Borislav | en_US |
| dc.date.accessioned | 2007-04-23T18:16:59Z | |
| dc.date.available | 2007-04-23T18:16:59Z | |
| dc.date.issued | 1999-04 | en_US |
| dc.description.abstract | Uniform Reliable Broadcast (URB) is a communication primitive that requires that if a process delivers a message, then all correct processes also deliver this message. A recent PODC paper [HR99] uses Knowledge Theory to determine what failure detectors are necessary to implement this primitive in asynchronous systems with process crashes and lossy links that are fair. In this paper, we revisit this problem using a different approach, and provide a result that is simpler, more intuitive, and, in a precise sense, more general. | en_US |
| dc.format.extent | 238046 bytes | |
| dc.format.extent | 265769 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/TR99-1741 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7395 | |
| 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 | Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast | en_US |
| dc.type | technical report | en_US |