distance-aware bloom filters enabling collaborative search for efficient resource discovery：（distance-aware布鲁姆过滤器使合作寻找有效的资源发现）.pdfVIP

Future Generation Computer Systems 29 (2013) 1621–1630 Contents lists available at SciVerse ScienceDirect Future Generation Computer Systems journal homepage: /locate/fgcs Distance-aware bloom filters: Enabling collaborative search for efficient resource discovery Yiming Zhang a,∗, Ling Liu b a School of Computer, National University of Defense Technology, Changsha 410073, China b College of Computing, Georgia Institute of Technology, Atlanta, GA 30332-0280, USA a r t i c l e i n f o a b s t r a c t Article history: Resource discovery in large-scale Peer-to-Peer (P2P) networks is challenging due to lack of effective Received 9 December 2011 methods for guiding queries. Based on the observation that the effectiveness of P2P resource discovery is Received in revised form determined by the utilization of hints, i.e., a summary of where the resources are, scattered in the network, 8 August 2012 in this paper we propose the distance-aware bloom filters (DABF) that disseminate hint information Accepted 22 August 2012 to faraway nodes by decaying BFs with different deterministic masks. Based on DABF, we design a Available online 7 September 2012 novel Collaborative P2P Search (CPS) mechanism, which supports intelligent message behaviors including suspend, resume, terminate, move, reside, dispatch, notify and order. The effectiveness of our proposals is Keywords: Peer-to-Peer demonstrated through theoretica