Version vectors based synchronization engine for mobile devices

Authors:
Carlos Quiroz Castro;Timo Pakkala
Affiliations:
Software and Application Technologies Laboratory, Nokia Research Center, NOKIA Group, Finland;Software and Application Technologies Laboratory, Nokia Research Center, NOKIA Group, Finland
Venue:
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Year:
2007

Citing 2
Cited 0

The Hash History Approach for Reconciling Mutual Inconsistency

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Optimistic replication

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current synchronization engines are mainly designed to reconcile data repositories between multiple clients and a central server on a star-like topology. A different approach is needed to achieve synchronization on peer-to-peer topologies where any node can be both client and server and updates may happen independently. Version vectors are one solution to the problem, ensuring global convergence of the datasets and providing straightforward conflict detection, while letting applications to control the conflict resolution semantics in their specific domain. In this paper an implementation of a synchronization engine for contact data in mobile devices using version vectors is presented. The engine is capable of optimistically synchronizing databases among many nodes in a peer-to-peer fashion.