skip to main content
Idioma:
Primo Advanced Search
Primo Advanced Search Query Term
Primo Advanced Search prefilters
Busca Simples

Novel intelligent architecture and approximate solution for future networks

Sarhan, Akram ; Jemmali, Mahdi Kumar, Sathish A.P.

PloS one, 2023-03, Vol.18 (3), p.e0278183-e0278183 [Periódico revisado por pares]

United States: Public Library of Science

Texto completo disponível

Citações Citado por
  • Título:
    Novel intelligent architecture and approximate solution for future networks
  • Autor: Sarhan, Akram ; Jemmali, Mahdi
  • Kumar, Sathish A.P.
  • Assuntos: Algorithms ; Analysis ; Architecture ; Artificial intelligence ; Benchmarking ; Communication ; Computer and Information Sciences ; Computer architecture ; Energy consumption ; Engineering and Technology ; Health Facilities ; Information Dissemination ; Interception ; Management ; Military communications ; Network security ; Neural networks ; Outsourcing ; Packet transmission ; Physical Sciences ; Privacy ; Research and Analysis Methods ; Routers ; Social Sciences
  • É parte de: PloS one, 2023-03, Vol.18 (3), p.e0278183-e0278183
  • Notas: ObjectType-Article-1
    SourceType-Scholarly Journals-1
    ObjectType-Feature-2
    content type line 23
    Competing Interests: The authors have declared that no competing interests exist.
  • Descrição: 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.
  • Editor: United States: Public Library of Science
  • Idioma: Inglês
Links
Voltar para lista de resultados
Ir para página anteriorAnterior Resultado  2 AvançarIr para próxima página

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.