Topics
stochasticBook
We consider a collection of queues operating in parallel and sharing a common server via a “randomized ” service priority sharing rule. We assume that the service times of the customers (cells) are all constant and identical. This paper is concerned with estimating the sensitivity of the tail of the distribution of the typical sojourn time through these queues to the fraction of server bandwidth given to them by randomized service sharing. Two approaches are considered: “smoothed ” perturbation analysis and stochastic intensity-based estimators.
This paper compares two discrete-time single-server queueing models with two queues. In both models,...
We consider a model of a multi-server queueing system with losses caused by lack of resources necess...
Consider N parallel queues competing for the attention of a single server. At each time slot each qu...
We consider a collection of queues operating in parallel and sharing a common server via the idling ...
Abstract We investigate the sensitivity analysis for a discrete-time queueing system using perturbat...
A sensitivity analysis of a single-server, infinite-buffer queue with correlated arrivals and correl...
The paper deals with the sensitivity analysis of reliability and performance measures for a multi-se...
In this paper we establish a framework for robust sensitivity analysis of queues. Our leading exampl...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
We consider queueing networks for which the performance measureJ ( ) depends on a parameter , which ...
We study infinitesimal perturbation analysis (IPA) for queueing networks with general service time d...
Over the past few decades, the Processor-Sharing (PS) discipline has attracted a great deal of atten...
We present the study of a non-classical discrete-time queueing model in which the customers each req...
Abstract The stationary distribution of the number of customers in the infinite-server system with n...
In this paper the optimal control of a single-channel bulk service queueing system with random serve...
This paper compares two discrete-time single-server queueing models with two queues. In both models,...
We consider a model of a multi-server queueing system with losses caused by lack of resources necess...
Consider N parallel queues competing for the attention of a single server. At each time slot each qu...
We consider a collection of queues operating in parallel and sharing a common server via the idling ...
Abstract We investigate the sensitivity analysis for a discrete-time queueing system using perturbat...
A sensitivity analysis of a single-server, infinite-buffer queue with correlated arrivals and correl...
The paper deals with the sensitivity analysis of reliability and performance measures for a multi-se...
In this paper we establish a framework for robust sensitivity analysis of queues. Our leading exampl...
For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time...
We consider queueing networks for which the performance measureJ ( ) depends on a parameter , which ...
We study infinitesimal perturbation analysis (IPA) for queueing networks with general service time d...
Over the past few decades, the Processor-Sharing (PS) discipline has attracted a great deal of atten...
We present the study of a non-classical discrete-time queueing model in which the customers each req...
Abstract The stationary distribution of the number of customers in the infinite-server system with n...
In this paper the optimal control of a single-channel bulk service queueing system with random serve...
This paper compares two discrete-time single-server queueing models with two queues. In both models,...
We consider a model of a multi-server queueing system with losses caused by lack of resources necess...
Consider N parallel queues competing for the attention of a single server. At each time slot each qu...
Add to ORKG