On the Optimality of Rate Balancing for Max-Min Fair Multicasting
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911408707338240 |
|---|---|
| author | Syed, Sadaf Utschick, Wolfgang Joham, Michael |
| author_facet | Syed, Sadaf Utschick, Wolfgang Joham, Michael |
| contents | The max-min fair (MMF) multicasting problem is known to be NP-hard. In this work, we analytically derive the optimal solution to this NP-hard problem and establish the equivalence between rate balancing and the optimal MMF multicasting solution under certain conditions. Based on this theoretical insight, we propose a low-complexity algorithm for MMF multicasting that yields closed-form solutions. Simulation results validate our analysis and demonstrate that the proposed algorithm outperforms the state-of-the-art methods while being computationally more efficient. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_22415 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the Optimality of Rate Balancing for Max-Min Fair Multicasting Syed, Sadaf Utschick, Wolfgang Joham, Michael Signal Processing The max-min fair (MMF) multicasting problem is known to be NP-hard. In this work, we analytically derive the optimal solution to this NP-hard problem and establish the equivalence between rate balancing and the optimal MMF multicasting solution under certain conditions. Based on this theoretical insight, we propose a low-complexity algorithm for MMF multicasting that yields closed-form solutions. Simulation results validate our analysis and demonstrate that the proposed algorithm outperforms the state-of-the-art methods while being computationally more efficient. |
| title | On the Optimality of Rate Balancing for Max-Min Fair Multicasting |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2601.22415 |