TL;DR
This paper develops a mean-field control approach combined with reinforcement learning to optimize load balancing in large queueing systems with communication delays, providing scalable solutions with theoretical guarantees.
Contribution
It introduces a novel mean-field control model with delayed information and applies policy gradient algorithms, offering a scalable and theoretically supported load balancing method.
Findings
The approach outperforms traditional policies under delay conditions.
The method is scalable to large systems.
Theoretical performance guarantees are established.
Abstract
Recent years have seen a great increase in the capacity and parallel processing power of data centers and cloud services. To fully utilize the said distributed systems, optimal load balancing for parallel queuing architectures must be realized. Existing state-of-the-art solutions fail to consider the effect of communication delays on the behaviour of very large systems with many clients. In this work, we consider a multi-agent load balancing system, with delayed information, consisting of many clients (load balancers) and many parallel queues. In order to obtain a tractable solution, we model this system as a mean-field control problem with enlarged state-action space in discrete time through exact discretization. Subsequently, we apply policy gradient reinforcement learning algorithms to find an optimal load balancing solution. Here, the discrete-time system model incorporates a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
