Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFurness, Jamieen_UK
dc.contributor.authorKolberg, Marioen_UK
dc.description.abstractAbstract-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.en_UK
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_UK
dc.relationFurness 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.
dc.rightsPublished 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.en_UK
dc.subjectCollaboration Toolsen_UK
dc.subjectComputer science Mathematicsen_UK
dc.titleConsidering Complex Search Techniques in DHTs Under Churnen_UK
dc.typeConference Paperen_UK
dc.type.statusAM - Accepted Manuscripten_UK
dc.citation.btitleIEEE Consumer Communications and Networking Conference (CCNC), 2011en_UK
dc.citation.conferencedates2011-01-09 - 2011-01-12en_UK
dc.citation.conferencelocationLas Vegas, NVen_UK
dc.citation.conferencename8th IEEE Consumer Communications and Networking Conference (CCNC)en_UK
dc.contributor.affiliationUniversity of Stirlingen_UK
dc.contributor.affiliationComputing Scienceen_UK
rioxxterms.typeConference Paper/Proceeding/Abstracten_UK
local.rioxx.authorFurness, Jamie|en_UK
local.rioxx.authorKolberg, Mario|0000-0002-0930-2385en_UK
local.rioxx.projectInternal Project|University of Stirling|
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings

Files in This Item:
File Description SizeFormat 
ccnc-2011-jamie.pdfFulltext - Accepted Version1.08 MBAdobe PDFView/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

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.