5 research outputs found
A framework for optimal decentralized service-choreography
Abstract We address the problem of optimizing mediator-based service composition where the services and the desired composition (goal
Recommended from our members
An intelligent framework for dynamic web services composition in the semantic web
As Web services are being increasingly adopted as the distributed computing technology of choice to securely publish application services beyond the firewall, the importance of composing them to create new, value-added service, is increasing. Thus far, the most successful practical approach to Web services composition, largely endorsed by the industry falls under the static composition category where the service selection and flow management are done a priori and manually. The second approach to web-services composition aspires to achieve more dynamic composition by semantically describing the process model of Web services and thus making it comprehensible to reasoning engines or software agents. The practical implementation of the dynamic composition approach is still in its infancy and many complex problems need to be resolved before it can be adopted outside the research communities.
The investigation of automatic discovery and composition of Web services in this thesis resulted in the development of the eXtended Semantic Case Based Reasoner (XSCBR), which utilizes semantic web and AI methodology of Case Based Reasoning (CBR). Our framework uses OWL semantic descriptions extensively for implementing both the matchmaking profiles of the Web services and the components of the CBR engine.
In this research, we have introduced the concept of runtime behaviour of services and consideration of that in Web services selection. The runtime behaviour of a service is a result of service execution and how the service will behave under different circumstances, which is difficult to presume prior to service execution. Moreover, we demonstrate that the accuracy of automatic matchmaking of Web services can be further improved by taking into account the adequacy of past matchmaking experiences for the requested task. Our XSCBR framework allows annotating such runtime experiences in terms of storing execution values of non-functional Web services parameters such as availability and response time into a case library. The XSCBR algorithm for matchmaking and discovery considers such stored Web services execution experiences to determine the adequacy of services for a particular task.
We further extended our fundamental discovery and matchmaking algorithm to cater for web services composition. An intensive knowledge-based substitution approach was proposed to adapt the candidate service experiences to the requested solution before suggesting more complex and computationally taxing AI-based planning-based transformations. The inconsistency problem that occurs while adapting existing service composition solutions is addressed with a novel methodology based on Constraint Satisfaction Problem (CSP).
From the outset, we adopted a pragmatic approach that focused on delivering an automated Web services discovery and composition solution with the minimum possible involvement of all composition participants: the service provider, the requestor and the service composer. The qualitative evaluation of the framework and the composition tools, together with the performance study of the XSCBR framework has verified that we were successful in achieving our goal
Towards Optimized Data Fetching for Service Discovery
The advent of Service Oriented Architecture makes services the most flexible, platform-independent choice for exposing and integrating business functionality across a network. However, the lack of service discovery mechanisms, that go beyond simple keyword search to enable automated late-binding of service requesters to providers, remains a major problem. Realistic late-binding involves matchmaking of client requests with service descriptions, based on frequently changing fine-grained client requests, and dynamically changing service functionality. The intricacies of service functionality cannot be specified by generic static descriptions since the functionality offered by the service may depend on the client at hand, their specific request and the service¿s current capabilities. In this paper, we pro- pose a semantic framework supporting dynamic data fetching from services during the discovery phase on service instance level entailing a communication overhead which we aim to minimize