A distributed optimal scheme based on local QoS for web service composition

The goal of web service composition is to choose an optimal scheme according to Quantity of Service (QoS) which selects instances in a distributed network. The networks are clustered with some web services such as ontologies, algorithms and rule engines with similar function and interfaces. In this scheme, web services acted as candidate service construct a distributed model which can´t obtain the global services´ information. The model is utilized to choose instances according to local QoS information in the progress of service composition. Some QoS matrixes are used to record and compare the instance paths and then choose a better one. Simulation result has proven that our approach has a tradeoff between efficiency and equality.