Skip to content
#edge computing Open access

Efficient and Green Service Function Chain Deployment and Scheduling for Mobile Edge Computing

Dec 2026 · IEEE Transactions on Mobile Computing · Vol 25, pp. 23085-23098 · 1 citation · 41 references

TL;DR

An SFC Deployment and Scheduling strategy based on the Soft Actor-Critic (SAC) algorithm, named SAC-DS, which integrates SFC deployment, component sharing, and scheduling into a unified framework, effectively improving system throughput while minimizing overall deployment costs, thereby enhancing user experience.

Abstract

Service Function Chain (SFC) decomposes a user’s overall service into multiple service components and links them in an orderly manner, providing more flexible, efficient, and responsive services for compute-intensive applications in mobile edge computing. Existing research primarily focuses on optimizing the deployment cost and system efficiency of SFC. However, the dynamic nature of user trajectories, along with the absence of adaptive scheduling and service component sharing in complex and heterogeneous environments, hinders existing approaches from achieving optimal resource efficiency. To achieve adaptive optimization of SFC deployment and efficient component sharing across multiple SFCs, we propose an SFC Deployment and Scheduling strategy based on the Soft Actor-Critic (SAC) algorithm, named SAC-DS. The proposed SAC-DS strategy first employs a Long Short-Term Memory (LSTM) model to predict user trajectories, thereby accurately forecasting future service demands. Based on these predictions, an SAC-based agent is trained to dynamically optimize SFC deployment and scheduling policies in real time. SAC-DS integrates SFC deployment, component sharing, and scheduling into a unified framework, effectively improving system throughput while minimizing overall deployment costs, thereby enhancing user experience. Compared with existing baseline methods, SAC-DS improves network throughput by 3.1%–18.1% and reduces average cost by 1.8%–10.0%.

Read PDF

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.