QoS-Aware Composite Services Retrieval

For current service-oriented applications, individual web serviceusually cannot meet the requirements arising from real worldapplications, so it is necessary to combine the functionalities ofdifferent web services to obtain a composite service in responseto users' service requests. In order to address the problem of webservice composition, this paper proposes an efficient approach tocomposing basic services in case no any individual service can fullysatisfy users' requests. Compared with the general strategiesadopted in most previously proposed approaches where only the bestcomposition solution is produced, the QoS-aware service compositionapproach is given and top k solutions in the framework are provided,rather than focusing on obtaining the best composition solution, sincethe presented approach allows more candidates that are likely to meetthe requirements of the users. The approach is based on a succinctbinary tree data structure, and a system, named ATC (Approach to Top-kComposite services retrieval) system is implemented. In ATC, QoS istaken into account for composite service, and a heuristic-based searchmethod is proposed to retrieve top k composite service. Some extensiveexperiments are designed and two web service benchmarks are used forperformance study. The experimental results show that the proposedapproach can assure high precision and efficiency for composite servicesearch.