Two routers network architecture and scheduling algorithms under packet category classification constraint

Sarhan, Akram Y.; Jemmali, Mahdi; Hmida, Abir Ben

doi:10.1145/3508072.3508092

Cited by 7 publications

(21 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, if an adversary could capture one highly secure packet at one point through one router, it would not be able to capture a second one simultaneously since our architecture promotes transmitting classified packets with multiple levels of security. Additionally, a review of the literature showed the lack of research on this NP-Hard problem, and we were the first to present it in [53]. Finally, we introduced several heuristics that can help reach metaheuristics or an exact solution for the problem in the future.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Unlike many researches that focused on solving the problem of exchanging or outsourcing data securely and privately at the application layer and try to solve it using known techniques or traditional methods to protect outsourced information, our innovative approach addresses the problem from a different point of view and study the problem at the network layer and propose heuristics solution reduced from known NP-Hard problem and apply in the network security field. Furthermore, the presented algorithms in [53] were based only on the dispatching rules; however, this paper uses several techniques for the problem, such as dispatching rules, the local insertion search, the randomization method, and the lifting procedure.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The problem of the minimization of the maximum estimated transmission time for the two routers under the confidentiality constraint is an NP-Hard problem as proved in [53].…”

Section: Problem Descriptionmentioning

confidence: 99%

“…The second best algorithm is RLT with a percentage of 72.8% and an average gap of 0.003. Now, we compare the best algorithm given in literature which is MDETA as detailed in [53] with the best-proposed algorithm RLT. We denoted by MV the minimum obtained between RLT and MDETA after running all the 960 instances.…”

Section: Plos Onementioning

confidence: 99%

See 3 more Smart Citations

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

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

“…The problem of the minimization of the maximum estimated transmission time for the two routers under the confidentiality constraint is an NP-Hard problem as proved in [53].…”

Section: Problem Descriptionmentioning

confidence: 99%

Section: Plos Onementioning

confidence: 99%

See 2 more Smart Citations

Novel intelligent architecture and approximate solution for future networks

Sarhan

Jemmali

2023

PLoS ONE

Self Cite

View full text Add to dashboard Cite

show abstract

“…These algorithms can be exploited to give a new solutions for the presented problem. In [29], authors developed algorithms for the category constraint into network based on scheduling problem. Authors in [30] developed algorithms for the read frequency of data.…”

Section: Introductionmentioning

confidence: 99%

Algorithms for the executable programs planning on supercomputers

Algashami

2022

PLoS ONE

View full text Add to dashboard Cite

This research dealt with the problem of scheduling applied to the supercomputer’s execution. The goal is to develop an appreciated algorithm that schedules a group of several programs characterized by their time consuming very high on different supercomputers searching for an efficient assignment of the total running time. This efficient assignment grantees the fair load distribution of the execution on the supercomputers. The essential goal of this research is to propose several algorithms that can ensure the load balancing of the execution of all programs. In this research, all supercomputers are assumed to have the same hardware characteristics. The main objective is to minimize the gap between the total running time of the supercomputers. This minimization of the gap encompasses the development of novel solutions giving planning of the executable programs. Different algorithms are presented to minimize the gap in running time. The experimental study proves that the developed algorithms are efficient in terms of performance evaluation and running time. A comparison between the presented algorithms is discussed through different classes of instances where in total the number of instances reached 630. The experiments show that the efficient algorithm is the best-programs choice algorithm. Indeed, this algorithm reached the percentage of 72.86%, an average running time of 0.0121, and a gap value of 0.0545.

show abstract