his paper proposes a rule for determining when to start collecting ~ data in a queueing simulation. The rule is designed to reduce depen-dence between the empty (queue) and idle (servers) initial conditions and the collec ted sample record. The rule is an outgrowth of earl ier work by Fishman and Moore (1978) and relies on a comparison between a priori information on the activity l evel (traffic intensity) and a corresponding sample estimate computed during the course of simulation. Experiments with simulations of the MIMIc queue with c = 1,2,4 and p =.7,.8,.9,.95 reveal that the rul e reduces and in most cases removes the dependence on the empty and idle initial conditions. In particular, the rule begins data collection when the simulation...
summary:A non-Markovian queueing system with Poisson input is studied under a modified operating rul...
Efficient importance sampling methods are proposed for the simulation of a single server queue with ...
The finding that Pareto distributions are adequate to model Internet packet interarrival times has ...
Simple heuristic formulas are developed to estimate the simulation run lengths required to achieve d...
The importance of accurate models for the input processes of simulation is generally recognized. How...
This thesis examines methods for predicting queue length of single server queues in order to evaluat...
The behavior of uniformly sampled queues simulated under different dispatching policies are modeled ...
Simulation experiments for analysing the steady-state behaviour of queueing systems over a range of ...
The probabilistic structure for the transient M/Ek/2 queue is derived in discrete time, where Ek den...
The paper presents an extended simulation study aimed to the evaluation of the impact on queueing pe...
The M(t)=G=s(t) + G queue (with a timevarying arrival rate and general distributions for the service...
The goal of steady-state simulation is often to obtain point and interval estimators for a steady-st...
This document gives an overview the standard methods used to model and analyze the performance of qu...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Queueing theory focuses on study waiting lines though the use of mathematical or queueing models. Q...
summary:A non-Markovian queueing system with Poisson input is studied under a modified operating rul...
Efficient importance sampling methods are proposed for the simulation of a single server queue with ...
The finding that Pareto distributions are adequate to model Internet packet interarrival times has ...
Simple heuristic formulas are developed to estimate the simulation run lengths required to achieve d...
The importance of accurate models for the input processes of simulation is generally recognized. How...
This thesis examines methods for predicting queue length of single server queues in order to evaluat...
The behavior of uniformly sampled queues simulated under different dispatching policies are modeled ...
Simulation experiments for analysing the steady-state behaviour of queueing systems over a range of ...
The probabilistic structure for the transient M/Ek/2 queue is derived in discrete time, where Ek den...
The paper presents an extended simulation study aimed to the evaluation of the impact on queueing pe...
The M(t)=G=s(t) + G queue (with a timevarying arrival rate and general distributions for the service...
The goal of steady-state simulation is often to obtain point and interval estimators for a steady-st...
This document gives an overview the standard methods used to model and analyze the performance of qu...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Queueing theory focuses on study waiting lines though the use of mathematical or queueing models. Q...
summary:A non-Markovian queueing system with Poisson input is studied under a modified operating rul...
Efficient importance sampling methods are proposed for the simulation of a single server queue with ...
The finding that Pareto distributions are adequate to model Internet packet interarrival times has ...