A Fast Heuristic Algorithm for the Composite Web Service Selection
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Capturing web services provider constraints: an algorithmic approach
CBSE'07 Proceedings of the 10th international conference on Component-based software engineering
Establishing composite SLAs through concurrent QoS negotiation with surplus redistribution
Concurrency and Computation: Practice & Experience
QoS-aware automatic service composition: a graph view
Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
Ant-based service selection framework for a smart home monitoring environment
Multimedia Tools and Applications
| Hi-index | 0.00 |
Nowadays, Web services are usually aggregated into a composite one to satisfy customer's more and more complex requirements. Generally, there may be several different candidate services to carry out one task in a composite service, so a choice needs to be made to help users select the most suitable one. Based on the quality of services, this paper generates a Weighted Multistage Graph for composite service, and transforms the problem of service selection into the one of how to get a longest path. Considering the problem of Interface Matching, this paper presents a 3-layer Web service organization model (WS3LM), which can help get an executable composite service. This paper describes and compares two types of selection approaches: one type of local optimal selection and the other type of global optimal selection using Exhaustive Search Algorithm, Dynamic Programming.