Resource Discovery Algorithm Based on Small-World Cluster in Hierarchical Grid Computing Environment

Authors:
Yan Ma;Bin Gong;Lida Zou
Affiliations:
-;-;-
Venue:
GCC '08 Proceedings of the 2008 Seventh International Conference on Grid and Cooperative Computing
Year:
2008

Citing 0
Cited 2

Defining Minimum Requirements of Inter-Collaborated Nodes by Measuring the Weight of Node Interactions

International Journal of Distributed Systems and Technologies
ISW: Interest-Based Small World Network of P2P

International Journal of Software Science and Computational Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Grid is an environment of seamless and integrated sharing and collaboration. The heterogeneous, dynamic, various and autonomous characteristics of resources make grid resource discovery a challenging issue. Hierarchical grid computing environment (hierarchical grid for short) with many advantages is far and wide used. This paper introduces small-world cluster into hierarchical grid in which intra-cluster adopts centralized management and cluster center nodes form small-world network. The architecture strikes a balance between high efficiency of total centralized management and good scalability of absolute distributed disposal. In the process of constructing small-world network, a new construction method on the basis of NW (Newman-Watts) model is presented, that is, short range contacts and long range contacts are represented by routing tables in a logic and dynamic way not by Manhattan distance. SWRD (Small-World Resource Discovery) algorithm pertinent to user classification and data retrieval way is proposed. Results from simulation experiments demonstrate SWRD algorithm greatly prunes search space and improves query efficiency.