Disconnected operation in the Coda File System
ACM Transactions on Computer Systems (TOCS)
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Perspectives on optimistically replicated, peer-to-peer filing
Software—Practice & Experience
The LOCUS distributed operating system
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Roam: a scalable replication system for mobile and distributed computing
Roam: a scalable replication system for mobile and distributed computing
Concise version vectors in WinFS
DISC'05 Proceedings of the 19th international conference on Distributed Computing
CPI: A Novel Three-Phase Algorithm for QoS-Aware Replica Placement Problem
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
Device transparency: a new model for mobile storage
ACM SIGOPS Operating Systems Review
Eyo: device-transparent personal storage
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
Hi-index | 0.00 |
This paper describes an enhanced replica synchronization mechanism built in Microsoft's WinFS replica management system. The system reconciles autonomously-operating replicas in a completely peer-to-peer manner, without employing a central master or locking. The main challenge is for two replicas to exchange meta-information efficiently about (potentially numerous) data objects in order to discover what updates they are missing, and detect conflicts. The paper introduces a novel bundling mechanisms called VS, that groups together multiple objects and represents their state in a single version-vector. VS provides improved storage and communication overheads over previously known optimistic replication schemes, in the following sense. Under normal, low-fault situations, it maintains and communicates as little as a single version vector in order to represent precedence ordering of the entire set of data objects. Moreover, under settings of severe communication disruptions, VS degenerates to no worse than a single vector per object. This dramatically improves the complexities described in a preliminary write-up of the WinFS replication scheme. The VS mechanism has potentially wide applicability as a mechanism for compactly handling synchronization of arbitrarily overlapping groups of objects.