Abstract
One of the current challenges in the context of service-oriented applications is the generation of composition plans for applications that optimize their QoS attributes by taking advantage of the resources offered by different providers, and generate them as efficiently as possible. Scalability is indeed a major issue, and the problem becomes a real challenge for applications with big numbers of services. In this work, we propose a divide-and-conquer algorithm that exploits the architecture of applications, to reduce the size of the search space. With it, we are able to recompose the solution for the global problem, with a significant gain in execution time. A variant of the algorithm—in which, when a sub-problem cannot be further divided without loosing information, a solver is used to find the optimal solution for it—allows us to trade execution time and precision. We report on the extensive experimentation carried out, where applications with up to \(2\,000\) services are considered, and which includes a comparison with the results delivered by GA solvers.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
The GA solver used in this paper is implemented using the Jenetics library (https://jenetics.io/). The hyper-parameters used in our experiments can be found in Appendix A. The Jenetics library offers two stop conditions: a hard timeout can be given, but also a convergence criteria can be provided so that the evolution stops when the fitness is deemed as converged.
- 2.
Each of the experiments in this paper has been executed 10 times, and averages are shown to make the graphs smoother.
References
Ai, L.: QoS-aware web service composition using genetic algorithms. Ph.D. thesis, Queensland University of Technology (2011)
Canfora, G., Di Penta, M., Esposito, R., Villani, M.L.: An approach for QoS-aware service composition based on genetic algorithms. In: 7th Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 1069–1075. Association for Computing Machinery (2005). https://doi.org/10.1145/1068009.1068189
Cardoso, J., Sheth, A., Miller, J., Arnold, J., Kochut, K.: Quality of service for workflows and web service processes. J. Web Semant. 1(3), 281–308 (2004). https://doi.org/10.1016/j.websem.2004.03.001
Deshpande, N., Sharma, N., et al.: Composition algorithm adaptation in service oriented systems. In: Muccini, H. (ed.) ECSA 2020. CCIS, vol. 1269, pp. 170–179. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-59155-7_13
Fan, S.-L., Ding, F., Guo, C.-H., Yang, Y.-B.: Supervised web service composition integrating multi-objective QoS optimization and service quantity minimization. In: Jin, H., Wang, Q., Zhang, L.-J. (eds.) ICWS 2018. LNCS, vol. 10966, pp. 215–230. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94289-6_14
Fan, S.-L., Peng, K.-Y., Yang, Y.-B.: Large-scale QoS-aware service composition integrating chained dynamic programming and hybrid pruning. In: Jin, H., Wang, Q., Zhang, L.-J. (eds.) ICWS 2018. LNCS, vol. 10966, pp. 196–211. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94289-6_13
Wu, Z., Lin, P., Huang, P., Peng, H., He, Y., Chen, J.: A user constraint awareness approach for QoS-based service composition. In: Miller, J., Stroulia, E., Lee, K., Zhang, L.-J. (eds.) ICWS 2019. LNCS, vol. 11512, pp. 48–62. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-23499-7_4
Yu, T., Zhang, Y., Lin, K.J.: Efficient algorithms for web services selection with end-to-end QoS constraints. ACM Trans. Web 1(1), 6-es (2007). https://doi.org/10.1145/1232722.1232728
Zeng, L., Benatallah, B., Ngu, A.H.H., Dumas, M., Kalagnanam, J., Chang, H.: QoS-aware middleware for web services composition. IEEE Trans. Software Eng. 30, 311–327 (2004). https://doi.org/10.1109/TSE.2004.11
Zhang, M., Liu, L., Liu, S.: Genetic algorithm based QoS-aware service composition in multi-cloud. In: IEEE Conference on Collaboration and Internet Computing (CIC), pp. 113–118 (2015). https://doi.org/10.1109/CIC.2015.23
Zhang, W., Chang, C., Feng, T., Jiang, H.: QoS-based dynamic web service composition with ant colony optimization. In: IEEE 34th Annual Computer Software and Applications Conference, pp. 493–502 (2010). https://doi.org/10.1109/COMPSAC.2010.76
Acknowledgements
This work has been partially supported by projects UMA-CEIATECH-09 (Andalucía TECH/J. Andalucía/FEDER), UMA18-FEDERJA-180 (J. Andalucía/FEDER), PGC2018-094905-B-I00 (Spanish MINECO/FEDER).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
A GA settings
A GA settings
Hyper-parameters. The hyper-parameters with which experiments in this paper have been performed are as follows:
-
Population: 100.
-
Probability to mutate any chromosome: \(13\%\).
-
Crossover probability: \(70\%\), which can affect a total of 5 different chromosomes at once (Multi-point crossover of 5 used).
-
Survivor selector: Elitist of 2 individuals. This feature assumes some risk, as it is possible to drag individuals which are local minimums during the GA execution.
-
OffSpring selector: The individuals chosen to create offspring will use the RouletteWheelSelector method, meaning that the probability that an individual will be chosen to generate offspring will be \(P(i) = \frac{f_{i}}{\sum _{j = 0}^{N-1} f_{j}}\), where N is the total population.
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Pozas, N., Durán, F. (2021). On the Scalability of Compositions of Service-Oriented Applications. In: Hacid, H., Kao, O., Mecella, M., Moha, N., Paik, Hy. (eds) Service-Oriented Computing. ICSOC 2021. Lecture Notes in Computer Science(), vol 13121. Springer, Cham. https://doi.org/10.1007/978-3-030-91431-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-91431-8_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-91430-1
Online ISBN: 978-3-030-91431-8
eBook Packages: Computer ScienceComputer Science (R0)