Census: Location-Aware Membership Management for Large-Scale Distributed Systems
Name
Liskov_Census Location.pdf
Size
530.57 KB
Format
Adobe PDF
Checksum (MD5)
e573fda014521abe812771f98413a78d
Author(s) • • • •
Cowling, James Alexander
Ports, Dan R. K.
Liskov, Barbara H.
Popa, Raluca Ada
Gaikwad, Abhijeet
Date Issued
June 2009
Journal
Proceedings of the 2009 USENIX Annual Technical Conference
Publisher
USENIX Association
Citation
Cowling, J., et al. "Census: Location-Aware Membership Management for Large-Scale Distributed Systems." Proceedings of the 2009 USENIX Annual Technical Conference (San Diego: June 14-19, 2009).
Version
Author's final manuscript
Abstract
We present Census, a platform for building large-scale distributed applications. Census provides a membership service and a multicast mechanism. The membership service provides every node with a consistent view of the system membership, which may be global or partitioned into location-based regions. Census distributes membership updates with low overhead, propagates changes promptly, and is resilient to both crashes and Byzantine failures. We believe that Census is the first system to provide a consistent membership abstraction at very large scale, greatly simplifying the design of applications built atop large deployments such as multi-site data centers.
Census builds on a novel multicast mechanism that is closely integrated with the membership service. It organizes nodes into a reliable overlay composed of multiple distribution trees, using network coordinates to minimize latency. Unlike other multicast systems, it avoids the cost of using distributed algorithms to construct and maintain trees. Instead, each node independently produces the same trees from the consistent membership view. Census uses this multicast mechanism to distribute membership updates, along with application-provided messages.
We evaluate the platform under simulation and on a real-world deployment on PlanetLab. We find that it imposes minimal bandwidth overhead, is able to react quickly to node failures and changes in the system membership, and can scale to substantial size.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
http://www.usenix.org/event/usenix09/tech/