Tag Routing for Efficient Blind Search in Peer-to-Peer Networks

A variety of algorithms have been developed for Blind Search (BS) over peer-to-peer (P2P) overlay networks, i.e., search of resources without any routing information for the exact location of the target resource. All these algorithms generate significant amount of duplicate query messages to increase the success rate. In this paper, we introduce tag routing search - a novel framework for BS over P2P overlay networks structured by Distributed Hash Tables (DHTs). A query message in this framework contains a tag that affect the selection of next hop nodes. We propose two specific algorithms: Zigzag Modified Breadth First Search with Local Indices (ZMBFS+L) and Recursive Partitioning Search (RPS). ZMBFS+L achieves high success rate with less duplications compared to other known BS algorithms. RPS, taking advantage of the DHT structure, does not generate any message duplication by design, thus is a very efficient broadcasting algorithm, and can achieve 100% success rate efficiently.