{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T08:26:12Z","timestamp":1783153572686,"version":"3.54.6"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T00:00:00Z","timestamp":1744329600000},"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":[[2025,4,30]]},"abstract":"<jats:p>Although high-fidelity network simulations have proven to be reliable and cost-effective tools to peer into architectural questions for high-performance computing (HPC) networks, they incur a high resource cost. The time spent in simulating a single millisecond of network traffic in the highest detail can take hours, even for static, well-behaved traffic patterns such as uniform random. Surrogate models offer a significant reduction in runtime, yet they cannot serve as complete replacements and should only be used when appropriate. Thus, there is a need for hybrid modeling, where high-fidelity simulation and surrogates run side-by-side. We present a surrogate model for HPC networks in which: packets bypass the network, while the network state is left untouched, i.e., suspended. To bypass the network, we use historical data to estimate the arrival time at which every packet should be scheduled at; to suspend the network, all in-flight packets are scheduled to arrive at their destinations, and are kept in the system to awaken as zombies when switching back to high-fidelity. Speedup for a hybrid model is relative to the proportion of surrogate to high-fidelity. This light-weight surrogate obtained up to 76\u00d7 speedup. Keeping the zombies in the network showed an increase in the accuracy of the high-fidelity simulation on restart when compared to restarting the network from an empty state.<\/jats:p>","DOI":"10.1145\/3682060","type":"journal-article","created":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T11:43:49Z","timestamp":1722339829000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Hybrid PDES Simulation of HPC Networks Using Zombie Packets"],"prefix":"10.1145","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3102-3187","authenticated-orcid":false,"given":"Elkin","family":"Cruz-Camacho","sequence":"first","affiliation":[{"name":"Computer Science, Rensselaer Polytechnic Institute, Troy, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0935-5743","authenticated-orcid":false,"given":"Kevin","family":"Brown","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory, Lemont, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3692-2483","authenticated-orcid":false,"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"Computer Science, University of Illinois Chicago, Chicago, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2097-5246","authenticated-orcid":false,"given":"Xiongxiao","family":"Xu","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology, Chicago, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6043-1764","authenticated-orcid":false,"given":"Kai","family":"Shu","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology, Chicago, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1047-8724","authenticated-orcid":false,"given":"Zhiling","family":"Lan","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago, Chicago, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5435-5857","authenticated-orcid":false,"given":"Robert B.","family":"Ross","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory, Lemont, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8862-9844","authenticated-orcid":false,"given":"Christopher","family":"Carothers","sequence":"additional","affiliation":[{"name":"Computer Science, Rensselaer Polytechnic Institute, Troy, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,4,11]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2486092.2486134"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-78713-4_8"},{"key":"e_1_3_2_4_2","article-title":"Artificial intelligence multiprocessing optimized system (AiMOS)","author":"Innovations Center for Computational","year":"2019","unstructured":"Center for Computational Innovations. 2019. Artificial intelligence multiprocessing optimized system (AiMOS). cci.rpi.edu.","journal-title":"cci.rpi.edu"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41939-017-0006-4"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.5555\/2821589"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/158459.158476"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.3934\/acse.2023015"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354702"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2002.1167066"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41404.2022.00025"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3316480.3325517"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.19"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3631882.3631890"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1177\/0037549712469892"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/PADS.2007.26"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/3522802.3522807"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/PMBS54543.2021.00010"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2543725"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358264"},{"key":"e_1_3_2_21_2","volume-title":"PyTorch: An Imperative Style, High-Performance Deep Learning LibraryCurran Associates, Inc.","author":"Paszke Adam","year":"2019","unstructured":"Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, Soumith Chintala, H. Wallach, H. Larochelle, A. Beygelzimer, F. d\u2019Alch\u00e9-Buc, E. Fox, and R. Garnett. 2019. PyTorch: An Imperative Style, High-Performance Deep Learning Library. Curran Associates, Inc.."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1177\/0037549706067271"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/280265.280267"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2017.102"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3573900.3591123"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3682060","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3682060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:03Z","timestamp":1750295403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3682060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,11]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4,30]]}},"alternative-id":["10.1145\/3682060"],"URL":"https:\/\/doi.org\/10.1145\/3682060","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"value":"1049-3301","type":"print"},{"value":"1558-1195","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,11]]},"assertion":[{"value":"2023-12-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-10","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}