[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
Reflects downloads up to 30 Dec 2024Bibliometrics
Skip Table Of Content Section
SECTION: Special Issue on Don Iglehart
editorial
Free
research-article
Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions
Article No.: 22, Pages 1–22https://doi.org/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 sequence ...

research-article
Resampled Regenerative Estimators
Article No.: 23, Pages 1–25https://doi.org/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 V-statistic, ...

research-article
The Power of Alternative Kolmogorov-Smirnov Tests Based on Transformations of the Data
Article No.: 24, Pages 1–22https://doi.org/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 ...

research-article
On Transience and Recurrence in Irreducible Finite-State Stochastic Systems
Article No.: 25, Pages 1–19https://doi.org/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 ...

research-article
Exact Sampling of Stationary and Time-Reversed Queues
Article No.: 26, Pages 1–27https://doi.org/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). The ...

research-article
How Hard are Steady-State Queueing Simulations?
Article No.: 27, Pages 1–21https://doi.org/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 ...

Subjects

Comments

Please enable JavaScript to view thecomments powered by Disqus.