An efficient and reliable approach for quality-of-service-aware service composition

With the rapidly increasing number of independently developed Web services that provide similar functionalities with varied quality of service (QoS), service composition is considered as a problem in the selection of component services that are in accordance with users’ QoS requirements; a practice...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information sciences 2014-06, Vol.269, p.238-254
Hauptverfasser: Li, Jun, Zheng, Xiao-Lin, Chen, Song-Tao, Song, William-Wei, Chen, De-ren
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:With the rapidly increasing number of independently developed Web services that provide similar functionalities with varied quality of service (QoS), service composition is considered as a problem in the selection of component services that are in accordance with users’ QoS requirements; a practice known as the QoS-aware service composition problem. However, current solutions are unsuitable for most real-time decision-making service composition applications required to obtain a relatively optimal result within a reasonable amount of time. These services are also unreliable (or even risky) given the open service-oriented environment. In this paper, we address these problems and propose a novel heuristic algorithm for an efficient and reliable selection of trustworthy services in a service composition. The proposed algorithm consists of three steps. First, a trust-based selection method is used to filter untrustworthy component services. Second, convex hulls are constructed to reduce the search space in the process of service composition. Finally, a heuristic global optimization approach is used to obtain the near-optimal solution. The results demonstrate that our approach obtains a close-to-optimal and reliable solution within a reasonable computation time.
ISSN:0020-0255
1872-6291
1872-6291
DOI:10.1016/j.ins.2013.12.015