A Web Service Composition Method Based on Multi-path

While a single Web service canpsilat satisfy complex business needs, how to compose a large granularity Web service by small ones is an important issue at present. However, the research of service composition focuses the selection of concrete service on the basis of abstract service, and neglects abstract service modeling. This paper defines composition service problem as a graph, transforms service selection to discovering the shortest path in the graph, and puts forward a multi-path composition service selection algorithm. The algorithm plans multi-path according to userpsilas requirement, provides the computation method of composition servicepsilas QoS, then select the best one to user based on the method.