Web service composition using graph model

With the popularity of Internet technology, web services are becoming the most promising paradigm for distributed computing. However, when a single web service fails to meet service requestor´s multiple function needs, web services need to be dynamically configured together to form a web service composition with Qos constraints. This paper proposes BTWS algorithm for web service selection, which is based on the sorted function graph. With the graph model, it converts the problem to a multi-constraint optimal path problem in the graph theory. The optimal composite services can be constructed with meeting the Qos constraints. The simulation experiments show that compared to the same kind of algorithm, it is much better in the metrics of runtime and memory usage.