By Topic

Dynamic Pick Method of Web Service Selection Algorithms Based on Use Mode in Self-adaptive Web Service Composition

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

5 Author(s)
Li Guohong ; Sch. of Inf. Sci. & Eng., Software Coll. Northeastern Univ., Shenyang, China ; Na Jun ; Zhang Bin ; Dong Pengxiang
more authors

To solve the contradiction between self-adaptive efficiency and optimization effect existing in the execution of current self-adaptive Web service composition, this paper proposes a dynamic pick method of Web service selection algorithms based on use mode. The dynamic pick method chooses service selection algorithm which best fits the runtime self-adaptive situation as adaptive strategy in self-adaptive Web service composite. And to achieve the dynamic pick, this paper presents two estimation methods of service selection algorithm's execution time in different ways. Through implementation and analysis, this paper adopts an associative way of two estimation methods. At last, this paper implements and tests the dynamic pick method. Test results show that the dynamic pick method based on use mode can effectively relieve the contradiction.

Published in:

Service Sciences (IJCSS), 2011 International Joint Conference on

Date of Conference:

25-27 May 2011