Coda: A Highly Available File System for a Distributed Workstation Environment
IEEE Transactions on Computers
Disconnected operation in the Coda File System
ACM Transactions on Computer Systems (TOCS)
Exploiting weak connectivity for mobile file access
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Automated hoarding for mobile computers
Proceedings of the sixteenth ACM symposium on Operating systems principles
Perspectives on optimistically replicated, peer-to-peer filing
Software—Practice & Experience
Rumor: Mobile Data Access Through Optimistic Peer-to-Peer Replication
ER '98 Proceedings of the Workshops on Data Warehousing and Data Mining: Advances in Database Technologies
Roam: A Scalable Replication System for Mobile Computing
DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
The LOCUS distributed operating system
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Resolving file conflicts in the Ficus file system
USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
Detection of Mutual Inconsistency in Distributed Systems
IEEE Transactions on Software Engineering
Eyo: device-transparent personal storage
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
| Hi-index | 0.00 |
Many mobile environments require optimistic replication for improved performance and reliability. Peer-to-peer replication strategies provide advantages over traditional client-server models by enabling any-to-any communication. These advantages are especially useful in mobile environments, when communicating with close peers can be cheaper than communicating with a distant server. However, most peer solutions require that all replicas store the entire replication unit. Such strategies are inefficient and expensive, forcing users to store unneeded data and to spend scarce resources maintaining consistency on that data. We have developed a set of algorithms and controls that implement selective replication, the ability to independently replicate individual portions of the large replication unit. We present a description of the algorithms and their implementation, as well as a performance analysis. We argue that these methods permit the practical use of peer optimistic replication.