The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems (2005)
Columbus, Ohio, USA
June 6, 2005 to June 10, 2005
ISSN: 1063-6927
ISBN: 0-7695-2331-5
pp: 199-208
John Carter , University of Utah
Sai Susarla , University of Utah
<p>The lack of a flexible consistency management solution hinders P2P implementation of applications involving updates, such as read-write file sharing, directory services, online auctions and wide area collaboration. Managing mutable shared data in a P2P setting requires a consistency solution that can operate efficiently over variable-quality failure-prone networks, support pervasive replication for scaling, and give peers autonomy to tune consistency to their sharing needs and resource constraints. Existing solutions lack one or more of these features.</p> <p>In this paper, we describe a new consistency model for P2P sharing of mutable data called composable consistency, and outline its implementation in a wide area middleware file service called Swarm¹. Composable consistency lets applications compose consistency semantics appropriate for their sharing needs by combining a small set of primitive options. Swarm implements these options efficiently to support scalable, pervasive, failure-resilient, wide-area replication behind a simple yet flexible interface. We present two applications to demonstrate the expressive power and effectiveness of composable consistency: a wide area file system that outperforms Coda in providing close-to-open consistency overWANs, and a replicated BerkeleyDB database that reaps order-of-magnitude performance gains by relaxing consistency for queries and updates.</p>
John Carter, Sai Susarla, "Flexible Consistency for Wide Area Peer Replication", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 199-208, 2005, doi:10.1109/ICDCS.2005.38
90 ms
(Ver 3.3 (11022016))