A service selection mechanism based on route planning

Web services have become a popular server-side technology. As more services are available, a more effective Web service selection mechanism is essential. How to compose multiple services into workflows to accomplish a task has become an important research topic. But the current solutions to selecting services for composition are either too complex or too specialized. In this paper we devise a mechanism that can select services more suitable for composition. We first filter out those services which do not meet the preset criteria using the semantic information that has been entered when the service is registered. Each remaining service is then treated as a node in a graph. The problem of selecting services becomes a problem of route planning. In our approach, the route is built by taking the correlation factor into consideration. We then compare the proposed method against the ones without correlation. The experiments show that the proposed selection method based on correlation has its advantage.