By Topic

A Feasibility Study of an Arbitrary Search in Structured Peer-to-Peer Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jani Hautakorpi ; Ericsson Res. NomadicLab, Jorvas, Finland ; Goran Schultz

Search algorithms have been a widely studied topic in the context of Peer-to-Peer (P2P) networks. Generally speaking, unstructured P2P networks, such as Gnutella, are used for performing arbitrary searches (i.e., the form of a search request is not restricted) and structured networks, such as the ones based on Distributed Hash Table algorithms, are used for performing exact searches (i.e., the form of a search request is restricted). In this paper we study the feasibility of an arbitrary search algorithm in structured P2P networks. Intuitively, structured P2P networks are not well-suited for performing arbitrary searches, but our study shows that this is not the case. According to our simulation results, arbitrary searches can be implemented on top of structured P2P networks in an efficient, incrementally deployable, and scalable manner.

Published in:

Computer Communications and Networks (ICCCN), 2010 Proceedings of 19th International Conference on

Date of Conference:

2-5 Aug. 2010