Abstract
Strong reliability properties, such as state machine replication and virtual synchrony, are hard to implement in a scalable manner. They are typically expressed in terms of global membership views. However, global membership is non-scalable. We propose a new 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 events 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 service while still supporting stronger properties. This paper focuses on the theoretical model and its base properties; in particular, on the concept of monotonic aggregation. We present a high-level architecture overview and initial performance results.
Original language | English |
---|---|
Title of host publication | Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009 |
Publisher | Association for Computing Machinery |
ISBN (Print) | 9781605586656 |
DOIs | |
State | Published - 2009 |
Event | 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009 - Nashville, TN, United States Duration: 6 Jul 2009 → 9 Jul 2009 |
Publication series
Name | Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009 |
---|---|
Volume | 2009-January |
Conference
Conference | 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009 |
---|---|
Country/Territory | United States |
City | Nashville, TN |
Period | 6/07/09 → 9/07/09 |
Bibliographical note
Publisher Copyright:© 2009 ACM.
Keywords
- aggregation
- data flow
- membership
- protocol
- scalability