By Topic

Semantic Web Services Discovery by Matching Temporal Restrictions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

Matching algorithms for semantic Web services discovery focus on the functional aspects of the services, which are usually given by the function that transforms inputs into outputs. Current approaches do not take into attention the fact that some services may not be available around the clock and, more restrictively, may require exclusive access. In this paper we present an approach to allow the discovery of Web Services based on properties and temporal restrictions. We present a matching algorithm which leverages the work reported on the literature so as to consider availability matching. Throughout the paper, we illustrate our approach in the context of Web services related to remote experiments, which may present rigid constraints in terms of both temporal restrictions and availability of resources.

Published in:

Applications and the Internet, 2008. SAINT 2008. International Symposium on

Date of Conference:

July 28 2008-Aug. 1 2008