Performing Load Balancing under Constraints
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929705663332352 |
|---|---|
| author | Fox, Andrea De Pellegrini, Francesco Altman, Eitan Ghosh, Arnob Shroff, Ness |
| author_facet | Fox, Andrea De Pellegrini, Francesco Altman, Eitan Ghosh, Arnob Shroff, Ness |
| contents | Join-the-shortest queue (JSQ) and its variants have often been used in solving load balancing problems. The aim of such policies is to minimize the average system occupation, e.g., the customer's system time. In this work we extend the traditional load balancing setting to include constraints that may be imposed, e.g., due to the communication network. We cast the problem into the framework of constrained MDPs, enabling the consideration of both action-dependent constraints, such as, e.g, bandwidth limitation, and state-dependent constraints, such as, e.g., minimum queue utilization. Unlike the state-of-the-art approaches, our load-balancing policies, in particular JSED-$k$ and JSSQ, are both provably safe and yet strive to minimize the system occupancy. Their performance is tested with extensive numerical results under various system settings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_01843 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Performing Load Balancing under Constraints Fox, Andrea De Pellegrini, Francesco Altman, Eitan Ghosh, Arnob Shroff, Ness Networking and Internet Architecture Join-the-shortest queue (JSQ) and its variants have often been used in solving load balancing problems. The aim of such policies is to minimize the average system occupation, e.g., the customer's system time. In this work we extend the traditional load balancing setting to include constraints that may be imposed, e.g., due to the communication network. We cast the problem into the framework of constrained MDPs, enabling the consideration of both action-dependent constraints, such as, e.g, bandwidth limitation, and state-dependent constraints, such as, e.g., minimum queue utilization. Unlike the state-of-the-art approaches, our load-balancing policies, in particular JSED-$k$ and JSSQ, are both provably safe and yet strive to minimize the system occupancy. Their performance is tested with extensive numerical results under various system settings. |
| title | Performing Load Balancing under Constraints |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2502.01843 |