We consider a scheduling application in 5G cellular networks, where base stations serve periodic tasks by allocating conflict-free portions of the available spectrum, in order to meet their traffic demand. The problem has a combinatorial structure featuring bi-dimensional periodic allocations of resources. We consider four variants of the problem, characterized by different degrees of freedom. Two types of formulations are presented and tested on realistic data, using a general-purpose solver. Knapsack Problems invited session.
Ansuini, G., Frangioni, A., Galli, L., Nardini, G., Stea, G. (2023). Bi-dimensional Assignment in 5G Periodic Scheduling. Cham : Springer Nature [10.1007/978-3-031-28863-0_14].
Bi-dimensional Assignment in 5G Periodic Scheduling
Galli L.
;
2023
Abstract
We consider a scheduling application in 5G cellular networks, where base stations serve periodic tasks by allocating conflict-free portions of the available spectrum, in order to meet their traffic demand. The problem has a combinatorial structure featuring bi-dimensional periodic allocations of resources. We consider four variants of the problem, characterized by different degrees of freedom. Two types of formulations are presented and tested on realistic data, using a general-purpose solver. Knapsack Problems invited session.| File | Dimensione | Formato | |
|---|---|---|---|
|
kp5g_FINAL.pdf
accesso aperto
Tipo:
Postprint / Author's Accepted Manuscript (AAM) - versione accettata per la pubblicazione dopo la peer-review
Licenza:
Licenza per accesso libero gratuito
Dimensione
144.42 kB
Formato
Adobe PDF
|
144.42 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
