Multipath routing based on a network coding protocol suit

Multipath routing based on a network coding protocol suit | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Physical Sciences - Article Multipath routing based on a network coding protocol suit Renyong Wu, Yang Zhong, Qiaolian Xiang, Qingyuan Wu, Hao Xiao This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-5496340/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted You are reading this latest preprint version Abstract New emerging technologies and applications are overtaking the performance that the legacy Transmission Control Protocol over Internet Protocol architecture1 can provide despite improvements having achieved in newly-proposed transport layer protocols2,3. By utilizing links of a network as many as possible to transmit data packets, network coding holds promise of multipath routing for the future Internet protocol networks, which is different from existing routing protocols where packets are delivered along the shortest path to the destination4,5. However, its practical implementation encounters two primary challenges: forming a directed acyclic graph (similar to the shortest path first tree in existing routing protocols) between the source and destination, and distributing an appropriate encoding matrix to each node of the graph. Here we show an integrated depth-first and breadth-first search algorithm that builds a multipath routing table for each node, thereby constructing a directed acyclic graph. We also find that, based on this search algorithm, it is easy to develop a complete network coding protocol suite. Moreover, an integration with the intermediate system-to-intermediate system within a test bed environment revealed significant performance improvements. This result marks the advent of an alternative and new, endogenous security, well compatible general routing solution for the future networks. Physical sciences/Engineering/Electrical and electronic engineering Physical sciences/Mathematics and computing/Information technology Full Text Additional Declarations There is NO Competing Interest. Supplementary Files Methods20241115.pdf Extended Data Supplementary20241115.pdf Supplementary Information Cite Share Download PDF Status: Under Review Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-5496340","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Physical Sciences - Article","associatedPublications":[],"authors":[{"id":381373710,"identity":"be684c8a-9895-4bf6-bd7e-1ba1fd9d541d","order_by":0,"name":"Renyong Wu","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA10lEQVRIiWNgGAWjYFAD9h4wxdhAvBaeMyRrkcghUovBjdyHjwvbbPLkI98ee8zDYCO74QDzswf4taQbG89sSys2vJ2XbszDkGa84QCbuQE+LWY30tikedsOJ26cnWMmzcNwOHHDAR42CQJa2H+Dtcw8A9LynygtbMwgLfMleEBaDhDWYn/mGbM0z7m0xA08OWaScwySjWceZjPDq0WyPY3xM0+ZTeL89jNmEm8q7GT7jjc/w6sFDBjZgEF3AMQCBRUzQfUg8IeBQb6BKJWjYBSMglEwEgEAXKlFEIJf43gAAAAASUVORK5CYII=","orcid":"","institution":"Hunan University","correspondingAuthor":true,"prefix":"","firstName":"Renyong","middleName":"","lastName":"Wu","suffix":""},{"id":381373711,"identity":"4c167690-7eb0-4cd1-a352-d7245969d29f","order_by":1,"name":"Yang Zhong","email":"","orcid":"","institution":"Hunan University","correspondingAuthor":false,"prefix":"","firstName":"Yang","middleName":"","lastName":"Zhong","suffix":""},{"id":381373712,"identity":"4794d85f-0468-4655-996b-e31c2037478f","order_by":2,"name":"Qiaolian Xiang","email":"","orcid":"","institution":"South-Central Minzu University","correspondingAuthor":false,"prefix":"","firstName":"Qiaolian","middleName":"","lastName":"Xiang","suffix":""},{"id":381373713,"identity":"0c0d44c5-1ab7-426c-83de-8c962c4266f9","order_by":3,"name":"Qingyuan Wu","email":"","orcid":"","institution":"South-Central Minzu University","correspondingAuthor":false,"prefix":"","firstName":"Qingyuan","middleName":"","lastName":"Wu","suffix":""},{"id":381373714,"identity":"0d54b222-3451-4449-b146-35e2c87903da","order_by":4,"name":"Hao Xiao","email":"","orcid":"","institution":"Hunan University","correspondingAuthor":false,"prefix":"","firstName":"Hao","middleName":"","lastName":"Xiao","suffix":""}],"badges":[],"createdAt":"2024-11-21 08:55:28","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-5496340/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-5496340/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":78956513,"identity":"0b10df3f-a1b2-4e9d-a0fc-41a8033b849c","added_by":"auto","created_at":"2025-03-21 10:23:11","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":469423,"visible":true,"origin":"","legend":"Article File","description":"","filename":"Nature20241115.pdf","url":"https://assets-eu.researchsquare.com/files/rs-5496340/v1_covered_c6cfd74f-b283-4713-9bbf-6f3784541ba4.pdf"},{"id":78956345,"identity":"0925e126-73bc-41ee-b9e6-861c61e383bb","added_by":"auto","created_at":"2025-03-21 10:15:10","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"supplement","size":502396,"visible":true,"origin":"","legend":"Extended Data","description":"","filename":"Methods20241115.pdf","url":"https://assets-eu.researchsquare.com/files/rs-5496340/v1/b119753d514ceb4f83b89740.pdf"},{"id":78956344,"identity":"f6e1ee5a-df35-4f80-a8f3-65e7694f79eb","added_by":"auto","created_at":"2025-03-21 10:15:10","extension":"pdf","order_by":2,"title":"","display":"","copyAsset":false,"role":"supplement","size":380456,"visible":true,"origin":"","legend":"Supplementary Information","description":"","filename":"Supplementary20241115.pdf","url":"https://assets-eu.researchsquare.com/files/rs-5496340/v1/7542caa805a2d03eaa9e857f.pdf"}],"financialInterests":"There is \u003cb\u003eNO\u003c/b\u003e Competing Interest.","formattedTitle":"Multipath routing based on a network coding protocol suit","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"nature-portfolio","isNatureJournal":true,"hasQc":false,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"","title":"Nature Portfolio","twitterHandle":"","acdcEnabled":false,"dfaEnabled":false,"editorialSystem":"ejp","reportingPortfolio":"","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-5496340/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-5496340/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"New emerging technologies and applications are overtaking the performance that the legacy Transmission Control Protocol over Internet Protocol architecture1 can provide despite improvements having achieved in newly-proposed transport layer protocols2,3. By utilizing links of a network as many as possible to transmit data packets, network coding holds promise of multipath routing for the future Internet protocol networks, which is different from existing routing protocols where packets are delivered along the shortest path to the destination4,5. However, its practical implementation encounters two primary challenges: forming a directed acyclic graph (similar to the shortest path first tree in existing routing protocols) between the source and destination, and distributing an appropriate encoding matrix to each node of the graph. Here we show an integrated depth-first and breadth-first search algorithm that builds a multipath routing table for each node, thereby constructing a directed acyclic graph. We also find that, based on this search algorithm, it is easy to develop a complete network coding protocol suite. Moreover, an integration with the intermediate system-to-intermediate system within a test bed environment revealed significant performance improvements. This result marks the advent of an alternative and new, endogenous security, well compatible general routing solution for the future networks.","manuscriptTitle":"Multipath routing based on a network coding protocol suit","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-03-21 10:15:05","doi":"10.21203/rs.3.rs-5496340/v1","editorialEvents":[],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"communications-engineering","isNatureJournal":true,"hasQc":false,"allowDirectSubmit":false,"externalIdentity":"commseng","sideBox":"Learn more about [Communications Engineering](http://link.springer.com/journal/44172)","snPcode":"44172","submissionUrl":"https://mts-commseng.nature.com/cgi-bin/main.plex","title":"Communications Engineering","twitterHandle":"@commseng","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"ejp","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"cf4138dd-aca8-448f-b109-ad855a2a5b9d","owner":[],"postedDate":"March 21st, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[{"id":40622188,"name":"Physical sciences/Engineering/Electrical and electronic engineering"},{"id":40622189,"name":"Physical sciences/Mathematics and computing/Information technology"}],"tags":[],"updatedAt":"2025-04-13T12:30:07+00:00","versionOfRecord":[],"versionCreatedAt":"2025-03-21 10:15:05","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-5496340","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-5496340","identity":"rs-5496340","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}