A Novel Two-Routers Model Based on Category Constraints Secure Data-Dissemination-Aware Scheduling in Next-Generation Communication Networks
Data breaches are a critical issue and have become one of the top widespread risks in today’s data-driven digital environment. Hence, Secure data outsourcing is essential in today’s digital communications. The current interconnected network lack many core features, including privacy and security, wh...
Gespeichert in:
Veröffentlicht in: | Journal of network and systems management 2023-07, Vol.31 (3), p.59, Article 59 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Data breaches are a critical issue and have become one of the top widespread risks in today’s data-driven digital environment. Hence, Secure data outsourcing is essential in today’s digital communications. The current interconnected network lack many core features, including privacy and security, which make it vulnerable to data leakages when transmitting sensitive information during critical circumstances (e.g., natural and human disasters). In this paper, we propose a network model that can be employed as a future private network paradigm to promptly and securely transmit confidential data, hence minimizing the chances of breaches. Our schemes provide the following contributions: (1) design a private novel network architecture to disseminate multilevel confidential packets using two routers; (2) Develop several heuristics to reduce an NP-hard problem to find an optimal solution for the studied problem; (3) Employee a developed scheduler for selecting the best algorithm that schedule packets securely and timely through two routers such that critical data packets associated to the same confidential level are prohibited from being transmitted at the same time; (4) conduct an analysis study to compare the developed heuristics and to prove the practicality of the proposed solution. The experimental results show the performance of the proposed heuristics. The results showed that the best heuristic is IFP2 in 84.4% of cases. |
---|---|
ISSN: | 1064-7570 1573-7705 |
DOI: | 10.1007/s10922-023-09747-y |