Invariance principle and McKean-Vlasov limit for randomized load balancing in heavy traffic
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909168883990528 |
|---|---|
| author | Atar, Rami Wolansky, Gershon |
| author_facet | Atar, Rami Wolansky, Gershon |
| contents | We consider a load balancing model where a Poisson stream of jobs arrive at a system of many servers whose service time distribution possesses a finite second moment. A small fraction of arrivals pass through the so called power-of-choice algorithm, which assigns a job to the shortest among $\ell$, $\ell\ge 2$, randomly chosen queues, and the remaining jobs are assigned to queues chosen uniformly at random. The system is analyzed at critical load in an asymptotic regime where both the number of servers and the usual heavy traffic parameter associated with individual queue lengths grow to infinity. The first main result is a hydrodynamic limit, where the empirical measure of the diffusively normalized queue lengths is shown to converge to a path in measure space whose density is given by the unique solution of a parabolic PDE with nonlocal coefficients.
Further, two forms of an invariance principle are proved, corresponding to two different assumptions on the initial distribution, where individual normalized queue lengths converge weakly to solutions of SDE. In one of these results, the limit is given by a McKean-Vlasov SDE, and propagation of chaos holds. The McKean-Vlasov limit is closely related to limit results for Brownian particles on $\mathbb{R}_+$ interacting through their rank (with a specific interaction). However, an entirely different set of tools is required, as the collection of $n$ prelimit particles does not obey a Markovian evolution on $\mathbb{R}_+^n$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_18143 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Invariance principle and McKean-Vlasov limit for randomized load balancing in heavy traffic Atar, Rami Wolansky, Gershon Probability 68M20, 90B22, 60F17, 35K20 We consider a load balancing model where a Poisson stream of jobs arrive at a system of many servers whose service time distribution possesses a finite second moment. A small fraction of arrivals pass through the so called power-of-choice algorithm, which assigns a job to the shortest among $\ell$, $\ell\ge 2$, randomly chosen queues, and the remaining jobs are assigned to queues chosen uniformly at random. The system is analyzed at critical load in an asymptotic regime where both the number of servers and the usual heavy traffic parameter associated with individual queue lengths grow to infinity. The first main result is a hydrodynamic limit, where the empirical measure of the diffusively normalized queue lengths is shown to converge to a path in measure space whose density is given by the unique solution of a parabolic PDE with nonlocal coefficients. Further, two forms of an invariance principle are proved, corresponding to two different assumptions on the initial distribution, where individual normalized queue lengths converge weakly to solutions of SDE. In one of these results, the limit is given by a McKean-Vlasov SDE, and propagation of chaos holds. The McKean-Vlasov limit is closely related to limit results for Brownian particles on $\mathbb{R}_+$ interacting through their rank (with a specific interaction). However, an entirely different set of tools is required, as the collection of $n$ prelimit particles does not obey a Markovian evolution on $\mathbb{R}_+^n$. |
| title | Invariance principle and McKean-Vlasov limit for randomized load balancing in heavy traffic |
| topic | Probability 68M20, 90B22, 60F17, 35K20 |
| url | https://arxiv.org/abs/2402.18143 |