JCSE, vol. 6, no. 2, pp.89-104, June, 2012
Dominance-Based Service Selection Scheme with Concurrent
Chaogang Tang, Qing Li, Yan Xiong, Shiting Wen, An Liu, Farong Zhong
Department of Computer Science and Technology, University of Science and Technology of China, Hefei; Department of Computer Science, City University of Hong Kong, Hong Kong, China/ Department of Computer Science, City University of Hong Kong, Hong Kong, China/ Department of Computer Science and Technology, University of Science and Technology of China, Hefei, China/ Department of Computer Science and Technology, University of Science and Technology of China, Hefei; State Key Laboratory of Software Engineering, Wuhan University, China/ Department of Computer Science, Zhejiang Normal University, Jinhua, China
Abstract: In dynamic Web service environments, the performance of the Internet is unpredictable; the reliability and effectiveness
of remote Web services are also unclear. Therefore, it can hardly be guaranteed that the quality of Web service (QoWS)
attributes of Web services do not fluctuate with the dynamic Web service environments. When a composite service is
planned in the context of dynamic service environments, there is another aspect which has not been taken into account by
existing works, namely, concurrency - the fact that multiple requests to a composite service may arrive at the same time.
Considering the dynamics of Web service environments and concurrency of requests, we propose in this paper a service
selection scheme which adopts top-k dominating queries to generate a composition solution rather than only select the
best composition solution for a given request. The experimental results have investigated the efficiency and effectiveness
of our approach and shown that it outperforms baseline and traditional methods for service selection.
Dynamics; Dominance; top-k; Concurrency; Service selection
Full Paper: 167 Downloads, 1847 View