The Community for Technology Leaders
2013 42nd International Conference on Parallel Processing (2007)
Xi'an, China
Sept. 10, 2007 to Sept. 14, 2007
ISSN: 0190-3918
ISBN: 0-7695-2933-X
pp: 7
Yiming Zhang , NUDT, China
Dongsheng Li , NUDT, China
Xicheng Lu , NUDT, China
Lei Chen , Hong Kong University of Science and Technology, Hong Kong
Searching in large-scale unstructured peer-to-peer networks is challenging due to the lack of effective hint information to guide queries. In this paper, we propose POP, a Parallel, cOllaborative and Probabilistic search mechanism, in which query messages are viewed as search units to collaborate with each other and aggregate the distributed hints during the search process. A scheme called Distributed Bloom Filter (DBF) is presented to propagate the hints with a bandwidth-aware manner, in which a node divides the received Bloom filter vector into subvectors and disseminates the fragments to its neighbors according to their bandwidth capacity. The effectiveness of POP is demonstrated through theoretical analysis and extensive simulations.
Yiming Zhang, Dongsheng Li, Xicheng Lu, Lei Chen, "Collaborative Search in Large-scale Unstructured Peer-to-Peer Networks", 2013 42nd International Conference on Parallel Processing, vol. 00, no. , pp. 7, 2007, doi:10.1109/ICPP.2007.26
94 ms
(Ver 3.3 (11022016))