Sep 2026· IEEE Internet of Things Journal· Vol 13, pp. 42093-42106· 0 citations· 44 references
Abstract
Container-based microservices provide a lightweight and scalable foundation for edge computing, where layer sharing improves storage and throughput efficiency. However, the unpredictable nature of edge networks leads to variable layer download times and thus bandwidth uncertainty. This article addresses the problem of microservice placement under bandwidth uncertainty by incorporating a quality of service (QoS) constraint that ensures timely start-up with high probability. The resulting model is a complex nonlinear stochastic optimization problem. By employing a series of mathematical lemmas, we reformulate it as an integer linear program (ILP), which can be solved with conventional computational tools. Furthermore, we propose <inline-formula> <tex-math notation="LaTeX">$\mu $ </tex-math></inline-formula>Layer, which relaxes the ILP to a linear program (LP) and applies iterative rounding to obtain high-quality solutions with improved efficiency and scalability. Experimental results demonstrate that the <inline-formula> <tex-math notation="LaTeX">$\mu $ </tex-math></inline-formula>Layer substantially reduces execution time while maintaining placement quality close to the optimal solution. In addition, compared with the baseline methods considered in this study, <inline-formula> <tex-math notation="LaTeX">$\mu $ </tex-math></inline-formula>Layer improves the total placement value of microservices by up to 25% and increases the probability of meeting the expected layer download time by 15%, which demonstrates its ability to handle bandwidth uncertainty more effectively.
This work introduces a Binary Linear Programming model to compute optimal placements and proposes a topology-aware greedy heuristic that efficiently approximates the optimal solution, making it suitable for periodic system reconfigurations.
Dario d'Abate, Matteo Cenzato, Matteo Briscini et al.· 0 citations
This thesis provides an end-to-end mathematical and machine learning framework for designing dependable, low-latency, and scalable SDN infrastructures.
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.· Proceedings of the Internati...· 0 citations
Emerging edge computing paradigms enable heterogeneous devices to collaborate on complex computation applications. However, for arbitrary heterogeneous edge networks, delay-optimal forwarding and computation offloading for long-term average performance remains an open problem. In this paper, we jointly optimize data/re...
Jin-Kun Zhang, Yuezhou Liu, Edmund Yeh· IEEE Transactions on Network...· 0 citations
A product-form queueing-network (PFQN) model with an approximation to capture the computation and communication dynamics of tree-structured task execution in a multi-tier MEC system is developed and results show that the proposed PFQN approximation provides accurate delay estimates.
The DQN-Scheduler is introduced, a novel reinforcement learning-based agent designed to optimize microservice scheduling in cloud environments and is believed to be the first framework to address all these objectives simultaneously.
Abdullah Alelyani, A. Data, Ghulam Mubasher· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comOct 29, 2026
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· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
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.