Abstract: The problem of access and service rate control as a general optimization problem for controlled Markov process with finite state space is considered. By using the dynamic programming approach we obtain the explicit form of the optimal control in the case of minimizing cost given as a mixture of an average queue length, number of lost jobs, and service resources. The problem is considered on a finite time interval in the case of non stationary input flow. In this case we suggest the general procedure of the numerical solution which can be applied to a problems with constraints. 1
The purpose of flow control is to reduce the congestion experienced in many systems, such as data ne...
A control problem of an M/G/1 queue with imperfectly observed queue length is considered. It is show...
The first part considers discrete-time constrained Markov Decision Processes (MDPs). At each epoch, ...
We consider a GI/M/s queuing system that is controlled by either accepting or rejecting arriving cus...
We consider the problem of service rate control of a single server queueing system with a finite-sta...
AbstractWe address a rate control problem associated with a single server Markovian queueing system ...
Abstract We consider a finite buffered queue in which the queue length is controlled by dynamically ...
We consider the problem of dynamic flow control of arriving packets into an infinite buffer. The ser...
We consider two congestion control models---(i) pricing control and (ii) admission control---in a no...
A number of on-line control methods have been studied for the operational control of a queuing syste...
This paper presents a problem of optimal flow control for discrete-time M|M|l queues, where the deci...
We consider a queuing system with a workload-dependent service rate. We specifically assume that the...
In this paper we consider an optimal control problem for the MAP(t)/M/2 queueing system with heterog...
The paper deals with a multi-server controllable queueing system M(t)/M/K with time-dependent and, i...
This paper presents a problem of optimal flow control for discrete M|M|1 queues. The problem is cast...
The purpose of flow control is to reduce the congestion experienced in many systems, such as data ne...
A control problem of an M/G/1 queue with imperfectly observed queue length is considered. It is show...
The first part considers discrete-time constrained Markov Decision Processes (MDPs). At each epoch, ...
We consider a GI/M/s queuing system that is controlled by either accepting or rejecting arriving cus...
We consider the problem of service rate control of a single server queueing system with a finite-sta...
AbstractWe address a rate control problem associated with a single server Markovian queueing system ...
Abstract We consider a finite buffered queue in which the queue length is controlled by dynamically ...
We consider the problem of dynamic flow control of arriving packets into an infinite buffer. The ser...
We consider two congestion control models---(i) pricing control and (ii) admission control---in a no...
A number of on-line control methods have been studied for the operational control of a queuing syste...
This paper presents a problem of optimal flow control for discrete-time M|M|l queues, where the deci...
We consider a queuing system with a workload-dependent service rate. We specifically assume that the...
In this paper we consider an optimal control problem for the MAP(t)/M/2 queueing system with heterog...
The paper deals with a multi-server controllable queueing system M(t)/M/K with time-dependent and, i...
This paper presents a problem of optimal flow control for discrete M|M|1 queues. The problem is cast...
The purpose of flow control is to reduce the congestion experienced in many systems, such as data ne...
A control problem of an M/G/1 queue with imperfectly observed queue length is considered. It is show...
The first part considers discrete-time constrained Markov Decision Processes (MDPs). At each epoch, ...