Description
In current service-oriented applications, each individual Web service usually cannot satisfy users’ requests for Web services, but the functionalities of different Web services may be integrated to accomplish requested task. This process is called Web service composition, and the resulted service is called composite Web service. The discovery and composition of Web services are two important research issues. In this article, a Web service composition system, BITS, which won the championship of the ICEBE05 contest due to its outstanding performance, is introduced. BITS is implemented based on a binary tree which is used to organize Web services. In this system, some search strategies and optimization techniques are developed for efficient service discovery and service composition. Extensive experiments are conducted for performance study, and the results show the efficiency and effectiveness of the methods adopted in BITS.