WEB SERVICES COMPOSITION USING PLANNING

Abstract

Web service composition problem can be considered as a service matching problem that means output of one web service can be used as input of another web services. When very large number of web services are involved in problem then web service composition problem become sophisticated and complicated process. Here we present a novel and cost effective framework which is based on planning graph and totally dedicated to cost effective in respect to time when very large number of redundant web services are involved and if exact solution is not exist then give approximate solution. This method consume fewer number of web services and less nested level finally we implement one simulation plafform to validate proposed method in large scale web service composition. And we will show when very large number of redundant web services are involved in traditional solution then dramatically improve the performance with the help of proposed method.