By Topic

Resource and query aware, peer-to-peer-based multi-attribute Resource Discovery

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)
Bandara, H.M.N.D. ; Dept. of Electr. & Comput. Eng., Colorado State Univ., Fort Collins, CO, USA ; Jayasumana, A.P.

Distributed, multi-attribute Resource Discovery (RD) is a fundamental requirement in collaborative Peer-to-Peer (P2P), grid, and cloud computing. We present an efficient and load balanced, P2P-based multi-attribute RD solution that consists of five heuristics, which can be executed independently and distributedly. First heuristic maintains a minimum number of nodes in a ring-like overlay consequently reducing the cost of resolving range queries. Second and third heuristics dynamically balance the key and query load by transferring keys to neighbors and by adding new neighbors when existing ones are insufficient. Last two heuristics, namely fragmentation and replication, form cliques of nodes that are placed orthogonal to the overlay ring to dynamically balance the highly skewed key and query loads while reducing the query cost. By applying these heuristics in the presented order, a RD solution that better responds to real-world resource and query characteristics is developed. Simulations using real workloads are used to demonstrate its efficacy.

Published in:

Local Computer Networks (LCN), 2012 IEEE 37th Conference on

Date of Conference:

22-25 Oct. 2012