Small World-Clustering-Based Grid Resource Search Algorithm
XU Hui-min · Beijing Youdian Xueyuan xuebao · 2006
There are a great deal and various types of resource in a distributed grid environment.A grid resource search algorithm: small-world-clustering-based routing algorithm was described to improve the search and location of diverse properties.According to the small world theory,the clustering center was used to the grade diffuse and the request for performing a well-ordered search from a global view.In order to improve scalability,a few shortcuts with distant peers were inserted into the routing tables with some probabilities,and then the average path length was reduced.The preliminary simulation results show that the key clustering algorithm with shortcuts is efficient and scalable.