Reinforced Workload Distribution Fairness
Not on the map. Why?
Abstract (arXiv)
Network load balancers are central components in data centers, that distributes workloads across multiple servers and thereby contribute to offering scalable services. However, when load balancers operate in dynamic environments with limited monitoring of application server loads, they rely on heuristic algorithms that require manual configurations for fairness and performance. To alleviate that, this paper proposes a distributed asynchronous reinforcement learning mechanism to-with no active load balancer state monitoring and limited network observations-improve the fairness of the workload distribution achieved by a load balancer. The performance of proposed mechanism is evaluated and compared with stateof-the-art load balancing algorithms in a simulator, under configurations with progressively increasing complexities. Preliminary results show promise in RLbased load balancing algorithms, and identify additional challenges and future research directions, including reward function design and model scalability.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 6 of its 22 references that are in the map. First posted on arXiv 29 Oct 2021.
Builds on
6 of 22 references.
References · 6
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2018Learning Scheduling Algorithms for Data Processing Clusterscited by 133
- 2016Microservices: yesterday, today, and tomorrowcited by 22
- 2019MVFST-RL: An Asynchronous RL Framework for Congestion Control with Delayed Actionscited by 9
- 2018In-network Congestion-aware Load Balancing at Transport Layercited by 4
- 2020Distributed Dispatching in the Parallel Server Modelcited by 4
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 1.
3 papers.