Integer and combinatorial optimization
Integer and combinatorial optimization
Multimedia Systems
Supporting QoS for ubiquitous multimedia service delivery
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Workflow management with service quality guarantees
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Dynamic and adaptive composition of e-services
Information Systems - The 12th international conference on advanced information systems engineering (CAiSE 00)
Heuristic Solutions for the Multiple-Choice Multi-dimension Knapsack Problem
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Quality driven web services composition
WWW '03 Proceedings of the 12th international conference on World Wide Web
Computational Techniques of the Simplex Method
Computational Techniques of the Simplex Method
Declarative Composition and Peer-to-Peer Provisioning of Dynamic Web Services
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
A DAML-Based Repository for QoS-Aware Semantic Web Service Selection
ICWS '04 Proceedings of the IEEE International Conference on Web Services
DAML-QoS Ontology for Web Services
ICWS '04 Proceedings of the IEEE International Conference on Web Services
QoS computation and policing in dynamic web service selection
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Global and Local QoS Constraints Guarantee in Web Service Selection
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
Computers and Operations Research
YAWL: yet another workflow language
Information Systems
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
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
Q-Peer: A Decentralized QoS Registry Architecture for Web Services
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Combining global optimization with local selection for efficient QoS-aware service composition
Proceedings of the 18th international conference on World wide web
SOA Middleware Support for Service Process Reconfiguration with End-to-End QoS Constraints
ICWS '09 Proceedings of the 2009 IEEE International Conference on Web Services
Mixed-Integer Programming for QoS-Based Web Service Matchmaking
IEEE Transactions on Services Computing
Transactional and QoS-aware dynamic service composition based on ant colony optimization
Future Generation Computer Systems
Efficient anytime algorithm for large-scale QoS-aware web service composition
International Journal of Web and Grid Services
A novel service selection based on resource-directive decomposition
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Control-Flow Patterns for Decentralized RESTful Service Composition
ACM Transactions on the Web (TWEB)
QoS-aware web services composition using GRASP with Path Relinking
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Dynamic selection of Web services at runtime is important for building flexible and loosely-coupled service-oriented applications. An abstract description of the required services is provided at design-time, and matching service offers are located at runtime. With the growing number of Web services that provide the same functionality but differ in quality parameters (e.g., availability, response time), a decision needs to be made on which services should be selected such that the user's end-to-end QoS requirements are satisfied. Although very efficient, local selection strategy fails short in handling global QoS requirements. Solutions based on global optimization, on the other hand, can handle global constraints, but their poor performance renders them inappropriate for applications with dynamic and realtime requirements. In this article we address this problem and propose a hybrid solution that combines global optimization with local selection techniques to benefit from the advantages of both worlds. The proposed solution consists of two steps: first, we use mixed integer programming (MIP) to find the optimal decomposition of global QoS constraints into local constraints. Second, we use distributed local selection to find the best Web services that satisfy these local constraints. The results of experimental evaluation indicate that our approach significantly outperforms existing solutions in terms of computation time while achieving close-to-optimal results.