Chongyun Wu, Jun Wen
Dec 12, 2009
2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing
The performance of automatic web service composition in massive service candidate collection behaves badly when running inappropriate strategy on whole candidate collection. A new service composition model is proposed to solve this problem. The model formally describes web service via ontology technique, which can easily get the user's demand. The paper first defines the cost to satisfy user's requirement, then finds out most similar web services, and constructs the directed acyclic graph based on cost by composition cost relations of web services. At last,the system applies depth first service search algorithm on the graph to find an optimal composition component. The results of experiment proved that this model have high composition efficiency and high success ratio.