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

Abstract

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.

An enhanced multilevel secure data dissemination approximate solution for future networks

“…While the best algorithm in [ 13 ] is the Randomized Longest Transmission time first algorithm ( ). On the other hand, the best algorithm proposed in [ 14 ] is the first variants of the Random-Grouped Classification with Shortest Scheduling Algorithms ( RGS 1 ). Table 5 shows an overview of the performance results for the developed algorithms in the literature.…”

“…Furthermore, compared with previous works. The proposed approach continues to enhance the results compared with previous developed algorithms in [12][13][14] results as it being detailed in the result and discussion section. It uses new algorithmic techniques and procedures.…”

“…In addition, authors in [ 13 ] proposed several algorithms based on critical-level security and randomization to deal with the studied problem. In the same context, the authors in [ 14 , 15 ] proposed novel heuristics to solve the studied problem approximately. The author in last work used several recognized and unknown algorithmic methods like iterative, randomization, and probabilistic methods.…”

“…Therefore, a security constraint is being used to prevent the transmission of two packets belonging to the same security level simultaneously through two different routers. Such a problem has been proven to be NP-hard [ 14 ].…”

“…Several algorithms have been proposed to deal with network scheduling problems. However, algorithms presented in [12][13][14][15] dealt with the issue presented in this paper which is transmitting multiple levels of data based on a constraint. Such a problem is an NP-hard [12] because the minimization of total time for transmitting data through two routers in this paper is reduced from two parallel machines NP-Hard problem.…”