In this paper we establish a framework for robust sensitivity analysis of queues. Our leading example is the finite capacity M/M/1/N queue, and we analyze the sensitivity of this model with respect to the assumption that interarrival times are exponentially distributed
We consider a discrete time queue with finite capacity and i.i.d. and Markov modulated arrivals, Eff...
Concepts of a discrete Markov flow and discrete-time Markov service are defined. A single-server fin...
We study the sensitivities of the performance measures in a closed queueing network with exponential...
We discuss the application of an efficient numerical algorithm to sensitivity analysis of the GI/M/1...
A sensitivity analysis of a single-server, infinite-buffer queue with correlated arrivals and correl...
Abstract We investigate the sensitivity analysis for a discrete-time queueing system using perturbat...
We consider queueing networks for which the performance measureJ ( ) depends on a parameter , which ...
The paper deals with the sensitivity analysis of reliability and performance measures for a multi-se...
We consider a collection of queues operating in parallel and sharing a common server via a “randomiz...
Linear programming representations for discrete-event simulation provide an alternative approach for...
We consider a collection of queues operating in parallel and sharing a common server via the idling ...
Abstract—We provide algorithms to compute the performance derivatives of Markov chains with respect ...
We propose an alternative approach for studying queues based on robust optimization. We model the un...
In this work, we address the problem of transient and steady-state analysis of a stochastic discret...
We study a fundamental feature of the generalized semi-Markov processes (GSMPs), called event coupli...
We consider a discrete time queue with finite capacity and i.i.d. and Markov modulated arrivals, Eff...
Concepts of a discrete Markov flow and discrete-time Markov service are defined. A single-server fin...
We study the sensitivities of the performance measures in a closed queueing network with exponential...
We discuss the application of an efficient numerical algorithm to sensitivity analysis of the GI/M/1...
A sensitivity analysis of a single-server, infinite-buffer queue with correlated arrivals and correl...
Abstract We investigate the sensitivity analysis for a discrete-time queueing system using perturbat...
We consider queueing networks for which the performance measureJ ( ) depends on a parameter , which ...
The paper deals with the sensitivity analysis of reliability and performance measures for a multi-se...
We consider a collection of queues operating in parallel and sharing a common server via a “randomiz...
Linear programming representations for discrete-event simulation provide an alternative approach for...
We consider a collection of queues operating in parallel and sharing a common server via the idling ...
Abstract—We provide algorithms to compute the performance derivatives of Markov chains with respect ...
We propose an alternative approach for studying queues based on robust optimization. We model the un...
In this work, we address the problem of transient and steady-state analysis of a stochastic discret...
We study a fundamental feature of the generalized semi-Markov processes (GSMPs), called event coupli...
We consider a discrete time queue with finite capacity and i.i.d. and Markov modulated arrivals, Eff...
Concepts of a discrete Markov flow and discrete-time Markov service are defined. A single-server fin...
We study the sensitivities of the performance measures in a closed queueing network with exponential...
DOI
Add to ORKG