DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks

Authors:
Liangzhong Yin;Guohong Cao
Affiliations:
Pennsylvania State University;Pennsylvania State University
Venue:
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Year:
2005

Citing 1
Cited 3

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

Popularity adaptive search in hybrid P2P systems

Journal of Parallel and Distributed Computing
CMV: File consistency maintenance through virtual servers in peer-to-peer systems

Journal of Parallel and Distributed Computing
A proactive low-overhead file replication scheme for structured P2P content delivery networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In peer-to-peer networks, indices are used to map data id to nodes that host the data. The performance of data access can be improved by actively pushing indices to interested nodes. This paper proposes the Dynamic-tree based Update Propagation (DUP) scheme, which builds the update propagation tree to facilitate the propagation of indices. Because the update propagation tree only involves nodes that are essential for update propagation, the overhead of DUP is very small and the query latency is significantly reduced.