End to end delay aware Service Function Chain Scheduling in Network Function Virtualization enabled networks

End to end delay aware Service Function Chain Scheduling in Network Function Virtualization enabled networks | 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 End to end delay aware Service Function Chain Scheduling in Network Function Virtualization enabled networks Sudha Dubba, Balaprakasa Rao Killi This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-3690663/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 05 Sep, 2024 Read the published version in Peer-to-Peer Networking and Applications → Version 1 posted 9 You are reading this latest preprint version Abstract Network function virtualization is a key enabling technology for the customization of network services in next-generation networks to support diverse applications. Most enterprise and network services contain specific network functions that are stitched together in a predefined sequence to form a service function chain. The deployment and scheduling of a service function chain onto the substrate network play a vital role in deciding the efficiency of resource utilization and the performance of network management. For a delay-sensitive network service request traversing a service function chain, the end-to-end packet delay is a crucial parameter that indicates the deployment performance. Transmission, propagation, processing, edge queueing, and virtualization delays all impact the order in which virtual network functions execute. Service level agreement violations and incorrect schedules are produced when the controller does not take edge queueing and virtualization delays into account. In this work, we propose a service function chain scheduling problem for the optimization of the end-to-end delay while considering transmission, propagation, queueing, virtualization, and processing delays. Then, we propose a scheduling approach based on the earliest finish times of the physical machines to minimize the end-to-end delay of the service function chain. The performance of the proposed service function chain scheduling approach using the earliest finish time is evaluated in terms of end-to-end delay, service level agreement violation ratio, resource utilization, and acceptance ratio. We compare our proposed algorithm with four existing approaches from the literature. Simulation results show that our proposed approach outperforms existing approaches in terms of end-to-end delay, service level agreement violation ratio, resource utilization, and acceptance ratio. Network Function Virtualization Service Function Chain Scheduling End-to-End Delay Service Level Agreement violation ratio Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 05 Sep, 2024 Read the published version in Peer-to-Peer Networking and Applications → Version 1 posted Editorial decision: Revision requested 30 Apr, 2024 Reviews received at journal 07 Apr, 2024 Reviews received at journal 04 Apr, 2024 Reviewers agreed at journal 19 Mar, 2024 Reviewers agreed at journal 14 Mar, 2024 Reviewers invited by journal 09 Jan, 2024 Editor assigned by journal 07 Jan, 2024 Submission checks completed at journal 07 Dec, 2023 First submitted to journal 01 Dec, 2023 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-3690663","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":257122227,"identity":"bc2c978d-a1c5-4801-a3bf-b8f8f5fc75cb","order_by":0,"name":"Sudha Dubba","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABGUlEQVRIie3OsUrEMBjA8a8EekvbrAknvVfIESi4+CwpBV3uAQqKphTieGvBe4gDXyBH4FwKXTM4nAhON9xtDqLWO+xii+DkkP+UfOHHFwCX6z+m8X4j2EeMvy7BYeTJ4xMaIsDZLkecSnQgpCWF/IUktKpRutQd6db0FzVajEPlc940a7LNH69hXN4+B3A2gVGo+wi1QvNQBXFiM58u6hcCJ6uiDCCbShSJPsKsJ7NQEZ5Y5LfrDAGSFuUMkAAUsF7SGDChYun93LTkvSM3w0Sfe0VVi3QJWUtkR8wgoXaGYJdrTmzGTxdrQ1VL7t7Yw1QNkKipR6+C6RjPV092e2UwJhebfZVfTjCue8nP/OOHvw8ul8vl+kuf+v9ceQ83HEEAAAAASUVORK5CYII=","orcid":"","institution":"National Institute of Technology Warangal","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Sudha","middleName":"","lastName":"Dubba","suffix":""},{"id":257122229,"identity":"87c630eb-e6fe-4484-b09d-6c01ca52908f","order_by":1,"name":"Balaprakasa Rao Killi","email":"","orcid":"","institution":"National Institute of Technology Warangal","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Balaprakasa","middleName":"Rao","lastName":"Killi","suffix":""}],"badges":[],"createdAt":"2023-12-01 06:44:16","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-3690663/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-3690663/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s12083-024-01800-0","type":"published","date":"2024-09-05T15:57:13+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":64185772,"identity":"ef63125f-587b-4fd0-9918-bbdb520e00a6","added_by":"auto","created_at":"2024-09-09 16:21:47","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":704867,"visible":true,"origin":"","legend":"","description":"","filename":"EndtoenddelayawareServiceFunctionChainSchedulinginNetworkFunctionVirtualizationenablednetworksManuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-3690663/v1_covered_951fb6ed-f65e-43fc-8a81-b171c0749741.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"End to end delay aware Service Function Chain Scheduling in Network Function Virtualization enabled networks","fulltext":[],"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":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"peer-to-peer-networking-and-applications","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"ppna","sideBox":"Learn more about [Peer-to-Peer Networking and Applications](http://link.springer.com/journal/12083)","snPcode":"12083","submissionUrl":"https://submission.nature.com/new-submission/12083/3","title":"Peer-to-Peer Networking and Applications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Network Function Virtualization, Service Function Chain Scheduling, End-to-End Delay, Service Level Agreement violation ratio","lastPublishedDoi":"10.21203/rs.3.rs-3690663/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-3690663/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Network function virtualization is a key enabling technology for the customization of network services in next-generation networks to support diverse applications. Most enterprise and network services contain specific network functions that are stitched together in a predefined sequence to form a service function chain. The deployment and scheduling of a service function chain onto the substrate network play a vital role in deciding the efficiency of resource utilization and the performance of network management. For a delay-sensitive network service request traversing a service function chain, the end-to-end packet delay is a crucial parameter that indicates the deployment performance. Transmission, propagation, processing, edge queueing, and virtualization delays all impact the order in which virtual network functions execute. Service level agreement violations and incorrect schedules are produced when the controller does not take edge queueing and virtualization delays into account. In this work, we propose a service function chain scheduling problem for the optimization of the end-to-end delay while considering transmission, propagation, queueing, virtualization, and processing delays. Then, we propose a scheduling approach based on the earliest finish times of the physical machines to minimize the end-to-end delay of the service function chain. The performance of the proposed service function chain scheduling approach using the earliest finish time is evaluated in terms of end-to-end delay, service level agreement violation ratio, resource utilization, and acceptance ratio. We compare our proposed algorithm with four existing approaches from the literature. Simulation results show that our proposed approach outperforms existing approaches in terms of end-to-end delay, service level agreement violation ratio, resource utilization, and acceptance ratio.","manuscriptTitle":"End to end delay aware Service Function Chain Scheduling in Network Function Virtualization enabled networks","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2023-12-11 03:30:21","doi":"10.21203/rs.3.rs-3690663/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2024-04-30T15:57:14+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-04-08T00:20:12+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-04-05T01:35:12+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"c9fdaee4-87e6-4201-9221-cf6936c42549","date":"2024-03-19T14:36:56+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"237e8653-5c12-45c8-b5c7-eba3649d4a3a","date":"2024-03-14T11:24:09+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-01-09T06:52:19+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-01-07T21:57:22+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2023-12-07T11:35:57+00:00","index":"","fulltext":""},{"type":"submitted","content":"Peer-to-Peer Networking and Applications","date":"2023-12-01T06:30:47+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"peer-to-peer-networking-and-applications","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"ppna","sideBox":"Learn more about [Peer-to-Peer Networking and Applications](http://link.springer.com/journal/12083)","snPcode":"12083","submissionUrl":"https://submission.nature.com/new-submission/12083/3","title":"Peer-to-Peer Networking and Applications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"2ebb990a-c15a-4475-86d3-dbcfbf464505","owner":[],"postedDate":"December 11th, 2023","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2024-09-09T16:11:30+00:00","versionOfRecord":{"articleIdentity":"rs-3690663","link":"https://doi.org/10.1007/s12083-024-01800-0","journal":{"identity":"peer-to-peer-networking-and-applications","isVorOnly":false,"title":"Peer-to-Peer Networking and Applications"},"publishedOn":"2024-09-05 15:57:13","publishedOnDateReadable":"September 5th, 2024"},"versionCreatedAt":"2023-12-11 03:30:21","video":"","vorDoi":"10.1007/s12083-024-01800-0","vorDoiUrl":"https://doi.org/10.1007/s12083-024-01800-0","workflowStages":[]},"version":"v1","identity":"rs-3690663","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-3690663","identity":"rs-3690663","version":["v1"]},"buildId":"cBFmMYwuxLRRLfASyISRj","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}