{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T09:46:44Z","timestamp":1763977604736,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2007,4]]},"abstract":"<jats:p>\n            We propose nonstandard simulation estimators of expected time averages over finite intervals [0,\n            <jats:italic>t<\/jats:italic>\n            ], seeking to enhance estimation efficiency. We make three key assumptions: (i) the underlying stochastic process has regenerative structure, (ii) the time average approaches a known limit as time\n            <jats:italic>t<\/jats:italic>\n            increases and (iii) time 0 is a regeneration time. To exploit those properties, we propose a\n            <jats:italic>residual-cycle estimator<\/jats:italic>\n            , based on data from the regenerative cycle in progress at time\n            <jats:italic>t<\/jats:italic>\n            , using only the data\n            <jats:italic>after<\/jats:italic>\n            time\n            <jats:italic>t<\/jats:italic>\n            . We prove that the residual-cycle estimator is unbiased and more efficient than the standard estimator for all sufficiently large\n            <jats:italic>t<\/jats:italic>\n            . Since the relative efficiency increases in\n            <jats:italic>t<\/jats:italic>\n            , the method is ideally suited to use when applying simulation to study the rate of convergence to the known limit. We also consider two other simulation techniques to be used with the residual-cycle estimator. The first involves\n            <jats:italic>overlapping cycles<\/jats:italic>\n            , paralleling the technique of overlapping batch means in steady-state estimation; multiple observations are taken from each replication, starting a new observation each time the initial regenerative state is revisited. The other technique is\n            <jats:italic>splitting<\/jats:italic>\n            , which involves independent replications of the terminal period after time\n            <jats:italic>t<\/jats:italic>\n            , for each simulation up to time\n            <jats:italic>t<\/jats:italic>\n            . We demonstrate that these alternative estimators provide efficiency improvement by conducting simulations of queueing models.\n          <\/jats:p>","DOI":"10.1145\/1225275.1225279","type":"journal-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:11Z","timestamp":1181140631000},"page":"8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Exploiting regenerative structure to estimate finite time averages via simulation"],"prefix":"10.1145","volume":"17","author":[{"given":"Wanmo","family":"Kang","sequence":"first","affiliation":[{"name":"Columbia University, New York, NY"}]},{"given":"Perwez","family":"Shahabuddin","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY"}]},{"given":"Ward","family":"Whitt","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY"}]}],"member":"320","published-online":{"date-parts":[[2007,4]]},"reference":[{"volume-title":"Applied Probability and Queues","author":"Asmussen S.","key":"e_1_2_2_1_1","unstructured":"Asmussen , S. 2003. Applied Probability and Queues , second ed. Wiley , New York . Asmussen, S. 2003. Applied Probability and Queues, second ed. Wiley, New York."},{"volume-title":"Convergence of Probability Measures","author":"Billingsley P.","key":"e_1_2_2_2_1","unstructured":"Billingsley , P. 1999. Convergence of Probability Measures , second ed. Wiley , New York . Billingsley, P. 1999. Convergence of Probability Measures, second ed. Wiley, New York."},{"key":"e_1_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Bratley P. Fox B. L. and Schrage L. E. 1987. A Guide to Simulation Second Ed. Springer Verlag New York.   Bratley P. Fox B. L. and Schrage L. E. 1987. A Guide to Simulation Second Ed. Springer Verlag New York.","DOI":"10.1007\/978-1-4419-8724-2"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/280265.280273"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.5.776.12409"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176995090"},{"volume-title":"A Course in Probability Theory","author":"Chung K. L.","key":"e_1_2_2_7_1","unstructured":"Chung , K. L. 1974. A Course in Probability Theory , second ed. Academic Press . Chung, K. L. 1974. A Course in Probability Theory, second ed. Academic Press."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.23.1.33"},{"key":"e_1_2_2_9_1","first-page":"421","article-title":"Network design and control using on-off and multi-level source traffic models with heavy-tailed distributions. Chapter 17 in Self-Similar Network Traffic and Performance Evaluation, Kihong Park and Walter Willinger, eds","author":"Duffield N. G.","year":"2000","unstructured":"Duffield , N. G. and Whitt , W. 2000 . Network design and control using on-off and multi-level source traffic models with heavy-tailed distributions. Chapter 17 in Self-Similar Network Traffic and Performance Evaluation, Kihong Park and Walter Willinger, eds . John Wiley and Sons , 421 - 445 . Duffield, N. G. and Whitt, W. 2000. Network design and control using on-off and multi-level source traffic models with heavy-tailed distributions. Chapter 17 in Self-Similar Network Traffic and Performance Evaluation, Kihong Park and Walter Willinger, eds. John Wiley and Sons, 421-445.","journal-title":"John Wiley and Sons"},{"key":"e_1_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi A. 1956. Asymptotic Expansions Dover.  Erd\u00e9lyi A. 1956. Asymptotic Expansions Dover.","DOI":"10.21236\/AD0055660"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Glynn P. W. and Iglehart D. L. 1986. Consequences of uniform integrability for simulation. Tech. rep. 40 Stanford University Dept. of Operations Research.  Glynn P. W. and Iglehart D. L. 1986. Consequences of uniform integrability for simulation. Tech. rep. 40 Stanford University Dept. of Operations Research.","DOI":"10.21236\/ADA178860"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.3.505"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4149(93)90019-Z"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-4149(01)00146-6"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964800004241"},{"volume-title":"Stopped Random Walks","author":"Gut A.","key":"e_1_2_2_16_1","unstructured":"Gut , A. 1988. Stopped Random Walks , Springer . Gut, A. 1988. Stopped Random Walks, Springer."},{"key":"e_1_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Hammersley J. M. and Handscomb D. C. 1964. Monte Carlo Methods Methuen London.  Hammersley J. M. and Handscomb D. C. 1964. Monte Carlo Methods Methuen London.","DOI":"10.1007\/978-94-009-5819-7"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.27.2.253.329"},{"key":"e_1_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Kang W. Shahabuddin P. and Whitt W. 2007. Exploiting regenerative structure to estimate finite time averages via simulation: supplementary material available in the ACM Digital Library.  Kang W. Shahabuddin P. and Whitt W. 2007. Exploiting regenerative structure to estimate finite time averages via simulation: supplementary material available in the ACM Digital Library.","DOI":"10.1145\/1225275.1225279"},{"volume-title":"Markov Chain Models---Rarity and Exponentiality","author":"Keilson J.","key":"e_1_2_2_20_1","unstructured":"Keilson , J. 1979. Markov Chain Models---Rarity and Exponentiality , Springer . Keilson, J. 1979. Markov Chain Models---Rarity and Exponentiality, Springer."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.28.2.173"},{"key":"e_1_2_2_22_1","unstructured":"Meketon M. S. and Schmeiser B. 1984. Overlapping batch means; something for nothing&quest; Proceedings of 1984 Winter Simulation Conference 227--230.   Meketon M. S. and Schmeiser B. 1984. Overlapping batch means; something for nothing&quest; Proceedings of 1984 Winter Simulation Conference 227--230."},{"key":"e_1_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Meyn S. P. and Tweedie R. L. 1993. Markov Chains and Stochastic Stability Springer.  Meyn S. P. and Tweedie R. L. 1993. Markov Chains and Stochastic Stability Springer.","DOI":"10.1007\/978-1-4471-3267-7"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/78919.78921"},{"volume-title":"Stochastic Processes","author":"Ross S. M.","key":"e_1_2_2_25_1","unstructured":"Ross , S. M. 1996. Stochastic Processes , second ed., John Wiley and Sons . Ross, S. M. 1996. Stochastic Processes, second ed., John Wiley and Sons."},{"volume-title":"Introduction to Probability Models, eighth ed","author":"Ross S. M.","key":"e_1_2_2_26_1","unstructured":"Ross , S. M. 2003. Introduction to Probability Models, eighth ed . Academic Press , New York . Ross, S. M. 2003. Introduction to Probability Models, eighth ed. Academic Press, New York."},{"key":"e_1_2_2_27_1","first-page":"6","article-title":"Regenerative stochastic processes","volume":"232","author":"Smith W. L.","year":"1955","unstructured":"Smith , W. L. 1955 . Regenerative stochastic processes . Proceedings of the Royal Society of London A232 , 6 -- 31 . Smith, W. L. 1955. Regenerative stochastic processes. Proceedings of the Royal Society of London A232, 6--31.","journal-title":"Proceedings of the Royal Society of London"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212333"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.2.279"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964899132029"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1225275.1225279","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1225275.1225279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:08Z","timestamp":1750278128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1225275.1225279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["10.1145\/1225275.1225279"],"URL":"https:\/\/doi.org\/10.1145\/1225275.1225279","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"type":"print","value":"1049-3301"},{"type":"electronic","value":"1558-1195"}],"subject":[],"published":{"date-parts":[[2007,4]]},"assertion":[{"value":"2007-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}