Implementing Dynamic Querying Search in K-ARY DHT-Based Overlays

Distributed Hash Tables (DHTs) provide scalable mechanisms for implementing resource discovery services in structured Peer-To-Peer (P2P) networks. However, DHT-based lookups do not support some types of queries that are fundamental in several classes of applications. A way to support arbitrary queries in structured P2P networks is implementing unstructured search techniques on top of DHT-based overlays. This approach has been exploited in the design of DQ-DHT, a P2P search algorithm that combines the Dynamic Querying (DQ) technique used in unstructured networks with an algorithm for efficient broadcast over a DHT.