Research Algorithm Based on Ant-Cooperation for Grid Service

It is very important for Web service to be located as quickly as possible in grid environments. Based on the fact of the default of the existing service resource locating methods,the research algorithm based on ant-cooperation for Web service is presented in the paper. In this algorithm, the resource management model is constructed by the minimum connected dominating sets, which shows a good performance in decreasing location time.Theoretical analysis shows the minimum dominating sets proposed is connected each other. Ant cooperation is applied to resolve the service search problem in different connected dominating sets in the paper. The approach is evaluated by comprehensive experiments, and the results show that it is feasible and applicable. Compared with other service recourse research algorithms, it shows some characters such as high performance and validity. It is an effective service recourse search algorithm in grid environments.

[1]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[2]  Marco Dorigo,et al.  Ant algorithms and stigmergy , 2000, Future Gener. Comput. Syst..

[3]  Warren Smith,et al.  A Resource Management Architecture for Metacomputing Systems , 1998, JSSPP.

[4]  Jun Zhang,et al.  Grid Resource Discovery Based on a Routing-Transferring Model , 2002, GRID.

[5]  Yong Meng Teo,et al.  A DHT-Based Grid Resource Indexing and Discovery Scheme , 2005 .

[6]  Klara Nahrstedt,et al.  A distributed resource management architecture that supports advance reservations and co-allocation , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[7]  Huai Jinpeng,et al.  Research and Implementation of an Active Distributed Web Service Registry , 2006 .

[8]  Rajkumar Buyya,et al.  GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing , 2002, Concurr. Comput. Pract. Exp..

[9]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[10]  Domenico Talia,et al.  Peer-to-Peer Models for Resource Discovery in Large-Scale Grids: A Scalable Architecture , 2006, VECPAR.

[11]  Andrew S. Tanenbaum,et al.  Globe: a wide area distributed system , 1999, IEEE Concurr..

[12]  Ian T. Foster,et al.  Grid information services for distributed resource sharing , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.