Please use this identifier to cite or link to this item:
Title: Evaluation of contact synchronization algorithms for the Android platform
Author: Pascual Seguí, Vincent
Xhafa, Fatos
Others: Universitat Politècnica de Catalunya
Universitat Oberta de Catalunya (UOC)
Keywords: data communications
data synchronization
mobile computing
Issue Date: Jun-2013
Publisher: Mathematical and Computer Modelling
Citation: Seguí Pascual, V. & Xhafa, F. (2013). Evaluation of contact synchronization algorithms for the android platform. Mathematical and Computer Modelling, 57(11-12), 2895-2903. doi: 10.1016/j.mcm.2011.12.039
Also see:
Abstract: Synchronization protocols have been widely investigated in distributed systems aiming to achieve real-time and scalable properties. With the fast development of large-scale distributed systems, and due to their heterogenous nature involving wired, wireless, and mobile nodes, synchronization has again come into play. In this work, we have studied contact synchronization and handling, which is an important feature in corporate environments. Indeed, it has become very important to support collaboration of teams of mobile users by enabling anytime and anywhere access to shared contact data. We characterize the problem as a distributed systems problem, identify its desirable properties, and outline its main characteristics. A simple algorithm is proposed as an efficient solution to contact synchronization when some nodes of the system are assumed to be mobile phones under the Android operating system. The features required at both ends of the distributed system are explained in order to guarantee the correctness of the algorithm. We also analyze the implementation of the algorithm coupling the Android platform and the SugarCRM server, and provide an experimental evaluation of the performance of the proposed approach.
Language: English
ISSN: 0895-7177MIAR
Appears in Collections:Articles

Files in This Item:
File SizeFormat 
android.pdf410.39 kBAdobe PDFView/Open

Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.