Two routers network architecture and scheduling algorithms under packet category classification constraint
Akram Y. Sarhan, Mahdi Jemmali, Abir Ben Hmida
Abstract
The sending and exchanging of data have become essential in the current revolution of industry 4.0 and digital transformation and all aspects of life. Ensuring the security of transmitted data continues to be a critical issue due to the fast advancement in technology. The studied problem is proven to be NP-hard in the strong sense. The contribution of this paper is twofold. First, we propose a network architecture that enables multilevel data sharing through two routers based on a data category classification constraint. Second, we propose a set of heuristic algorithms for an NP-Hard problem. The constraint of the studied problem is described as follows. Two files belonging to the same category of confidential level should not be transmitted simultaneously through the routers. The proposed architecture involves a scheduler component responsible for finding a schedule that minimizes the maximum estimated transmission time respecting the data category classification constraint. An experimental result is carried out to show the performance of the proposed algorithms. Several indicators are used to measure the performance of algorithms. The best algorithm is the Modified decreasing estimated-transmission time algorithm in 91.6% of cases. The experimental results confirm the practicality of the proposed scheme in terms of two-machines scheduling problems.