Collaborative Task Processing for Multiple Edge Nodes Based on Service Placement

Collaborative Task Processing for Multiple Edge Nodes Based on Service Placement | 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 Collaborative Task Processing for Multiple Edge Nodes Based on Service Placement Lei Shi, Shilong Feng, Rui Ji, Juan Xu, Xu Ding This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-3804016/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 With the rapid development of the Internet of Things (IoT), Mobile Edge Com-puting (MEC) technology is shifting computational and storage capabilities fromcentralized clouds to the network edge to meet the low-latency demands ofnumerous emerging applications. However, ensuring quality of service (QoS) formobile users becomes challenging in dense, decentralized wireless communica-tion environments and with limited MEC server storage capacity. Against thisbackground, this paper proposes a collaborative task processing model for mul-tiple ENs based on service placement and formulates a MINLP optimizationproblem aimed at minimizing system latency and cost. To address this problem,we introduce an online optimization algorithm (OPDA) based on the Lyapunovframework which operates in real-time without the need to predict future infor-mation. Subsequently, we decompose the long-term optimization problem into aseries of one-time slot problems and design a two-stage one-time slot optimiza-tion algorithm to obtain an approximate optimal solution. Specifically, we usethe Lagrange multiplier approach to solve the resource allocation problem fortasks and the matching theory to solve the offloading decision and service place-ment problem for tasks. Simulation results show that our algorithm can achievenear-optimal latency performance while satisfying long-term cost constraints. Mobile Edge Computing Collaborative Task Processing Service Placement Resource Allocation Lyapunov Optimization. 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-3804016","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":263547044,"identity":"7a07efed-eb49-4641-8b76-622a9dc09547","order_by":0,"name":"Lei Shi","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Lei","middleName":"","lastName":"Shi","suffix":""},{"id":263547045,"identity":"10e828e9-c384-4502-883e-58fb5bd5bb9d","order_by":1,"name":"Shilong Feng","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA2klEQVRIiWNgGAWjYBAC9gbmxgcMDBIyDBKMD0ACjA2EtPAcYGw2AGrhYZBgNmA4QKSWNgkQTYIW/oNtVTdqLHgYpJvZpD8w2MhuOMD87AFeLRKJbbdzjgEdJnOYTeIAQ5rxhgNs5gb4tNhLMAK1sIH8kn8MqOVw4oYDPGwShBxWnPMPpCUZZMt/IrQwJLYx57bBtRwgQotEYrN0bp8EUFkys8UZg2TjmYfZzAg47PDBzznf6uT4JZIZb1RU2Mn2HW9+hlcLHLCBSVBQMROlfhSMglEwCkYBPgAAxuc/h3CBffwAAAAASUVORK5CYII=","orcid":"","institution":"","correspondingAuthor":true,"prefix":"","firstName":"Shilong","middleName":"","lastName":"Feng","suffix":""},{"id":263547046,"identity":"1dea1bc8-95a6-403a-9c90-799e41da5876","order_by":2,"name":"Rui Ji","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Rui","middleName":"","lastName":"Ji","suffix":""},{"id":263547047,"identity":"0eb9a7a0-f051-48ea-add9-844fea7f0a17","order_by":3,"name":"Juan Xu","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Juan","middleName":"","lastName":"Xu","suffix":""},{"id":263547048,"identity":"66ab221e-b336-4992-a4cf-83ec450f4243","order_by":4,"name":"Xu Ding","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Xu","middleName":"","lastName":"Ding","suffix":""}],"badges":[],"createdAt":"2023-12-25 10:14:26","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-3804016/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-3804016/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":77207606,"identity":"ec6cdc34-7846-4c88-85f3-fdfdf64c226f","added_by":"auto","created_at":"2025-02-26 08:32:16","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":4126301,"visible":true,"origin":"","legend":"","description":"","filename":"wirelessnetwork.pdf","url":"https://assets-eu.researchsquare.com/files/rs-3804016/v1_covered_601c7bfc-c24c-452e-b868-e295f346579e.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Collaborative Task Processing for Multiple Edge Nodes Based on Service Placement","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"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":"Mobile Edge Computing, Collaborative Task Processing, Service Placement, Resource Allocation, Lyapunov Optimization.","lastPublishedDoi":"10.21203/rs.3.rs-3804016/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-3804016/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"With the rapid development of the Internet of Things (IoT), Mobile Edge Com-puting (MEC) technology is shifting computational and storage capabilities fromcentralized clouds to the network edge to meet the low-latency demands ofnumerous emerging applications. However, ensuring quality of service (QoS) formobile users becomes challenging in dense, decentralized wireless communica-tion environments and with limited MEC server storage capacity. Against thisbackground, this paper proposes a collaborative task processing model for mul-tiple ENs based on service placement and formulates a MINLP optimizationproblem aimed at minimizing system latency and cost. To address this problem,we introduce an online optimization algorithm (OPDA) based on the Lyapunovframework which operates in real-time without the need to predict future infor-mation. Subsequently, we decompose the long-term optimization problem into aseries of one-time slot problems and design a two-stage one-time slot optimiza-tion algorithm to obtain an approximate optimal solution. Specifically, we usethe Lagrange multiplier approach to solve the resource allocation problem fortasks and the matching theory to solve the offloading decision and service place-ment problem for tasks. Simulation results show that our algorithm can achievenear-optimal latency performance while satisfying long-term cost constraints.","manuscriptTitle":"Collaborative Task Processing for Multiple Edge Nodes Based on Service Placement","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-01-01 02:24:27","doi":"10.21203/rs.3.rs-3804016/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":"53e76433-6fbf-44c2-ba52-0828405df8ca","owner":[],"postedDate":"January 1st, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-02-26T08:23:54+00:00","versionOfRecord":[],"versionCreatedAt":"2024-01-01 02:24:27","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-3804016","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-3804016","identity":"rs-3804016","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}