Novel intelligent architecture and approximate solution for future networks.

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 [Formula: see text] 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.