Abstract—We consider optimizing average queueing delay and average power consumption in a nonpreemptive multi-class M/G/1 queue with dynamic power control that affects instan-taneous service rates. Four problems are studied: (1) satisfying per-class average delay constraints; (2) minimizing a separable convex function of average delays subject to per-class delay constraints; (3) minimizing average power consumption subject to per-class delay constraints; (4) minimizing a separable convex function of average delays subject to an average power constraint. Combining an achievable region approach in queueing systems and the Lyapunov optimization theory suitable for optimizing dynamic systems with time average constraints, we propose a unified f...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
We propose a method for the control of multi-class queueing networks over a finite time horizon. We ...
International audienceWe consider a queueing system composed of a dispatcher that routes determinist...
We study convex optimization problems with side constraints in a multi-class M/G/1M/G/1 queue with...
We consider the optimal control problem of emptying a deterministic single server multiclass queuing...
In this report we consider the optimal control problem of emptying a deterministic single server mul...
The paper deals with a multi-server controllable queueing system M(t)/M/K with time-dependent and, i...
Queueing Theory has been successfully and extensively applied to the scheduling, control, and analys...
In this thesis, we first study delay systems with different classes of impatient customers. We analy...
Abstract. Consider a single-server queueing system with K job classes, each having its own renewal i...
An optimal policy to minimize the queue length in a multi-server controllable queueing system with h...
We address the problem of scheduling a multiclass queueing network on M parallel servers to minimize...
The paper studies a controllable multi-server heterogeneous queueing system where servers operate at...
Scheduling policies for statistical multiplexing should provide delay differentiation between differ...
This thesis deals with dynamic control of multi-class single-server queues. In a broad class of such...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
We propose a method for the control of multi-class queueing networks over a finite time horizon. We ...
International audienceWe consider a queueing system composed of a dispatcher that routes determinist...
We study convex optimization problems with side constraints in a multi-class M/G/1M/G/1 queue with...
We consider the optimal control problem of emptying a deterministic single server multiclass queuing...
In this report we consider the optimal control problem of emptying a deterministic single server mul...
The paper deals with a multi-server controllable queueing system M(t)/M/K with time-dependent and, i...
Queueing Theory has been successfully and extensively applied to the scheduling, control, and analys...
In this thesis, we first study delay systems with different classes of impatient customers. We analy...
Abstract. Consider a single-server queueing system with K job classes, each having its own renewal i...
An optimal policy to minimize the queue length in a multi-server controllable queueing system with h...
We address the problem of scheduling a multiclass queueing network on M parallel servers to minimize...
The paper studies a controllable multi-server heterogeneous queueing system where servers operate at...
Scheduling policies for statistical multiplexing should provide delay differentiation between differ...
This thesis deals with dynamic control of multi-class single-server queues. In a broad class of such...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
We propose a method for the control of multi-class queueing networks over a finite time horizon. We ...
International audienceWe consider a queueing system composed of a dispatcher that routes determinist...