An enhanced multilevel secure data dissemination approximate solution for future networks

Authors:
raw_author_name: Mohammad Mahmood Otoom
raw_affiliation_string: Department of Computer Science and Information, College of Science at Zulfi, Majmaah University, Al-Majmaah, Saudi Arabia
raw_author_name: Mahdi Jemmali
raw_affiliation_string: College of Computing and Informatics, University of Sharjah, Sharjah, United Arab Emirates; Higher Institute of Computer Science and Mathematics, University of Monastir, Monastir, Tunisia; Mars Laboratory, University of Sousse, Sousse, Tunisia
raw_author_name: Akram Y. Sarhan
raw_affiliation_string: Department of Information Technology, College of Computing and Information Technology at Khulis, University of Jeddah, Jeddah, Saudi Arabia
raw_author_name: Imen Achour
raw_affiliation_string: Department of Computer Science and Information, College of Science at Zulfi, Majmaah University, Al-Majmaah, Saudi Arabia
raw_author_name: Ibrahim Alsaduni
raw_affiliation_string: Department of Electrical Engineering, College of Engineering, Majmaah University, Al-Majmaah, Saudi Arabia
raw_author_name: Mohamed Nazih Omri
raw_affiliation_string: Mars Laboratory, University of Sousse, Sousse, Tunisia

Abstract: 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 ( <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M1"><mml:mover accent="true"><mml:mrow><mml:mi>B</mml:mi> <mml:mi>R</mml:mi></mml:mrow> <mml:mo>˜</mml:mo></mml:mover></mml:math> ), 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, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M2"><mml:mover accent="true"><mml:mrow><mml:mi>B</mml:mi> <mml:mi>R</mml:mi></mml:mrow> <mml:mo>˜</mml:mo></mml:mover></mml:math> is compared to the best-proposed algorithm in the literature which is the Modified decreasing Estimated-Transmission Time algorithm ( MDETA ). The results show that <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="M3"><mml:mover accent="true"><mml:mrow><mml:mi>B</mml:mi> <mml:mi>R</mml:mi></mml:mrow> <mml:mo>˜</mml:mo></mml:mover></mml:math> is the best one in 100% of cases where MDETA reaches the best results in only 48%.