Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

An Enhanced Binary Particle Swarm Optimization (E-BPSO) algorithm for service placement in hybrid cloud platforms

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Hybrid cloud platforms offer an attractive solution to organizations interested in implementing integrated private and public cloud applications to meet their profitability requirements. However, this can only be achieved by utilizing available resources while speeding up execution processes. Accordingly, deploying new applications entails dedicating some of these processes to a private cloud while allocating others to the public cloud. In this context, the current work aims to minimize relevant costs and deliver effective choices for an optimal service placement solution within minimal execution time. To date, several evolutionary algorithms have been applied to solve the challenging service placement problem by dealing with complex solution spaces to provide an optimal placement with relatively short execution times. In particular, the standard BPSO algorithm has been found to display a significant disadvantage, namely getting trapped in local optima and demonstrating a noticeable lack of robustness in dealing with service placement problems. Hence, to overcome the critical shortcomings associated with the standard BPSO, an enhanced binary particle swarm optimization (E-BPSO) algorithm is proposed, comprising a modification inspired by the continuous PSO for the particle position updating equation. Our proposed E-BPSO algorithm is shown to outperform state-of-the-art approaches using a real benchmark task in terms of both cost and execution time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Yusoh, Z., Tang, M., 2010. A penalty-based genetic algorithm for the composite SaaS placement problem in the cloud. In: 2010 IEEE congress on evolutionary computation (CEC), pp 1–8

  2. Wada H, Suzuki J, Yamano Y, Oba K (2012) E3: A multiobjective optimization framework for SLA-aware service composition. IEEE Trans Serv Comput 5(3):358–372

    Article  Google Scholar 

  3. Li W, Zhong Y, Wang X, Cao Y (2013) Resource virtualization and service selection in cloud logistics. J Netw Comput Appl 36(6):1696–1704

    Article  Google Scholar 

  4. Klein A, Ishikawa F, Honiden S (2014) SanGA: A self-adaptive network-aware approach to service composition. IEEE Trans Serv Comput 7(3):452–464

    Article  Google Scholar 

  5. Phan DH, Suzuki J, Carroll R, Balasubramaniam S, Donnelly W, Botvich D (2012). Evolutionary multiobjective optimization for green clouds. In: Proceedings of the 14th annual conference companion on genetic and evolutionary computation, GECCO ’12, (New York, NY, USA), pp. 19–26, ACM.

  6. Yao F, Yao Y, Xing L, Chen H, Lin Z, Li T (2019) An intelligent scheduling algorithm for complex manufacturing system simulation with frequent synchronizations in a cloud environment. Memetic Comput 11:357–370

    Article  Google Scholar 

  7. Sahni S (1974) Computationally related problems. SIAM J Comput 3:262–279

    Article  MathSciNet  MATH  Google Scholar 

  8. Zemmal N, Azizi N, Sellami M, Cheriguene S, Ziani A, AlDwairi M, Dendani N (2020) Particle swarm optimization based swarm intelligence for active learning improvement: application on medical data classification. Cogn Comput 12:991–1010

    Article  Google Scholar 

  9. Wang J, Khishe M, Kaveh M, Mohammadi H (2021) Binary chimp optimization algorithm (BChOA): a new binary meta-heuristic for solving optimization problems. Cogn Comput 13:1297–1316

    Article  Google Scholar 

  10. Foschini, L., Tortonesi., M., 2013. Adaptive and business-driven service placement in federated Cloud computing environments. In: IFIP/IEEE international symposium on integrated network management (IM 2013), IEEE.

  11. Ni, Z.W., Pan, X.F., Wu, Z.J., 2012. An ant colony optimization for the composite SAAS placement problem in the cloud. In: Applied Mechanics and Materials, vol. 130, pp. 3062–3067. Trans Tech Publ.

  12. Hajji MA, Mezni H (2017) A composite particle swarm optimization approach for the composite SAAS placement in cloud environment. Soft Comput, pp 1–21.

  13. Kchaou H, Kechaou Z, Alimi AM (2021) Interval type-2 fuzzy C-means data placement optimization in scientific cloud workflow applications. Simul Model Pract Theory 107:102217

    Article  Google Scholar 

  14. Kchaou, H., Kechaou, Z., Alimi, A. M., 2018. A two-stage fuzzy c-means data placement strategy for scientific cloud workflows. FUZZ-IEEE, pp 1–8

  15. Van den Bossche R, Vanmechelen, K., Broeckhove, J., 2010. Cost optimal scheduling in hybrid IAAS clouds for deadline constrained workloads. In: Proceedings of the 2010 IEEE 3rd international conference on cloud computing, ser. CLOUD ’10. Washington, DC, USA: IEEE Computer Society, pp 228–235

  16. Luong NC, Wang P, Niyato D, Wen Y, Han Z (2017) Resource management in cloud networking using economic analysis and pricing models: a survey. In IEEE Communications Surveys & Tutorials 19(2):954–1001

    Article  Google Scholar 

  17. Altmann J, Kashef MM (2014) Cost model based service placement in federated hybrid clouds. Future Gener Comput Syst 41:79–90

    Article  Google Scholar 

  18. Huang K-C, Shen B-J (2015) Service deployment strategies for efficient execution of composite saas applications on cloud platform. J Syst Softw 107:127–141

    Article  Google Scholar 

  19. Yusoh Z, Tang M (2012) A penalty-based grouping genetic algorithm for multiple composite SAAS components clustering in cloud. In: 2012 IEEE international conference on systems, man, and cybernetics (SMC), pp 1396–1401.

  20. Yusoh Z, Tang M (2012) Composite SAAS placement and resource optimization in cloud computing using evolutionary algorithms. In 2012 IEEE 5th International Conference on Cloud Computing (CLOUD), pp. 590–597.

  21. Filelis-Papadopoulos, C. K., Endo, P. T., Bendechache, M., Svorobej, S., Giannoutakis, K. M., Gravvanis, G. A., Tzovaras, D., Byrne, J., Lynn, T., 2020. Towards simulation and optimization of cache placement on large virtual content distribution networks. In Journal of Computational Science, Volume 39.

  22. Barthwal V, Rauthan MMS (2021) AntPu: a meta-heuristic approach for energy-efficient and SLA aware management of virtual machines in cloud computing. Memetic Computing 13:91–110

    Article  Google Scholar 

  23. Mezni, H., Sellami, M., Kouki, J., 2018. Security-aware saas placement using swarm intelligence. J. Softw. Evol. Process, e1932.

  24. Mezni, H., Kouki, J., 2017. A multi-swarm based approach with cooperative learning strategy for composite saas placement. In: Proceedings of the Symposium on Applied Computing, pp. 399–404. ACM.

  25. Kaviani, N., Wohlstadter, E., Lea, R., 2012. Manticore: A framework for partitioning software services for hybrid cloud. In Proceedings of the 2012 IEEE 4th International Conference on Cloud Computing Technology and Science (CloudCom), ser. CLOUDCOM ’12. Washington, DC, USA: IEEE Computer Society, pp. 333–340.

  26. Björkqvist, M., Chen, L. Y., Binder, W., 2012. Cost-driven service provisioning in hybrid clouds. In 2012 Fifth IEEE International Conference on Service-Oriented Computing and Applications (SOCA), IEEE.

  27. Ben Charrada F, Tata S (2016) An efficient algorithm for the bursting of service-based applications in hybrid Clouds. In IEEE Transactions on Services Computing 9(3):357–367

    Article  Google Scholar 

  28. Abbes, W., Kechaou, Z., Alimi, A. M., 2016. A New Placement Optimization Approach in Hybrid Cloud Based on Genetic Algorithm. In IEEE International Conference on e-Business Engineering (ICEBE), pp. 226–231.

  29. Abbes, W., Kechaou, Z., Hussain, A., Alimi, A.M., (2022) Service Bursting Based on Binary PSO in Hybrid Cloud Environment. In: Lee R. (eds) Computer and Information Science 2021 - Fall. ICIS 2021. Studies in Computational Intelligence, vol 1003. Springer, Cham.

  30. Cerroni, W., Foschini, L., Grabarnik, G. Ya., Shwartz, L., Tortonesi, M., 2018. Service Placement for Hybrid Clouds Environments based on Realistic Network Measurements. In 14th International Conference on Network and Service Management (CNSM), IEEE.

  31. Rahimi, M., Venkatasubramanian, N., Mehrotra, S., Vasilakos, A., 2012. MAPCloud: Mobile applications on an elastic and scalable 2-tier cloud architecture. In: 2012 IEEE fifth international conference on utility and cloud computing (UCC), pp 83–90

  32. Bittencourt LF, Senna CR, Madeira ERM (2010) Scheduling service workflows for cost optimization in hybrid clouds. In: 2010 international conference on network and service management, IEEE

  33. Bittencourt LF, Madeira ERM (2011) HCOC: a cost optimization algorithm for workflow scheduling in hybrid clouds. J Internet Serv Appl 3(2):207–227

    Article  Google Scholar 

  34. Van den Bossche R, Vanmechelen K, Broeckhove J (2013) Online cost-efficient scheduling of deadline-constrained workloads on hybrid clouds. In Future Gener Comput Syst 4(29):973–985

    Article  Google Scholar 

  35. Unuvar, M., Steinder, M., Tantawi, A. N., 2014. Hybrid cloud placement algorithm. In 2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems, IEEE.

  36. Breitgand, D., Marashini, A., and Tordsson, J., 2011. Policy-driven service placement optimization in federated clouds. In IBM Research Division, Tech. Rep, H-0299.

  37. Grabarnik, G. Y., Shwartz, L., Tortonesi, M., 2014. Business-driven optimization of component placement for complex services in federated Clouds. In Network Operations and Management Symposium (NOMS), IEEE.

  38. Aryal, R. G., Altmann, J., 2018. Dynamic application deployment in federations of clouds and edge resources using a multiobjective optimization AI algorithm. In Third International Conference on Fog and Mobile Edge Computing (FMEC), IEEE.

  39. Espling D, Larsson L, Li W, Tordsson J, Elmroth E (2016) Modeling and placement of cloud services with internal structure. IEEE Trans Cloud Comput 4(4):429–439

    Article  Google Scholar 

  40. Rekik, M., Boukadi, K., Assy, N., Gaaloul, W., BenAbdallah, H., 2016. A linear program for optimal configurable business processes deployment into cloud federation. In: 2016 IEEE International Conference on Services Computing (SCC), pp. 34–41. IEEE.

  41. Business Process Incubator, April 2021. https://www.businessprocessincubator.com/category/type/templates/

  42. O. M. G. (OMG), Business Process Model and Notation™ (BPMN™) Version 2.0, Object Management Group (OMG), Tech. Rep., jan 2011. http://www.omg.org/spec/BPMN/2.0/

  43. Kennedy, J., Eberhart, R. C., 1997. A discrete binary version of the particle swarm algorithm. IEEE International Conference on Systems, Man, and Cybernetics.

  44. Murtza SA, Ahmad A, Qadri MY, Qadri NN, Ahmed J (2018) Optimizing energy and throughput for mpsocs: an integer particle swarm optimization approach. J Comput 100:227–244

    MathSciNet  Google Scholar 

  45. Miao Z, Yong P, Mei Y, Quanjun Y, Xu X (2021) A discrete PSO-based static load balancing algorithm for distributed simulations in a cloud environment. Futur Gener Comput Syst 115:497–516

    Article  Google Scholar 

  46. Aygun, B., Kilic, B. G., Arici, N., Cosar, A., Tuncsiper, B., 2021. Application of binary PSO for public cloud resources allocation system of video on demand (VoD) services, Applied Soft Computing, Vol. 99.

  47. Dong C, Zhao L (2019) Sensor network security defense strategy based on attack graph and improved binary PSO. Saf Sci 117:81–87

    Article  Google Scholar 

  48. Ozsoydan F, B., Baykasoglu, A., (2019) A swarm intelligence-based algorithm for the set-union knapsack problem. Futur Gener Comput Syst 93:560–569

    Article  Google Scholar 

  49. Fahland D, Favre C, Koehler J, Lohmann N, Volzer H, Wolf K (2011) Analysis on demand: Instantaneous soundness checking of industrial business process models. In Data and Knowledge Engineering 70(5):448–466

    Article  Google Scholar 

  50. ILOG SA, ILOG CPLEX 12, User’s Manual, 2021. https://www.ibm.com/support/pages/node/134239

Download references

Acknowledgements

The present research, contributing to achieving the highlighted promising results, has received a funding grant from the Ministry of Higher Education and Scientific Research of Tunisia under grant agreement number LR11ES48. We deeply acknowledge Taif University for supporting this study through Taif University Researchers Supporting Project number (TURSP-2020/327), Taif University, Taif, Saudi Arabia. The authors would like to thank the anonymous reviewers for their insightful comments and suggestions which helped improve the quality of the paper. Hussain acknowledges the support of the U.K. Engineering and Physical Sciences Research Council (EPSRC—Grants Ref. EP/M026981/1, EP/T021063/1, and Grant EP/T024917/1.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wissem Abbes.

Ethics declarations

Conflict of interest

We have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abbes, W., Kechaou, Z., Hussain, A. et al. An Enhanced Binary Particle Swarm Optimization (E-BPSO) algorithm for service placement in hybrid cloud platforms. Neural Comput & Applic 35, 1343–1361 (2023). https://doi.org/10.1007/s00521-022-07839-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-022-07839-5

Keywords