Improving Web Service Composition Technique using Graph Based Algorithm - A Technical Research

Automatic web service composition is not a trivial problem, especially when the number of services is high and there are different control structures to handle the execution flow. Some approaches, treat the composition problem as a planning problem. In general, these approaches have important drawbacks such as high complexity, high computational cost and inability to maximize parallel execution of web services. Other approaches consider the problem as a search problem, where a search algorithm is applied over a graph or a tree in order to find a minimal composition. These proposals are simpler and more effective than the other approaches, and also many of them can exploit parallel execution of web services but it does not provide optimal result. Citation: Urvi Chaudhary, Ipcowala Institute of Engineering & Technology, Dharmaj; Mikin R Patel ,Ipcowala Institute of Engineering & Technology, Dharmaj; Rohan C Prajapati ,Ipcowala Institute of Engineering & Technology, Dharmaj. "Improving Web Service Composition Technique using Graph Based Algorithm - A Technical Research ." Global Research and Development Journal For Engineering 26 2017: 1 - 4.