ACM Transactions on Programming Languages and Systems (TOPLAS)
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Serialization of concurrent operations in a distributed collaborative environment
GROUP '97 Proceedings of the international ACM SIGGROUP conference on Supporting group work: the integration challenge
Operational transformation in real-time group editors: issues, algorithms, and achievements
CSCW '98 Proceedings of the 1998 ACM conference on Computer supported cooperative work
ACM Computing Surveys (CSUR)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Squirrel: a decentralized peer-to-peer web cache
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
A Competitive Dynamic Data Replication Algorithm
Proceedings of the Ninth International Conference on Data Engineering
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Consistency Maintenance In Peer-to-Peer File Sharing Networks
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Update Propagation through Replica Chain in Decentralized and Unstructured P2P Systems
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
| Hi-index | 0.00 |
Peer-to-peer (P2P) has become a mainstream architecture in numerous diverse distributed applications. However current P2P systems do not provide consistency guarantees under multiple reader multiple writer scenarios. Such a feature is desirable as well as necessary for supporting more diverse applications than merely file-sharing systems. In this paper, we develop a highly scalable and efficient algorithm, called Consistency Maintenance through Virtual servers (CMV), in P2P systems. In this algorithm, consistency of each dynamic file is maintained by a Virtual Server (VS). A file update can only be accepted through the VS to ensure one-copy serializability consistency. The VS of a file is a logical network composed of multiple Replica Peers (RPs) that have replicas of the file. Mathematical analysis is performed for optimal parameter selections that achieve minimum overhead messages for maintaining file consistency. Simulation experiments are conducted to compare the performance of the proposed CMV algorithm with two existing schemes, namely the rumor spreading based scheme and the Update Propagation Through Replica Chain (UPTReC) scheme. Our results show that CMV can quickly commit update to the system and significantly reduce (by more than 90%) overhead messages compared to these schemes under various system conditions.