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!
|
container_end_page | |
---|---|
container_issue | 3 |
container_start_page | 59 |
container_title | Journal of network and systems management |
container_volume | 31 |
creator | Jemmali, Mahdi Ben Hmida, Abir Sarhan, Akram Y. |
description | 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. |
doi_str_mv | 10.1007/s10922-023-09747-y |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2831675834</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2831675834</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-2b06de2990ce318cd995fa47feb90837a812f45e85eb6600138df70a9cbf28db3</originalsourceid><addsrcrecordid>eNp9kM9O3DAQxqMKpC5_XoCTJc4uYzuJ4-OyFFqJbiV2OVtOMlkCu_ZiO2zzDn3ougSpt55mxvN938i_LLtg8IUByKvAQHFOgQsKSuaSjp-yGSukoFJCcZR6KHMqCwmfs5MQngGgEqqYZb_nZOnecEvWB0cf3BDRB_LDtenl2gRsibNkYSJunB_JwtkQveltDGSFzeCR3Jho6E0fAu56a2LvLJ0fTFqsmidsh21vN6S3ZIm_Ir1Di_5dk5J2u8H2zTQtMR6cfwln2XFntgHPP-pp9nj7db34Ru9_3n1fzO9pI5iKlNdQtsiVggYFq5pWqaIzueywVulb0lSMd3mBVYF1WQIwUbWdBKOauuNVW4vT7HLK3Xv3OmCI-tkN3qaTmleClbKoRJ5UfFI13oXgsdN73--MHzUD_Ze6nqjrRF2_U9djMonJFJLYbtD_i_6P6w98p4gj</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2831675834</pqid></control><display><type>article</type><title>A Novel Two-Routers Model Based on Category Constraints Secure Data-Dissemination-Aware Scheduling in Next-Generation Communication Networks</title><source>SpringerLink Journals</source><creator>Jemmali, Mahdi ; Ben Hmida, Abir ; Sarhan, Akram Y.</creator><creatorcontrib>Jemmali, Mahdi ; Ben Hmida, Abir ; Sarhan, Akram Y.</creatorcontrib><description>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.</description><identifier>ISSN: 1064-7570</identifier><identifier>EISSN: 1573-7705</identifier><identifier>DOI: 10.1007/s10922-023-09747-y</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Communication networks ; Communications Engineering ; Computer architecture ; Computer Communication Networks ; Computer Science ; Computer Systems Organization and Communication Networks ; Constraint modelling ; Heuristic ; Information Systems and Communication Service ; Networks ; Operations Research/Decision Theory ; Routers ; Scheduling ; Security in Next-Generation Communication Networks</subject><ispartof>Journal of network and systems management, 2023-07, Vol.31 (3), p.59, Article 59</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-2b06de2990ce318cd995fa47feb90837a812f45e85eb6600138df70a9cbf28db3</citedby><cites>FETCH-LOGICAL-c319t-2b06de2990ce318cd995fa47feb90837a812f45e85eb6600138df70a9cbf28db3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10922-023-09747-y$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10922-023-09747-y$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Jemmali, Mahdi</creatorcontrib><creatorcontrib>Ben Hmida, Abir</creatorcontrib><creatorcontrib>Sarhan, Akram Y.</creatorcontrib><title>A Novel Two-Routers Model Based on Category Constraints Secure Data-Dissemination-Aware Scheduling in Next-Generation Communication Networks</title><title>Journal of network and systems management</title><addtitle>J Netw Syst Manage</addtitle><description>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.</description><subject>Algorithms</subject><subject>Communication networks</subject><subject>Communications Engineering</subject><subject>Computer architecture</subject><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Computer Systems Organization and Communication Networks</subject><subject>Constraint modelling</subject><subject>Heuristic</subject><subject>Information Systems and Communication Service</subject><subject>Networks</subject><subject>Operations Research/Decision Theory</subject><subject>Routers</subject><subject>Scheduling</subject><subject>Security in Next-Generation Communication Networks</subject><issn>1064-7570</issn><issn>1573-7705</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp9kM9O3DAQxqMKpC5_XoCTJc4uYzuJ4-OyFFqJbiV2OVtOMlkCu_ZiO2zzDn3ougSpt55mxvN938i_LLtg8IUByKvAQHFOgQsKSuaSjp-yGSukoFJCcZR6KHMqCwmfs5MQngGgEqqYZb_nZOnecEvWB0cf3BDRB_LDtenl2gRsibNkYSJunB_JwtkQveltDGSFzeCR3Jho6E0fAu56a2LvLJ0fTFqsmidsh21vN6S3ZIm_Ir1Di_5dk5J2u8H2zTQtMR6cfwln2XFntgHPP-pp9nj7db34Ru9_3n1fzO9pI5iKlNdQtsiVggYFq5pWqaIzueywVulb0lSMd3mBVYF1WQIwUbWdBKOauuNVW4vT7HLK3Xv3OmCI-tkN3qaTmleClbKoRJ5UfFI13oXgsdN73--MHzUD_Ze6nqjrRF2_U9djMonJFJLYbtD_i_6P6w98p4gj</recordid><startdate>20230701</startdate><enddate>20230701</enddate><creator>Jemmali, Mahdi</creator><creator>Ben Hmida, Abir</creator><creator>Sarhan, Akram Y.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ALSLI</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CNYFK</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M1O</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20230701</creationdate><title>A Novel Two-Routers Model Based on Category Constraints Secure Data-Dissemination-Aware Scheduling in Next-Generation Communication Networks</title><author>Jemmali, Mahdi ; Ben Hmida, Abir ; Sarhan, Akram Y.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-2b06de2990ce318cd995fa47feb90837a812f45e85eb6600138df70a9cbf28db3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Communication networks</topic><topic>Communications Engineering</topic><topic>Computer architecture</topic><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Computer Systems Organization and Communication Networks</topic><topic>Constraint modelling</topic><topic>Heuristic</topic><topic>Information Systems and Communication Service</topic><topic>Networks</topic><topic>Operations Research/Decision Theory</topic><topic>Routers</topic><topic>Scheduling</topic><topic>Security in Next-Generation Communication Networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jemmali, Mahdi</creatorcontrib><creatorcontrib>Ben Hmida, Abir</creatorcontrib><creatorcontrib>Sarhan, Akram Y.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Social Science Premium Collection</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Library & Information Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Library Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of network and systems management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jemmali, Mahdi</au><au>Ben Hmida, Abir</au><au>Sarhan, Akram Y.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Novel Two-Routers Model Based on Category Constraints Secure Data-Dissemination-Aware Scheduling in Next-Generation Communication Networks</atitle><jtitle>Journal of network and systems management</jtitle><stitle>J Netw Syst Manage</stitle><date>2023-07-01</date><risdate>2023</risdate><volume>31</volume><issue>3</issue><spage>59</spage><pages>59-</pages><artnum>59</artnum><issn>1064-7570</issn><eissn>1573-7705</eissn><abstract>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.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10922-023-09747-y</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1064-7570 |
ispartof | Journal of network and systems management, 2023-07, Vol.31 (3), p.59, Article 59 |
issn | 1064-7570 1573-7705 |
language | eng |
recordid | cdi_proquest_journals_2831675834 |
source | SpringerLink Journals |
subjects | Algorithms Communication networks Communications Engineering Computer architecture Computer Communication Networks Computer Science Computer Systems Organization and Communication Networks Constraint modelling Heuristic Information Systems and Communication Service Networks Operations Research/Decision Theory Routers Scheduling Security in Next-Generation Communication Networks |
title | A Novel Two-Routers Model Based on Category Constraints Secure Data-Dissemination-Aware Scheduling in Next-Generation Communication Networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T09%3A52%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Novel%20Two-Routers%20Model%20Based%20on%20Category%20Constraints%20Secure%20Data-Dissemination-Aware%20Scheduling%20in%20Next-Generation%20Communication%20Networks&rft.jtitle=Journal%20of%20network%20and%20systems%20management&rft.au=Jemmali,%20Mahdi&rft.date=2023-07-01&rft.volume=31&rft.issue=3&rft.spage=59&rft.pages=59-&rft.artnum=59&rft.issn=1064-7570&rft.eissn=1573-7705&rft_id=info:doi/10.1007/s10922-023-09747-y&rft_dat=%3Cproquest_cross%3E2831675834%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2831675834&rft_id=info:pmid/&rfr_iscdi=true |