Abstract
Since the birth of web service composition, the minimization of the number of web services in the resulting composition while satisfying user requests has been a significant perspective of research. With the increase in the number of services released across the Internet, efficient algorithms for this research area are urgently required. In this paper, we present an efficient mechanism to solve the problem. For a given request, a service dependency graph is first generated with the relevant services selected from an external repository. Then, the searching process of the minimal composition over the graph is divided into several steps, and each search step is transformed into a dynamic knapsack problem by mapping services to items, the volume and cost of which are changeable, after which a knapsack-variant algorithm is applied to solve each problem in order. When the final search step has been completed, the minimal composition that satisfies the request can be obtained. Experiments on eight public datasets proposed for the Web Service Challenge 2008 demonstrate that the proposed mechanism outperforms the state-of-the-arts by generating solutions containing the same or a smaller number of services with much higher efficiency.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bellwood, T., Bryan, D., Draluk, V., Ehnebuske, D., Glover, T., Hately, A.: UDDI version 2.04 API specification. UDDI Committee Specification, OASIS (2002)
Hadley, M., Mendelsohn, N., Moreau, J., Nielsen, H., Gudgin, M.: SOAP version 1.2 part 1: messaging framework. W3C REC REC-soap12-part1-20030624, pp. 240–8491, June 2003
Chinnici, R., Gudgin, M., Moreau, J.J., Schlimmer, J., Weerawarana, S.: Web services description language (WSDL) version 2.0 part 1: core language. W3C working draft 26 (2004)
Sirin, E., Parsia, B.: Planning for semantic web services. In: Semantic Web Services Workshop at 3rd International Semantic Web Conference, pp. 33–40. Springer, Hiroshima (2004)
Klusch, M., Gerber, A., Schmidt, M.: Semantic web service composition planning with OWLS-Xplan. In: Proceedings of the 1st International AAAI Fall Symposium on Agents and the Semantic Web, pp. 55–62 (2005)
Akkiraju, R., Srivastava, B., Ivan, A.A., Goodwin, R., Syeda-Mahmood, T.: Semaplan: combining planning with semantic matching to achieve web service composition. In: International Conference on Web Services, ICWS 2006, pp. 37–44. IEEE (2006)
Rodriguez-Mier, P., Mucientes, M., Lama, M.: Automatic web service composition with a heuristic-based search algorithm. In: IEEE International Conference on Web Services (ICWS), pp. 81–88. IEEE (2011)
Rodriguez-Mier, P., Mucientes, M., Vidal, J.C., Lama, M.: An optimal and complete algorithm for automatic web service composition. Int. J. Web Serv. Res. (IJWSR) 9(2), 1–20 (2012)
Rodriguez-Mier, P., Mucientes, M., Lama, M.: Hybrid optimization algorithm for large-scale QoS-aware service composition. IEEE Trans. Serv. Comput. 10(4), 547–559 (2017)
Chattopadhyay, S., Banerjee, A., Banerjee, N.: A scalable and approximate mechanism for web service composition. In: IEEE International Conference on Web Services (ICWS), pp. 9–16. IEEE (2015)
Rodriguez-Mier, P., Pedrinaci, C., Lama, M., Mucientes, M.: An integrated semantic web service discovery and composition framework. IEEE Trans. Serv. Comput. 9(4), 537–550 (2016)
Xia, Y.M., Yang, Y.B.: Web service composition integrating QoS optimization and redundancy removal. In: IEEE 20th International Conference on Web Services (ICWS), pp. 203–210. IEEE (2013)
Yan, Y., Chen, M., Yang, Y.: Anytime QoS optimization over the PlanGraph for web service composition. In: Proceedings of the 27th Annual ACM Symposium on Applied Computing, pp. 1968–1975. ACM (2012)
Chen, M., Yan, Y.: Redundant service removal in QoS-aware service composition. In: IEEE 19th International Conference on Web Services (ICWS), pp. 431–439. IEEE (2012)
Paolucci, M., Kawamura, T., Payne, T.R., Sycara, K.: Semantic matching of web services capabilities. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 333–347. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-48005-6_26
Rodriguez-Mier, P., Mucientes, M., Lama, M.: A hybrid local-global optimization strategy for QoS-aware service composition. In: IEEE International Conference on Web Services (ICWS), pp. 735–738. IEEE (2015)
Acknowledgment
This work is funded by the Natural Science Foundation of China (No. 61673204), National Key R&D Program of China (No. 2018YFB1003800), State Grid Corporation of Science and Technology Projects (Funded No. SGLNXT00DKJS1700 166), and the Program for Distinguished Talents of Jiangsu Province, China (No. 2013-XXRJ-018).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Fan, SL., Yang, YB., Wang, XX. (2018). Efficient Web Service Composition via Knapsack-Variant Algorithm. In: Ferreira, J., Spanoudakis, G., Ma, Y., Zhang, LJ. (eds) Services Computing – SCC 2018. SCC 2018. Lecture Notes in Computer Science(), vol 10969. Springer, Cham. https://doi.org/10.1007/978-3-319-94376-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-94376-3_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94375-6
Online ISBN: 978-3-319-94376-3
eBook Packages: Computer ScienceComputer Science (R0)