Nous: Drop-Freeness and Duplicate-Freeness for Consistent Updating in SDN Multicast Routing
Consistent routing updates through Software-Defined Networking (SDN) can be difficult due to the asynchronous and distributed nature of the data plane. Recent studies have achieved consistent unicast routing updates. However, achieving consistent updates with drop-freeness and duplicate-freeness rem...
Gespeichert in:
| Veröffentlicht in: | IEEE/ACM transactions on networking Jg. 32; H. 5; S. 3685 - 3698 |
|---|---|
| Hauptverfasser: | , , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.10.2024
|
| Schlagworte: | |
| ISSN: | 1063-6692, 1558-2566 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Consistent routing updates through Software-Defined Networking (SDN) can be difficult due to the asynchronous and distributed nature of the data plane. Recent studies have achieved consistent unicast routing updates. However, achieving consistent updates with drop-freeness and duplicate-freeness remains a challenge for multicast with fewer known results. This paper proposes a Novel Ordered Update Scheme called Nous, a novel approach that offers a comprehensive solution for consistently updating multicast routing based on SDN. To avoid duplicate entries, Nous configures the inport match field in the forwarding rules. Nous implements a dependency graph to schedule update operations dynamically. It also solves the Replace Operation Tree Migration Problem (ROTMP) using a greedy solution. To compare the greedy solution with the optimal solution, we employ the state-of-the-art mathematical programming solver Gurobi Optimizer 7.5 (for solving the optimization problem), Mininet 2.0, and Floodlight 1.2 (for simulation and comparison) to obtain a near-optimal solution. Simulation results show that using the greedy solution, Nous can usually achieve near-optimal solutions to the ROTMP with an average of fewer than 1.2 rounds and within 10 ms in different scenarios. This makes Nous the first ordered update scheme to guarantee two consistent states simultaneously. |
|---|---|
| AbstractList | Consistent routing updates through Software-Defined Networking (SDN) can be difficult due to the asynchronous and distributed nature of the data plane. Recent studies have achieved consistent unicast routing updates. However, achieving consistent updates with drop-freeness and duplicate-freeness remains a challenge for multicast with fewer known results. This paper proposes a Novel Ordered Update Scheme called Nous, a novel approach that offers a comprehensive solution for consistently updating multicast routing based on SDN. To avoid duplicate entries, Nous configures the inport match field in the forwarding rules. Nous implements a dependency graph to schedule update operations dynamically. It also solves the Replace Operation Tree Migration Problem (ROTMP) using a greedy solution. To compare the greedy solution with the optimal solution, we employ the state-of-the-art mathematical programming solver Gurobi Optimizer 7.5 (for solving the optimization problem), Mininet 2.0, and Floodlight 1.2 (for simulation and comparison) to obtain a near-optimal solution. Simulation results show that using the greedy solution, Nous can usually achieve near-optimal solutions to the ROTMP with an average of fewer than 1.2 rounds and within 10 ms in different scenarios. This makes Nous the first ordered update scheme to guarantee two consistent states simultaneously. |
| Author | Jahanbakhsh, Nazila Gao, Xiaofeng Kong, Linghe Wu, Guanhao Majidi, Akbar Chen, Guihai Gao, Yucen |
| Author_xml | – sequence: 1 givenname: Xiaofeng orcidid: 0000-0003-1776-8799 surname: Gao fullname: Gao, Xiaofeng email: gaoxiaofeng@sjtu. edu.cn organization: Department of Computer Science and Engineering, MoE Key Laboratory of Artificial Intelligence, Shanghai Jiao Tong University, Shanghai, China – sequence: 2 givenname: Akbar orcidid: 0000-0003-3715-5105 surname: Majidi fullname: Majidi, Akbar email: majidi86@gmail.com organization: Department of Computer Science and Statistics, Trinity College Dublin, CONNECT/Enable Research Center, The University of Dublin, Dublin 2, Ireland – sequence: 3 givenname: Yucen orcidid: 0000-0002-7155-8250 surname: Gao fullname: Gao, Yucen email: guo_ke@sjtu.edu.cn organization: Department of Computer Science and Engineering, MoE Key Laboratory of Artificial Intelligence, Shanghai Jiao Tong University, Shanghai, China – sequence: 4 givenname: Guanhao surname: Wu fullname: Wu, Guanhao email: tian_zwyxhi@sjtu.edu.cn organization: Department of Computer Science and Engineering, MoE Key Laboratory of Artificial Intelligence, Shanghai Jiao Tong University, Shanghai, China – sequence: 5 givenname: Nazila surname: Jahanbakhsh fullname: Jahanbakhsh, Nazila email: jahanbakhsh.nazila@gmail.com organization: Department of Computer Science and Engineering, MoE Key Laboratory of Artificial Intelligence, Shanghai Jiao Tong University, Shanghai, China – sequence: 6 givenname: Linghe orcidid: 0000-0001-9266-3044 surname: Kong fullname: Kong, Linghe email: linghe.kong@sjtu.edu.cn organization: Department of Computer Science and Engineering, MoE Key Laboratory of Artificial Intelligence, Shanghai Jiao Tong University, Shanghai, China – sequence: 7 givenname: Guihai orcidid: 0000-0002-6934-1685 surname: Chen fullname: Chen, Guihai email: gchen@cs.sjtu.edu.cn organization: Department of Computer Science and Engineering, MoE Key Laboratory of Artificial Intelligence, Shanghai Jiao Tong University, Shanghai, China |
| BookMark | eNpNkE1LAzEQhoNUsK3-AMFD_sDWfG228Sb9UKFW0PbkYcluJrJSkyXJHvz33aUFPc0wM8_L8EzQyHkHCN1SMqOUqPvddrWbMcLEjAsilCwu0Jjm-TxjuZSjvieSZ1IqdoUmMX4TQjlhcow-t76LD3gZfJutA4CDGLF2Bi-79tDUOsHf2PqAF97FJiZwCe9bo1PjvnDj8Mdyi1-7Q-qJmPC774bFNbq0-hDh5lynaL9e7RbP2ebt6WXxuMlqRucp44xpzkUFkoICRSphtKWK9O-bSljNhSgsJzZnUnIqhcmtNobUhVa8EsWcTxE95dbBxxjAlm1ofnT4LSkpBzvlYKcc7JRnOz1zd2IaAPh3LwvVJ_IjLCdjFw |
| CODEN | IEANEP |
| Cites_doi | 10.1109/INFOCOM.2016.7524499 10.1109/INFOCOMWKSHPS57453.2023.10226178 10.1109/LCOMM.2016.2546240 10.1145/2491185.2491191 10.1145/2491185.2491190 10.1109/GLOCOM.2016.7841562 10.1145/2377677.2377748 10.1145/321043.321046 10.1145/2767386.2767412 10.1145/2486001.2486005 10.1109/TNET.2022.3192167 10.1016/j.jnca.2019.102504 10.1145/2491185.2491214 10.1145/1355734.1355746 10.1109/INFOCOM.2016.7524418 10.1109/TNET.2009.2030188 10.1007/s11704-016-6125-y 10.1109/IFIPNetworking.2016.7497232 10.1109/INFOCOM.2015.7218645 10.1145/2486001.2486012 10.1109/TNSM.2016.2585672 10.1109/TNSM.2015.2465371 10.17487/rfc7047 10.1109/ISCC.2012.6249274 10.1109/INFOCOM.2016.7524419 10.1145/2670518.2673873 10.1145/2535771.2535791 10.1109/CHINACOM.2014.7054265 10.17487/rfc4760 10.17487/rfc4624 10.17487/rfc3376 10.17487/rfc7761 10.1109/TNET.2016.2529058 10.1109/JPROC.2014.2371999 10.17487/rfc3170 10.1007/978-3-319-48314-6_25 10.1145/2896377.2901476 10.1145/2619239.2626307 10.1109/ICNP.2015.33 |
| ContentType | Journal Article |
| DBID | 97E RIA RIE AAYXX CITATION |
| DOI | 10.1109/TNET.2024.3404967 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-2566 |
| EndPage | 3698 |
| ExternalDocumentID | 10_1109_TNET_2024_3404967 10679783 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Shanghai Municipal Science and Technology Major Project grantid: 2021SHZDZX0102 funderid: 10.13039/501100010256 – fundername: Science Foundation Ireland grantid: 13/RC/2077 P2 – fundername: National Natural Science Foundation of China grantid: U23A20309; 62272302; 62172276; 62372296 funderid: 10.13039/501100001809 |
| GroupedDBID | -DZ -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 85S 8US 97E 9M8 AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABPPZ ABQJQ ABVLG ACGFS ACGOD ACIWK ACM ADBCU ADL AEBYY AEFXT AEJOY AENSD AETEA AETIX AFWIH AFWXC AGQYO AGSQL AHBIQ AI. AIBXA AIKLT AKJIK AKQYR AKRVB ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 D0L EBS EJD FEDTE GUFHI HF~ HGAVV HZ~ H~9 I07 ICLAB IEDLZ IES IFIPE IFJZH IPLJI JAVBF LAI LHSKQ M43 MVM O9- OCL P1C P2P PQQKQ RIA RIE RNS ROL TN5 UPT UQL VH1 XOL YR2 ZCA AAYXX CITATION |
| ID | FETCH-LOGICAL-c218t-322a334be61e9e90b4daf190155db4fa3447f30f52663164d5fadd0c7a93b4783 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001313347200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1063-6692 |
| IngestDate | Sat Nov 29 03:05:28 EST 2025 Wed Aug 27 02:18:05 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c218t-322a334be61e9e90b4daf190155db4fa3447f30f52663164d5fadd0c7a93b4783 |
| ORCID | 0000-0002-6934-1685 0000-0003-1776-8799 0000-0001-9266-3044 0000-0002-7155-8250 0000-0003-3715-5105 |
| PageCount | 14 |
| ParticipantIDs | crossref_primary_10_1109_TNET_2024_3404967 ieee_primary_10679783 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-10-01 |
| PublicationDateYYYYMMDD | 2024-10-01 |
| PublicationDate_xml | – month: 10 year: 2024 text: 2024-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | IEEE/ACM transactions on networking |
| PublicationTitleAbbrev | TNET |
| PublicationYear | 2024 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref13 ref35 ref12 ref34 ref15 ref37 ref14 ref36 ref31 ref30 ref11 ref33 ref10 ref32 (ref41) 2024 ref2 ref1 ref17 ref39 ref16 ref38 Richardson (ref25) 2008 (ref47) 2024 (ref42) 2024 ref24 ref46 ref23 ref45 ref26 ref20 ref22 ref44 ref43 Caesar (ref40) ref28 ref27 (ref19) 2024 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 (ref18) 2024 Dantu (ref21) 3746 |
| References_xml | – ident: ref38 doi: 10.1109/INFOCOM.2016.7524499 – ident: ref3 doi: 10.1109/INFOCOMWKSHPS57453.2023.10226178 – start-page: 1 volume-title: Forwarding and Control Element Separation (ForCES) Framework year: 3746 ident: ref21 – ident: ref11 doi: 10.1109/LCOMM.2016.2546240 – ident: ref7 doi: 10.1145/2491185.2491191 – ident: ref23 doi: 10.1145/2491185.2491190 – ident: ref39 doi: 10.1109/GLOCOM.2016.7841562 – ident: ref4 doi: 10.1145/2377677.2377748 – ident: ref46 doi: 10.1145/321043.321046 – ident: ref10 doi: 10.1145/2767386.2767412 – start-page: 15 volume-title: Proc. NSDI ident: ref40 article-title: Design and implementation of a routing control platform – ident: ref6 doi: 10.1145/2486001.2486005 – ident: ref1 doi: 10.1109/TNET.2022.3192167 – ident: ref17 doi: 10.1016/j.jnca.2019.102504 – volume-title: Mininet year: 2024 ident: ref41 – ident: ref37 doi: 10.1145/2491185.2491214 – volume-title: Floodlight year: 2024 ident: ref42 – ident: ref24 doi: 10.1145/1355734.1355746 – ident: ref44 doi: 10.1109/INFOCOM.2016.7524418 – volume-title: Software-Defined Networking: The New Norm for Networks year: 2024 ident: ref19 – ident: ref14 doi: 10.1109/TNET.2009.2030188 – ident: ref2 doi: 10.1007/s11704-016-6125-y – volume-title: RESTful Web Services year: 2008 ident: ref25 – ident: ref12 doi: 10.1109/IFIPNetworking.2016.7497232 – ident: ref43 doi: 10.1109/INFOCOM.2015.7218645 – ident: ref5 doi: 10.1145/2486001.2486012 – ident: ref15 doi: 10.1109/TNSM.2016.2585672 – ident: ref33 doi: 10.1109/TNSM.2015.2465371 – ident: ref22 doi: 10.17487/rfc7047 – ident: ref31 doi: 10.1109/ISCC.2012.6249274 – ident: ref16 doi: 10.1109/INFOCOM.2016.7524419 – ident: ref13 doi: 10.1145/2670518.2673873 – ident: ref36 doi: 10.1145/2535771.2535791 – ident: ref32 doi: 10.1109/CHINACOM.2014.7054265 – volume-title: Gurobi year: 2024 ident: ref47 – ident: ref30 doi: 10.17487/rfc4760 – ident: ref29 doi: 10.17487/rfc4624 – ident: ref27 doi: 10.17487/rfc3376 – volume-title: Openflow Switch Specification year: 2024 ident: ref18 – ident: ref28 doi: 10.17487/rfc7761 – ident: ref45 doi: 10.1109/TNET.2016.2529058 – ident: ref20 doi: 10.1109/JPROC.2014.2371999 – ident: ref26 doi: 10.17487/rfc3170 – ident: ref9 doi: 10.1007/978-3-319-48314-6_25 – ident: ref35 doi: 10.1145/2896377.2901476 – ident: ref8 doi: 10.1145/2619239.2626307 – ident: ref34 doi: 10.1109/ICNP.2015.33 |
| SSID | ssj0013026 |
| Score | 2.4673536 |
| Snippet | Consistent routing updates through Software-Defined Networking (SDN) can be difficult due to the asynchronous and distributed nature of the data plane. Recent... |
| SourceID | crossref ieee |
| SourceType | Index Database Publisher |
| StartPage | 3685 |
| SubjectTerms | Bandwidth consistent routing updates Delays multicast Multicast algorithms Protocols Routing Software defined networking Software-defined networks Unicast |
| Title | Nous: Drop-Freeness and Duplicate-Freeness for Consistent Updating in SDN Multicast Routing |
| URI | https://ieeexplore.ieee.org/document/10679783 |
| Volume | 32 |
| WOSCitedRecordID | wos001313347200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Xplore customDbUrl: eissn: 1558-2566 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0013026 issn: 1063-6692 databaseCode: RIE dateStart: 19930101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07a8MwED6a0KEd-kxp-kJDp4ISy5btqFtpEjqZQhMIdDCyfSpZnOA4_f09yS7J0qGLMbIM9iehT6d7fACPMdIsESi59o3PJVEGH5lCciJvPxeRLwrZiE3ESTJaLNR7m6zucmEQ0QWf4cDeOl9-scq39qhsaMud2aOKDnTiOG6StXYuA89pq1GfgEeR8lsXpvDUcJZMZmQK-nIQSNoRO035HQntqao4Upme_vNzzuCk3T2yl2a4z-EAyws43qspeAmfCdnyz2xcrdZ8aoNqaCljuizYeNu4qnHXTBtW5hQ7aajLms3XNteh_GLLkn2ME-aSc3O9qZmNG6IHPZhPJ7PXN94qKPCcqLvmBLgOAplhJFCh8jJZaOO2AGGRSaNtuT8TeCYkmg7IcCpCQ-udl8daBZmkX7uCbrkq8RoYErVrHIVG-EIasjIUXbQ2Tn-dWLAPT7-QpuumUEbqDAxPpRb_1OKftvj3oWfh3OvYIHnzR_stHNnXmyC6O-jW1Rbv4TD_rpeb6sHNgx9YYa8b |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8MwGH7RKagHPyfOzxw8CdmaNO0Wb-I2Js4i2MHAQ8naRHbpxtb5-32TVraLBy-lpKG0T0KevHk_HoD7tsZZwrSgihtOBVIG7ZhMUCRvnrKQs0yUYhPtKOqMx_K9SlZ3uTBaaxd8ppv21vnys1m6skdlLVvuzB5VbMNOIARnZbrW2mngOXU17OXTMJS8cmIyT7biqBejMchF0xe4J3aq8msa2tBVcbTSP_rnBx3DYbV_JE_lgJ_Als5P4WCjquAZfEZozT-S7mI2p30bVoOLGVF5Rrqr0lmt1824ZSVOsxMHOy_IaG6zHfIvMs3JRzciLj03VcuC2MghfFCHUb8XPw9opaFAUyTvgiLkyvfFRIdMSy29iciUcZuAIJsIo2zBP-N7JkCi9tF0ygKDK56XtpX0JwJ_7Rxq-SzXF0A0krvSncAwzoRBO0PiRSnjFNiRBxvw8AtpMi9LZSTOxPBkYvFPLP5JhX8D6hbOjY4lkpd_tN_B3iB-GybDl-j1Cvbtq8qQumuoFYuVvoHd9LuYLhe3bk78AKRAsmI |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Nous%3A+Drop-Freeness+and+Duplicate-Freeness+for+Consistent+Updating+in+SDN+Multicast+Routing&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Gao%2C+Xiaofeng&rft.au=Majidi%2C+Akbar&rft.au=Gao%2C+Yucen&rft.au=Wu%2C+Guanhao&rft.date=2024-10-01&rft.issn=1063-6692&rft.eissn=1558-2566&rft.volume=32&rft.issue=5&rft.spage=3685&rft.epage=3698&rft_id=info:doi/10.1109%2FTNET.2024.3404967&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TNET_2024_3404967 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon |