We analyze the approximation quality of the discrete-time decomposition approach, compared to simulation, and with respect to the expected value and the 95th-percentile of waiting time. For both performance measures, we use OLS regression models to compute point estimates, and quantile regression models to compute interval estimates of decomposition error. The ANOVA reveal major influencing factors on decomposition error while the regression models are demonstrated to provide accurate forecasts and precise confidence intervals for decomposition error
We consider a single-server discrete-time queueing system with N sources, where each source is model...
"September 1990."Includes bibliographical references (p. 27-28).Research supported by the Leaders fo...
One approach to simulating a single-server tandem queuing system is to explicitly model each of the ...
The data sets and regression models presented here are related to the article "Point and interval es...
International audienceClassical performance evaluation of sharing resources systems using queues is ...
For general queueing networks, the exact performance measures such as average waiting time in queue ...
Operational analysis provides a framework for studying queueing phenomena during finite time periods...
This paper analyzes a single-server tandem queue with generally distributed service times, finite bu...
In this paper, we study single-server tandem queues with general service times and finite buffers. J...
In this work, we provide initial insights regarding the error introducedinto multicomponent queueing...
The probabilistic structure for the transient M/Ek/2 queue is derived in discrete time, where Ek den...
Discrete time queueing models have been shown previously to be of practical use for modelling the ap...
We consider the queue lengths of a tandem queueing network. The number of customers in the system c...
AbstractWe show that while we have found closed form, albeit unwieldy, expressions for a tandem queu...
We consider a discrete-time Geo=G=1=1 system in which a customer that finishes its fi rst essential...
We consider a single-server discrete-time queueing system with N sources, where each source is model...
"September 1990."Includes bibliographical references (p. 27-28).Research supported by the Leaders fo...
One approach to simulating a single-server tandem queuing system is to explicitly model each of the ...
The data sets and regression models presented here are related to the article "Point and interval es...
International audienceClassical performance evaluation of sharing resources systems using queues is ...
For general queueing networks, the exact performance measures such as average waiting time in queue ...
Operational analysis provides a framework for studying queueing phenomena during finite time periods...
This paper analyzes a single-server tandem queue with generally distributed service times, finite bu...
In this paper, we study single-server tandem queues with general service times and finite buffers. J...
In this work, we provide initial insights regarding the error introducedinto multicomponent queueing...
The probabilistic structure for the transient M/Ek/2 queue is derived in discrete time, where Ek den...
Discrete time queueing models have been shown previously to be of practical use for modelling the ap...
We consider the queue lengths of a tandem queueing network. The number of customers in the system c...
AbstractWe show that while we have found closed form, albeit unwieldy, expressions for a tandem queu...
We consider a discrete-time Geo=G=1=1 system in which a customer that finishes its fi rst essential...
We consider a single-server discrete-time queueing system with N sources, where each source is model...
"September 1990."Includes bibliographical references (p. 27-28).Research supported by the Leaders fo...
One approach to simulating a single-server tandem queuing system is to explicitly model each of the ...