English

QoS-Aware Load Balancing in the Computing Continuum via Multi-Player Bandits

Networking and Internet Architecture 2026-01-08 v2 Distributed, Parallel, and Cluster Computing

Abstract

As computation shifts from the cloud to the edge to reduce processing latency and network traffic, the resulting Computing Continuum (CC) creates a dynamic environment where meeting strict Quality of Service (QoS) requirements and avoiding service instance overload becomes challenging. Existing methods often prioritize global metrics and overlook per-client QoS, which is crucial for latency-sensitive and reliability-critical applications. We propose QEdgeProxy, a decentralized QoS-aware load balancer that acts as a proxy between IoT devices and service instances in the CC. We formulate the load balancing problem as a Multi-Player Multi-Armed Bandit (MP-MAB) with heterogeneous rewards: Each load balancer autonomously selects service instances to maximize the probability of meeting its clients' QoS requirements by using Kernel Density Estimation (KDE) to estimate QoS success probabilities. Our load-balancing algorithm also incorporates an adaptive exploration mechanism to recover rapidly from performance shifts and non-stationary conditions. We present a Kubernetes-native QEdgeProxy implementation and evaluate it on an emulated CC testbed deployed on a K3s cluster with realistic network conditions and a latency-sensitive edge-AI workload. Results show that QEdgeProxy significantly outperforms proximity-based and reinforcement-learning baselines in per-client QoS satisfaction, while adapting effectively to load surges and changes in instance availability.

Keywords

Cite

@article{arxiv.2512.18915,
  title  = {QoS-Aware Load Balancing in the Computing Continuum via Multi-Player Bandits},
  author = {Ivan Čilić and Ivana Podnar Žarko and Pantelis Frangoudis and Schahram Dustdar},
  journal= {arXiv preprint arXiv:2512.18915},
  year   = {2026}
}
R2 v1 2026-07-01T08:35:54.577Z