Two-staged approach for semantically annotating and brokering TV-related services

Nowadays, more and more distributed digital TV and TV-related resources are published on the Web, such as Electronic Personal TV Guide (EPG) data. To enable applications to access these resources easily, the TV resource data is commonly provided by Web service technologies. The huge variety of data related to the TV domain and the wide range of services that provide it, raises the need to have a broker to discover, select and orchestrate services to satisfy the runtime requirements of applications that invoke these services. The variety of data and heterogeneous nature of the service capabilities makes it a challenging domain for automated web-service discovery and composition. To overcome these issues, we propose a two-stage service annotation approach, which is resolved by integrating Linked Services and IRS-III semantic web services framework, to complete the lifecycle of service annotating, publishing, deploying, discovering, orchestration and dynamic invocation. This approach satisfies both developer's and application's requirements to use Semantic Web Services (SWS) technologies manually and automatically

A linked data compliant framework for dynamic and web-scale consumption of web services

The While Semantic Web Services (SWS) research aims at automating Web service tasks such as discovery, orchestration and execution, its take-up is very limited so far. This is due to several reasons, such as inherent complexity of existing SWS frameworks and the considerable costs involved in creating correct SWS descriptions. In addition, while semantics are in use to enable tasks such as discovery, interaction between service consumers, providers and brokering environments is still not supported by semantic message descriptions. On the other hand, the Linked Data approach has produced a set of established principles for sharing and describing data, such as RDF as representation language and the integral use of dereferencable URIs. In this paper we propose to apply those principles to expose Web services and Web APIs and introduce a framework in which service registries as well as services contribute to the automation of service discovery, and hence, workload is distributed more efficiently. This is achieved by developing a Linked Data compliant Web services framework with that communicate with semi-centralised registries but compute their suitability for a given request themselves. All communications among different framework components are using RDF-based message protocols including service input and output. This framework aims at optimizing load balance and performance by dynamically assembling services at run time in a massively distributed Web environment

Autonomous matchmaking web services

Current Semantic Web Services research investigates how to dynamically discover assemble and invoke Web services. Despite many research efforts, Semantic Web Services are still not fully recognized in industry. One important reason is the dissevered description layers of syntax and semantics. In other words, semantics is only useful for a service broker to discover services whereas service requesters still need to invoke services based on syntactic descriptions. In this paper, we view semantics from another angle to reform the Web service framework completely (even for input messages and output messages during invocation) by using only RDF and Linked Open Data. We introduce Autonomous Matchmaking Web Services in which Web services are brokering themselves to notify the service registry whether they are suitable to the requesters. This framework is designated to more efficiently work for dynamically assembling services at run time in a massively distributed environment