QOGMP: QoS-oriented Global Multi-path Traffic Scheduling Algorithm in Software Defined Network

QOGMP: QoS-oriented Global Multi-path Traffic Scheduling Algorithm in Software Defined Network | 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 Article QOGMP: QoS-oriented Global Multi-path Traffic Scheduling Algorithm in Software Defined Network Yiping Guo, Guyu Hu, Dongsheng Shao This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-1770227/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 9 You are reading this latest preprint version Abstract According to the research status of SDN(Software Defined Network) control layer traffic scheduling, we find the current common problems, including single path, easy congestion, QoS(Quality of Service) requirements and high delay. To solve these four problems, we design and implement a QoS-oriented global multi-path traffic scheduling algorithm for SDN, referred to as QOGMP. First, we propose a link weight calculation algorithm based on the idea of traction links and deep reinforcement learning, and conduct experimental verifications related to traction links. The algorithm considers QoS requirements and alleviates the problems of easy congestion and high delay. Then, we propose a traffic scheduling algorithm based on link weight and multi-path scheme, which also considers QoS requirements and solves the problem of single path. Finally, we combined the link weight calculation algorithm and the traffic scheduling algorithm to implement QOGMP, and carried out comparative experiments in the built simulation environment. The experimental results show that QOGMP is better than the two comparison algorithms in terms of delay and rescheduling rate. Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Major revision 04 Jul, 2022 Reviews received at journal 03 Jul, 2022 Reviews received at journal 01 Jul, 2022 Reviewers agreed at journal 22 Jun, 2022 Reviewers invited by journal 21 Jun, 2022 Editor assigned by journal 21 Jun, 2022 Editor invited by journal 21 Jun, 2022 Submission checks completed at journal 21 Jun, 2022 First submitted to journal 17 Jun, 2022 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-1770227","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":115366584,"identity":"a7035166-88c2-4c74-8e7c-420e4ea493e9","order_by":0,"name":"Yiping Guo","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA20lEQVRIiWNgGAWjYBACfvbGxsc/KmzsGNubDxCnRbLn8GFjhjNpycw9xxKI02Jwwy1NmrHtMGP7jBwDIl12g8dMuoDtMDNvQ87HG28Y7OR0GwjoYJzdY2w9gyedT7Lh7GbLOQzJxmYHCGhhljljeINHwprZsLF3mzQPw4HEbYS0sEnkGEjwGDAz7j/M84w4LTwSaUnSPAnOjI1tPGzEaZHgOXzYcMaBtGTGHjZjyzkGRPjF/nhj44OP/4BROf/xwxtvKuzkCGpBs5LYqEHSQqqOUTAKRsEoGBEAADFnRGgfPMJjAAAAAElFTkSuQmCC","orcid":"","institution":"People’s Liberation Army Engineering University","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Yiping","middleName":"","lastName":"Guo","suffix":""},{"id":115366585,"identity":"bb3cbdcc-0f22-4185-89b5-785299291a2d","order_by":1,"name":"Guyu Hu","email":"","orcid":"","institution":"People’s Liberation Army Engineering University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Guyu","middleName":"","lastName":"Hu","suffix":""},{"id":115366586,"identity":"92bd2444-1afb-47ae-aae5-f9d4711da4cf","order_by":2,"name":"Dongsheng Shao","email":"","orcid":"","institution":"Unit 31106 of People’s Liberation Army","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Dongsheng","middleName":"","lastName":"Shao","suffix":""}],"badges":[],"createdAt":"2022-06-18 03:14:03","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-1770227/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-1770227/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":23230801,"identity":"76dee41f-c3e2-4e5a-b9dd-c2b79d47e7a1","added_by":"auto","created_at":"2022-06-29 14:31:11","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":341234,"visible":true,"origin":"","legend":"","description":"","filename":"main.pdf","url":"https://assets-eu.researchsquare.com/files/rs-1770227/v1_covered.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"QOGMP: QoS-oriented Global Multi-path Traffic Scheduling Algorithm in Software Defined Network","fulltext":[{"header":"Full Text","content":"This preprint is available for \u003ca href='/article/rs-1770227/latest.pdf' target='_blank'\u003edownload as a PDF\u003c/a\u003e."}],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":false,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-1770227/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-1770227/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"According to the research status of SDN(Software Defined Network) control layer traffic scheduling, we find the current common problems, including single path, easy congestion, QoS(Quality of Service) requirements and high delay. To solve these four problems, we design and implement a QoS-oriented global multi-path traffic scheduling algorithm for SDN, referred to as QOGMP. First, we propose a link weight calculation algorithm based on the idea of traction links and deep reinforcement learning, and conduct experimental verifications related to traction links. The algorithm considers QoS requirements and alleviates the problems of easy congestion and high delay. Then, we propose a traffic scheduling algorithm based on link weight and multi-path scheme, which also considers QoS requirements and solves the problem of single path. Finally, we combined the link weight calculation algorithm and the traffic scheduling algorithm to implement QOGMP, and carried out comparative experiments in the built simulation environment. The experimental results show that QOGMP is better than the two comparison algorithms in terms of delay and rescheduling rate.","manuscriptTitle":"QOGMP: QoS-oriented Global Multi-path Traffic Scheduling Algorithm in Software Defined Network","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2022-06-29 14:31:06","doi":"10.21203/rs.3.rs-1770227/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Major revision","date":"2022-07-04T07:20:05+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2022-07-04T00:15:20+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2022-07-02T01:33:12+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"4566bf3d-4a5f-41b9-8bad-380b6301e6d4","date":"2022-06-22T23:45:59+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2022-06-22T03:37:37+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2022-06-22T03:34:55+00:00","index":"","fulltext":""},{"type":"editorInvited","content":"","date":"2022-06-21T17:35:54+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2022-06-21T17:29:13+00:00","index":"","fulltext":""},{"type":"submitted","content":"Scientific Reports","date":"2022-06-18T03:11:38+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"8cb10e28-b130-450e-b8c4-9eafca14b38b","owner":[],"postedDate":"June 29th, 2022","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2022-08-22T09:29:36+00:00","versionOfRecord":[],"versionCreatedAt":"2022-06-29 14:31:06","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-1770227","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-1770227","identity":"rs-1770227","version":["v1"]},"buildId":"rHA-KDH7Qsr4HCuvH75dn","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}