Considering Complex Search Techniques in DHTs Under Churn

Citation

Furness J & Kolberg M (2011) Considering Complex Search Techniques in DHTs Under Churn. In: IEEE Consumer Communications and Networking Conference (CCNC), 2011. 8th IEEE Consumer Communications and Networking Conference (CCNC), Las Vegas, NV, 09.01.2011-12.01.2011. Institute of Electrical and Electronics Engineers (IEEE), pp. 559-564. https://doi.org/10.1109/CCNC.2011.5766542

Abstract
Abstract-Traditionally complex queries have been performed over unstructured P2P networks by means of flooding, which is inherently inefficient due to the large number of redundant messages generated. While Distributed Hash Tables (DHTs) can provide very efficient look-up operations, they traditionally do not provide any methods for complex queries. By exploiting the structure inherent in DHTs we can perform complex querying over structured P2P networks by means of efficiently broadcasting the search query. This allows every node in the network to process the query locally, and hence is as powerful and flexible as flooding in unstructured networks, but without the inefficiency of redundant messages. While there have been various approaches proposed for broadcasting search queries over DHTs, the focus has not been on validation under churn. Comparing blind search methods for DHTs through simulation we see that churn, in particular nodes leaving the network, has a large impact on query success rate. In this paper we present novel results comparing blind search over Chord and Pastry while under varying levels of churn. We further consider how different data replication strategies can be used to enhance the query success rate.

Keywords
; Collaboration Tools; Computer science Mathematics

• ccnc-2011-jamie.pdf