16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008) (2006)
Feb. 15, 2006 to Feb. 17, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDP.2006.68
Matteo Mordacchini , INFN Sezione di Padova, via Marzolo, Padova, Italy
Moreno Marzolla , Universita Ca? Foscari di Venezia, via Torino, Italy
Salvatore Orlando , ISTI Area della Ricerca CNR, via G. Moruzzi , Pisa, Italy
Locating data on peer-to-peer networks is a complex issue addressed by many P2P protocols. Most of the research in this area only considers static content, that is, it is often assumed that data in P2P systems do not vary over time. In this paper we describe a data location strategy for dynamic content on P2P networks. Data location exploits a distributed index based on bit vectors: this index is used to route queries towards areas of the system where matches can be found. The bit vectors can be efficiently updated when data is modified. Simulation results show that the proposed algorithms for queries and updates propagation have good performances, also on large networks, even if content exhibits a high degree of variability.
Matteo Mordacchini, Moreno Marzolla, Salvatore Orlando, "Tree Vector Indexes: Efficient Range Queries for Dynamic Content on Peer-to-Peer Networks", 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008), vol. 00, no. , pp. 457-464, 2006, doi:10.1109/PDP.2006.68