• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.05a
• /
• pp.169-169
• /
• 2001

With the aid of fast computing power, resampling techniques are being introduced for simulation output analysis (SOA). Autocorrelation among the output from discrete-event simulation prohibit the direct application of resampling schemes (Threshold bootstrap, Binary bootstrap, Stationary bootstrap, etc) extend its usage to time-series data such as simulation output. We present a new method for inference from a regenerative process, regenerative bootstrap, that equals or exceeds the performance of classical regenerative method and approximation regeneration techniques. Regenerative bootstrap saves computation time and overcomes the problem of scarce regeneration cycles. Computational results are provided using M/M/1 model.

• IE interfaces
• /
• v.11 no.3
• /
• pp.89-101
• /
• 1998

The randomness of the input variables in simulation experiments produce output responses which are also realizations of random variables. The random responses make necessary the use of statistical inferences to adequately describe the stochastic nature of the output. The analysis of the simulation output of non-terminating simulations is frequently complicated by the autocorrelation of the output data and the effect of the initial conditions that produces biased estimates. The regenerative method has been developed to deal with some of the problems created by the random nature of the simulation experiments. It provides a simple solution to some tactical problems and can produce valid statistical results. However, not all processes can he modeled using the regenerative method. Other processes modeled as regenerative may not return to a given demarcating state frequently enough to allow for adequate statistical analysis. This paper shows how the state transformation concept was successfully used in a queueing model and a job shop model. Although the first example can be analyzed using the regenerative method. it has the problem of too few recurrences under certain conditions. The second model has the problem of no recurrences. In both cases, the state transformation increase the frequency of the demarcating state. It was shown that time state transformations are regenerative and produce more cycles than the best typical discrete demarcating state in a given run length.

• Journal of the Korea Society for Simulation
• /
• v.13 no.2
• /
• pp.23-34
• /
• 2004

Regenerative simulation (RS) is a method of stochastic steady-state simulation in which output data are collected and analysed within regenerative cycles (RCs). Since data collected during consecutive RCs are independent and identically distributed, there is no problem with the initial transient period in simulated processes, which is a perennial issue of concern in all other types of steady-state simulation. In this paper, we address the issue of experimental analysis of the quality of sequential regenerative simulation in the sense of the coverage of the final confidence intervals of mean values. The ultimate purpose of this study is to determine the best version of RS to be implemented in Akaroa2 [1], a fully automated controller of distributed stochastic simulation in LAN environments.

• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.1025-1032
• /
• 2003

Percentiles are convenient measures of the entire range of values of simulation outputs. However, unlike means and standard deviations, the observations have to be stored since calculation of percentiles requires several passes through the data. Thus, percentile (PE) requires a large amount of computer storage and computation time. The best possible computation time to sort n observations is (O($nlog_{2}n$)), and memory proportional to n is required to store sorted values in order to find a given order statistic. Several approaches for extimating percentiles in RS(regenerative simulation) and non-RS, which can avoid difficulties of PE, have been proposed in [11, 12, 21]. In this paper, we implemented these three approaches known as : leanear PE, batching PE, spectral $P^2$ PE in the context of sequential steady-state simulation. Numerical results of coverage analysis of these PE approachs are present.