International audienceWe consider three-tier network architecture modeled with two physical nodes in tandem where an autonomous agent controls the number of active resources on each node. We analyse the learning of auto-scaling strategies in order to optimise both performance and energy consumption of the whole system. We compare several model-based reinforcement learning with model-free Q-learning algorithm. The relevance of these algorithms is to faster update Q-value function with an additional planning phase allowed by approximated model of the dynamics of the environment. Secondly, we consider the same tandem queue scenario with MMPP (Markov modulated Poisson process) for arrivals. In this context, the arrival rate is varying over time...
As power grids transition towards increased reliance on renewable generation, energy storage and dem...
We consider the multi-armed restless bandit problem (RMABP) with an infinite horizon average cost ob...
We propose and analyze iterative algorithms that are computationally efficient, statistically sound ...
International audienceWe consider three-tier network architecture modeled with two physical nodes in...
International audienceAs today’s networking systems utilize more virtualisation, efficient auto-scal...
Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 201...
With the rapid advance of information technology, network systems have become increasingly complex a...
Learning to act optimally in the complex world has long been a major goal in artificial intelligence...
The main contribution of this work is a novel machine reinforcement learning algorithm for problems ...
International audienceIntroduction: Control and optimization in queues have been an active area of r...
Methods for optimising measures of social utility in queueing systems usually require interventions ...
We consider a two-tier urban Heterogeneous Network where small cells powered with renewable energy a...
We consider a load balancing problem with task-server affinity and server-dependent task recurrence,...
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q...
As the dynamicity of the traffic increases, the need for self-network operation becomes more evident...
As power grids transition towards increased reliance on renewable generation, energy storage and dem...
We consider the multi-armed restless bandit problem (RMABP) with an infinite horizon average cost ob...
We propose and analyze iterative algorithms that are computationally efficient, statistically sound ...
International audienceWe consider three-tier network architecture modeled with two physical nodes in...
International audienceAs today’s networking systems utilize more virtualisation, efficient auto-scal...
Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 201...
With the rapid advance of information technology, network systems have become increasingly complex a...
Learning to act optimally in the complex world has long been a major goal in artificial intelligence...
The main contribution of this work is a novel machine reinforcement learning algorithm for problems ...
International audienceIntroduction: Control and optimization in queues have been an active area of r...
Methods for optimising measures of social utility in queueing systems usually require interventions ...
We consider a two-tier urban Heterogeneous Network where small cells powered with renewable energy a...
We consider a load balancing problem with task-server affinity and server-dependent task recurrence,...
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q...
As the dynamicity of the traffic increases, the need for self-network operation becomes more evident...
As power grids transition towards increased reliance on renewable generation, energy storage and dem...
We consider the multi-armed restless bandit problem (RMABP) with an infinite horizon average cost ob...
We propose and analyze iterative algorithms that are computationally efficient, statistically sound ...