A flexible and robust lookup algorithm for P2P systems

Mauro Andreolini, Riccardo Lancellotti
2009 2009 IEEE International Symposium on Parallel & Distributed Processing  
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
more » ... mance 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.
doi:10.1109/ipdps.2009.5160900 dblp:conf/ipps/AndreoliniL09 fatcat:bu3lycrrn5ca7aqboartkwpbku