Achieving Reliability Through Distributed Data Flows and Recursive Delegation
| dc.contributor.author | Ostrowski, Krzysztof | |
| dc.contributor.author | Birman, Ken | |
| dc.contributor.author | Dolev, Danny | |
| dc.contributor.author | Sakoda, Chuck | |
| dc.date.accessioned | 2009-03-15T20:34:54Z | |
| dc.date.available | 2009-03-15T20:34:54Z | |
| dc.date.issued | 2009-03-15T20:34:54Z | |
| dc.description.abstract | Strong reliability properties, such as state machine replication or virtual synchrony, are hard to implement in a scalable manner. They are typically expressed in terms of global membership views. As we argue, global membership is non-scalable. We propose a way of modeling protocols that does not rely on global membership. Our approach is based on the concept of a distributed data flow, a set of messages distributed in space and time. We model protocols as networks of such flows, constructed through recursive delegation. The resulting system uses multiple small membership services instead of a single global one while still supporting stronger properties. Our work was inspired by the functional approach to modeling distributed systems pioneered by I/O automata. This paper focuses on the basic model. Internal details of our system architecture and a compiler that translates protocols from our data flow language to real executable code will be discussed elsewhere. | en_US |
| dc.description.sponsorship | This work was supported in part by grants from AFOSR, AFRL, NSF, and Intel Corporation | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/12111 | |
| dc.language.iso | en_US | en_US |
| dc.subject | strong reliability properties | en_US |
| dc.subject | I/O automata | en_US |
| dc.subject | distributed data flow | en_US |
| dc.subject | scalable protocol | en_US |
| dc.subject | monotonic aggregation | en_US |
| dc.title | Achieving Reliability Through Distributed Data Flows and Recursive Delegation | en_US |
| dc.type | article | en_US |
Files
Original bundle
1 - 1 of 1