Reliable Web Services Selection Using a Heuristic Algorithm

Web services composition (WSC) is the key techniques in its application. Dynamically selecting reliable Web services (WSs) becomes crucial to users. In fact, most works regard a Web service (WS) as the basic unit and selection with end-to-end, and as more and more WSs become available, the WSs selection problem is a complex NP-hard optimization problem. So, in this paper, the WSs consist of the operations and the WSs selection problem is formalized as a finite state machine process and we proposed a backward algorithm to create the WSC tree (WSCT). Then, we proposed a heuristic algorithm to complete the selection of WSs based on the WSCT. The results of experiment show our proposed heuristic algorithm is effective.