Every time you stream a video, join a video call, or ask a voice assistant a question, your data does not simply travel to some distant cloud and back. Increasingly, it is processed at the network’s edge, on small data centers called mobile edge computing (MEC) nodes that sit close to your phone. This proximity is what makes latency-sensitive applications feel instant. But deciding exactly how to arrange the software components that process your requests across these scarce, scattered edge resources is a fiendishly difficult optimization problem, and a new study published in the Journal of Big Data proposes an artificial intelligence framework that tackles it with a combination of reinforcement learning, reliability engineering, and clever resource reuse.
The research, conducted by Yijiang Zhang and Yanfeng Fang of the School of Artificial Intelligence at Shaoxing Institute of Technology in China, together with Wei Wang of the Department of Computer Engineering at the University of Rahjuyan Danesh Borazjan in Iran, introduces what the authors call a Reliability-Aware Adaptive Actor-Critic framework, abbreviated RACC. Its target is a core task in modern telecommunications known as service function chain (SFC) deployment, the process of stringing together a sequence of virtualized network functions, such as firewalls, load balancers, video optimizers, or encryption modules, so that traffic flows through them in the correct order while consuming as little of the edge’s limited computing capacity as possible.
The underlying technology that makes SFCs possible is network function virtualization, or NFV. Traditionally, network functions ran on dedicated hardware appliances, each one a physical box bolted into a rack. NFV replaces those boxes with software that can be instantiated on any sufficiently capable server, including the compact servers at MEC sites. That flexibility is enormously powerful, but it also creates a combinatorial explosion of choices. For every incoming service request, an operator must decide where to place each virtual network function (VNF), how much CPU, memory, and other resources to allocate to it, and how to route traffic between the functions. With dynamic service requests arriving continuously, heterogeneous network conditions, and limited edge resources, the search space is vast and constantly shifting.
Reinforcement learning has emerged as a natural fit for this kind of sequential decision-making problem. In a reinforcement learning setup, an agent learns by trial and error: it takes actions, observes the consequences, and adjusts its behavior to maximize a cumulative reward. Several prior approaches have applied reinforcement learning to SFC deployment, but the authors of the new study point out a persistent blind spot. Most existing methods concentrate on improving resource utilization and reducing latency while overlooking two critical dimensions: the reliability of the deployed service and the need for adaptive decision-making in highly dynamic MEC environments. A chain that is fast and efficient on paper is of little value if a node failure or resource bottleneck causes the service to degrade or fail outright.
RACC addresses this gap with an adaptive actor-critic architecture, a well-established family of reinforcement learning algorithms that separates the learning problem into two cooperating components. The actor is responsible for selecting actions, in this case the placement and resource allocation decisions for each service function chain, while the critic evaluates those actions by estimating their long-term value, providing feedback that helps the actor improve over time. The adaptive element allows the framework to adjust its behavior as conditions at the edge change, which is essential in an environment where traffic patterns, available capacity, and network states fluctuate from moment to moment.
What the framework optimizes is deliberately multi-dimensional. The authors formulate a multi-objective objective function designed to jointly maximize the SFC acceptance rate, meaning the proportion of incoming service requests the system can successfully accommodate, and service reliability, while simultaneously minimizing service latency, energy consumption, resource utilization, and migration cost. These goals frequently pull against one another. Accepting more requests strains resources and can raise latency; minimizing energy consumption may conflict with reliability guarantees; migrating functions to rebalance load costs time and disruption. By encoding all of these objectives into a single reward structure, RACC forces the learning agent to find deployment strategies that strike a principled balance rather than excelling on one metric at the expense of the others.
Two mechanisms inside RACC deserve particular attention. The first is dependency-aware SFC partitioning. A service function chain is not just a flat list of components; the functions have dependencies on one another, and the framework exploits this structure by partitioning chains into segments that can be executed in parallel. Parallel execution can shorten the end-to-end processing time of a chain, but only if the partitioning respects the dependency relationships between VNFs, otherwise the parallel segments would produce incorrect results or deadlock. By making the partitioning dependency-aware, RACC gains the speed benefits of parallelism without sacrificing correctness.
The second mechanism combines live migration with VNF reuse. Live migration allows a running virtual network function to be moved from one edge node to another without shutting it down, which the framework uses to maintain a balanced load distribution across the edge infrastructure and to enhance service reliability by relocating functions away from stressed or threatened nodes. VNF reuse, meanwhile, allows an already-running instance of a function to serve multiple service requests rather than spinning up a duplicate copy for each one. Together, these mechanisms improve resource allocation, keep load evenly distributed, and bolster the reliability of deployed services, all of which feed back into the reinforcement learning loop as the agent learns when and where to migrate and reuse.
The authors evaluated RACC through simulation against state-of-the-art baseline methods, including other reinforcement learning-based models. The results, as reported in the paper, show that the proposed framework consistently outperformed the baselines, and that RACC achieved higher expected cumulative reward values than the reinforcement learning baselines it was compared with. In reinforcement learning terms, a higher expected cumulative reward means the agent’s learned policy delivers better long-term outcomes across the full set of objectives, not just in isolated moments, which is precisely the property an operator needs when deployment decisions have cascading effects on future capacity and reliability.
The significance of this work extends beyond the simulation results themselves. As 5G and future 6G networks carry ever more latency-sensitive and resource-intensive applications, from industrial automation to immersive media, the pressure on edge infrastructure will only intensify, and the cost of ignoring reliability will grow with it. By demonstrating that a single adaptive actor-critic framework can jointly handle placement, resource allocation, parallel partitioning, migration, and reuse while explicitly accounting for reliability, the study offers a template for how the next generation of edge orchestrators might be built. The article is open access, published on 13 October 2026 in the Journal of Big Data, allowing researchers and network engineers alike to examine the full technical details of the framework.
Subject of Research: Reliability-aware reinforcement learning for service function chain deployment in mobile edge computing
Article Title: Adaptive actor-critic framework for efficient and reliability-aware SFC deployment in mobile edge computing
Article References: Adaptive actor-critic framework for efficient and reliability-aware SFC deployment in mobile edge computing. (n.d.). https://doi.org/10.1186/s40537-026-01580-9
Image Credits: AI Generated
DOI: 10.1186/s40537-026-01580-9
Keywords: mobile edge computing, network function virtualization, service function chain, reinforcement learning, actor-critic, reliability-aware deployment, VNF placement, resource allocation, live migration, latency optimization, energy consumption, Journal of Big Data
Cite Scienmag News
Denise Maddox. (October 13, 2026). AI Learns to Orchestrate the Edge: New Actor-Critic Framework Makes Mobile Networks Faster and More Reliable. Scienmag. https://scienmag.com/ai-learns-to-orchestrate-the-edge-new-actor-critic-framework-makes-mobile-networks-faster-and-more-reliable/
Denise Maddox. "AI Learns to Orchestrate the Edge: New Actor-Critic Framework Makes Mobile Networks Faster and More Reliable." Scienmag, 13 October 2026, https://scienmag.com/ai-learns-to-orchestrate-the-edge-new-actor-critic-framework-makes-mobile-networks-faster-and-more-reliable/. Accessed 13 October 2026.
Denise Maddox. "AI Learns to Orchestrate the Edge: New Actor-Critic Framework Makes Mobile Networks Faster and More Reliable." Scienmag. October 13, 2026. https://scienmag.com/ai-learns-to-orchestrate-the-edge-new-actor-critic-framework-makes-mobile-networks-faster-and-more-reliable/








