loading...
Optimal Selection of Web Services for Composition Based on Interface-Matching and Weighted Multistage Graph
Dalian, China December 05-December 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.180Sixth International Conference on Par ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yan Gao, Northeastern University, China
Bin Zhang, Northeastern University, China
Jun Na, Northeastern University, China
Lei Yang, Northeastern University, China
Yu Dai, Northeastern University, China
Qiang Gong, Northeastern University, China
This paper first presents a 3-layer organization model and an evaluation model for services composition. Then it presents an approach for selecting global optimal execution plan of Web services composition, which is based on weighted multistage graph and fully considering interface-matching between Web services. Based on this approach, we can select the optimal execution plan dynamically by Dynamic Programming, Integer Programming, Genetic Algorithm or Immune Algorithm, which can solve the problem efficiently and make the selection more correct.
Citation:
Yan Gao, Bin Zhang, Jun Na, Lei Yang, Yu Dai, Qiang Gong, "Optimal Selection of Web Services for Composition Based on Interface-Matching and Weighted Multistage Graph," pdcat, pp.336-338, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.