{"title":"End-to-End Deterministic Network Slicing: A Profit-Driven Optimization Framework With Domain-Specific Algorithms","authors":"Kaili Qian;Yiqin Lu;Xiaohuan Zhang;Wenqi Zhou","doi":"10.1109/TNSM.2026.3667996","DOIUrl":null,"url":null,"abstract":"With the rapid evolution of 5G/6G networks, deterministic services such as the Industrial Internet, vehicular communications, and immersive applications impose stringent end-to-end (E2E) latency guarantees. Efficient resource allocation for E2E network slicing (NS) is therefore required to simultaneously satisfy strict latency constraints and improve overall resource efficiency. However, orchestrating cross-domain and multidimensional resources across the radio access network (RAN) and core network (CN) remains challenging due to strong coupling and scalability issues. To address this problem, this paper develops a profit-driven optimization framework for static E2E NS, which jointly accounts for deterministic service guarantees and system profitability. On the RAN side, a hybrid genetic algorithm (HGA) is developed to preserve the global exploration capability of genetic algorithms, while incorporating a gradient-guided resource scaling (GGRS) operator to refine elite solutions and improve solution quality. On the CN side, we design a capacity-aware workload balancing algorithm (CA-WLB). For each candidate path, CA-WLB couples capacity adaptive virtual network function (VNF) placement with demand responsive CPU allocation to jointly optimize latency and resource consumption, and then selects the path that yields the maximum profit. Extensive simulations across a wide range of scenarios demonstrate that the proposed framework consistently outperforms conventional heuristic and meta-heuristic approaches, while achieving performance close to high-complexity optimization benchmarks with significantly reduced computational overhead.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"23 ","pages":"2916-2934"},"PeriodicalIF":5.7000,"publicationDate":"2026-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11411853/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
With the rapid evolution of 5G/6G networks, deterministic services such as the Industrial Internet, vehicular communications, and immersive applications impose stringent end-to-end (E2E) latency guarantees. Efficient resource allocation for E2E network slicing (NS) is therefore required to simultaneously satisfy strict latency constraints and improve overall resource efficiency. However, orchestrating cross-domain and multidimensional resources across the radio access network (RAN) and core network (CN) remains challenging due to strong coupling and scalability issues. To address this problem, this paper develops a profit-driven optimization framework for static E2E NS, which jointly accounts for deterministic service guarantees and system profitability. On the RAN side, a hybrid genetic algorithm (HGA) is developed to preserve the global exploration capability of genetic algorithms, while incorporating a gradient-guided resource scaling (GGRS) operator to refine elite solutions and improve solution quality. On the CN side, we design a capacity-aware workload balancing algorithm (CA-WLB). For each candidate path, CA-WLB couples capacity adaptive virtual network function (VNF) placement with demand responsive CPU allocation to jointly optimize latency and resource consumption, and then selects the path that yields the maximum profit. Extensive simulations across a wide range of scenarios demonstrate that the proposed framework consistently outperforms conventional heuristic and meta-heuristic approaches, while achieving performance close to high-complexity optimization benchmarks with significantly reduced computational overhead.
期刊介绍:
IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.