Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Maintaining Temporal Coherency of Virtual Data Warehouses
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Consistency Maintenance In Peer-to-Peer File Sharing Networks
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Performance Analysis of Distributed Search in Open Agent Systems
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Maintaining Mutual Consistency for Cached Web Objects
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Cache Updates in a Peer-to-Peer Network of Mobile Agents
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Adaptive searching and replication of images in mobile hierarchical peer-to-peer networks
Data & Knowledge Engineering
Near-optimal dynamic replication in unstructured peer-to-peer networks
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Peer-to-peer architectures for massively multiplayer online games: A Survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
In peer-to-peer systems, replication is an important issue as it improves search performance and data availability. It has been shown that optimal replication is attained when the number of replicas per item is proportional to the square root of their popularity. In this paper, we focus on updates in the case of optimal replication. In particular, we propose a new practical strategy for achieving square root replication called pull-then-push replication (PtP). With PtP, after a successful search, the requesting node enters a replicate-push phase where it transmits copies of the item to its neighbors. We show that updating the replicas can be significantly improved through an update-push phase where the node that created the copies propagates any updates it has received using similar parameters as in replicate-push. Our experimental results show that replicate-push coupled with an update-push strategy achieves good replica placement and consistency with small message overhead.