How to design optimistic operations for peer-to-peer replication
- Hyun-Gul Roh 0, Jin-Soo Kim, Joon-Won Lee
- Corresponding Author
- Hyun-Gul Roh
0Korea Advanced Institute of Science and Technology
Available Online undefined NaN.
- https://doi.org/10.2991/jcis.2006.245How to use a DOI?
- Distributed systems, optimistic replication, consistency, optimistic operations
- As collaboration over the Internet becomes an everyday affair, it is increasingly important to provide high quality of interactivity. Distributed applications can replicate collaborative objects at every site for the purpose of achieving high interactivity. Replication, however, has a fatal weakness that it is difficult to maintain consistency among replicas. This paper introduces operation commutativity as a key principle in designing operations in order to manage distributed replicas consistent. In addition, we suggest effective schemes that make operations commutative using the relations of objects and operations. Finally, we apply our approaches to some simple replicated abstract data types, and achieve their consistency without serialization and locking.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Hyun-Gul Roh AU - Jin-Soo Kim AU - Joon-Won Lee PY - NaN/NaN DA - NaN/NaN TI - How to design optimistic operations for peer-to-peer replication BT - 9th Joint International Conference on Information Sciences (JCIS-06) PB - Atlantis Press UR - https://doi.org/10.2991/jcis.2006.245 DO - https://doi.org/10.2991/jcis.2006.245 ID - RohNaN/NaN ER -