A Semantic Framework for Priority-based Service Matching in Pervasive Environments

The increasing popularity of personal wireless devices has raised new demands for the efficient discovery of heterogeneous devices and services in pervasive environments. The existing approaches such as Jini [1], UPnP [8], etc., describe services at a syntactic level and the matching mechanisms in these approaches are limited to syntactic comparisons based on attributes or interfaces. In order to overcome the limitations in these approaches, there has been an increased interest in the use of semantic description and matching techniques to support effective service discovery. This paper proposes a semantic matching approach which facilitates the discovery of device-based services in a pervasive environment; the approach provides a ranking facility that orders services according to their suitability and also considers priorities placed on individual requirements in a request during the matching process. The evaluation studies have shown that the matcher results correlate reasonably well with human judgement

A Semantic Approach for Description and Ranked Matching of Services in Pervasive Environments

With the recent developments in technology, new and diverse devices are being introduced into the pervasive world. This has raised new challenges for the discovery of devices and their services in dynamic environments. The existing approaches such as Jini [AOSJ99], UPnP [UPnP06], etc., describe services at a syntactic level and the matching mechanisms in these approaches are limited to syntactic comparisons based on attributes or interfaces. In order to overcome the limitations of these approaches, there has been an increasing interest in the use of Semantic Web technologies to support the description and matching of services. This paper proposes a semantic matching framework to facilitate effective discovery of device based services in pervasive environments. This offers a ranking mechanism that will order the available services in the order of their suitability; the evaluation of the experimental results have indicated that the results correlate well with human perception

Two-fold Semantic Web service matchmaking – applying ontology mapping for service discovery

Semantic Web Services (SWS) aim at the automated discovery and orchestration of Web services on the basis of comprehensive, machine-interpretable semantic descriptions. Since SWS annotations usually are created by distinct SWS providers, semantic-level mediation, i.e. mediation between concurrent semantic representations, is a key requirement for SWS discovery. Since semantic-level mediation aims at enabling interoperability across heterogeneous semantic representations, it can be perceived as a particular instantiation of the ontology mapping problem. While recent SWS matchmakers usually rely on manual alignments or subscription to a common ontology, we propose a two-fold SWS matchmaking approach, consisting of (a) a general-purpose semantic-level mediator and (b) comparison and matchmaking of SWS capabilities. Our semantic-level mediation approach enables the implicit representation of similarities across distinct SWS by grounding service descriptions in so-called Mediation Spaces (MS). Given a set of SWS and their respective grounding, a SWS matchmaker automatically computes instance similarities across distinct SWS ontologies and matches the request to the most suitable SWS. A prototypical application illustrates our approach

Semantic-driven matchmaking of web services using case-based reasoning

With the rapid proliferation of Web services as the medium of choice to securely publish application services beyond the firewall, the importance of accurate, yet flexible matchmaking of similar services gains importance both for the human user and for dynamic composition engines. In this paper, we present a novel approach that utilizes the case based reasoning methodology for modelling dynamic Web service discovery and matchmaking. Our framework considers Web services execution experiences in the decision making process and is highly adaptable to the service requester constraints. The framework also utilises OWL semantic descriptions extensively for implementing both the components of the CBR engine and the matchmaking profile of the Web services

A Framework for Dynamic Web Services Composition

Dynamic composition of web services is a promising approach and at the same time a challenging research area for the dissemination of service-oriented applications. It is widely recognised that service semantics is a key element for the dynamic composition of Web services, since it allows the unambiguous descriptions of a service's capabilities and parameters. This paper introduces a framework for performing dynamic service composition by exploiting the semantic matchmaking between service parameters (i.e., outputs and inputs) to enable their interconnection and interaction. The basic assumption of the framework is that matchmaking enables finding semantic compatibilities among independently defined service descriptions. We also developed a composition algorithm that follows a semantic graph-based approach, in which a graph represents service compositions and the nodes of this graph represent semantic connections between services. Moreover, functional and non-functional properties of services are considered, to enable the computation of relevant and most suitable service compositions for some service request. The suggested end-to-end functional level service composition framework is illustrated with a realistic application scenario from the IST SPICE project

Grid service discovery with rough sets

Copyright [2008] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.The computational grid is evolving as a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Service discovery becomes an issue of vital importance in utilising grid facilities. This paper presents ROSSE, a Rough sets based search engine for grid service discovery. Building on Rough sets theory, ROSSE is novel in its capability to deal with uncertainty of properties when matching services. In this way, ROSSE can discover the services that are most relevant to a service query from a functional point of view. Since functionally matched services may have distinct non-functional properties related to Quality of Service (QoS), ROSSE introduces a QoS model to further filter matched services with their QoS values to maximise user satisfaction in service discovery. ROSSE is evaluated in terms of its accuracy and efficiency in discovery of computing services

A Pragmatic Approach for the Semantic Description and Matching of Pervasive Resources

The increasing popularity of personal wireless devices has raised new demands for the efficient discovery of heterogeneous devices and services in pervasive environments. With the advancement of the electronic world, the diversity of available services is increasing rapidly. %This raises new demands for the efficient discovery and location of heterogeneous services and resources in dynamically changing environments. Traditional approaches for service discovery describe services at a syntactic level and the matching mechanisms available for these approaches are limited to syntactic comparisons based on attributes or interfaces. In order to overcome these limitations, there has been an increased interest in the use of semantic description and matching techniques to support effective service discovery. In this paper, we present a semantic matching approach to facilitate the discovery of device-based services in pervasive environments. The approach includes a ranking mechanism that orders services according to their suitability and also considers priorities placed on individual requirements in a request during the matching process. The solution has been systematically evaluated for its retrieval effectiveness and the results have shown that the matcher results agree reasonably well with human judgement. Another important practical concern is the efficiency and the scalability of the semantic matching solution. Therefore, we have evaluated the scalability of the proposed solution by investigating the variation in matching time in response to increasing numbers of advertisements and increasing request sizes, and have presented the empirical results

Semantic Service Substitution in Pervasive Environments

A computing infrastructure where everything is a service offers many new system and application possibilities. Among the main challenges, however, is the issue of service substitution for the application execution in such heterogeneous environments. An application would like to continue to execute even when a service disappears, or it would like to benefit from the environment by using better services with better QoS when possible. In this article, we define a generic service model and describe the equivalence relations between services considering the functionalities they propose and their non functional QoS properties. We define semantic equivalence relations between services and equivalence degree between non functional QoS properties. Using these relations we propose semantic substitution mechanisms upon the appearance and disappearance of services that fits the application needs. We developed a prototype as a proof of concept and evaluated its efficiency over a real use case