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

Abstract

Peer-to-peer networks have received considerable attention due to properties such as scalability, availability, and anonymity. In peer-to-peer networks, indices are used to map data id to nodes that host the data. Previous work showed that the performance of locating data in peer-to-peer networks can be improved by passively caching passing-by indices. The performance can be further improved by actively pushing indices to interested nodes. This paper proposes a Dynamic-tree based Update Propagation (DUP) scheme to propagate the indices in peer-to-peer networks. DUP dynamically 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. Simulation results show that DUP not only reduces the overall cost of the index propagation and index access, but also results in much lower index query latency compared to existing schemes