作者: Elias Leontiadis , Vassilios V. Dimakopoulos , Evaggelia Pitoura
DOI: 10.1007/11823285_107
关键词: Overhead (computing) 、 Computer science 、 Replication (computing) 、 Node (networking) 、 Distributed computing 、 Peer-to-peer 、 Focus (computing) 、 Consistency (database systems) 、 Replica
摘要: In peer-to-peer systems, replication is an important issue as it improves search performance and data availability. It has been shown that optimal attained when the number of replicas per item proportional to square root their popularity. this paper, we focus on updates in case replication. particular, propose a new practical strategy for achieving called pull-then-push (PtP). With PtP, after successful search, requesting node enters replicate-push phase where transmits copies its neighbors. We show updating can be significantly improved through update-push created propagates any received using similar parameters replicate-push. Our experimental results coupled with achieves good replica placement consistency small message overhead.