Title: A compressed graph representation for services composition

Authors: Jing Li; Yuhong Yan; Ming Zhu

Addresses: Department of Computer Science and Technology, Shandong University of Technology, Shandong, 255000, China ' Department of Computer Science and Software Engineering, Concordia University, Montreal, H3G1M8, Canada ' Department of Computer Science and Technology, Shandong University of Technology, Shandong, 255000, China

Abstract: Service-oriented computing enhances business scalability and flexibility. Providers who expect to benefit from it may bring the explosive growth of web services. As a result, the huge storage required in searching a composition solution may be too much to afford. In this paper, we apply a compressed data structure to tackle this challenging issue. We propose a system model to solves web service composition (WSC) problem. In this model, we use a compressed tree to represent the search graph. This work innovatively solve the composition problem with compressed graph representation. The proposed model is verified through theoretical analysis and experimental study. The obtained experimental results show that this system may handle a large number of web services with small space requirement.

Keywords: WSC; web service composition; QoS optimisation; graph compression.

DOI: 10.1504/IJWGS.2018.092589

International Journal of Web and Grid Services, 2018 Vol.14 No.3, pp.305 - 331

Available online: 22 Jun 2018 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article