Let a and s denote the inter arrival times and service times in a GI/GI/1 queue. Let a (n), s (n) be the r.v.s, with distributions as the estimated distributions of a and s from iid samples of a and s of sizes n. Let w be a r.v. with the stationary distribution lr of the waiting times of the queue with input (a, s). We consider the problem of estimating E [w~], tx > 0 and 7r via simulations when (a (n), s (n)) are used as input. Conditions for the accuracy of the asymptotic estimate, continuity of the asymptotic variance and uniformity in the rate of convergence to the estimate are obtained. We also obtain rates of convergence for sample moments, the empirical process and the quantile process for the regenerative processes. Robust estimates...
This dissertation contains two parts. The first part introduces the first class of perfect sampling ...
We propose an alternative approach for studying queues based on robust optimization. We model the un...
Given a marked renewal point process (assuming that the marks are i.i.d.) we say that an unbounded r...
We consider the estimation of arrival and service rates for queues based on queue length data collec...
Simple heuristic formulas are developed to estimate the simulation run lengths required to achieve d...
This paper considers a simulation-based estimator for a general class of Markovian processes and exp...
We consider nonparametric estimation of the stationary distribution of the number of customers in a ...
Multiclass open queueing networks find wide applications in communication, computer, and fabrication...
We propose nonstandard simulation estimators of expected time averages over finite intervals [0, t],...
AbstractWe consider nonparametric estimation of the stationary distribution of the number of custome...
The probabilistic structure for the transient M/Ek/2 queue is derived in discrete time, where Ek den...
This thesis examines methods for predicting queue length of single server queues in order to evaluat...
We consider inference for queues based on inter-departure time data. Calculating the likelihood for ...
In this dissertation, we consider analytic and numeric approaches to the solution of probabilistic s...
Approaches like finite differences with common random numbers, infinitesimal perturbation analysis, ...
This dissertation contains two parts. The first part introduces the first class of perfect sampling ...
We propose an alternative approach for studying queues based on robust optimization. We model the un...
Given a marked renewal point process (assuming that the marks are i.i.d.) we say that an unbounded r...
We consider the estimation of arrival and service rates for queues based on queue length data collec...
Simple heuristic formulas are developed to estimate the simulation run lengths required to achieve d...
This paper considers a simulation-based estimator for a general class of Markovian processes and exp...
We consider nonparametric estimation of the stationary distribution of the number of customers in a ...
Multiclass open queueing networks find wide applications in communication, computer, and fabrication...
We propose nonstandard simulation estimators of expected time averages over finite intervals [0, t],...
AbstractWe consider nonparametric estimation of the stationary distribution of the number of custome...
The probabilistic structure for the transient M/Ek/2 queue is derived in discrete time, where Ek den...
This thesis examines methods for predicting queue length of single server queues in order to evaluat...
We consider inference for queues based on inter-departure time data. Calculating the likelihood for ...
In this dissertation, we consider analytic and numeric approaches to the solution of probabilistic s...
Approaches like finite differences with common random numbers, infinitesimal perturbation analysis, ...
This dissertation contains two parts. The first part introduces the first class of perfect sampling ...
We propose an alternative approach for studying queues based on robust optimization. We model the un...
Given a marked renewal point process (assuming that the marks are i.i.d.) we say that an unbounded r...