Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-16T19:24:09.028Z Has data issue: false hasContentIssue false

SIMULATION OF PROCESSES WITH MULTIPLE REGENERATION SEQUENCES

Published online by Cambridge University Press:  01 April 2000

James M. Calvin
Affiliation:
Department of Computer and Information Science, New Jersey Institute of Technology, Newark, New Jersey 07102-1982, [email protected]
Marvin K. Nakayama
Affiliation:
Department of Computer and Information Science, New Jersey Institute of Technology, Newark, New Jersey 07102-1982, [email protected]

Abstract

The classical regenerative method of simulation output analysis exploits the regenerative structure of a stochastic process to break up a path into independent and identically distributed cycles based on a single sequence of regeneration times. If a process is regenerative with respect to more than one sequence of regeneration times, the classical regenerative method does not exploit the additional structure, and the variance of the resulting estimator for certain performance measures (e.g., the time-average variance constant) can vary greatly, depending on the particular regeneration sequence chosen. In a previous article, we introduced an efficiency-improvement technique for regenerative simulation of processes having two sequences of regeneration times based on permuting regenerative cycles associated with the second sequence of regeneration points. In this article, we show how to exploit more than two regeneration sequences. In particular, for birth–death Markov chains, the regenerations associated with hitting times to each state can all be exploited. We present empirical results that show significant variance reductions in some cases, and the results seem to indicate that the permuted estimator for the time-average variance constant can have a variance that is independent of the primary regeneration sequence used to run the simulation.

Type
Research Article
Copyright
© 2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)