Unraveling the Web Services Web: An Introduction to SOAP, WSDL, and UDDI
IEEE Internet Computing
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
Constraint Driven Web Service Composition in METEOR-S
SCC '04 Proceedings of the 2004 IEEE International Conference on Services Computing
Heuristics for QoS-aware Web Service Composition
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Autonomous service level agreement negotiation for service composition provision
Future Generation Computer Systems
Adaptive Service Composition in Flexible Processes
IEEE Transactions on Software Engineering
Combining global optimization with local selection for efficient QoS-aware service composition
Proceedings of the 18th international conference on World wide web
Optimizing QoS-Aware Semantic Web Service Composition
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Selecting skyline services for QoS-based web service composition
Proceedings of the 19th international conference on World wide web
Partitioning composite web services for decentralized execution using a genetic algorithm
Future Generation Computer Systems
A workflow framework for intelligent service composition
Future Generation Computer Systems
Transactional and QoS-aware dynamic service composition based on ant colony optimization
Future Generation Computer Systems
Dynamic web service selection group decision-making method based on hybrid QoS
International Journal of High Performance Computing and Networking
Review: Cloud computing service composition: A systematic literature review
Expert Systems with Applications: An International Journal
QoS-aware web services composition using GRASP with Path Relinking
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The quality of service (QoS)-aware service composition (QSC) problem is to find an execution plan of a service composition process which can ensure that the quality of service meets given user requirements. This paper proposes a branch and bound for execution plan selection (BB4EPS) algorithm to solve the QSC problem. In the proposed BB4EPS algorithm, a universal QoS model is used to evaluate the QoS parameters for service composition, and the QSC problem is modeled as an extended flexible constraint satisfaction framework, in which the utility function is applied to build the objective function. Numerical simulation results show that the proposed algorithm is feasible and effective.