DocumentCode :
2910249
Title :
Fast Quality Driven Selection of Composite Web Services
Author :
Jang, Jae-Ho ; Shin, Dong-Hoon ; Lee, Kyong-Ho
Author_Institution :
Dept. of Comput. Sci., Yonsei Univ.
fYear :
2006
fDate :
Dec. 2006
Firstpage :
87
Lastpage :
98
Abstract :
The composite Web service selection is the process of building an executable composite Web service. Generally, the selection process involves decision making in terms of non-functional properties of Web services such as QoS requirements. Since the number of Web services is rapidly increasing and the QoS of the Web services environment changes dynamically, the fast selection is important. This paper presents a fast method for quality driven composite Web services selection based on a workflow partition strategy. The proposed method partitions an abstract workflow into two sub-workflows to decrease the number of candidate services that should be considered. A mixed integer linear programming is utilized for solving the service selection problem. Experimental results show that the partition strategy performed faster than the optimal strategy. Also, the qualities of the selected composite Web services are not significantly different from the optimal one
Keywords :
Web services; integer programming; linear programming; quality of service; QoS requirements; mixed integer linear programming; optimal strategy; quality driven composite Web service selection; workflow partition strategy; Capacity planning; Computer science; Costs; Decision making; Delay; Large-scale systems; Monitoring; Quality of service; Service oriented architecture; Web services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Web Services, 2006. ECOWS '06. 4th European Conference on
Conference_Location :
Zurich
Print_ISBN :
0-7695-2737-X
Type :
conf
DOI :
10.1109/ECOWS.2006.21
Filename :
4031153
Link To Document :
بازگشت