Cross-domain Load Balancing Communication Mechanism Based on the Auction Game Theory

preprint OA: closed
Full text JSON View at publisher
Full text 12,125 characters · extracted from preprint-html · click to expand
Cross-domain Load Balancing Communication Mechanism Based on the Auction Game Theory | 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 Cross-domain Load Balancing Communication Mechanism Based on the Auction Game Theory fengjun shang, Lin Mao This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4527816/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 2 You are reading this latest preprint version Abstract This paper studied the cross-domain load balancing communication mechanism based on the game model. Firstly, the problem of routing between SDN/IP heterogeneous network inter-domain communication is analyzed. The SDN/IP cross-domain hybird network communication model is proposed. The network abstraction idea is introduced. The OpenFlow controller can be supported by the three-layer routing module and edge nodes. IP routing protocol to synchronize network reachable information between hybrid networks. In the Layer 3 routing module, the routing engine sub-module parses and responds to routing messages, and abstracts the OpenFlow network as a standard "Router". At the same time, three sub-modules of edge management, routing processing, and routing engine management are designed on the controller side. Forward control of inter-domain datagrams of SDN internal networks and management of routing engine sub-modules. Then, a feedback mechanism is added at the edge node location to actively detect and report the edge location state information to expand SDN impact. Secondly, for the problem of elephant stream forwarding in SDN/IP cross-domain network, a multi-path load balancing communication mechanism oriented to cross-domain is designed. The mechanism monitors the elephant flow in the network through the traffic monitoring module in real time, and proposes a multi-path dynamic load balancing algorithm to achieve network load balancing. Firstly, according to the real-time QoS index of the link, multiple minimum cost paths are calculated, and the idea of stream splitting is introduced. Multiple paths are used to bear an elephant stream, which reduces the burden of a single path and improves the utilization of network resources. Then the game model based auction model is introduced to calculate the offload strategy to optimize the maximum link utilization of the network. The simulation results show that the algorithm can effectively balance network traffic, meet the QoS requirements of the service, and increase the network resource utilization rate to 83%. Software-defined network Hybrid network communication Load balancing Multi-path routing game theory Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Submission checks completed at journal 06 Jun, 2024 First submitted to journal 04 Jun, 2024 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-4527816","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":311247590,"identity":"7a6d1f33-9db9-463f-9a1b-755c7784f08e","order_by":0,"name":"fengjun shang","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA5ElEQVRIiWNgGAWjYDACCRBhwyYH4zM2EKcljc0YzDlAghaGxAaitcjPbn728EsCX3p/e47Z4w8MNrIbDjA/e4BPi8GdY+bGMglsuTPOvDE3OMCQZrzhAJu5AV4tEglm0pI/2HI3SOSYSRxgOJy44QAPmwReh81I/yYtkcCWbgDR8p+wFoYbOWaSHxLYEqBaDhDWYnAjp0yaIYHNcMaZZ+UGZwySjWceZjMj5LBtkj8Sjsnztydve1BRYSfbd7z5GX6HAQEzD8MxIJXABrQUxCWkHggYfzDUQLWMglEwCkbBKMACAL0aSJkCcGaSAAAAAElFTkSuQmCC","orcid":"","institution":"Chongqing University of Posts and Telecommunications","correspondingAuthor":true,"prefix":"","firstName":"fengjun","middleName":"","lastName":"shang","suffix":""},{"id":311247591,"identity":"f1de4a19-0126-4523-92a9-ebc40e6b5fee","order_by":1,"name":"Lin Mao","email":"","orcid":"","institution":"Chongqing University of Posts and Telecommunications","correspondingAuthor":false,"prefix":"","firstName":"Lin","middleName":"","lastName":"Mao","suffix":""}],"badges":[],"createdAt":"2024-06-04 11:51:16","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4527816/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4527816/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":58768214,"identity":"725958e1-48f3-49d7-b6cc-340567aac193","added_by":"auto","created_at":"2024-06-20 23:03:46","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":678970,"visible":true,"origin":"","legend":"","description":"","filename":"future.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4527816/v1_covered_4ac6c0ba-f823-4efe-83eb-bab1c7170d9e.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Cross-domain Load Balancing Communication Mechanism Based on the Auction Game Theory","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":"wireless-networks","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"wine","sideBox":"Learn more about [Wireless Networks](http://link.springer.com/journal/11276)","snPcode":"11276","submissionUrl":"https://submission.nature.com/new-submission/11276/3","title":"Wireless Networks","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Software-defined network, Hybrid network communication, Load balancing, Multi-path routing, game theory","lastPublishedDoi":"10.21203/rs.3.rs-4527816/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4527816/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThis paper studied the cross-domain load balancing communication mechanism based on the game model. Firstly, the problem of routing between SDN/IP heterogeneous network inter-domain communication is analyzed. The SDN/IP cross-domain hybird network communication model is proposed. The network abstraction idea is introduced. The OpenFlow controller can be supported by the three-layer routing module and edge nodes. IP routing protocol to synchronize network reachable information between hybrid networks. In the Layer 3 routing module, the routing engine sub-module parses and responds to routing messages, and abstracts the OpenFlow network as a standard \"Router\". At the same time, three sub-modules of edge management, routing processing, and routing engine management are designed on the controller side. Forward control of inter-domain datagrams of SDN internal networks and management of routing engine sub-modules. Then, a feedback mechanism is added at the edge node location to actively detect and report the edge location state information to expand SDN impact. Secondly, for the problem of elephant stream forwarding in SDN/IP cross-domain network, a multi-path load balancing communication mechanism oriented to cross-domain is designed. The mechanism monitors the elephant flow in the network through the traffic monitoring module in real time, and proposes a multi-path dynamic load balancing algorithm to achieve network load balancing. Firstly, according to the real-time QoS index of the link, multiple minimum cost paths are calculated, and the idea of stream splitting is introduced. Multiple paths are used to bear an elephant stream, which reduces the burden of a single path and improves the utilization of network resources. Then the game model based auction model is introduced to calculate the offload strategy to optimize the maximum link utilization of the network. The simulation results show that the algorithm can effectively balance network traffic, meet the QoS requirements of the service, and increase the network resource utilization rate to 83%.\u003c/p\u003e","manuscriptTitle":"Cross-domain Load Balancing Communication Mechanism Based on the Auction Game Theory","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-06-20 22:55:38","doi":"10.21203/rs.3.rs-4527816/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"checksComplete","content":"","date":"2024-06-06T08:46:02+00:00","index":"","fulltext":""},{"type":"submitted","content":"Wireless Networks","date":"2024-06-04T11:48:50+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"wireless-networks","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"wine","sideBox":"Learn more about [Wireless Networks](http://link.springer.com/journal/11276)","snPcode":"11276","submissionUrl":"https://submission.nature.com/new-submission/11276/3","title":"Wireless Networks","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"c32e01c7-e51b-42fc-86a8-b4b4c179b784","owner":[],"postedDate":"June 20th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2024-06-20T22:55:38+00:00","versionOfRecord":[],"versionCreatedAt":"2024-06-20 22:55:38","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4527816","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4527816","identity":"rs-4527816","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00