QoS-Aware Composite Services Retrieval

For current service-oriented applications, individual web service usually cannot meet the requirements arising from real world applications, so it is necessary to combine the functionalities of different web services to obtain a composite service in response to users’ service requests. In order to a...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer science and technology 2006-07, Vol.21 (4), p.547-558
Main Authors: Wang, Xiao-Ling, Huang, Sheng, Zhou, Ao-Ying
Format: Article
Language:English
Subjects:
Benchmarks
Composing
Composition
Data structures
Focusing
Internet service providers
Mathematical models
Retrieval
Search methods
Searching
Strategy
Studies
User requirements
User satisfaction
Web services
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For current service-oriented applications, individual web service usually cannot meet the requirements arising from real world applications, so it is necessary to combine the functionalities of different web services to obtain a composite service in response to users’ service requests. In order to address the problem of web service composition, this paper proposes an efficient approach to composing basic services in case no any individual service can fully satisfy users’ requests. Compared with the general strategies adopted in most previously proposed approaches where only the best composition solution is produced, the QoS-aware service composition approach is given and top k solutions in the framework are provided, rather than focusing on obtaining the best composition solution, since the presented approach allows more candidates that are likely to meet the requirements of the users. The approach is based on a succinct binary tree data structure, and a system, named ATC (Approach to Top-k Composite services retrieval) system is implemented. In ATC, QoS is taken into account for composite service, and a heuristic-based search method is proposed to retrieve top k composite service. Some extensive experiments are designed and two web service benchmarks are used for performance study. The experimental results show that the proposed approach can assure high precision and efficiency for composite service search.
ISSN:1000-9000
1860-4749
DOI:10.1007/s11390-006-0547-1