|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Peer Review Status:||Refereed|
|Title:||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|
|Conference Name:||8th IEEE Consumer Communications and Networking Conference (CCNC)|
|Conference Dates:||2011-01-09 - 2011-01-12|
|Conference Location:||Las Vegas, NV|
|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.|
|Status:||AM - Accepted Manuscript|
|Rights:||Published in IEEE Consumer Communications and Networking Conference (CCNC), 2011. © Copyright 2011 IEEE. © 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.|
|ccnc-2011-jamie.pdf||Fulltext - Accepted Version||1.08 MB||Adobe PDF||View/Open|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.