Fast Ordered Multicasts
| dc.contributor.author | Stephenson, Patrick | en_US |
| dc.date.accessioned | 2007-04-23T17:52:28Z | |
| dc.date.available | 2007-04-23T17:52:28Z | |
| dc.date.issued | 1991-02 | en_US |
| dc.description.abstract | In this thesis, we present new protocols that provide reliable ordered multicasts to multiple overlapping process groups in the presence of failures. Our protocols provide two kinds of message delivery ordering - causal ordering and total ordering. Message delivery is also ordered with respect to the observation of group membership changes, a property known as virtual synchrony. Initially we examine solutions for the case of a single process group, and subsequently extend our solutions to encompass multiple overlapping process groups. In comparison with previous protocols for these problems, our protocols are cheaper and scale up better. An initial implementation of our protocols as part of the ISIS toolkit has produced encouraging performance results. | en_US |
| dc.format.extent | 7988078 bytes | |
| dc.format.extent | 1457716 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/TR91-1194 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7034 | |
| 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 | Fast Ordered Multicasts | en_US |
| dc.type | technical report | en_US |