{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T22:10:08Z","timestamp":1755900608230,"version":"3.44.0"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T00:00:00Z","timestamp":1748304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2215671 and CNS-2215672"],"award-info":[{"award-number":["CNS-2215671 and CNS-2215672"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2025,5,27]]},"abstract":"<jats:p>\n            Ensuring the integrity of petabyte-scale file transfers is essential for the data gathered from scientific instruments. As packet sizes increase, so does the likelihood of errors, resulting in a higher probability of undetected errors in the packet. This paper presents a Multi-Level Error Detectio n (MLED) framework that leverages in-network resources to reduce\n            <jats:italic toggle=\"yes\">undetected error probability<\/jats:italic>\n            (UEP) in file transmission. MLED is based on a configurable recursive architecture that organizes communication in layers at different levels, decoupling network functions such as error detection, routing, addressing, and security. Each layer\n            <jats:italic toggle=\"yes\">\n              L\n              <jats:sub>ij<\/jats:sub>\n            <\/jats:italic>\n            at level\n            <jats:italic toggle=\"yes\">i<\/jats:italic>\n            implements a policy\n            <jats:italic toggle=\"yes\">\n              P\n              <jats:sub>ij<\/jats:sub>\n            <\/jats:italic>\n            that governs its operation, including the error detection mechanism used, specific to the scope of that layer. MLED can be configured to mimic the error detection mechanisms of existing large-scale file transfer protocols. The recursive structure of MLED is analyzed and it shows that adding additional levels of error detection reduces the overall UEP. An adversarial error model is designed to introduce errors into files that evade detection by multiple error detection policies. Through experimentation using the FABRIC testbed the traditional approach, with transport- and data link- layer error detection, results in a corrupt file transfer requiring retransmission of the entire file. Using its recursive structure, an implementation of MLED detects and corrects these adversarial errors at intermediate levels inside the network, avoiding file retransmission under non-zero error rates. MLED therefore achieves a 100% gain in goodput over the traditional approach, reaching a goodput of over 800 Mbps on a single connection with no appreciable increase in delay.\n          <\/jats:p>","DOI":"10.1145\/3727111","type":"journal-article","created":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T09:43:35Z","timestamp":1749030215000},"page":"1-42","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Design and Modeling of a New File Transfer Architecture to Reduce Undetected Errors Evaluated in the FABRIC Testbed"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0009-0003-3597-5561","authenticated-orcid":false,"given":"Prateek","family":"Jain","sequence":"first","affiliation":[{"name":"Boston University, Boston, MA, USA"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-3611-4459","authenticated-orcid":false,"given":"Arash","family":"Sarabi","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-4528-0344","authenticated-orcid":false,"given":"Abraham","family":"Matta","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-5025-0337","authenticated-orcid":false,"given":"Violet R.","family":"Syrotiuk","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,6,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1088\/0034--4885\/72\/7\/076901"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2021.02.002"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1405292"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2076450.2076468"},{"volume-title":"Retrieved","year":"2014","key":"e_1_2_1_5_1","unstructured":"AsperaFASP 2014. Aspera FASP High Speed Transport: A Critical Technology Comparison. Retrieved January 20, 2025 from https:\/\/2.zoppoz.workers.dev:443\/https\/api.semanticscholar.org\/CorpusID:54027719"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS59830.2024.10575104"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2019.2958545"},{"key":"e_1_2_1_8_1","unstructured":"Noah Barnes. 2024. MLED Configurator. Boston University. https:\/\/2.zoppoz.workers.dev:443\/https\/mled.bu.edu\/"},{"volume-title":"Users' manual for MLED","author":"Barnes Noah","key":"e_1_2_1_9_1","unstructured":"Noah Barnes. 2024. Users' manual for MLED. Boston University. https:\/\/2.zoppoz.workers.dev:443\/https\/mled.bu.edu\/res\/MLED_GUI_user_manual.pdf"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","unstructured":"Abhay Bhushan. 1971. File Transfer Protocol. RFC 114. doi:10.17487\/RFC0114","DOI":"10.17487\/RFC0114"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-nucl-102010--130059"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Robert T. Braden David A. Borman and Craig Partridge. 1988. RFC 1071: Computing the Internet Checksum. Request for Comments. doi:10.17487\/RFC1071","DOI":"10.17487\/RFC1071"},{"key":"e_1_2_1_13_1","unstructured":"Stephan Brumme. 2011. CRC32 Algorithm - Stephan Brumme. https:\/\/2.zoppoz.workers.dev:443\/https\/create.stephan-brumme.com\/crc32\/"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.231911"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468--4004.2012.53430.x"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1544012.1544079"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1950"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (Prague, Czech Republic) (TELE-INFO'05)","author":"Dorigo Alvise","year":"2005","unstructured":"Alvise Dorigo, Peter Elmer, Fabrizio Furano, and Andrew Hanushevsky. 2005. XROOTD\/TXNetFile: a highly scalable architecture for data access in the ROOT environment. In Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (Prague, Czech Republic) (TELE-INFO'05). World Scientific and Engineering Academy and Society (WSEAS), Stevens Point, Wisconsin, USA, Article 46, 6 pages."},{"key":"e_1_2_1_19_1","unstructured":"FDT 2009. Fast Data Transfer - FDT. https:\/\/2.zoppoz.workers.dev:443\/http\/monalisa.cern.ch\/FDT\/"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxm075"},{"key":"e_1_2_1_21_1","unstructured":"Andrew Hanushevsky. 2001. BBCP. https:\/\/2.zoppoz.workers.dev:443\/https\/www.slac.stanford.edu\/~abh\/bbcp\/"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2021.9363693"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2022.9844436"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC9000"},{"key":"e_1_2_1_25_1","unstructured":"Prateek Jain. 2024. Programmers' Manual for MLED. https:\/\/2.zoppoz.workers.dev:443\/https\/cs-people.bu.edu\/jainp\/index.html#mled"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1117\/12.777377"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2022.3213237"},{"key":"e_1_2_1_28_1","unstructured":"Philip Koopman. 2015. Best CRC Polynomials. https:\/\/2.zoppoz.workers.dev:443\/https\/users.ece.cmu.edu\/~koopman\/crc\/"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208040.3208053"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1088\/1538--3873\/acbb9f"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3651890.3672262"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742--6596\/331\/5\/052015"},{"key":"e_1_2_1_33_1","first-page":"147","article-title":"A comparative study of hash algorithms in cryptography","volume":"8","author":"Pittalia Prashant P","year":"2019","unstructured":"Prashant P Pittalia. 2019. A comparative study of hash algorithms in cryptography. International Journal of Computer Science and Mobile Computing 8, 6 (2019), 147--152.","journal-title":"International Journal of Computer Science and Mobile Computing"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Ronald L. Rivest. 1992. The MD5 Message-Digest Algorithm. RFC 1321. RFC Editor. 1--21 pages. https:\/\/2.zoppoz.workers.dev:443\/https\/www.rfceditor.org\/rfc\/rfc1321.txt","DOI":"10.17487\/rfc1321"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3105096"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2011.5937236"},{"key":"e_1_2_1_37_1","unstructured":"Richard Smith. 2020. Working Draft Standard for Programming Language C. https:\/\/2.zoppoz.workers.dev:443\/https\/www.openstd.org\/jtc1\/sc22\/wg21\/docs\/papers\/2020\/n4849.pdf"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.731187"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347561"},{"volume-title":"A Painless Guide to CRC Error Detection Algorithms","author":"Williams Ross N.","key":"e_1_2_1_40_1","unstructured":"Ross N. Williams. 1993. A Painless Guide to CRC Error Detection Algorithms. Rocksofttm Pty Ltd, 16 Lerwick Avenue, Hazelwood Park 5066, Australia. https:\/\/2.zoppoz.workers.dev:443\/http\/www.ross.net\/crc\/download\/crc_v3.txt"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3727111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/3727111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T21:32:22Z","timestamp":1755898342000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3727111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,27]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,5,27]]}},"alternative-id":["10.1145\/3727111"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/3727111","relation":{},"ISSN":["2476-1249"],"issn-type":[{"type":"electronic","value":"2476-1249"}],"subject":[],"published":{"date-parts":[[2025,5,27]]},"assertion":[{"value":"2025-06-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}