A Cost-Effective Planning Graph Approach for Large-Scale Web Service Composition

@inproceedings{Lin2014ACP,
  title={A Cost-Effective Planning Graph Approach for Large-Scale Web Service Composition},
  author={Szu-Yin Lin and Guan-Ting Lin and Kuo-Ming Chao and Chi-Chun Lo},
  year={2014}
}
Web Service Composition WSC problems can be considered as a service matching problem, which means that the output parameters of a Web service can be used as inputs of another one. However, when a very large number of Web services are deployed in the environment, the service composition has become sophisticated and complicated process. In this study, we proposed a novel cost-effective Web service composition mechanism. It utilizes planning graph based on backward search algorithm to find… CONTINUE READING
7 Extracted Citations
12 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Similar Papers

Loading similar papers…