Issue No. 04 - Oct.-Dec. (2014 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSC.2013.11
Kyriakos Kritikos , Information Systems Laboratory, Institute of Computer Science, Foundation for Research and Technology-Hellas (FORTH), Heraklion, Crete, Greece
Dimitris Plexousakis , Information Systems Laboratory, Institute of Computer Science, Foundation for Research and Technology-Hellas (FORTH), Heraklion, Crete, Greece
Service-orientation paves the way for the Internet of Services (IoS), where millions of services will be available to realize the everyday user applications or tasks. Consequently, as a great number of functionally equivalent services will be available for a specific user task, the service nonfunctional aspect should be considered for filtering and selecting among these services. The state-of-the-art approaches in nonfunctional service discovery exploit constraint solving techniques to optimize the matchmaking time between a service offer and demand pair. However, they do not scale well, as matchmaking time is proportional to the offer number, so they are not yet suitable for the IoS. To this end, this article proposes three novel alternative techniques that intelligently organize the service offer space to improve the overall matchmaking time. These techniques are theoretically and experimentally evaluated. The results show that all techniques optimize the matchmaking time without sacrificing accuracy and that each technique is better in different circumstances.
Service-oriented architecture, Semantics, Programming, Transforms,performance evaluation, QoS, service, discovery, matchmaking, mixed-integer programming
Kyriakos Kritikos, Dimitris Plexousakis, "Novel Optimal and Scalable Nonfunctional Service Matchmaking Techniques", IEEE Transactions on Services Computing, vol. 7, no. , pp. 614-627, Oct.-Dec. 2014, doi:10.1109/TSC.2013.11