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

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.