By Topic

Range Query Using Learning-Aware RPS in DHT-Based 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
$31 $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

5 Author(s)
Ze Deng ; Sch. of Comput., Huazhong Univ. of Sci. & Technol., Wuhan ; Dan Feng ; Ke Zhou ; Zhan Shi
more authors

Range query in Peer-to-Peer networks based on Distributed Hash Table (DHT) is still an open problem. The traditional way uses order-preserving hashing functions to create value indexes that are placed and stored on the corresponding peers to support range query. The way, however, suffers from high index maintenance costs. To avoid the issue, a scalable blind search method over DHTs - recursive partition search (RPS) can be used. But, RPS still easily incurs high network overhead as network size grows. Thus, in this paper, a learning-aware RPS (LARPS) is proposed to overcome the disadvantages of two approaches above mentioned. Extensive experiments show LARPS is a scalable and robust approach for range query, especially in the following cases: (a) query range is wide, (b) the requested resources follow Zipf distribution, and (c) the number of required resources is small.

Published in:

Cluster Computing and the Grid, 2009. CCGRID '09. 9th IEEE/ACM International Symposium on

Date of Conference:

18-21 May 2009