Kyriakos Kritikos , Information Systems Laboratory, Institute of Computer Science, Foundation for Research and Technology - Hellas, Heraklion
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSC.2013.11
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 non-functional aspect should be considered for filtering and selecting among these services. The state-of-the-art approaches in non-functional 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.
Measurement, Vegetation, Accuracy, Semantics, Programming, Catalogs, Transforms, Constrained optimization, Services Computing, Web Services, Web Services Discovery, Application Services and Standards, Solution-Level Quality of Service, Solution-Level QoS Framework, Web Services Standard Stack, Quality of Service, Computing Methodologies, Symbolic and algebraic manipulation, Algorithms, Performance evaluation of algorithms and systems, Artificial Intelligence, Problem Solving, Control Methods, and Search, Constraint satisfaction, Mathematics of Computing, Numerical Analysis, Optimization, Linear programming, Optimization
Kyriakos Kritikos, "Novel Optimal and Scalable Non-Functional Service Matchmaking Techniques", IEEE Transactions on Services Computing, , no. 1, pp. 1, PrePrints PrePrints, doi:10.1109/TSC.2013.11