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

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.

[1]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[2]  Miguel Castro,et al.  SCRIBE: The Design of a Large-Scale Event Notification Infrastructure , 2001, Networked Group Communication.

[3]  Edith Cohen,et al.  Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.

[4]  Jun Xu.  On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks , 2004, IEEE Journal on Selected Areas in Communications.

[5]  Guohong Cao,et al.  A scalable low-latency cache invalidation strategy for mobile environments , 2000, MobiCom '00.

[6]  Mary Baker,et al.  CUP: Controlled Update Propagation in Peer-to-Peer Networks , 2003, USENIX Annual Technical Conference, General Track.

[7]  Chengjie Liu,et al.  Maintaining Strong Cache Consistency in the World Wide Web , 1998, IEEE Trans. Computers.

[8]  Forouzan Golshani,et al.  Proceedings of the Eighth International Conference on Data Engineering , 1992 .

[9]  Sushil Jajodia,et al.  An adaptive data replication algorithm , 1997, TODS.

[10]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[11]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[12]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[13]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[14]  Li Xiao,et al.  On reliable and scalable peer-to-peer Web document sharing , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[15]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[16]  Margo I. Seltzer,et al.  World Wide Web Cache Consistency , 1996, USENIX Annual Technical Conference.

[17]  Ben Y. Zhao,et al.  Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.

[18]  Evangelos P. Markatos,et al.  Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).