A semantic QoS-based web service discovery engine for over-constrained QoS demands

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The success of the Web Service (WS) paradigm has led to a proliferation of available WSs. Semantic discovery mechanisms have been invented to overcome UDDI's syntactic discovery solution by providing more precise results. However, the problem remains as many functionally-equivalent WSs are returned. Its solution comes in terms of semantic QoS-based description and discovery of WSs. We have already presented a rich and extensible ontology language for QoS-based WS description that is called OWL-Q and we have proposed a semantic QoS metric matching algorithm. Based on this algorithm, we have extended a Constraint-Programming-based approach for QoS-based WS discovery. In this paper, we show an extension of OWL-Q with SWRL rules and propose a modification to the metric matching algorithm to make it more feasible. Moreover, we propose and analyze an automated approach for semantic QoS-based WS discovery that provides solutions even for over-constrained QoS-based WS demands. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kritikos, K., & Plexousakis, D. (2009). A semantic QoS-based web service discovery engine for over-constrained QoS demands. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4907 LNCS, pp. 151–164). https://doi.org/10.1007/978-3-540-93851-4_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free