Application of Particle Swarm Optimization and Path Relinking techniques for container allocation problem in data centers

• João Paulo de Araújo UFC
• Filipe de Matos UFC
• Fernando Antonio Mota Trinta UFC

DOI: https://doi.org/10.5753/sbrc.2024.1499

Abstract

Container virtualization stands out as a lighter form of virtualization, enabling rapid service provisioning and portability. Due to factors such as heterogeneity in container configurations and the dimensionality of hosting data centers, determining an optimal allocation poses a challenging combinatorial problem, often involving a wide search space. In this context, this study introduces a container allocation policy named PSOPR, based on the Particle Swarm Optimization technique combined with the metaheuristic Path Relinking. The goal is to consolidate data centers without adversely affecting application performance. Using CloudSim as a simulation tool and relying on metrics such as energy consumption, SLA violation, and the number of virtual machines used, experimental results indicated that the PSOPR policy consumed, on average, 25.38% and 24.61% less energy than the First-Come, First-Served (FCFS) and Random policies, respectively. Furthermore, it demonstrated favorable results in terms of SLA violation levels, with an average violation of 10%, one of the best outcomes among the evaluated policies.

References

Ahmad, I., AlFailakawi, M. G., AlMutawa, A., and Alsalman, L. (2021). Container scheduling techniques: A survey and assessment. Journal of King Saud University-Computer and Information Sciences.

Ben Alla, H., Ben Alla, S., Ezzati, A., and Touhafi, A. (2017). An efficient dynamic priority-queue algorithm based on ahp and pso for task scheduling in cloud computing. In Abraham, A., Haqiq, A., Alimi, A. M., Mezzour, G., Rokbani, N., and Muda, A. K., editors, Proceedings of the 16th International Conference on Hybrid Intelligent Systems (HIS 2016), pages 134–143, Cham. Springer International Publishing.

Bussab, W. d. O. and Morettin, P. A. (2010). Estatística básica. In Estatística básica, pages xvi–540.

Calheiros, R. N., Ranjan, R., Beloglazov, A., De Rose, C. A., and Buyya, R. (2011). Cloudsim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Software: Practice and experience, 41(1):23–50.

de Assuncao, M. D., da Silva Veith, A., and Buyya, R. (2018). Distributed data stream processing and edge computing: A survey on resource elasticity and future directions. Journal of Network and Computer Applications, 103:1–17.

Docker (2023). Enterprise container platform for high-velocity innovation.

Glover, F., Laguna, M., and Martí, R. (2000). Fundamentals of scatter search and path relinking. Control and cybernetics, 29(3):653–684.

Helali, L. and Omri, M. N. (2021). A survey of data center consolidation in cloud computing systems. Computer Science Review, 39:100366.

Kennedy, J. and Eberhart, R. (1995). Particle swarm optimization. In Proceedings of ICNN’95-international conference on neural networks, volume 4, pages 1942–1948. IEEE.

Li, L., Chen, J., and Yan, W. (2018). A particle swarm optimization-based container scheduling algorithm of docker platform. In Proceedings of the 4th International Conference on Communication and Information Processing, pages 12–17.

Mann, Z. A. and Szabó, M. (2017). Which is the best algorithm for virtual machine placement optimization? Concurrency and Computation: Practice and Experience, 29(10):e4083.

Menezes, M. d. S., Goldbarg, M. C., Goldbarg, E. F. G., Ferreira, V. E. S., and Correia, G. C. (2017). Abordagens grasp aplicadas ao problema quota cars. In Anais do 49 Simpósio Brasileiro de Pesquisa Operacional, pages 1807–1818.

Papadimitriou, C. H. and Steiglitz, K. (1998). Combinatorial optimization: algorithms and complexity. Courier Corporation.

Rodrigues, L., Pasin, M., Alves Jr, O. C., Pillon, M. A., Miers, C. C., and Koslovski, G. P. (2019). Escalonamento de contêineres com método de decisao multicritério acelerado por gpu. In Anais do XXXVII Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos, pages 515–528. SBC.

Shim, J. P. (1989). Bibliographical research on the analytic hierarchy process (ahp). Socio-Economic Planning Sciences, 23(3):161–167.

Van Dongen, S. (2000). Graph clustering by flow simulation. PhD thesis, University of Utrecht.

Van Laarhoven, P. J., Aarts, E. H., van Laarhoven, P. J., and Aarts, E. H. (1987). Simulated annealing. Springer.

Varghese, B. and Buyya, R. (2018). Next generation cloud computing: New trends and research directions. Future Generation Computer Systems, 79:849–861.

Zhang, Q., Cheng, L., and Boutaba, R. (2010). Cloud computing: state-of-the-art and research challenges. Journal of internet services and applications, 1(1):7–18.

Zhou, X., Li, K., Liu, C., and Li, K. (2019). An experience-based scheme for energy-sla balance in cloud data centers. IEEE Access, 7:23500–23513.