A protocol for discovering content adaptation services
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
A hybrid approach for efficient Web service composition with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Towards optimizing the non-functional service matchmaking time
Proceedings of the 21st international conference companion on World Wide Web
Scatter/Gather browsing of web service QoS data
Future Generation Computer Systems
A QoS-aware composition method supporting cross-platform service invocation in cloud environment
Journal of Computer and System Sciences
User-centered design of a QoS-based web service selection system
Service Oriented Computing and Applications
Low-Cost Web Service Discovery Based on Distributed Decision Tree in P2P Environments
Wireless Personal Communications: An International Journal
Task model-driven realization of interactive application functionality through services
ACM Transactions on Interactive Intelligent Systems (TiiS)
Goal-based business service composition
Service Oriented Computing and Applications
Resource virtualization and service selection in cloud logistics
Journal of Network and Computer Applications
| Hi-index | 0.00 |
QoS-based Web Service (WS) discovery has been recognized as the main solution for filtering and selecting between functionally equivalent WSs stored in registries or other types of repositories. There are two main techniques for QoS-based WS matchmaking (filtering): ontology-based and Constraint Programming (CP)-based. Unfortunately, the first technique is not efficient as it is based on the rather immature technology of ontology reasoning, while the second one is not accurate as it is based on syntactic QoS-based descriptions and faulty matchmaking metrics. In our previous work, we have developed an extensible and rich ontology language for QoS-based WS description. Moreover, we have devised a semantic alignment algorithm for aligning QoS-based WS descriptions so as to increase the accuracy of QoS-based WS matchmaking algorithms. Finally, we have developed two alternative CP-based QoS-based WS matchmaking algorithms: a unary-constrained and n-ary-constrained one. In this paper, we claim that Mixed-Integer Programming (MIP) should be used as a matchmaking technique instead of CP and we provide experimental results proving it. In addition, we analyze and experimentally evaluate our matchmaking algorithms against a competing techniques one in order to demonstrate their efficiency and accuracy.