School of Natural Sciences >
Computing Science and Mathematics >
Computing Science and Mathematics Book Chapters and Sections >
Please use this identifier to cite or link to this item:
|Appears in Collections:||Computing Science and Mathematics Book Chapters and Sections|
|Title: ||Improving Wide Area P2P Service Discovery Mechanisms using Complex Queries|
|Author(s): ||Furness, Jamie|
|Contact Email: ||email@example.com|
|Editor(s): ||Prasad, Anand R.|
Buford, John F.
Gurbani, Vijay K.
|Citation: ||Furness J & Kolberg M (2011) Improving Wide Area P2P Service Discovery
Mechanisms using Complex Queries. In: Prasad Anand R., Buford John F., Gurbani
Vijay K. (ed.). Future Internet Services and Service Architectures. The River
Publishers Series in Communications, Aalborg, Denmark: River Publishers, pp.
|Issue Date: ||2011|
|Publisher: ||River Publishers|
|Series/Report no.: ||The River Publishers Series in Communications,|
|Abstract: ||With smartphones and other network enabled consumer devices becoming
increasingly popular, the number of available services and their complexity is
growing considerably. With an increasingly large and dynamic environment it is
important that users have a comprehensive yet efficient mechanism to discover
these services. Many existing wide-area service discovery mechanisms are
centralised and do not scale to large amounts of users. Peer-to-peer networks
however have been prove to scale well, and can be used to provide not just a
platform on which peers can offer and use services without relying on a
centralised resource, but also as a means of service discovery. There are
various wide-area peer-to-peer service discovery mechanisms that allow discovery
of services via their attributes, however the majority are limited to keyword
matching and do not support other types of complex queries. This chapter starts
with a review of complex queries and existing approaches which provide support
for such queries. We illustrate the use of blind search in Distributed Hash
Tables (DHTs) to provide support for all types of complex queries, such as wild-
card search, range queries, and even regular expressions. Using blind search
allows for processing the search query at every node within the network,
supporting queries as complex as required. However due to the nature of
broadcast trees search performance suffers under high churn levels; to combat
this we note that data is already replicated within the network for redundancy.
This can be further used to improve the success rate of blind search when under
high churn. Finally, we present novel results considering churn level vs
replication of data.|
|Rights: ||The publisher has not yet responded to our queries therefore this work cannot be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author; you can only request a copy if you wish to use this work for your own research or private study.|
|Affiliation: ||University of Stirling|
Computing Science - CSM Dept
Files in This Item:
|book-chapter-angsa.pdf||1.3 MB||Adobe PDF||Under Embargo
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
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.