A cluster-based solution for Service Function Chain allocation in large scale infrastructure

A cluster-based solution for Service Function Chain allocation in large scale infrastructure | 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 A cluster-based solution for Service Function Chain allocation in large scale infrastructure Diego de Freitas Bezerra, Guto Leoni Santos, Élisson da Silva Rocha, and 5 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4778835/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 Changes in telecommunication services demand the development of a new infrastructure to attend new network applications' requirements. The traditional approach to network functions running over dedicated equipment can no longer handle all the dynamics of these new services. The network function virtualization (NFV) paradigm decouples a function from the underlying dedicated hardware thus making networks more flexible and agile. A set of virtual network functions (VNFs) can be deployed as virtual machines or containers across common servers, and orchestrated to compose a service function chain (SFC).Despite the many benefits of NFV, it raises several challenges. SFC placement is a complex task, since it requires taking into consideration the characteristics of VNFs, the SFC requirements, and the state of network infrastructure. This poses a challenge for large scale networks. Information regarding network resources are stored in a large database, and retrieving such data in order to perform SFC placement according to some strategy can be a problem. Limited memory capacity and the presence of a large number of disk operations can compromise the performance of SFC placement algorithms and make it unfeasible. In addition, the amount of memory available to run the allocation algorithm may not be sufficient to load the large amount of information that describe the network resources (occasionally in the hundreds of gigabytes). We address this problem by using a cluster based solution that stores and retrieves data for large scale infrastructures in order to perform SFC placement. The results demonstrate that the use of clusters in the preprocessing step can drastically reduce the size of the resulting database, as well as the execution time to select candidate nodes for a scalable SFC allocation. Clustering Service Function Chain Virtual Network Function Resource Allocation 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-4778835","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":333698596,"identity":"f4da3ee1-723c-4a29-923f-eb6cd5de25d6","order_by":0,"name":"Diego de Freitas Bezerra","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAu0lEQVRIiWNgGAWjYDCCw2eYH3xgkACyGB8AiQNEaDmWw2Y4A6yF2YBoLQzSPGAWsVr4jvEeMLapschjkEhmA7rwTj5BLZLH+BIe5xyTKAZqYQe68JllAyEtBvd7DIxzGyQSGyTyjwFdeNiAoC0Gx3gMpC3BWpLZpP8QrYURpoWBGC1Av6QZ9hyTSGzjecxu2GPwjLAWYIgdfvCjpi6xnx0YYj8q7hDWAgdsYESCBpiuUTAKRsEoGAVYAACecTiGMt1rIwAAAABJRU5ErkJggg==","orcid":"","institution":"Federal University of Pernambuco","correspondingAuthor":true,"prefix":"","firstName":"Diego","middleName":"de Freitas","lastName":"Bezerra","suffix":""},{"id":333698597,"identity":"102ba4f6-9cf4-4276-a7de-6319e9921e51","order_by":1,"name":"Guto Leoni Santos","email":"","orcid":"","institution":"Federal University of Pernambuco","correspondingAuthor":false,"prefix":"","firstName":"Guto","middleName":"Leoni","lastName":"Santos","suffix":""},{"id":333698598,"identity":"8268b30e-8f8d-469b-b2a9-7befcdb2361b","order_by":2,"name":"Élisson da Silva Rocha","email":"","orcid":"","institution":"Federal University of Pernambuco","correspondingAuthor":false,"prefix":"","firstName":"Élisson","middleName":"da Silva","lastName":"Rocha","suffix":""},{"id":333698599,"identity":"4166e52e-ac27-4742-a17c-3134c3fbd542","order_by":3,"name":"Glauco Estacio Gonçalves","email":"","orcid":"","institution":"Federal University of Para","correspondingAuthor":false,"prefix":"","firstName":"Glauco","middleName":"Estacio","lastName":"Gonçalves","suffix":""},{"id":333698600,"identity":"0cf239ed-80f0-4da5-8ab9-4db7b48a015b","order_by":4,"name":"André Moreira","email":"","orcid":"","institution":"Federal University of Pernambuco","correspondingAuthor":false,"prefix":"","firstName":"André","middleName":"","lastName":"Moreira","suffix":""},{"id":333698601,"identity":"e02d9c82-c09f-4549-92ef-9471072a50d3","order_by":5,"name":"Maria Valéria Marquezini","email":"","orcid":"","institution":"Ericsson Research","correspondingAuthor":false,"prefix":"","firstName":"Maria","middleName":"Valéria","lastName":"Marquezini","suffix":""},{"id":333698602,"identity":"5c050d3b-d8ab-402b-8844-7df906ceb1d3","order_by":6,"name":"Judith Kelner","email":"","orcid":"","institution":"Federal University of Pernambuco","correspondingAuthor":false,"prefix":"","firstName":"Judith","middleName":"","lastName":"Kelner","suffix":""},{"id":333698603,"identity":"d3220377-86a5-470e-9f22-8612cd444987","order_by":7,"name":"Djamel Sadok","email":"","orcid":"","institution":"Federal University of Pernambuco","correspondingAuthor":false,"prefix":"","firstName":"Djamel","middleName":"","lastName":"Sadok","suffix":""}],"badges":[],"createdAt":"2024-07-22 03:21:43","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4778835/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4778835/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":61448715,"identity":"b1fbfb99-09dd-425e-9cc2-a6555d532415","added_by":"auto","created_at":"2024-07-31 00:54:04","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":2354672,"visible":true,"origin":"","legend":"","description":"","filename":"yqgbbcgpjqvnmzfwvbbdwhfgzyzpryhw.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4778835/v1_covered_9cb00b36-c5b9-4c60-9a5e-0fc9c9968f12.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A cluster-based solution for Service Function Chain allocation in large scale infrastructure","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":"Clustering, Service Function Chain, Virtual Network Function, Resource Allocation","lastPublishedDoi":"10.21203/rs.3.rs-4778835/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4778835/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Changes in telecommunication services demand the development of a new infrastructure to attend new network applications' requirements. The traditional approach to network functions running over dedicated equipment can no longer handle all the dynamics of these new services. The network function virtualization (NFV) paradigm decouples a function from the underlying dedicated hardware thus making networks more flexible and agile. A set of virtual network functions (VNFs) can be deployed as virtual machines or containers across common servers, and orchestrated to compose a service function chain (SFC).Despite the many benefits of NFV, it raises several challenges. SFC placement is a complex task, since it requires taking into consideration the characteristics of VNFs, the SFC requirements, and the state of network infrastructure. This poses a challenge for large scale networks. Information regarding network resources are stored in a large database, and retrieving such data in order to perform SFC placement according to some strategy can be a problem. Limited memory capacity and the presence of a large number of disk operations can compromise the performance of SFC placement algorithms and make it unfeasible. In addition, the amount of memory available to run the allocation algorithm may not be sufficient to load the large amount of information that describe the network resources (occasionally in the hundreds of gigabytes). We address this problem by using a cluster based solution that stores and retrieves data for large scale infrastructures in order to perform SFC placement. The results demonstrate that the use of clusters in the preprocessing step can drastically reduce the size of the resulting database, as well as the execution time to select candidate nodes for a scalable SFC allocation.","manuscriptTitle":"A cluster-based solution for Service Function Chain allocation in large scale infrastructure","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-07-31 00:45:56","doi":"10.21203/rs.3.rs-4778835/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":"c639c4b0-1926-44b4-a05e-1f0f43a0bd8a","owner":[],"postedDate":"July 31st, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2024-08-18T00:17:45+00:00","versionOfRecord":[],"versionCreatedAt":"2024-07-31 00:45:56","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4778835","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4778835","identity":"rs-4778835","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}