ABSTRACT
While our understanding of eventual consistency for replicated data has improved considerably over the past few years, relatively little work focused on eventually-consistent distributed data structures. By revisiting PL-Gossip, our self-managed, decentralized algorithm for maintaining cluster hierarchies in wireless sensor networks, this paper illustrates sample problems one is likely to encounter when dealing with such structures. Given the growing interest in analyzing huge, dynamic, inter-dependent data sets, we believe that the paper will inspire research to facilitate understanding and devising eventually-consistent distributed data structures.
- A. Bieniusa, M. Zawirski, N. Preguiça, M. Shapiro, C. Baquero, V. Balegas, and S. Duarte. Brief announcement: Semantics of eventually consistent replicated sets. In Proceedings of the 26th International Conference on Distributed Computing, DISC'12, pages 441--442, Berlin, Heidelberg, 2012. Springer-Verlag. ISBN 978-3-642-33650-8. Google ScholarDigital Library
- S. Burckhardt, D. Leijen, M. Fähndrich, and M. Sagiv. Eventually consistent transactions. In Proceedings of the 21st European Conference on Programming Languages and Systems, ESOP'12, pages 67--86, Berlin, Heidelberg, 2012. Springer-Verlag. ISBN 978-3-642-28868-5. Google ScholarDigital Library
- S. Burckhardt, A. Gotsman, and H. Yang. Understanding eventual consistency. Technical Report MSR-TR-2013-39, Microsoft Research, March 2013.Google Scholar
- R. Cheng, J. Hong, A. Kyrola, Y. Miao, X. Weng, M. Wu, F. Yang, L. Zhou, F. Zhao, and E. Chen. Kineograph: Taking the pulse of a fast-changing and connected world. In Proceedings of the 7th ACM European Conference on Computer Systems, EuroSys '12, pages 85--98, New York, NY, USA, 2012. ACM. ISBN 978-1-4503-1223-3. Google ScholarDigital Library
- G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: Amazon's highly available key-value store. In Proceedings of Twenty-first ACM SIGOPS Symposium on Operating Systems Principles, SOSP '07, pages 205--220, New York, NY, USA, 2007. ACM. ISBN 978-1-59593-591-5. Google ScholarDigital Library
- A. Fekete, D. Gupta, V. Luchangco, N. Lynch, and A. Shvartsman. Eventually-serializable data services. In Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, PODC '96, pages 300--309, New York, NY, USA, 1996. ACM. ISBN 0-89791-800-2. Google ScholarDigital Library
- K. Iwanicki. Hierarchical Routing in Low-Power Wireless Networks. PhD thesis, Vrije Universiteit Amsterdam, Amsterdam, the Netherlands, June 2010.Google Scholar
- K. Iwanicki and M. van Steen. Using area hierarchy for multi-resolution storage and search in large wireless sensor networks. In Communications, 2009. ICC '09. IEEE International Conference on, pages 1--6, June 2009. Google ScholarDigital Library
- K. Iwanicki and M. van Steen. Gossip-based self-management of a recursive area hierarchy for large wireless sensornets. Parallel and Distributed Systems, IEEE Transactions on, 21 (4):562--576, April 2010. ISSN 1045-9219. Google ScholarDigital Library
- K. Iwanicki and M. Van Steen. A case for hierarchical routing in low-power wireless embedded networks. ACM Trans. Sen. Netw., 8(3):25:1--25:34, Aug. 2012. ISSN 1550-4859. Google ScholarDigital Library
- P. R. Johnson and R. Thomas. Maintenance of duplicate databases, 1975.Google Scholar
- U. Kang, C. Tsourakakis, and C. Faloutsos. Pegasus: A peta-scale graph mining system implementation and observations. In Data Mining, 2009. ICDM '09. Ninth IEEE International Conference on, pages 229--238, Dec 2009. Google ScholarDigital Library
- P. Levis, N. Patel, D. Culler, and S. Shenker. Trickle: A self-regulating algorithm for code propagation and maintenance in wireless sensor networks. In Proceedings of the 1st Conference on Symposium on Networked Systems Design and Implementation - Volume 1, NSDI'04, pages 2--2, Berkeley, CA, USA, 2004. USENIX Association. Google ScholarDigital Library
- S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu. The broad-cast storm problem in a mobile ad hoc network. In Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, MobiCom '99, pages 151--162, New York, NY, USA, 1999. ACM. ISBN 1-58113-142-9. Google ScholarDigital Library
- M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski. A comprehensive study of Convergent and Commutative Replicated Data Types. Technical Report RR-7506, INRIA, January 2011.Google ScholarDigital Library
- M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski. Conflict-free replicated data types. In Proceedings of the 13th International Conference on Stabilization, Safety, and Security of Distributed Systems, SSS'11, pages 386--400, Berlin, Heidelberg, 2011. Springer-Verlag. ISBN 978-3-642-24549-7. Google ScholarDigital Library
- D. B. Terry, M. M. Theimer, K. Petersen, A. J. Demers, M. J. Spreitzer, and C. H. Hauser. Managing update conflicts in bayou, a weakly connected replicated storage system. In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles, SOSP '95, pages 172--182, New York, NY, USA, 1995. ACM. ISBN 0-89791-715-4. Google ScholarDigital Library
Index Terms
Beyond replicated storage: eventually-consistent distributed data structures
Recommendations
Adaptive Consistency Guarantees for Large-Scale Replicated Services
NAS '08: Proceedings of the 2008 International Conference on Networking, Architecture, and StorageTo maintain consistency, designers of replicated services have traditionally been forced to choose from either strong consistency guarantees or none at all. Realizing that a continuum between strong and optimistic consistencies is semantically ...
Replicated data types: specification, verification, optimality
POPL '14Geographically distributed systems often rely on replicated eventually consistent data stores to achieve availability and performance. To resolve conflicting updates at different replicas, researchers and practitioners have proposed specialized ...
Comments