Reference Hub8
A Top-K QoS-Optimal Service Composition Approach Based on Service Dependency Graph

A Top-K QoS-Optimal Service Composition Approach Based on Service Dependency Graph

Baili Zhang, Kejie Wen, Jianhua Lu, Mingjun Zhong
Copyright: © 2021 |Volume: 33 |Issue: 3 |Pages: 19
ISSN: 1546-2234|EISSN: 1546-5012|EISBN13: 9781799859062|DOI: 10.4018/JOEUC.20210501.oa4
Cite Article Cite Article

MLA

Zhang, Baili, et al. "A Top-K QoS-Optimal Service Composition Approach Based on Service Dependency Graph." JOEUC vol.33, no.3 2021: pp.50-68. http://doi.org/10.4018/JOEUC.20210501.oa4

APA

Zhang, B., Wen, K., Lu, J., & Zhong, M. (2021). A Top-K QoS-Optimal Service Composition Approach Based on Service Dependency Graph. Journal of Organizational and End User Computing (JOEUC), 33(3), 50-68. http://doi.org/10.4018/JOEUC.20210501.oa4

Chicago

Zhang, Baili, et al. "A Top-K QoS-Optimal Service Composition Approach Based on Service Dependency Graph," Journal of Organizational and End User Computing (JOEUC) 33, no.3: 50-68. http://doi.org/10.4018/JOEUC.20210501.oa4

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

With the development of internet of things (IoT) technology, servitization of IoT device functions has become a trend. The cooperation between IoT devices can be equivalent to web service composition. However, current service composition approaches applied in the internet cannot work well in IoT environments due to weak adaptability, low accuracy, and poor time performance. This paper, based on service dependency graph, proposes a top-k QoS-optimal service composition approach suitable for IoT. It aims to construct the relationship between services by applying the service dependency model and to reduce the traversal space through effective filtering strategies. On the basis of a composition path traversal sequence, the generated service composition can be represented directly to avoid backtracking search. Meanwhile, the redundant services can be removed from the service composition with the help of dynamic programming. Experiments show that the approach can obtain the top-k QoS-optimal service composition and better time performance.