Operations Research
Management Science
On arrivals that see time averages
Operations Research
A review of L=&lgr;W and extensions
Queueing Systems: Theory and Applications
The asymptotic efficiency of simulation estimators
Operations Research
Asymptotic formulas for Markov processes with applications to simulation
Operations Research
Queueing simulation in heavy traffic
Mathematics of Operations Research
Estimating customer and time averages
Operations Research
The physics of the Mt/G/ ∞ symbol Queue
Operations Research
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
The BMAP/G/1 QUEUE: A Tutorial
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Variance Reduction in Simulations of Loss Models
Operations Research
Simulation in research and research in simulation: a telecommunications perspective
Proceedings of the 29th conference on Winter simulation
Resource sharing for book-ahead and instantaneous-request calls
IEEE/ACM Transactions on Networking (TON)
A Diffusion Approximation for a Markovian Queue with Reneging
Queueing Systems: Theory and Applications
Properties of the Reflected Ornstein–Uhlenbeck Process
Queueing Systems: Theory and Applications
Impacts of data call characteristics on multi-service CDMA system capacity
Performance Evaluation - Performance 2005
Rare event simulation for a slotted time M/G/s model
Queueing Systems: Theory and Applications
Differentiating the performance of systems more reliably
Performance Evaluation
On the time-dependent moments of Markovian queues with reneging
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We derive formulas approximating the asymptotic variance of four estimators for steady-state blocking probability in a multiserver loss system, exploiting diffusion process limits. These formulas can be used to predict simulation run lengths required to obtain desired statistical precision before the simulation has been run, which can aid in the design of simulation experiments. They also indicate that one estimator can be much better than another, depending on the loading. An indirect estimator based on estimating the mean occupancy is significantly more (less) efficient than a direct estimator for heavy (light) loads. A major concern is the way computational effort scales with system size. For all the estimators, the asymptotic variance tends to be inversely proportional to the system size, so that the computational effort (regarded as proportional to the product of the asymptotic variance and the arrival rate) does not grow as system size increases. Indeed, holding the blocking probability fixed, the computational effort with a good estimator decreases to zero as the system size increases. The asymptotic variance formulas also reveal the impact of the arrival-process and service-time variability on the statistical precision. We validate these formulas by comparing them to exact numerical results for the special case of the classical Erlang M/M/s/0 model and simulation estimates for more general G/GI/s/0 models. It is natural to delete an initial portion of the simulation run to allow the system to approach steady state when it starts out empty. For small to moderately size systems, the time to approach steady state tends to be negligible compared to the time required to obtain good estimates in steady state. However, as the system size increases, the time to approach steady state remains approximately unchanged, or even increases slightly, so that the computational effort associated with letting the system approach steady state becomes a greater portion of the overall computational effort as system size increases.