By Topic

Research Algorithm Based on Ant-Cooperation for Grid Service

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jibo Liu ; Dept. of Comput. & Electron. Eng., Hunan Bus. Coll., Changsha ; Chunhua Hu ; Peidong Zhu

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.

Published in:

Grid and Cooperative Computing, 2007. GCC 2007. Sixth International Conference on

Date of Conference:

16-18 Aug. 2007