Distance-aware bloom filters: Enabling collaborative search for efficient resource discovery

Resource discovery in large-scale Peer-to-Peer (P2P) networks is challenging due to lack of effective methods for guiding queries. Based on the observation that the effectiveness of P2P resource discovery is determined by the utilization of hints, i.e., a summary of where the resources are, scattered in the network, in this paper we propose the distance-aware bloom filters (DABF) that disseminate hint information to faraway nodes by decaying BFs with different deterministic masks. Based on DABF, we design a 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 demonstrated through theoretical analysis and extensive simulations, in which we observed a remarkable reduction in search latency over previous approaches.

[1]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.

[2]  Domenico Talia,et al.  A DHT-based semantic overlay network for service discovery , 2012, Future Gener. Comput. Syst..

[3]  Rajeev Rastogi,et al.  Accelerating Lookups in P2P Systems using Peer Caching , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[4]  Zhang Yi.  An Efficient Search Algorithm for Large-Scale P2P Systems , 2008 .

[5]  Emmanouel A. Varvarigos,et al.  Scheduling efficiency of resource information aggregation in grid networks , 2012, Future Gener. Comput. Syst..

[6]  Abhishek Kumar,et al.  Efficient and scalable query routing for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  Yunhao Liu,et al.  False Negative Problem of Counting Bloom Filter , 2010, IEEE Transactions on Knowledge and Data Engineering.

[8]  Anthony A. Maciejewski,et al.  Overlay network resource allocation using a decentralized market-based approach , 2012, Future Gener. Comput. Syst..

[9]  Yuan He,et al.  Receiver-oriented design of Bloom filters for data-centric routing , 2010, Comput. Networks.

[10]  Laura Ricci,et al.  Gossip Communities: Collaborative Filtering Through Peer-to-Peer Overlays (Extended Abstract) , 2010, SEBD.

[11]  Evaggelia Pitoura,et al.  Content-Based Routing of Path Queries in Peer-to-Peer Systems , 2004, EDBT.

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

[13]  George Varghese,et al.  Beyond bloom filters: from approximate membership checks to approximate state machines , 2006, SIGCOMM.

[14]  Jie Wu,et al.  Hint-based routing in WSNs using scope decay bloom filters , 2006, 2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06).

[15]  Yiming Zhang,et al.  Survey of DHT topology construction techniques in virtual computing environments , 2011, Science China Information Sciences.

[16]  Yi-Ming Zhang.  An Efficient Search Algorithm for Large-Scale P2P Systems: An Efficient Search Algorithm for Large-Scale P2P Systems , 2008 .

[17]  Hai Jin,et al.  Scalable DHT- and ontology-based information service for large-scale grids , 2010, Future Gener. Comput. Syst..

[18]  Saeed Ebadi,et al.  A new distributed and hierarchical mechanism for service discovery in a grid environment , 2011, Future Gener. Comput. Syst..

[19]  Jussi Kangasharju,et al.  Explaining BubbleStorm: Resilient, Probabilistic, and Exhaustive PeertoPeer Search , 2007, SIGCOMM 2007.

[20]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[21]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[22]  Jiehua Zhu,et al.  National Natural Science Foundation of China (NSFC) , 2013 .

[23]  Leili Mohammad Khanli,et al.  FRDT: Footprint Resource Discovery Tree for grids , 2011, Future Gener. Comput. Syst..

[24]  Richard P. Martin,et al.  PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[25]  Robbert van Renesse,et al.  Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining , 2003, TOCS.

[26]  Leandro Navarro-Moldes,et al.  Network-aware summarisation for resource discovery in P2P-content networks , 2012, Future Gener. Comput. Syst..

[27]  Jie Wu,et al.  The Dynamic Bloom Filters , 2010, IEEE Transactions on Knowledge and Data Engineering.

[28]  Naveen K. Chilamkurti,et al.  Capacity and load-aware service discovery with service selection in peer-to-peer grids , 2012, Future Gener. Comput. Syst..

[29]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[30]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[31]  Scott Shenker,et al.  Minimizing churn in distributed systems , 2006, SIGCOMM.

[32]  Christos Doulkeridis,et al.  Skyline-based Peer-to-Peer Top-k Query Processing , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[33]  Dimitrios Gunopulos,et al.  A local search mechanism for peer-to-peer networks , 2002, CIKM '02.

[34]  Hector Garcia-Molina,et al.  Efficient search in peer to peer networks , 2004 .

[35]  Ramachandran Baskaran,et al.  QoS enhancements for global replication management in peer to peer networks , 2012, Future Gener. Comput. Syst..

[36]  Laura Ricci,et al.  Service and Resource Discovery supports over P2P overlays , 2009, 2009 International Conference on Ultra Modern Telecommunications & Workshops.

[37]  Hai Jin,et al.  A novel data replication mechanism in P2P VoD system , 2012, Future Gener. Comput. Syst..

[38]  John Kubiatowicz,et al.  Probabilistic location and routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[39]  Wei Peng,et al.  An efficient random walks based approach to reducing file locating delay in unstructured P2P network , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..