Distributed Log-based Reconciliation

  • Authors:

  • Yek Loong Chong;Youssef Hamadi

  • Affiliations:

  • University of Cambridge, Computer Laboratory, 15 J J Thomson Avenue, Cambridge CB3 0FD, United Kingdom, ylc21@hermes.cam.ac.uk;Microsoft Research Ltd., 7 J J Thomson Avenue, Cambridge CB3 0FB, United Kingdom, youssefh@microsoft.com

  • Venue:
  • Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this work, we present four distributed algorithms for log-based reconciliation, an important NP-hard problem occurring in CSCW. Our methods remove the classical drawbacks of centralized systems like single point of failure, performance bottleneck and loss of autonomy. The problem is formalized using the Distributed Constraint Satisfaction paradigm (DisCSP). In the worst case, the message passing complexity of our methods range from O(p2) to O(2p) in a system of p nodes. Experimental results confirm our theoretical analysis and allow us to establish quality and efficiency trade-off for each method.