P2P logging and timestamping for XWiki
Authors: 
Mounir Tlili, W. Kokou Dedzoé, Esther Pacitti, 
Patrick Valduriez, Reza Akbarinia, Ludovic Dubost, Sergiu Dumitriu, Stéphane Laurière, Gérôme Canals, 
Pascal Molli, Julien MaireAuthors Info & Claims
Article No.: 25, Pages 1 - 4
Abstract
Collaborative applications are getting an increasing interest as a result of the rapid progress in distributed technologies such as grid computing. P2P applications, and mobile computing. Constructing these applications on top of P2P networks has many advantages which stem from P2P properties: decentralization, self-organization, scalability and fault-tolerance
In this paper, we address data replication and reconciliation in XWiki peer-to-peer (P2P) collaborative application. We propose a new mechanism of optimistic replication, which consists of an algorithm for data reconciliation based on operational transformation approach (OT) and an extension of KTS service that performs distributed timestamp generation running over a distributed hash table (DHT). While updating at collaborating XWiki peers, updates are timestamped and stored in a highly available P2P log. During reconciliation, these updates are retrieved in total order to enforce eventual consistencies.
The work presented here is partially supported by the National Agency of Research within RNTL XWiki Concerto project (2007--2009).
References
[1]
E. Pacitti, O. Dedieu. Algorithms for optimistic replication on the Web. Journal of the Brazilian Computing Society, 8(2): 179--183, 2002.
[2]
I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup service for internet applications. In Proc. of the ACM SIGCOMM Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications, 149--160, San Diego, California, August 2001.
[3]
Java RMI. http://java.sun.com
[4]
Open Chord version 1.0.2 User's Manual. http://www.unibamberg.de
[5]
P. Molli, G. Oster, H. Skaf-Molli, A. Imine. Using the transformational approach to build a safe and generic data synchronizer. ACM SIGGROUP Conference on Supporting Group Work, (GROUP), 212--220, 2003.
[6]
R. Akbarinia, E. Pacitti, P. Valduriez. Data Currency in Replicated DHTs. ACM SIGMOD Int. Conf. on Management of Data, Beijing, China, 211--222, 2007.
[7]
REST:http://dev.xwiki.org/xwiki/bin/view/Design/XWikiPat chService.
[8]
XWiki: http://www.xwiki.org
[9]
XWiki Concerto: http://concerto.xwiki.com
Index Terms
- P2P logging and timestamping for XWiki
Recommendations
Scalable P2P Reconciliation Infrastructure for Collaborative Text Editing
DBKDA '10: Proceedings of the 2010 Second International Conference on Advances in Databases, Knowledge, and Data ApplicationsWe address the problem of optimistic replication forcollaborative text editing in Peer-to-Peer (P2P) systems. This problem is challenging because of concurrent updating at multiple peers and dynamic behavior of peers. Operationaltransformation (OT) is a ...
Trustworthiness of Acquaintances in Peer-to-Peer(P2P) Overlay Networks
CISIS '10: Proceedings of the 2010 International Conference on Complex, Intelligent and Software Intensive SystemsSystems using peer-to-peer (P2P) overlay networks are getting a central position in information systems. P2P systems are in nature fully distributed, with no centralized coordinator and each peer is autonomous. Each peer has to obtain information on ...
LH*RSP2P: a scalable distributed data structure for P2P environment
NOTERE '08: Proceedings of the 8th international conference on New technologies in distributed systemsLH*RSP2P is a Scalable Distributed Data Structure (SDDS) designed for P2P applications. It stores and processes data on SDDS peer nodes. Each node is both an SDDS client and, actually or potentially, an SDDS server with application or parity data. The ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
June 2008
399 pages
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- Lyon 1 University
- SIGAPP: ACM Special Interest Group on Applied Computing
- Mairie de Villeurbanne
- Conseil Général du Rhône
- INSA Lyon: Institut National des Sciences Appliquées de Lyon
- Conseil Régional Rhône-Alpes
- Mutuelle d'assurance MAIF
- I.U.T.A LYON 1: Institute of Technology Lyon 1
- Ministère de l'Enseignement Supérieur et de la Recherche
- Lyon 2 University
- ISTASE: High-Level Engineering School in Telecommunication
- France Telecom
- LIRIS: Lyon Research Center for Images and Intelligent Information Systems
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 23 June 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 100Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 14 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in