Evènement pour le groupe Algorithmique Distribuée
|Date|| 2015-06-15 14:00-15:00|
|Titre|| Station Assignment with Reallocation |
|Résumé|| In this work, we studied a dynamic allocation problem that arises in various scenarios where mobile clients joining and leaving the system have to communicate with static stations via radio transmissions. Restrictions are a maximum delay, or laxity, between consecutive client transmissions and a maximum bandwidth that a station can share among its clients. We studied the problem of assigning clients to stations so that every client transmits to some station, satisfying those restrictions. We considered reallocation algorithms, where clients are revealed at its arrival time, the departure time is unknown until they leave, and clients may be reallocated to another station, but at a cost proportional to the reciprocal of the client’s laxity. I will present positive and negative results as well as the results of our simulations showing that our protocols behave even better than our theoretical guarantees.
This is joint work with Yulia Rossikova and Prudence W. H. Wong, and will be presented at SEA 2015. |
|Orateur||Miguel Mosteiro |
|Url||Kean University, NJ, USA |
Aucun document lié à cet événement.RetourRetour à l'index