Projects Distribution Algorithms for Regional Development

Jemmali, Mahdi

doi:10.14201/adcaij2021103293305

Cited by 16 publications

(7 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several papers treated load balancing in different domains. In finance and budgeting [6][7][8][9], storage systems [10], smart parking [11], the network [12], and parallel machines [13]. The authors in [14] proposed two variants of PSO.…”

Section: Related Workmentioning

confidence: 99%

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

Eljack,

Jemmali,

Denden

et al. 2024

CMC

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

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

Eljack,

Jemmali,

Denden

et al. 2024

CMC

View full text Add to dashboard Cite

show abstract

“…For example, the authors in 26 proposed three heuristics based on the probabilistic and iterative approach. Recently, authors in 27 proposed five heuristics to solve the problem. While the authors in 28 employed load balancing to address the problem of used space storage in memory system by developing several approximate solutions to find an appropriate schedule that ensures the fair distribution of the storage system files.…”

Section: Related Workmentioning

confidence: 99%

Smart-parking management algorithms in smart city

Jemmali

Melhim

Alharbi

et al. 2022

Sci Rep

Self Cite

View full text Add to dashboard Cite

Recently, various advanced technologies have been employed to build smart cities. Smart cities aim at improving the quality of life through the delivery of better services. One of the current services that are essential for any smart city, is the availability of enough parking spaces to ensure smooth and easy traffic flow. This research proposes a new framework for solving the problem of parking lot allocation, which emphasizes the equitable allocation of people based on the overall count of people in each parking space. The allocation process is performed while considering the available parking lots in each parking space. To accomplish the desired goal, this research will develop a set of seven algorithms to reduce the gap in the number of people between parking spaces. Many experiments carried out on 2430 different cases to cover several aspects such as the execution time and the gap calculations, were used to explore the performance of the developed algorithm. Analyzing the obtained results indicates a good performance behavior of the developed algorithms. Also, it shows that the developed algorithms can solve the studied problem in terms of gap and time calculations. The MR algorithm gained excellent performance results compared to one of the best algorithms in the literature. The MR algorithm has a percentage of 96.1 %, an average gap of 0.02, and a good execution time of 0.007 s.

show abstract

“…The proposed algorithms can be applied to enhance the monitoring system developed by ( Melhim et al, 2020 ; Melhim, Jemmali & Alharbi, 2019 ). On the other hand, the algorithms developed by Jemmali (2019a) ; Jemmali (2019b) ; Jemmali (2022) ; Alharbi & Jemmali (2020) ; Jemmali (2021a) ; Jemmali (2021b) ; Jemmali, Otoom & Al Fayez (2020) ; Jemmali, Melhim & Al Fayez (2022) can be enhanced then applied to address the proposed problem. Our solution suggests enhancing the current IP network architecture by providing multilevel data security and privacy protection.…”

Section: Introductionmentioning

confidence: 99%

A novel smart multilevel security approach for secure data outsourcing in crisis

Sarhan

2023

PeerJ Computer Science

View full text Add to dashboard Cite

The Interconnected Network or the Internet has revolutionized digital communications. It has expanded worldwide over the past four decades due to numerous features such as connectivity, transparency, hierarchy, and openness. Several drawbacks, including mobility, scalability, controllability, security, etc., have been presented due to continuous developments. Although several network paradigms exist to address such drawbacks, many issues still persist. This research proposed a future network paradigm that addresses multilevel security shortcomings. It suggested the following: (i) a two-router network-based cyber security architecture for multilevel data sharing; (ii) using a scheduler to deal with the multilevel transmitted packets scheduling problem; (iii) five algorithms for the studied difficult problem; and (iv) providing an experimental result to show the optimal results obtained by the developed algorithms and comparing it with algorithms in the literature. The experimental result shows that the random-grouped classification with shortest scheduling algorithm (RGS) performed the best at 37.7% with a gap of 0.03. This result proves the practicality of our approach in terms of two-machine scheduling problems.

show abstract

Projects Distribution Algorithms for Regional Development

Cited by 16 publications

References 29 publications

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

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

Smart-parking management algorithms in smart city

A novel smart multilevel security approach for secure data outsourcing in crisis

Contact Info

Product

Resources

About