Optimizing web service composition through hybrid graph simplification and NSGAII algorithm

Document Type : Original Article - Short Paper

Authors

Department of Software Engineering, University of Kashan, Kashan, Iran.

Abstract

In the rapidly evolving landscape of web services, efficient interaction and optimal selection among services with different quality parameters are essential. This paper addresses the complex challenge of selecting candidate services for abstract services within probabilistic graph structures. We propose a new hybrid method that combines node-based and path-based graph simplification techniques, allowing for the identification of new patterns, such as parallel and nested loops. We use NSGAII to improve scalability and accuracy in service selection. The proposed approach simplifies the composition graph while optimizing the selection process by considering important quality parameters such as execution cost, response time, and availability. Through systematic simplification and a robust fitness function, we ensure a definitive and accurate response to user queries. The results show significant improvements in the proposed approach compared to existing methods, making it a comprehensive solution for effectively composing web services in dynamic environments.

Keywords


[1] A. Rasoolzadegan and m. Basiri, “The quantitative measurement of quality in service-oriented software engineering: Methods, applications, and issues,” Soft Comput. J., vol. 3, no. 1, pp. 2–19, 2014, dor: 20.1001.1.23223707.1393.3.1.54.5 [In Persian].
[2] M. Dehghani and S. Emadi, “Developing a new model for governance maturity of service oriented architecture,” Soft Comput. J., vol. 4, no. 2, pp. 54–67, 2016, dor: 20.1001.1.23223707.1394.4.2.57.7 [In Persian].
[3] N. Zahiri and S. M. Babamir, “A method to simplify patterns in web services compositions and select optimal probabilistic composition,” Soft Comput. J., vol. 9, no. 2, pp. 44–71, 2021, doi: 10.22052/scj.2021.243188.1003 [In Persian].
[4] F. Chen, R. Dou, M. Li, and H. Wu, “A flexible qos-aware web service composition method by multi-objective optimization in cloud manufacturing,” Comput. Ind. Eng., vol. 99, pp. 423–431, 2016, doi: 10.1016/J.CIE.2015.12.018.
[5] A. Strunk, “Qos-aware service composition: A survey,” in 8th IEEE European Conference on Web Services (ECOWS 2010), 1-3 December 2010, Ayia Napa, Cyprus, A. Brogi, C. Pautasso, and G. A. Papadopoulos, Eds. IEEE Computer Society, 2010, pp. 67–74, doi: 10.1109/ECOWS.2010.16.
[6] H. Zheng, W. Zhao, J. Yang, and A. Bouguettaya, “Qos analysis for web service compositions with complex structures,” IEEE Trans. Serv. Comput., vol. 6, no. 3, pp. 373–386, 2013, doi: 10.1109/TSC.2012.7.
[7] Z. Brahmi, “Qos-aware automatic web service composition based on cooperative agents,” in 2013 Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, Hammamet, Tunisia, June 17-20, 2013, S. Reddy and M. Jmaiel, Eds. IEEE Computer Society, 2013, pp. 27–32, doi: 10.1109/WETICE.2013.1.
[8] G. Canfora, M. Di Penta, R. Esposito, and M. L. Villani, “A lightweight approach for qos aware service composition,” in Proceedings of 2nd international conference on service oriented computing (ICSOC’04), 2004, pp. 1–10.
[9] S. Gohain and A. Paul, “Web service composition using pso — aco,” in 2016 International Conference on Recent Trends in Information Technology (ICRTIT), 2016, pp. 1–5, doi: 10.1109/ICRTIT.2016.7569553.
[10] L. Li, P. Yang, L. Ou, Z. Zhang, and P. Cheng, “Genetic algorithm-based multi-objective optimisation for qos-aware web services composition,” in Knowledge Science, Engineering and Management, 4th International Conference, KSEM 2010, Belfast, Northern Ireland, UK, September 1-3, 2010. Proceedings, ser. Lecture Notes in Computer Science, Y. Bi and M. Williams, Eds., vol. 6291. Springer, 2010, pp. 549–554, doi: 10.1007/978-3-642-15280-1_50.
[11] Y. Huo, P. Qiu, J. Zhai, D. Fan, and H. Peng, “Multi-objective service composition model based on cost-effective optimization,” Appl. Intell., vol. 48, no. 3, pp. 651–669, 2018, doi: 10.1007/S10489-017-0996-Y.
[12] D. Ardagna and B. Pernici, “Global and local qos guarantee in web service selection,” in Business Process Management Workshops, BPM 2005 International Workshops, BPI, BPD, ENEI, BPRM, WSCOBPM, BPS, Nancy, France, September 5, 2005, Revised Selected Papers, C. Bussler and A. Haller, Eds., vol. 3812, 2005, pp. 32–46, doi: 10.1007/11678564_4.
[13] Y. Yao and H. Chen, “Qos-aware service composition using nsga-ii1,” in Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, ser. ACM International Conference Proceeding Series, S. Sohn, L. Chen, S. Hwang, K. Cho, S. Kawata, K. Um, F. I. S. Ko, K. Kwack, J. H. Lee, G. Kou, K. Nakamura, A. C. M. Fong, and P. C. M. Ma, Eds., vol. 403. ACM, 2009, pp. 358–363, doi: 10.1145/1655925.1655991.
[14] P. Sharifara, A. Yari, and M. M. R. Kashani, “An evolutionary algorithmic based web service composition with quality of service,” in 7’th International Symposium on Telecommunications (IST’2014), 2014, pp. 61–65, doi: 10.1109/ISTEL.2014.7000670.
[15] L. Liu and M. Zhang, “Multi-objective optimization model with AHP decision-making for cloud service composition,” KSII Trans. Internet Inf. Syst., vol. 9, no. 9, pp. 3293–3311, 2015, doi: 10.3837/TIIS.2015.09.002.
[16] S. C. Sadouki and A. Tari, “Multi-objective and discrete elephants herding optimization algorithm for qos aware web service composition,” RAIRO Oper. Res., vol. 53, no. 2, pp. 445–459, 2019, doi: 10.1051/RO/2017049.
[17] F. Dahan, W. Binsaeedan, M. Altaf, M. S. Al-Asaly, and M. M. Hassan, “An efficient hybrid metaheuristic algorithm for qos-aware cloud service composition problem,” IEEE Access, vol. 9, pp. 95 208–95 217, 2021, doi: 10.1109/ACCESS.2021.3092288.
[18] F. Dahan, K. M. E. Hindi, A. Ghoneim, and H. Alsalman, “An enhanced ant colony optimization based algorithm to solve qosaware web service composition,” IEEE Access, vol. 9, pp. 34 098–34 111, 2021, doi: 10.1109/ACCESS.2021.3061738.