Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

User Preferred Optimal Execution Path Selection from Quality Enabled Multi-Path Web Service Composition Graph


Affiliations
1 Sathyabama University in Department of Information Technology, Chennai, India
2 Dean (Conferences & Publications) in Sathyabama University, Chennai, India
     

   Subscribe/Renew Journal


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.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 234

PDF Views: 3




  • User Preferred Optimal Execution Path Selection from Quality Enabled Multi-Path Web Service Composition Graph

Abstract Views: 234  |  PDF Views: 3

Authors

S. Justin Samuel
Sathyabama University in Department of Information Technology, Chennai, India
T. Sasipraba
Dean (Conferences & Publications) in Sathyabama University, Chennai, India

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.