{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:22:40Z","timestamp":1774120960836,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Institute of Information & Communications Technology Planning & Evaluation (IITP) Grant funded by the Korean Government","award":["2020-0-01592"],"award-info":[{"award-number":["2020-0-01592"]}]},{"DOI":"10.13039\/501100003725","name":"Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education","doi-asserted-by":"publisher","award":["2019R1F1A1058548"],"award-info":[{"award-number":["2019R1F1A1058548"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3055731","type":"journal-article","created":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T06:25:48Z","timestamp":1612247148000},"page":"22939-22954","source":"Crossref","is-referenced-by-count":6,"title":["DLFT: Data and Layout Aware Fault Tolerance Framework for Big Data Transfer Systems"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8804-8276","authenticated-orcid":false,"given":"Preethika","family":"Kasu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1030-3844","authenticated-orcid":false,"given":"Prince","family":"Hamandawana","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5992-1136","authenticated-orcid":false,"given":"Tae-Sun","family":"Chung","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2623633"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2571281"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2687923"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.72"},{"key":"ref14","author":"alliance","year":"2020","journal-title":"The Globus Toolkit"},{"key":"ref15","author":"hanushevsky","year":"0","journal-title":"Bbcp"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2011.5937236"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2619344"},{"key":"ref18","first-page":"67","article-title":"LADS: Optimizing data transfers using layout-aware data scheduling","author":"kim","year":"2015","journal-title":"Proc 1st USENIX Conf File Storage Technol"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2905158"},{"key":"ref28","article-title":"Understanding Lustre filesystem internals","author":"wang","year":"2009"},{"key":"ref4","first-page":"1","article-title":"Scalable performance of the panasas parallel file system","author":"welch","year":"2008","journal-title":"Proc 6th USENIX Conf File Storage Technol"},{"key":"ref27","year":"2020","journal-title":"Lustre"},{"key":"ref3","year":"2020","journal-title":"ORNL"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2550439"},{"key":"ref29","year":"2020","journal-title":"ATLAS"},{"key":"ref5","article-title":"LADS: Optimizing data transfers using layout-aware data scheduling","author":"kim","year":"2015"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.232562"},{"key":"ref7","year":"0","journal-title":"Lustre Wiki"},{"key":"ref2","year":"2020","journal-title":"LIGO"},{"key":"ref9","first-page":"54","article-title":"Lightweight logging and recovery for distributed shared memory over virtual interface architecture","author":"park","year":"2003","journal-title":"2nd Int Symp Parallel Distrib Comput"},{"key":"ref1","year":"2020","journal-title":"CERN"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref22","year":"0","journal-title":"Bloom filter"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2015.7404748"},{"key":"ref23","first-page":"456","volume":"4168","author":"kirsch","year":"2006","journal-title":"Less Hashing Same Performance Building a Better Bloom Filter"},{"key":"ref26","year":"2020","journal-title":"Murmurhash"},{"key":"ref25","article-title":"Optimizing Bloom filter: Challenges, solutions, and comparisons","author":"luo","year":"2018","journal-title":"arXiv 1804 04777"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09343287.pdf?arnumber=9343287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T14:50:32Z","timestamp":1643208632000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9343287\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3055731","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}