How to design optimistic operations for peer-to-peer replication

DOI

10.2991/jcis.2006.245How to use a DOI?

Keywords

Distributed systems, optimistic replication, consistency, optimistic operations

Abstract

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.

Copyright

© 2006, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Hyun-Gul Roh
AU  - Jin-Soo Kim
AU  - Joon-Won Lee
PY  - 2006/10
DA  - 2006/10
TI  - How to design optimistic operations for peer-to-peer replication
BT  - Proceedings of the 9th Joint International Conference on Information Sciences (JCIS-06)
PB  - Atlantis Press
SP  - 299
EP  - 302
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2006.245
DO  - 10.2991/jcis.2006.245
ID  - Roh2006/10
ER  -