Web Services Selection and Composition based on the Routing Algorithm

In recent years, a growing number of Web services have emerged as the Internet develops at a fast rate. With the growing number of Web services, it is necessary to compose existing Web services dynamically. Selecting and composing individual Web services into more complicated and more useful Web processes is an important challenge. This paper model those composition processes as a graph problem. Based on the model, routing algorithms are discussed for static and dynamic services selection. Experiment is conducted based on the model and the algorithm.