An analytic cost model is presented for M/G/1/N queueing systems. It considers the cost of customer loss versus customer delays, by varying buffer size and processor speed. We find optimal (and near optimal) configurations for a wide variety of service-time distributions. The model can provide insight into when it is better to invest in increased processor speed than to supply more buffer space. It is seen that different distributions may need very different hardware for optimal performance, and that it may actually be better to reject customers
We consider the problem of how best to assign the service capacity in a queueing network in order to...
In this paper, a simple optimal buffer capacity model is developed for series production line where ...
Continuously growing needs for distributed applications that transmit massive amount of data has led...
Analytic modelling has proven to be cost-effective in the performance evaluation of computer systems...
Nowadays, due to the advent of clouding computing, buffer size can be readily extended in a couple o...
The optimal design of real-life systems modeled as finite queueing networks is a difficult stochasti...
We study a generalised M(k)/M/k queueing system where the arrival rate depends on the number of serv...
The optimal design of real-life systems modeled as finite queueing networks is a difficult stochasti...
This paper deals with the joint optimization of the number of buffers and servers, an important issu...
AbstractA cost function is studied for an M/G/1 queueing model for which the service rate of the vir...
International audienceThe M/G/1 queue is a classical model used to represent a large number of real-...
International audienceThis paper deals with the joint optimization of the number of buffers and serv...
The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, int...
AbstractThis paper investigates the T policy M/G/1 queue with server breakdowns, and startup times. ...
We consider the problem of how best to assign the service effort in a queueing network in order to m...
We consider the problem of how best to assign the service capacity in a queueing network in order to...
In this paper, a simple optimal buffer capacity model is developed for series production line where ...
Continuously growing needs for distributed applications that transmit massive amount of data has led...
Analytic modelling has proven to be cost-effective in the performance evaluation of computer systems...
Nowadays, due to the advent of clouding computing, buffer size can be readily extended in a couple o...
The optimal design of real-life systems modeled as finite queueing networks is a difficult stochasti...
We study a generalised M(k)/M/k queueing system where the arrival rate depends on the number of serv...
The optimal design of real-life systems modeled as finite queueing networks is a difficult stochasti...
This paper deals with the joint optimization of the number of buffers and servers, an important issu...
AbstractA cost function is studied for an M/G/1 queueing model for which the service rate of the vir...
International audienceThe M/G/1 queue is a classical model used to represent a large number of real-...
International audienceThis paper deals with the joint optimization of the number of buffers and serv...
The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, int...
AbstractThis paper investigates the T policy M/G/1 queue with server breakdowns, and startup times. ...
We consider the problem of how best to assign the service effort in a queueing network in order to m...
We consider the problem of how best to assign the service capacity in a queueing network in order to...
In this paper, a simple optimal buffer capacity model is developed for series production line where ...
Continuously growing needs for distributed applications that transmit massive amount of data has led...