Add to ORKGWe consider the optimal scheduling of an infinite-capacity batch server in a N-node ring queueing network, where the controller observes only the length of the queue at which the server is located. For a cost criterion that includes linear holding costs, fixed dispatching costs, and linear service rewards, we prove optimality and monotonicity of threshold scheduling policies
We consider a heterogeneous two-server system processing fixed size jobs. This includes the scheduli...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
We prove a monotonicity result for the problem of optimal service rate control in certain queueing n...
We consider the optimal scheduling of an infinite-capacity batch server in a N -node ring queueing n...
Motivated by applications in production and computer-communication systems, we study an N-queue poll...
In this paper we consider the problem of allocating bandwidth to two transmitters/queues with arbitr...
In telecommunications networks, usually an aggregation of information units (a batch) is transmitted...
An optimal policy to minimize the queue length in a multi-server controllable queueing system with h...
Queueing Theory has been successfully and extensively applied to the scheduling, control, and analys...
We consider a parallel server queueing system consisting of a bank of buffers for holding incoming j...
\u3cp\u3eWe consider a content delivery problem in which jobs are processed in batches and may aband...
International audienceWe consider a content delivery problem in which jobs are processed in batches ...
We consider the problem of optimizing a polling system, i.e., of optimally sequencing a server in a ...
\u3cp\u3eWe consider a polling system with two queues, exhaustive service, no switchover times, and ...
This paper is concerned with the problem of deriving efficient operational rules for polling queues ...
We consider a heterogeneous two-server system processing fixed size jobs. This includes the scheduli...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
We prove a monotonicity result for the problem of optimal service rate control in certain queueing n...
We consider the optimal scheduling of an infinite-capacity batch server in a N -node ring queueing n...
Motivated by applications in production and computer-communication systems, we study an N-queue poll...
In this paper we consider the problem of allocating bandwidth to two transmitters/queues with arbitr...
In telecommunications networks, usually an aggregation of information units (a batch) is transmitted...
An optimal policy to minimize the queue length in a multi-server controllable queueing system with h...
Queueing Theory has been successfully and extensively applied to the scheduling, control, and analys...
We consider a parallel server queueing system consisting of a bank of buffers for holding incoming j...
\u3cp\u3eWe consider a content delivery problem in which jobs are processed in batches and may aband...
International audienceWe consider a content delivery problem in which jobs are processed in batches ...
We consider the problem of optimizing a polling system, i.e., of optimally sequencing a server in a ...
\u3cp\u3eWe consider a polling system with two queues, exhaustive service, no switchover times, and ...
This paper is concerned with the problem of deriving efficient operational rules for polling queues ...
We consider a heterogeneous two-server system processing fixed size jobs. This includes the scheduli...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
We prove a monotonicity result for the problem of optimal service rate control in certain queueing n...