TY - JOUR
T1 - Trust-oriented composite service selection with QoS constraints
AU - Li, Lei
AU - Wang, Yan
AU - Lim, Ee Peng
N1 - The following article appeared in Journal of universal computer science, 16(13), 1720-1744, and can be found at http://dx.doi.org/10.3217/jucs-016-13-1720. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.
PY - 2010
Y1 - 2010
N2 - In Service-Oriented Computing (SOC) environments, service clients interact with service providers for consuming services. From the viewpoint of service clients, the trust level of a service or a service provider is a critical factor to consider in service selection, particularly when a client is looking for a service from a large set of services or service providers. However, a invoked service may be composed of other services. The complex invocations in composite services greatly increase the complexity of trust-oriented service selection. In this paper, we propose novel approaches for composite service representation, trust evaluation and trust-oriented composite service selection (with QoS constraints). Our experimental results illustrate that compared with the existing approaches our proposed trust-oriented (QoS constrained) composite service selection algorithms are realistic and enjoy better efficiency.
AB - In Service-Oriented Computing (SOC) environments, service clients interact with service providers for consuming services. From the viewpoint of service clients, the trust level of a service or a service provider is a critical factor to consider in service selection, particularly when a client is looking for a service from a large set of services or service providers. However, a invoked service may be composed of other services. The complex invocations in composite services greatly increase the complexity of trust-oriented service selection. In this paper, we propose novel approaches for composite service representation, trust evaluation and trust-oriented composite service selection (with QoS constraints). Our experimental results illustrate that compared with the existing approaches our proposed trust-oriented (QoS constrained) composite service selection algorithms are realistic and enjoy better efficiency.
UR - http://www.scopus.com/inward/record.url?scp=77957986547&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:77957986547
SN - 0958-695X
VL - 16
SP - 1720
EP - 1744
JO - Journal of Universal Computer Science
JF - Journal of Universal Computer Science
IS - 13
ER -