Abstract Views :154 |
PDF Views:3
Authors
Affiliations
1 Sathyabama University in Department of Information Technology, Chennai, IN
2 Dean (Conferences & Publications) in Sathyabama University, Chennai, IN
Source
Networking and Communication Engineering, Vol 4, No 3 (2012), Pagination: 146-152
Abstract
Composition of web services is a promising approach for the integration of global enterprise applications' functionalities.When a composition request is given, there may be multiple web services required and invoked to converge into a solution. For a single task multiple web services from multiple providers with multiple qualities are evolving day to day. There are many service selection algorithms available for finding services for each task level in the service composition graph. Hence, the composition graph generated for a given user request may have multiple candidates with various qualities at each task level. Also, several composition paths may exist to provide the same solution with different aggregated quality. But extracting the optimal path with required quality from the complete composition graph is a real research issue. In this paper, we propose a method to extract the optimal composition path from a given complete composition graph. The optimal path with user preferred quality is extracted by applying the improved shortest path algorithm.
Keywords
Web Service Composition, Optimal Execution Path, Muti-Path Composition Graph.
