13 February 2022 in International Journal of Intelligent Systems
Network function virtualization is a promising technology for providing personalized services via agile service function chains (SFCs). Flexible SFC orchestration and rational resource allocation are pivotal for improving the SFC's quality of service (QoS). However, the requirements for computational load and resources have frequently been changing. Consequently, static resource allocation can result in resource insufficiency when SFCs turn busy and resource waste due to resource overplus when SFCs are idle. Since a dynamic resource allocation is necessary, the existing dynamic resource allocation methods' responses have often been delayed. This paper proposes an SFC active reconfiguration mechanism (SARM) based on computational load and resource demand. The SARM predicts nodes' computation loads and SFCs' resource demands and uses these predictions to estimate future QoS and develop the SFC reconfiguration strategy. The SARM considers multiple factors and applies a heuristic algorithm to achieve the tradeoff between migration cost and QoS preservation. The experiments demonstrate that the SARM can effectively predict the nodes' load and the resource demand of SFCs. In addition, the SARM can successfully identify the SFCs to reconfigure and reduce the QoS maintenance costs. The simulation results indicate that the average delays of the SFCs can be reduced by at least 26%.
25 February 2026 in IEEE Transactions on Network and Service Management
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.