Skip to content

ShBkDRL: Reliable Microservice Provision With Shared Backup in Dynamic Edge Computing

Nov 2026 · IEEE transactions on computers · Vol 75, pp. 3869-3883 · 0 citations · 39 references

Abstract

As a key 5G enabler, edge computing locates resources near users to enable low-latency services, and microservices architecture (MSA) decomposes monolithic services into microservices, easing deployment and scaling of mission-critical applications with high reliability requirements. Existing studies on microservice backup and deployment often adopt dedicated backup strategies, resulting in excessive redundancy and high resource consumption. This paper investigates reliable service deployment with shared backups in resource-constrained and dynamic edge environments, aiming to meet differentiated reliability requirements while optimizing resource efficiency. However, shared backups introduce interdependencies among services, complicating relationships among backup and deployment strategies, service reliability, resource costs, and loads. To model these intricate relationships, we divide microservices (service functions) of the same type into service function groups for sharing backups and formulate the problem as an integer nonlinear programming problem, proving its complexity. Moreover, the sequential arrival of requests in dynamic environments renders this problem a multi-stage decision problem, with high-dimensional resource constraints and a large-scale solution space adding complexity. Thus, we design a deep reinforcement learning (DRL)-based shared backup scheme with theoretical guarantees, which leverages DRL to capture long-term rewards and generate fractional solutions, while domain knowledge—specifically, the insight that providing additional backups to service function groups with low reliability yields greater reliability improvements—is used to adjust the fractional solutions. This adjustment helps prevent the DRL agent from falling into poor local optima and violating constraints. Finally, extensive experiments on real-world Alibaba traces show our method reduces costs by up to 70.52% compared to state-of-the-art approaches.

View source

Similar papers

2026

COSMOS: Taming Heterogeneous Resource Demands in Serverless Functions With Complementary Swarming and Monotonic Scale-Up

Serverless computing is an increasingly popular paradigm built on top of a data center network (DCN), offering scalability and fine-grained billing. However, serverless platforms must efficiently manage resources for a multitude of diverse functions and requests with different inputs. Conventional approaches often igno...

Yun-Shan Jia, Jun-Yi Shu, Chiheng Lou et al. · 0 citations

CERLA-SFC: hierarchical orchestration of cost-efficient, reliable and low-latency SFCs in multi-access edge computing

CERLA-SFC is introduced, a hierarchical, multi-objective orchestrator that unifies learning-based placement, topology-aware routing and event-driven resource allocation in a single control loop that maintains near-zero latency violations across all urgency classes while keeping end-to-end delay in the millisecond range...

Yuanfei Xiao, Zhen-Li He, Xiaolong Zhai et al. · 0 citations
Book Open access Sep 2026

QMScaler: A QoS-Constrained Resource-Efficient Microservice Autoscaling Framework for Edge Environments

QMScaler is proposed, a QoS-driven microservice horizontal scaling framework based on Monte Carlo Tree Search (MCTS) that aims to minimize the number of container instances while meeting the QoS requirements of multiple application functions.

Tian-Yang Zheng, Peng-Fei Yang, Zhe Xu et al. · 0 citations
Preprint Oct 2026

Prioritizing Microservice Requests via Retries

Cloud services rapidly shift towards independently-managed microservices architectures. This independence may lead to temporary microservices miscoordination, resulting in overloads and rejections of valuable transactions. This weakness may further be exploited by attackers to launch overload attacks inflicting perform...

Ofek Lavi, Jhonatan Tavori, Hanoch Levy et al. · 0 citations
#reinforcement learning Open access Sep 2026

CoSIPR: Shared Service Orchestration with Dynamic Interest Coalitions in Edge Computing

Experiments show that CoSIPR improves service-category matching, request satisfaction, and the average number of accepted requests per instance, and reduces aggregate state-transfer cost and limits hotspot exposure while maintaining a controlled trade-off between end-to-end delay and state-transfer cost.

Meng-Xuan Dai, Xuan Chen, Ling Yang et al. · 0 citations

Related blog posts

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…

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

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