Novel intelligent architecture and approximate solution for future networks

Abstract

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.

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

“…Furthermore, for 134 instances, we have Bnew = MDETA. On the other hand, comparing the results given by the proposed algorithms with the best algorithm developed in ( Sarhan & Jemmal, 2023 ), shows that for 13 instances, we have Bnew< . This means that Bnew participates in giving a better solution with .…”

“…The current section describes the experimental findings of the created algorithms and compares the results with those presented in works of ( Sarhan, Jemmali & Ben Hmida, 2021 ; Sarhan & Jemmal, 2023 ) to find the best algorithm. A summary of the core experimental variables and performance results is in Tables 2 – 6 .…”

“…In this article, we suggested a group of algorithms that give remarkable results. We compare the results with those of ( Sarhan, Jemmali & Ben Hmida, 2021 ; Sarhan & Jemmal, 2023 ). We denote Bnew for the algorithm that gives the best value of all proposed algorithms—running the best algorithm MDETA developed in ( Sarhan, Jemmali & Ben Hmida, 2021 ) on the 300 used instances.…”

“…On the other hand, Sarhan et al’s packet multilevel security scheme uses a constraint-based packet categorization and dissemination and two routers. In addition, the authors suggested several scheduling algorithms to minimize the transmission time ( Sarhan, Jemmali & Ben Hmida, 2021 ; Sarhan & Jemmal, 2023 ). This research uses different heuristics to deal with the proposed problem.…”

“…This section presents five newly designed algorithms that solve the studied problem ( Sarhan, Jemmali & Ben Hmida, 2021 ; Sarhan & Jemmal, 2023 ) in a remarkable time. The proposed algorithms use different techniques to enhance the transmitted time and reduce the algorithmic complexity.…”