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.