DocumentCode
3062959
Title
Optimal Selection of Web Services for Composition Based on Interface-Matching and Weighted Multistage Graph
Author
Gao, Yan ; Zhang, Bin ; Na, Jun ; Yang, Lei ; Dai, Yu ; Gong, Qiang
Author_Institution
Northeastern University, China
fYear
2005
fDate
05-08 Dec. 2005
Firstpage
336
Lastpage
338
Abstract
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.
Keywords
Distributed computing; Dynamic programming; Educational institutions; Genetic algorithms; Information science; Linear programming; Ontologies; Quality of service; Runtime; Web services;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on
Print_ISBN
0-7695-2405-2
Type
conf
DOI
10.1109/PDCAT.2005.180
Filename
1578929
Link To Document