Quality driven web services composition
WWW '03 Proceedings of the 12th international conference on World Wide Web
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
Service Selection Algorithms for Web Services with End-to-End QoS Constraints
CEC '04 Proceedings of the IEEE International Conference on E-Commerce Technology
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Management Science
Adaptive Service Composition in Flexible Processes
IEEE Transactions on Software Engineering
Investigating web services on the world wide web
Proceedings of the 17th international conference on World Wide Web
A Scalable Approach for QoS-Based Web Service Selection
Service-Oriented Computing --- ICSOC 2008 Workshops
Multi-attribute optimization in service selection
World Wide Web
A hybrid approach for efficient Web service composition with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
A decomposition-based approach for service composition with global QoS guarantees
Information Sciences: an International Journal
Hi-index | 0.00 |
Since increasing services are deployed and published, service composition selection has became a crucial issue of Service-Oriented Computing (SOC). To address the issue, the paper proposed a novel selection algorithm based on the principle of divide and rule. We first construct a linear programming model to describe service selection problem; we then decompose the model into small subproblems by means of resource-directive decomposition technique. To obtain near-to-optimal resource allocation, we employ subgradient algorithm to search appropriate solution. To demonstrate our approach, we conducted a series of experiments to compare the performance of our approach with others.