14 citations · 40 across the 8 of their papers we have counts for
8 papers
Learning in Markovian bandits with non-observable states and constrained decision epochs
Thomas Hira, Victor Boone, Urtzi Ayesta +1
This paper studies the problem of regret minimization in Markovian bandits with \emph{non-observable states} and possibly \emph{constrained} decision epochs. The focus is restricte…
Decision-Epoch Matters: Unveiling its Impact on the Stability of Scheduling with Randomly Varying Connectivity
Nahuel Soprano-Loto, Urtzi Ayesta, Matthieu Jonckheere +1
A classical queuing theory result states that in a parallel-queue single-server model, the maximum stability region does not depend on the scheduling decision epochs, and in partic…
A Survey of Stability Results for Redundancy Systems
Elene Anton, Urtzi Ayesta, Matthieu Jonckheere +1
Redundancy mechanisms consist in sending several copies of a same job to a subset of servers. It constitutes one of the most promising ways to exploit diversity in multiservers app…
Improving the performance of heterogeneous data centers through redundancy
Elene Anton, Urtzi Ayesta, Matthieu Jonckheere +1
We analyze the performance of redundancy in a multi-type job and multi-type server system. We assume the job dispatcher is unaware of the servers' capacities, and we set out to stu…
On the stability of redundancy models
E. Anton, U. Ayesta, M. Jonckheere +1
We investigate the stability condition of redundancy- multi-server systems. Each server has its own queue and implements popular scheduling disciplines such as First-Come-First-…
A token-based central queue with order-independent service rates
U. Ayesta, T. Bodas, J. L. Dorsman +1
We study a token-based central queue with multiple customer types. Customers of each type arrive according to a Poisson process and have an associated set of compatible tokens. Cus…