Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect

Hidri, Lotfi; Jemmali, Mahdi

doi:10.1051/ro/2020009

Cited by 11 publications

(6 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The cloud environment faces many challenges, such as cost and power consumption reduction of various services. The optimization of the cost is studied in [41][42][43][44]. Recently, many international companies have ranked security [45][46][47] as the most difficult parameter to achieve in the cloud and the first challenge for cloud developers and users.…”

Section: Study Backgroundmentioning

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: Study Backgroundmentioning

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

“…The algorithms developed in [28] can be extended and applied to the presented problem. The algorithms of the parallel machine problem [29][30][31][32] can be extended and reformulated to use the related algorithms for the studied problem. Moreover, the algorithms developed in this paper can be extended for the subject considered in [33,34] The issues of packet scheduling, timing, and routing have been well-studied by many.…”

Section: Related Workmentioning

confidence: 99%

An enhanced multilevel secure data dissemination approximate solution for future networks

Otoom,

Jemmali,

Sarhan

et al. 2024

PLoS ONE

Self Cite

View full text Add to dashboard Cite

Sensitive data, such as financial, personal, or classified governmental information, must be protected throughout its cycle. This paper studies the problem of safeguarding transmitted data based on data categorization techniques. This research aims to use a novel routine as a new meta-heuristic to enhance a novel data categorization based-traffic classification technique where private data is classified into multiple confidential levels. As a result, two packets belonging to the same confidentiality level cannot be transmitted through two routers simultaneously, ensuring a high data protection level. Such a problem is determined by a non-deterministic polynomial-time hardness (NP-hard) problem; therefore, a scheduling algorithm is applied to minimize the total transmission time over the two considered routers. To measure the proposed scheme’s performance, two types of distribution, uniform and binomial distributions used to generate packets transmission time datasets. The experimental result shows that the most efficient algorithm is the Best-Random Algorithm (B R ˜), recording 0.028 s with an average gap of less than 0.001 in 95.1% of cases compared to all proposed algorithms. In addition, B R ˜ is compared to the best-proposed algorithm in the literature which is the Modified decreasing Estimated-Transmission Time algorithm (MDETA). The results show that B R ˜ is the best one in 100% of cases where MDETA reaches the best results in only 48%.

show abstract

“…Finally, we introduced several heuristics that can help reach metaheuristics or an exact solution for the problem in the future. The proposed algorithms in [54][55][56][57][58][59][60].…”

Section: Literature Reviewmentioning

confidence: 99%

Novel intelligent architecture and approximate solution for future networks

Sarhan

Jemmali

2023

PLoS ONE

Self Cite

View full text Add to dashboard Cite

Private networks have become popular for secure data sharing and anonymous communication in many domains: enterprise environments, military, journalism, telecommunication, healthcare, to name a few. It has been used with or without internet connection. Its primary purpose is to provide confidentiality, bypass unlawful activities, and protect against common threats such as interception, modification, and censorship. In addition, several private network technologies exist to support secure communications. However, they mostly rely on encryption only. The transmitted data is classified into different confidentiality levels. This research presents a smart private network architecture scheme that transmits constraint-based classified packets. The main directive of this work is the proposed constraint. This constraint is meant to enforce that if two packets belong to the same confidentiality level, they can’t be transmitted through the two routers simultaneously. Therefore, the studied problem is an NP-hard problem. This paper presents the following contributions: (i) proposes a new architecture paradigm for outsourcing a constraint-based multi-classified data sharing securely and transmitted through two routers; (ii) introduces several algorithms to prove the feasibility for this NP-Hard problem; and (iii) implements the algorithms solutions using C++ and compares their performance. Different metrics are used to measure the performance of the proposed algorithms. Randomized Longest Transmission time first algorithm R L T ¯ scored the best algorithm with a percentage of 73.5% and an average gap of 0.002 according to the experimental results. It is remarkable worthy to note that the execution time of all the algorithms is less than 0.001 s.

show abstract

Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect

Cited by 11 publications

References 22 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

An enhanced multilevel secure data dissemination approximate solution for future networks

Novel intelligent architecture and approximate solution for future networks

Contact Info

Product

Resources

About