ACM DL

Modeling and Computer Simulation (TOMACS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special Issue on Don Iglehart, Volume 25 Issue 4, November 2015



Section: Special Issue on Don Iglehart

Guest Editors’ Introduction to Special Issue Honoring Donald L. Iglehart
Peter W. Glynn, Peter J. Haas
Article No.: 21
DOI: 10.1145/2822375

Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions
Sarat Babu Moka, Sandeep Juneja
Article No.: 22
DOI: 10.1145/2699717

Multiclass open queueing networks find wide applications in communication, computer, and fabrication networks. Steady-state performance measures associated with these networks is often a topic of interset. Conceptually, under mild conditions, a...

Resampled Regenerative Estimators
James M. Calvin, Marvin K. Nakayama
Article No.: 23
DOI: 10.1145/2699718

We discuss some estimators for simulations of processes having multiple regenerative sequences. The estimators are obtained by resampling trajectories without and with replacement, which correspond to a type of U-statistic and a type of...

The Power of Alternative Kolmogorov-Smirnov Tests Based on Transformations of the Data
Song-Hee Kim, Ward Whitt
Article No.: 24
DOI: 10.1145/2699716

The Kolmogorov-Smirnov (KS) statistical test is commonly used to determine if data can be regarded as a sample from a sequence of independent and identically distributed (i.i.d.) random variables with specified continuous cumulative distribution...

On Transience and Recurrence in Irreducible Finite-State Stochastic Systems
Peter W. Glynn, Peter J. Haas
Article No.: 25
DOI: 10.1145/2699721

Long-run stochastic stability is a precondition for applying steady-state simulation output analysis methods to a discrete-event stochastic system, and is of interest in its own right. We focus on systems whose underlying stochastic process can be...

Exact Sampling of Stationary and Time-Reversed Queues
Jose Blanchet, Aya Wallwater
Article No.: 26
DOI: 10.1145/2822892

We provide the first algorithm that, under minimal assumptions, allows simulation of the stationary waiting-time sequence of a single-server queue backward in time, jointly with the input processes of the queue (interarrival and service times)....

How Hard are Steady-State Queueing Simulations?
Eric C. Ni, Shane G. Henderson
Article No.: 27
DOI: 10.1145/2749460

Some queueing systems require tremendously long simulation runlengths to obtain accurate estimators of certain steady-state performance measures when the servers are heavily utilized. However, this is not uniformly the case. We analyze a number of...