A flexible and robust lookup algorithm for P2P systems

One of the most critical operations performed in a P2P system is the lookup of a resource. The main issues to be addressed by lookup algorithms are: (1) support for flexible search criteria (e.g., wildcard or multi-keyword searches), (2) effectiveness - i.e., ability to identify all the resources that match the search criteria, (3) efficiency - i.e. low overhead, (4) robustness with respect to node failures and churning. Flood-based P2P networks provide flexible lookup facilities and robust performance at the expense of high overhead, while other systems (e.g. DHT) provide a very efficient lookup mechanism, but lacks flexibility. In this paper, we propose a novel resource lookup algorithm, namely fuzzy-DHT, that solves this trade-off by introducing a flexible and robust lookup criteria based on multiple keywords on top of a distributed hash table algorithm. We demonstrate that the fuzzy-DHT algorithm satisfies all the requirements of P2P lookup systems combining the flexibility of flood-based mechanisms while preserving high efficiency, effectiveness ad robustness.

[1]  Yuh-Jzer Joung,et al.  Keyword Search in DHT-Based Peer-to-Peer Networks , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[2]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[3]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[4]  Duane Wessels,et al.  Cache Digests , 1998, Comput. Networks.

[5]  Yunhao Liu,et al.  Efficient multi-keyword search over p2p web , 2008, WWW.

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

[7]  Arun K. Somani,et al.  CompuP2P: An Architecture for Internet Computing Using Peer-to-Peer Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[8]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

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

[10]  Nathaniel Leibowitz,et al.  ARE FILE SWAPPING NETWORKS CACHEABLE? CHARACTERIZING P2P TRAFFIC , 2002 .

[11]  Zhichen Xu,et al.  pSearch: information retrieval in structured overlays , 2003, CCRV.

[12]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[13]  Amin Vahdat,et al.  Efficient Peer-to-Peer Keyword Searching , 2003, Middleware.

[14]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

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

[16]  Michalis Faloutsos,et al.  Is P2P dying or just hiding? [P2P traffic measurement] , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[17]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[18]  Philip S. Yu,et al.  Analysis of peer-to-peer systems: workload characterization and effects on traffic cacheability , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[19]  Kien A. Hua,et al.  ZIGZAG: an efficient peer-to-peer scheme for media streaming , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[21]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

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

[23]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[24]  Miguel Castro,et al.  Scalable Application-Level Anycast for Highly Dynamic Groups , 2003, Networked Group Communication.

[25]  Aruna Seneviratne,et al.  The cost of application-level broadcast in a fully decentralized peer-to-peer network , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[26]  Bin Liu,et al.  Supporting Complex Multi-Dimensional Queries in P2P Systems , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[27]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[28]  Antony I. T. Rowstron,et al.  Squirrel: a decentralized peer-to-peer web cache , 2002, PODC '02.

[29]  Muneer O. Bani Yassein,et al.  On the Performance of Probabilistic Flooding in Mobile Ad Hoc Networks , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[30]  Michele Amoretti,et al.  Performance evaluation of advanced routing algorithms for unstructured peer-to-peer networks , 2006, valuetools '06.