Scheduling users in drive-thru Internet: a multi-armed bandit approach - ETIS, équipe de recherche CELL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Scheduling users in drive-thru Internet: a multi-armed bandit approach

Résumé

We consider the problem of allocating a wireless channel to mobile users moving on a straight road. The objective is to maximize a given function of the total data transmitted. We develop a model within the multi-armed bandit framework and we formulate an optimization problem under the constraint that only one user can be served at a time. We solve the relaxed optimization problem, in which one user is served on the average, for which the solution is given by Whittle's index policy, and we derive a heuristic policy for the original optimization problem using Whittle's index policy as well. We evaluate numerically to see how well the heuristic algorithm performs in various settings, including the dynamic scenario with arrivals of new users, and in the presence of heterogeneous users.
Fichier principal
Vignette du fichier
long_version.pdf (504.74 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02112621 , version 1 (26-04-2019)

Identifiants

Citer

Thi Thuy Nga Nguyen, Urtzi Ayesta, Balakrishna Prabhu. Scheduling users in drive-thru Internet: a multi-armed bandit approach. WiOpt 2019, International Federation for Information Processing (IFIP), Jun 2019, Avignon, France. ⟨10.23919/WiOPT47501.2019.9144139⟩. ⟨hal-02112621⟩
262 Consultations
165 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More