A graph database-based approach utilizing FAHP and directed bipartite graph for service composition
- PDF / 1,664,573 Bytes
- 13 Pages / 595.276 x 790.866 pts Page_size
- 70 Downloads / 198 Views
ORIGINAL RESEARCH PAPER
A graph database-based approach utilizing FAHP and directed bipartite graph for service composition Guodong Fan1 · Ming Zhu1 · Jing Li1
· Chun Wang2 · Lei Zhao1
Received: 26 August 2019 / Revised: 28 March 2020 / Accepted: 6 July 2020 © Springer-Verlag London Ltd., part of Springer Nature 2020
Abstract Cloud computing has recently evolved into container technology and edge computing for conveniently hosting and delivering a set of services. There is a need to compose individual services to perform a complex task. However, finding an optimal solution of composition satisfying both functional and non-functional requirements is a challenging problem. To solve this problem, we propose a method using fuzzy analytical hierarchy process and an extended Dijkstra algorithm to find a solution in a directed bipartite graph stored in a Neo4j graph database. Unlike other database-based approaches that aim to optimize a pre-defined composition task, our approach is much flexible that can perform an arbitrary task once the services information is preprocessed in a database. We conduct experiments and compare the performance of the proposed approach with a Graphplan method and a relational database-based approach, and the results show that this approach leads to less query execution time and better user’s satisfaction. Keywords Service composition · QoS · FAHP · Graph database
1 Introduction Container technology [1] and edge computing technology [2,3] are used to extend the cloud computing system. These bring great flexibility and reliability with low cost for users to deploy web services into the cloud. As a result, more This work is supported by National Key R&D Program of China 2018YFB1403302, Canada NSERC Discovery Grant N01677, and Zibo University and City Integration Development Project (2019ZBXC114).
B
Jing Li [email protected] Guodong Fan [email protected] Ming Zhu [email protected] Chun Wang [email protected] Lei Zhao [email protected]
1
College of Computer Science and Technology, Shandong University of Technology, Zibo 255000, China
2
Institute for Information Systems Engineering, Concordia University, Montreal H3G 1M8, Canada
and more services are published online. However, sometimes an individual web service fails to meet the requirement, and therefore, it needs to be composed with other web services to accomplish a complex task. The QoS-aware web service composition problem is designed to automatically construct composite services with the optimal QoS value. Given the huge search space, a full solution indexing using a database (FSIDB) system [4] for the composition problem is proposed, where possible service combinations are generated, stored, and searched in a relational database. However, there are some limitations to this method. Firstly, to find a solution to meet a user’s requirements, FSIDB needs to perform many cross-table join operations, which reduces the processing speed. Secondly, only services and relationships between them are constructed, while concepts ar
Data Loading...
