An update propagation strategy considering access frequency in peer-to-peer networks

Authors:
Toshiki Watanabe;Akimitsu Kanzaki;Takahiro Hara;Shojiro Nishio
Affiliations:
Dept. of Multimedia Eng., Graduate School of Information Science and Technology, Osaka University, Suita, Osaka, Japan;Dept. of Multimedia Eng., Graduate School of Information Science and Technology, Osaka University, Suita, Osaka, Japan;Dept. of Multimedia Eng., Graduate School of Information Science and Technology, Osaka University, Suita, Osaka, Japan;Dept. of Multimedia Eng., Graduate School of Information Science and Technology, Osaka University, Suita, Osaka, Japan
Venue:
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Year:
2008

Citing 5
Cited 0

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
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
An efficient update propagation algorithm for P2P systems

Computer Communications
An Update Propagation Strategy for Delay Reduction and Node Failure Tolerance in Peer-to-Peer Networks

AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a P2P network, a data update occurred on a particular peer should be immediately propagated to other peers holding its replicas. In our previous work, we proposed a novel update propagation strategy using a tree structure for delay reduction and node failure tolerance. This strategy propagates the updated data according to the tree. In this paper, we extend our previous strategy to selectively propagate each updated data considering the data access frequency of each peer. The extended strategy propagates the updated data to peers which frequently access the data, whereas only a small message informing that the replica has become invalid is propagated to peers which rarely access the data.