Open Access

ARTICLE

Intelligent Solution System for Cloud Security Based on Equity Distribution: Model and Algorithms

Sarah Mustafa Eljack^1,*, Mahdi Jemmali^2,3,4, Mohsen Denden^6,7, Mutasim Al Sadig¹, Abdullah M. Algashami¹, Sadok Turki⁵

1 Department of Computer Science and Information, College of Science at Zulfi, Majmaah University, Al-Majmaah, 11952, Saudi Arabia
2 Department of Computer Science, College of Computing and Informatics, University of Sharjah, Sharjah, United Arab Emirates
3 Higher Institute of Computer Science and Mathematics, University of Monastir, Monastir, 5000, Tunisia
4 Mars Laboratory, University of Sousse, Sousse, Tunisia
5 Department of Logistic and Maintenance, UFR MIM at Metz, University of Lorraine, Metz, France
6 Department of Computer and Information Technologies, College of Telecommunication, and Information Riyadh CTI, Technical and Vocational Training Corporation TVTC, Riyadh, 12464, Saudi Arabia
7 Department of Computer Science, Higher Institute of Applied Sciences of Sousse, Sousse University, Sousse, 4000, Tunisia

* Corresponding Author: Sarah Mustafa Eljack. Email:

(This article belongs to the Special Issue: The Next Generation of Artificial Intelligence and the Intelligent Internet of Things)

Computers, Materials & Continua 2024, 78(1), 1461-1479. https://doi.org/10.32604/cmc.2023.040919

Received 04 April 2023; Accepted 03 November 2023; Issue published 30 January 2024

Abstract

In the cloud environment, ensuring a high level of data security is in high demand. Data planning storage optimization is part of the whole security process in the cloud environment. It enables data security by avoiding the risk of data loss and data overlapping. The development of data flow scheduling approaches in the cloud environment taking security parameters into account is insufficient. In our work, we propose a data scheduling model for the cloud environment. The model is made up of three parts that together help dispatch user data flow to the appropriate cloud VMs. The first component is the Collector Agent which must periodically collect information on the state of the network links. The second one is the monitoring agent which must then analyze, classify, and make a decision on the state of the link and finally transmit this information to the scheduler. The third one is the scheduler who must consider previous information to transfer user data, including fair distribution and reliable paths. It should be noted that each part of the proposed model requires the development of its algorithms. In this article, we are interested in the development of data transfer algorithms, including fairness distribution with the consideration of a stable link state. These algorithms are based on the grouping of transmitted files and the iterative method. The proposed algorithms show the performances to obtain an approximate solution to the studied problem which is an NP-hard (Non-Polynomial solution) problem. The experimental results show that the best algorithm is the half-grouped minimum excluding (HME), with a percentage of 91.3%, an average deviation of 0.042, and an execution time of 0.001 s.

---

Keywords

---