{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:48Z","timestamp":1750306608087,"version":"3.41.0"},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,5,8]],"date-time":"2015-05-08T00:00:00Z","timestamp":1431043200000},"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":[[2015,11,16]]},"abstract":"<jats:p>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 of regeneration times exists in multiclass networks, making them amenable to regenerative simulation for estimating steady-state performance measures. However, typically, identification of such a sequence in these networks is difficult. A well-known exception is when all interarrival times are exponentially distributed, where the instants corresponding to customer arrivals to an empty network constitute a sequence of regeneration times. In this article, we consider networks in which the interarrival times are generally distributed but have exponential or heavier tails. We show that these distributions can be decomposed into a mixture of sums of independent random variables such that at least one of the components is exponentially distributed. This allows an easily implementable embedded sequence of regeneration times in the underlying Markov process. We show that among all such interarrival time decompositions, the one with an exponential component that has the largest mean minimizes the asymptotic variance of the standard deviation estimator. We also show that under mild conditions on the network primitives, the regenerative mean and standard deviation estimators are consistent and satisfy a joint central limit theorem useful for constructing asymptotically valid confidence intervals.<\/jats:p>","DOI":"10.1145\/2699717","type":"journal-article","created":{"date-parts":[[2015,5,11]],"date-time":"2015-05-11T16:30:57Z","timestamp":1431361857000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions"],"prefix":"10.1145","volume":"25","author":[{"given":"Sarat Babu","family":"Moka","sequence":"first","affiliation":[{"name":"Tata Institute of Fundamental Research, Mumbai, India"}]},{"given":"Sandeep","family":"Juneja","sequence":"additional","affiliation":[{"name":"Tata Institute of Fundamental Research, Mumbai, India"}]}],"member":"320","published-online":{"date-parts":[[2015,5,8]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964800004022"},{"key":"e_1_2_2_2_1","volume-title":"Applied Probability and Queues","author":"Asmussen S.","unstructured":"S. Asmussen . 2003. Applied Probability and Queues ( 2 nd ed.). Applications of Mathematics: Stochastic Modelling and Applied Probability, Vol. 51 . Springer-Verlag , New York. S. Asmussen. 2003. Applied Probability and Queues (2nd ed.). Applications of Mathematics: Stochastic Modelling and Applied Probability, Vol. 51. Springer-Verlag, New York.","edition":"2"},{"key":"e_1_2_2_3_1","first-page":"1","article-title":"Renovation, regeneration, and coupling in multiple-server queues in continuous time","volume":"1","author":"Asmussen S.","year":"1993","unstructured":"S. Asmussen and S. G. Foss . 1993 . Renovation, regeneration, and coupling in multiple-server queues in continuous time . Front. Pure Appl. Probab. 1 , 1 -- 6 . S. Asmussen and S. G. Foss. 1993. Renovation, regeneration, and coupling in multiple-server queues in continuous time. Front. Pure Appl. Probab. 1, 1--6.","journal-title":"Front. Pure Appl. Probab."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1978-0511425-0"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005200"},{"volume-title":"Asymptotic Methods in Queuing Theory","author":"Borovkov A. A.","key":"e_1_2_2_6_1","unstructured":"A. A. Borovkov . 1984. Asymptotic Methods in Queuing Theory . John Wiley & Sons, Ltd. , Chichester. A. A. Borovkov. 1984. Asymptotic Methods in Queuing Theory. John Wiley & Sons, Ltd., Chichester."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019160803783"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.3.531"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147224.1147228"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004699"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2784206.2784219"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.23.1.33"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004828"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.471210"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02412251"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.21067"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994267"},{"key":"e_1_2_2_18_1","volume-title":"Handbooks in Operations Research and Management Science","volume":"13","author":"Glynn P. W.","year":"2006","unstructured":"P. W. Glynn . 2006 . Chapter 16 Simulation Algorithms for Regenerative Processes. In Simulation, S. G. Henderson and B. L. Nelson (Eds.) . Handbooks in Operations Research and Management Science , Vol. 13 . Elsevier, 477--500. P. W. Glynn. 2006. Chapter 16 Simulation Algorithms for Regenerative Processes. In Simulation, S. G. Henderson and B. L. Nelson (Eds.). Handbooks in Operations Research and Management Science, Vol. 13. Elsevier, 477--500."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/102810.102811"},{"key":"e_1_2_2_20_1","doi-asserted-by":"crossref","unstructured":"P. W. Glynn and D. L. Iglehart. 1981. Simulation Output Analysis for General State Space Markov Chains. Ph.D. dissertation Stanford University Department of Operational Research Stanford CA.  P. W. Glynn and D. L. Iglehart. 1981. Simulation Output Analysis for General State Space Markov Chains. Ph.D. dissertation Stanford University Department of Operational Research Stanford CA.","DOI":"10.1007\/978-1-4899-4975-2_3"},{"key":"e_1_2_2_21_1","doi-asserted-by":"crossref","unstructured":"P. W. Glynn and D. L. Iglehart. 1984. Confidence intervals using the regenerative method for simulation output analysis. Technical Report in Defense Technical Information Center (DTIC) ADA150147 248--249.  P. W. Glynn and D. L. Iglehart. 1984. Confidence intervals using the regenerative method for simulation output analysis. Technical Report in Defense Technical Information Center (DTIC) ADA150147 248--249.","DOI":"10.21236\/ADA150147"},{"key":"e_1_2_2_22_1","doi-asserted-by":"crossref","unstructured":"P. W. Glynn and D. L. Iglehart. 1986. Recursive moment formulas for regenerative simulation. In J. Jassen (Ed.). Semi-Markov Models 99--110.  P. W. Glynn and D. L. Iglehart. 1986. Recursive moment formulas for regenerative simulation. In J. Jassen (Ed.). Semi-Markov Models 99--110.","DOI":"10.1007\/978-1-4899-0574-1_7"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187081"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964800003727"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(96)00176-0"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.2.313"},{"key":"e_1_2_2_27_1","volume-title":"Stochastic Differential Systems, Stochastic Control Theory and Applications (Minneapolis, Minn.","author":"Harrison J. M.","year":"1986","unstructured":"J. M. Harrison . 1988. Brownian models of queueing networks with heterogeneous customer populations . In Stochastic Differential Systems, Stochastic Control Theory and Applications (Minneapolis, Minn. , 1986 ). IMA Vol. Math. Appl., Vol. 10 . Springer , New York, 147--186. J. M. Harrison. 1988. Brownian models of queueing networks with heterogeneous customer populations. In Stochastic Differential Systems, Stochastic Control Theory and Applications (Minneapolis, Minn., 1986). IMA Vol. Math. Appl., Vol. 10. Springer, New York, 147--186."},{"key":"e_1_2_2_28_1","doi-asserted-by":"crossref","unstructured":"P. Heidelberger and D. L. Iglehart. 1979. Comparing stochastic systems using regenerative simulation with common random numbers. Advances in Applied Probability 804--819.  P. Heidelberger and D. L. Iglehart. 1979. Comparing stochastic systems using regenerative simulation with common random numbers. Advances in Applied Probability 804--819.","DOI":"10.2307\/1426860"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/324138.324243"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/508366.508367"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800220311"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/322123.322132"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322087"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.5.896"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00266048"},{"key":"e_1_2_2_36_1","volume-title":"Lecture Notes in Control and Information Sciences","volume":"26","author":"Iglehart D. L.","unstructured":"D. L. Iglehart and G. S. Shedler . 1980. Regenerative simulation of response times in networks of queues . Lecture Notes in Control and Information Sciences , Vol. 26 . Springer-Verlag, Berlin. D. L. Iglehart and G. S. Shedler. 1980. Regenerative simulation of response times in networks of queues. Lecture Notes in Control and Information Sciences, Vol. 26. Springer-Verlag, Berlin."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264534"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.2307\/1426989"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.31.6.1145"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.50339"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.1.140"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.106156"},{"key":"e_1_2_2_43_1","first-page":"167","article-title":"Traffic models for ISDN data users: office automation application","volume":"13","author":"Meier-Hellstern K. S.","year":"1991","unstructured":"K. S. Meier-Hellstern , P. E. Wirth , Y. Yan , and D. A. Hoeflin . 1991 . Traffic models for ISDN data users: office automation application . In Proc. ITC , Vol. 13 , 167 -- 172 . K. S. Meier-Hellstern, P. E. Wirth, Y. Yan, and D. A. Hoeflin. 1991. Traffic models for ISDN data users: office automation application. In Proc. ITC, Vol. 13, 167--172.","journal-title":"Proc. ITC"},{"key":"e_1_2_2_44_1","first-page":"175","article-title":"Stability and optimization of queueing networks and their fluid models","volume":"33","author":"Meyn S.","year":"1997","unstructured":"S. Meyn . 1997 . Stability and optimization of queueing networks and their fluid models . Lect. Appl. Math. Am. Math. Soc. 33 , 175 -- 200 . S. Meyn. 1997. Stability and optimization of queueing networks and their fluid models. Lect. Appl. Math. Am. Math. Soc. 33, 175--200.","journal-title":"Lect. Appl. Math. Am. Math. Soc."},{"key":"e_1_2_2_45_1","doi-asserted-by":"crossref","unstructured":"S. P. Meyn and R. L. Tweedie. 2009. Markov Chains and Stochastic Stability (2nd ed.). Cambridge University Press New York.   S. P. Meyn and R. L. Tweedie. 2009. Markov Chains and Stochastic Stability (2nd ed.). Cambridge University Press New York.","DOI":"10.1017\/CBO9780511626630"},{"volume-title":"Winter Simulation Conference (WSC\u201913)","author":"Moka S. B.","key":"e_1_2_2_46_1","unstructured":"S. B. Moka and S. Juneja . 2013. Regenerative simulation for multiclass open queueing networks . In Winter Simulation Conference (WSC\u201913) . IEEE, 643--654. S. B. Moka and S. Juneja. 2013. Regenerative simulation for multiclass open queueing networks. In Winter Simulation Conference (WSC\u201913). IEEE, 643--654."},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699717"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:QUES.0000027988.38058.8d"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00534764"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.2307\/1426476"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.21085"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.2307\/3214447"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1955.0198"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.2307\/1426618"},{"key":"e_1_2_2_55_1","doi-asserted-by":"crossref","unstructured":"H. Thorisson. 2000. Coupling Stationarity and Regeneration. Springer-Verlag New York.  H. Thorisson. 2000. Coupling Stationarity and Regeneration. Springer-Verlag New York.","DOI":"10.1007\/978-1-4612-1236-2"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/66.4384"},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019108819713"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2699717","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2699717","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:59Z","timestamp":1750227419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2699717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,8]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11,16]]}},"alternative-id":["10.1145\/2699717"],"URL":"https:\/\/doi.org\/10.1145\/2699717","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"type":"print","value":"1049-3301"},{"type":"electronic","value":"1558-1195"}],"subject":[],"published":{"date-parts":[[2015,5,8]]},"assertion":[{"value":"2013-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-05-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}