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 AntCooperation 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 valiaity.It is an effective service recourse search algorithm in grid environments.
Grid service Resource search Connected dominating sets Ant cooperation
Jibo Liu Chunhua Hu Peidong Zhu
Department of Computer and Electronic Engineering, Hunan Business College, Changsha 410205, China School of Computer Science, National University of Defense Technology, Changsha 410073, China
国际会议
第六届网格与协同计算国际会议(The Sixth International Conference on Grid and Cooperative Computing GCC 2007)
乌鲁木齐
英文
49-56
2007-08-16（万方平台首次上网日期，不代表论文的发表时间）