Link Capacity Distributions and Optimal Capacities for Competent Network Performance

Link Capacity Distributions and Optimal Capacities for Competent Network Performance | 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 Research Article Link Capacity Distributions and Optimal Capacities for Competent Network Performance Shivam Anil Chougule, Dripto Bakshi, Ayan Chatterjee, Amitava Mukherjee This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6350005/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract This work addresses traffic volume, link capacity, and elimination of congestion in networks with packetized traffic flows. We adopt an analytical approach for evaluating link capacities using stochastic distributions, under the presumptions regarding i) the graphical topology of the network, ii) the routing model, and iii) the flow information of the packets being transmitted in the network. Knowledge of the capacity distributions of the links has equipped us with the technique to determine the optimal link capacities. This optimal solution provides a rigid state of the traffic flow in the network which is characterized mathematically in this work. Circumventing congestion and downtime for an individual link and the network at large and thereby ensuring optimal operability are the main objectives of this paper. In this work, we analyze a network that achieves up-time 85% using the algorithm to determine the corresponding link capacities of any network. Networks Traffic Packets Link Capacity Congestion Control Optimal Capacity Allocation Traffic Flow Model Packet Generation Model Packet Routing Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted 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-6350005","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":465901785,"identity":"1de1851b-aee5-4e77-8a26-e7850b15f247","order_by":0,"name":"Shivam Anil Chougule","email":"","orcid":"","institution":"Indian Institute of Technology","correspondingAuthor":false,"prefix":"","firstName":"Shivam","middleName":"Anil","lastName":"Chougule","suffix":""},{"id":465901786,"identity":"7e2c3427-1639-4918-a101-7b4103a15911","order_by":1,"name":"Dripto Bakshi","email":"","orcid":"","institution":"Indian Institute of Technology","correspondingAuthor":false,"prefix":"","firstName":"Dripto","middleName":"","lastName":"Bakshi","suffix":""},{"id":465901787,"identity":"c2a97640-7cb2-46f9-9214-beb73e56a2de","order_by":2,"name":"Ayan Chatterjee","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABPUlEQVRIie2Rz0uEQBTHtQG9aF7f4mb/woiQdKl/ZcTDXrxEEB4WGliwS3sXdqt/oVNnRfAknT1ICUF7MXDpsrESTRoRaT+OQX5g5h3mfeYL73FcT89fBJqCmuK+XtKHZ4lrAxxPg3clYUeo2/CPSgPv/UJRZpPFXeneiIpI+Uf5PNPMi2mYr6pKM2eUzx+8dkgW6zRIDtHgNECqfHVvDONNW5962BhmAdLP2goGotPQIwinhGNKZPmCtAMyxZYPRFDlLmW0pOEzQfu3OVrL81oxn6oKHzNFXHcqDkuhLAU49idtUpAkYAIsBXUokDoHfhITBInl7c7jyADBMdQtz9B9sCaD+XV7Yv7osnTHxFZOoigtxpEGKNGXRaVtA9hhWRy1p/yGzZZCNz5tgadf9jP26pbVdy09PT09/5YXZgdpaBtZ0UMAAAAASUVORK5CYII=","orcid":"","institution":"Northeastern University","correspondingAuthor":true,"prefix":"","firstName":"Ayan","middleName":"","lastName":"Chatterjee","suffix":""},{"id":465901788,"identity":"ea5f3614-e3fa-4201-8769-d27e153ee6dc","order_by":3,"name":"Amitava Mukherjee","email":"","orcid":"","institution":"Amrita University","correspondingAuthor":false,"prefix":"","firstName":"Amitava","middleName":"","lastName":"Mukherjee","suffix":""}],"badges":[],"createdAt":"2025-04-01 06:23:27","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6350005/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6350005/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":83963528,"identity":"48e625d5-43c4-4692-a191-c1857f383b0a","added_by":"auto","created_at":"2025-06-05 06:03:37","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":742505,"visible":true,"origin":"","legend":"","description":"","filename":"LinkCapacitySpringerANS.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6350005/v1_covered_cf68ff22-dada-4e00-a471-61bf53f83f6e.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Link Capacity Distributions and Optimal Capacities for Competent Network Performance","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"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":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Networks, Traffic, Packets, Link Capacity, Congestion Control, Optimal Capacity Allocation, Traffic Flow Model, Packet Generation Model, Packet Routing","lastPublishedDoi":"10.21203/rs.3.rs-6350005/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6350005/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"This work addresses traffic volume, link capacity, and elimination of congestion in networks with packetized traffic flows. We adopt an analytical approach for evaluating link capacities using stochastic distributions, under the presumptions regarding i) the graphical topology of the network, ii) the routing model, and iii) the flow information of the packets being transmitted in the network. Knowledge of the capacity distributions of the links has equipped us with the technique to determine the optimal link capacities. This optimal solution provides a rigid state of the traffic flow in the network which is characterized mathematically in this work. Circumventing congestion and downtime for an individual link and the network at large and thereby ensuring optimal operability are the main objectives of this paper. In this work, we analyze a network that achieves up-time 85% using the algorithm to determine the corresponding link capacities of any network.","manuscriptTitle":"Link Capacity Distributions and Optimal Capacities for Competent Network Performance","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-06-05 05:39:11","doi":"10.21203/rs.3.rs-6350005/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"3e0e7ab6-3231-4b6f-b6d6-f215ed9d743e","owner":[],"postedDate":"June 5th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-06-05T05:39:11+00:00","versionOfRecord":[],"versionCreatedAt":"2025-06-05 05:39:11","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6350005","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6350005","identity":"rs-6350005","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}