This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
37th Annual IEEE Conference on Local Computer Networks
Resource and query aware, peer-to-peer-based multi-attribute Resource Discovery
Clearwater Beach, FL, USA USA
October 22-October 25
ISBN: 978-1-4673-1565-4
H. M. N. Dilum Bandara, Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, 80523, USA
Anura P. Jayasumana, Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, 80523, USA
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.
Index Terms:
Indexes,Peer to peer computing,Collaboration,Load modeling,Cloud computing,Load management,Dynamic scheduling,resource discovery,Load balancing,peer-to-peer
Citation:
H. M. N. Dilum Bandara, Anura P. Jayasumana, "Resource and query aware, peer-to-peer-based multi-attribute Resource Discovery," lcn, pp.276-279, 37th Annual IEEE Conference on Local Computer Networks, 2012
Usage of this product signifies your acceptance of the Terms of Use.