{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T13:09:36Z","timestamp":1751461776030,"version":"3.41.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0325074"],"award-info":[{"award-number":["IIS-0325074"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p>This article gives several methods for approximating a closed queueing network with a smaller one. The objective is to reduce the simulation time of the network. We consider Jackson-like networks with Markovian routing and with general service distributions. The basic idea is to first divide the network into two parts\u2014the core nodes of interest and the remaining nodes. We suppose that only metrics at the core nodes are of interest. The remaining nodes are collapsed into a reduced set of nodes, in an effort to approximate the flows into and out of the set of core nodes. The core nodes and their interactions are preserved in the reduced network. We test the network reductions for accuracy and speed. By randomly generating sample networks, we test the reductions on a large variety of test networks, rather than on a few specific cases. The main conclusion is that the reductions work well when the squared coefficients of variation of the service distributions are not all small (that is, the network is not close to being deterministic) and for nodes where the utilization is not too high or too low.<\/jats:p>","DOI":"10.1145\/1540530.1540531","type":"journal-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T13:29:23Z","timestamp":1249997363000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Reduction of closed queueing networks for efficient simulation"],"prefix":"10.1145","volume":"19","author":[{"given":"John F.","family":"Shortle","sequence":"first","affiliation":[{"name":"George Mason University, Fairfax, VA"}]},{"given":"Brian L.","family":"Mark","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA"}]},{"given":"Donald","family":"Gross","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA"}]}],"member":"320","published-online":{"date-parts":[[2009,8,11]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_2_1_1","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_2_2_2_1","first-page":"60","article-title":"Scale-free networks. Sci","volume":"288","author":"Barab","year":"2003","unstructured":"Barab &amp;#225;si, A. L. and Bonabeau , E. 2003 . Scale-free networks. Sci . Amer. 288 , 5, 60 -- 69 . Barab&amp;#225;si, A. L. and Bonabeau, E. 2003. Scale-free networks. Sci. Amer. 288, 5, 60--69.","journal-title":"Amer."},{"doi-asserted-by":"publisher","key":"e_1_2_2_3_1","DOI":"10.1287\/mnsc.34.1.75"},{"doi-asserted-by":"crossref","unstructured":"Bolch G. Greiner S. de Meer H. and Trivedi K. S. 2006. Queueing Networks and Markov Chains. Wiley NJ.   Bolch G. Greiner S. de Meer H. and Trivedi K. S. 2006. Queueing Networks and Markov Chains. Wiley NJ.","key":"e_1_2_2_4_1","DOI":"10.1002\/0471791571"},{"doi-asserted-by":"publisher","key":"e_1_2_2_5_1","DOI":"10.1080\/15326349808807516"},{"doi-asserted-by":"publisher","key":"e_1_2_2_6_1","DOI":"10.1007\/BF01158934"},{"key":"e_1_2_2_7_1","first-page":"36","article-title":"Decomposition and aggregation by class in closed queueing networks","volume":"19","author":"Chandy K. M.","year":"1975","unstructured":"Chandy , K. M. and Georganas , N. D. 1975 . Decomposition and aggregation by class in closed queueing networks . IEEE Trans. Softw. Eng. 19 , 36 -- 42 . Chandy, K. M. and Georganas, N. D. 1975. Decomposition and aggregation by class in closed queueing networks. IEEE Trans. Softw. Eng. 19, 36--42.","journal-title":"IEEE Trans. Softw. Eng."},{"doi-asserted-by":"publisher","key":"e_1_2_2_8_1","DOI":"10.1147\/rd.191.0043"},{"volume-title":"Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications.","author":"Cowie J.","unstructured":"Cowie , J. , Liu , H. , Liu , J. , Nicol , D. , and Ogielski , A . 1999. Towards realistic million-node Internet simulations . In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications. Cowie, J., Liu, H., Liu, J., Nicol, D., and Ogielski, A. 1999. Towards realistic million-node Internet simulations. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications.","key":"e_1_2_2_9_1"},{"doi-asserted-by":"publisher","key":"e_1_2_2_10_1","DOI":"10.1145\/360881.360887"},{"key":"e_1_2_2_11_1","series-title":"ACM monograph series","volume-title":"Decomposability Queueing and Computer Science Applications","author":"Curtois P.","unstructured":"Curtois , P. 1977. Decomposability Queueing and Computer Science Applications . ACM monograph series , Academic Press , New York . Curtois, P. 1977. Decomposability Queueing and Computer Science Applications. ACM monograph series, Academic Press, New York."},{"doi-asserted-by":"publisher","key":"e_1_2_2_12_1","DOI":"10.1214\/aoap\/1177005771"},{"doi-asserted-by":"publisher","key":"e_1_2_2_13_1","DOI":"10.1214\/aoap\/1177005269"},{"doi-asserted-by":"publisher","key":"e_1_2_2_14_1","DOI":"10.1287\/opre.42.1.119"},{"doi-asserted-by":"publisher","key":"e_1_2_2_15_1","DOI":"10.1287\/opre.45.4.610"},{"unstructured":"Gelenbe E. and Pujolle G. 1998. Introduction to Queueing Networks 2nd ed. Wiley New York.   Gelenbe E. and Pujolle G. 1998. Introduction to Queueing Networks 2nd ed. Wiley New York.","key":"e_1_2_2_16_1"},{"unstructured":"Gross D. and Harris C. 1998. Fundamentals of Queueing Theory 3rd Ed. Wiley New York.   Gross D. and Harris C. 1998. Fundamentals of Queueing Theory 3rd Ed. Wiley New York.","key":"e_1_2_2_17_1"},{"doi-asserted-by":"publisher","key":"e_1_2_2_18_1","DOI":"10.1007\/BF02411463"},{"doi-asserted-by":"publisher","key":"e_1_2_2_19_1","DOI":"10.1016\/S0377-2217(03)00299-6"},{"doi-asserted-by":"publisher","key":"e_1_2_2_20_1","DOI":"10.1109\/TCOM.1979.1094270"},{"volume-title":"Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications.","author":"Liu B.","unstructured":"Liu , B. , Guo , Y. , Kurose , J. , Towsley , D. , and Gong , W . 1999. Fluid simulation of large scale networks: Issues and tradeoffs . In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications. Liu, B., Guo, Y., Kurose, J., Towsley, D., and Gong, W. 1999. Fluid simulation of large scale networks: Issues and tradeoffs. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications.","key":"e_1_2_2_21_1"},{"doi-asserted-by":"publisher","key":"e_1_2_2_22_1","DOI":"10.1145\/781027.781039"},{"volume-title":"Proceedings of the Winter Simulation Conference. IEEE","author":"Nicol D. M.","unstructured":"Nicol , D. M. , Liljenstam , M. , and Liu , J . 2005. Advanced concepts in large-scale network simulation . In Proceedings of the Winter Simulation Conference. IEEE , Piscataway, NJ, 153--166. Nicol, D. M., Liljenstam, M., and Liu, J. 2005. Advanced concepts in large-scale network simulation. In Proceedings of the Winter Simulation Conference. IEEE, Piscataway, NJ, 153--166.","key":"e_1_2_2_23_1"},{"volume-title":"Proceedings of the Winter Simulation Conference. IEEE","author":"Nicol D. M.","unstructured":"Nicol , D. M. , Liu , J. , Liljenstam , M. , and Yan , G . 2003. Simulation of large-scale networks using SSF . In Proceedings of the Winter Simulation Conference. IEEE , Piscataway, NJ, 650--657. Nicol, D. M., Liu, J., Liljenstam, M., and Yan, G. 2003. Simulation of large-scale networks using SSF. In Proceedings of the Winter Simulation Conference. IEEE, Piscataway, NJ, 650--657.","key":"e_1_2_2_24_1"},{"volume-title":"Proceedings of the International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.","author":"Rao D. M.","unstructured":"Rao , D. M. and Wilsey , P. A . 1999. Simulation of ultra-large communication networks . In Proceedings of the International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems. Rao, D. M. and Wilsey, P. A. 1999. Simulation of ultra-large communication networks. In Proceedings of the International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.","key":"e_1_2_2_25_1"},{"doi-asserted-by":"publisher","key":"e_1_2_2_26_1","DOI":"10.1287\/moor.9.3.441"},{"doi-asserted-by":"publisher","key":"e_1_2_2_27_1","DOI":"10.1016\/0167-6377(90)90055-A"},{"unstructured":"Riley G. and Ammar M. H. 2002. Simulating large networks&amp;#8212;how big is big enough&amp;quest; In Proceedings of the 1st International Conference on Grand Challenges for Modeling and Simulation.  Riley G. and Ammar M. H. 2002. Simulating large networks&amp;#8212;how big is big enough&amp;quest; In Proceedings of the 1st International Conference on Grand Challenges for Modeling and Simulation.","key":"e_1_2_2_28_1"},{"doi-asserted-by":"publisher","key":"e_1_2_2_29_1","DOI":"10.5555\/1030818.1030909"},{"doi-asserted-by":"publisher","key":"e_1_2_2_30_1","DOI":"10.1145\/1540530.1540531"},{"doi-asserted-by":"publisher","key":"e_1_2_2_31_1","DOI":"10.1016\/0167-6377(90)90054-9"},{"doi-asserted-by":"publisher","key":"e_1_2_2_32_1","DOI":"10.1287\/opre.30.1.125"},{"key":"e_1_2_2_33_1","first-page":"2816","article-title":"Performance of the QNA","volume":"62","author":"Whitt W.","year":"1983","unstructured":"Whitt , W. 1983 a. Performance of the QNA . Bell Syst. Tech. J. 62 , 9, 2816 -- 2843 . Whitt, W. 1983a. Performance of the QNA. Bell Syst. Tech. J. 62, 9, 2816--2843.","journal-title":"Bell Syst. Tech. J."},{"doi-asserted-by":"publisher","key":"e_1_2_2_34_1","DOI":"10.1002\/j.1538-7305.1983.tb03204.x"},{"doi-asserted-by":"publisher","key":"e_1_2_2_35_1","DOI":"10.1002\/j.1538-7305.1984.tb00084.x"},{"doi-asserted-by":"publisher","key":"e_1_2_2_36_1","DOI":"10.1287\/mnsc.41.10.1704"},{"volume-title":"Proceedings of the 5th EUROCONTROL\/FAA ATM R&amp;D Conference","author":"Yousefi A.","unstructured":"Yousefi , A. , Donohue , G. L. , and Qureshi , K. M . 2003. Investigation of en-route metrics for model validation and airspace design using the Total Airport and Airspace Modeler (TAAM) . In Proceedings of the 5th EUROCONTROL\/FAA ATM R&amp;D Conference . Budapest, Hungary. Yousefi, A., Donohue, G. L., and Qureshi, K. M. 2003. Investigation of en-route metrics for model validation and airspace design using the Total Airport and Airspace Modeler (TAAM). In Proceedings of the 5th EUROCONTROL\/FAA ATM R&amp;D Conference. Budapest, Hungary.","key":"e_1_2_2_37_1"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1540530.1540531","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1540530.1540531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:55Z","timestamp":1750253395000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1540530.1540531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.1145\/1540530.1540531"],"URL":"https:\/\/doi.org\/10.1145\/1540530.1540531","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"type":"print","value":"1049-3301"},{"type":"electronic","value":"1558-1195"}],"subject":[],"published":{"date-parts":[[2009,6]]},"assertion":[{"value":"2007-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}