{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T12:40:09Z","timestamp":1731847209351,"version":"3.28.0"},"reference-count":47,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T00:00:00Z","timestamp":1711238400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS\u20102210029"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Int J Network Mgmt"],"published-print":{"date-parts":[[2024,9]]},"abstract":"Abstract<\/jats:title>Synchronization of transaction pools (mempools<\/jats:italic>) has shown potential for improving the performance and block propagation delay of state\u2010of\u2010the\u2010art blockchains. Indeed, various heuristics have been proposed in the literature to incorporate early exchanges of unconfirmed<\/jats:italic> transactions into the block propagation protocol. In this work, we take a different approach, maintaining transaction synchronization externally (and independently) of the block propagation channel. In the process, we formalize the synchronization problem within a graph theoretic framework and introduce a novel algorithm (SREP<\/jats:italic>\u2014set reconciliation\u2010enhanced propagation<\/jats:italic>) with quantifiable guarantees. We analyze the algorithm's performance for various realistic network topologies and show that it converges on static connected graphs in a time bounded by the diameter of the graph. In graphs with dynamic edges, SREP<\/jats:italic> converges in an expected time that is linear in the number of nodes. We confirm our analytical findings through extensive simulations that include comparisons with MempoolSync<\/jats:italic>, a recent approach from the literature. Our simulations show that SREP<\/jats:italic> incurs reasonable bandwidth overhead and scales gracefully with the size of the network (unlike MempoolSync<\/jats:italic>).<\/jats:p>","DOI":"10.1002\/nem.2265","type":"journal-article","created":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T04:54:45Z","timestamp":1711342485000},"update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Out\u2010of\u2010band transaction pool sync for large dynamic blockchain networks"],"prefix":"10.1002","volume":"34","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-3997-4139","authenticated-orcid":false,"given":"Novak","family":"Boskov","sequence":"first","affiliation":[{"name":"Nokia Bell Labs Murray Hill NJ USA"},{"name":"Department of Electrical and Computer Engineering Boston University Boston Massachusetts USA"}]},{"given":"Xingyu","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering Boston University Boston Massachusetts USA"}]},{"given":"Sevval","family":"Simsek","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering Boston University Boston Massachusetts USA"}]},{"given":"Ari","family":"Trachtenberg","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering Boston University Boston Massachusetts USA"}]},{"given":"David","family":"Starobinski","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering Boston University Boston Massachusetts USA"}]}],"member":"311","published-online":{"date-parts":[[2024,3,24]]},"reference":[{"key":"e_1_2_10_2_1","unstructured":"CoralloM..Compact block relay protocol:GitHub. (Accessed 2022\u201012\u201002);2016."},{"key":"e_1_2_10_3_1","unstructured":"Peter Tschipper.BUIP010 Xtreme Thinblocks. (Accessed 2022\u201012\u201002);2016."},{"key":"e_1_2_10_4_1","doi-asserted-by":"crossref","unstructured":"OzisikA.P. AndresenG. LevineB.N. TappD. BissiasG. KatkuriS..Graphene: efficient interactive set reconciliation applied to blockchain propagation. In: Proceedings of the ACM Special Interest Group on Data Communication SIGCOMM '19.Association for Computing Machinery;2019;New York NY USA:303\u2010317.https:\/\/doi.org\/10.1145\/3341302.3342082","DOI":"10.1145\/3341302.3342082"},{"key":"e_1_2_10_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-022-1685-5"},{"key":"e_1_2_10_6_1","doi-asserted-by":"crossref","unstructured":"HuZ. XiaoZ..Dino: a block transmission protocol with low bandwidth consumption and propagation latency. In: IEEE INFOCOM 2022 \u2010 IEEE Conference on Computer Communications IEEE;2022:1319\u20101328.","DOI":"10.1109\/INFOCOM48880.2022.9796837"},{"key":"e_1_2_10_7_1","first-page":"1","article-title":"Empirical comparison of block relay protocols","volume":"2022","author":"Imtiaz M.A.","year":"2022","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"e_1_2_10_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2021.3050428"},{"key":"e_1_2_10_9_1","doi-asserted-by":"crossref","unstructured":"ImtiazM.A. StarobinskiD. TrachtenbergA. YounisN..Churn in the Bitcoin network: characterization and impact. In: 2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC) IEEE;2019:431\u2010439.","DOI":"10.1109\/BLOC.2019.8751297"},{"key":"e_1_2_10_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.2974739"},{"key":"e_1_2_10_11_1","doi-asserted-by":"crossref","unstructured":"Mi\u0161i\u0107J. Mi\u0161i\u0107V.B. ChangX..On the benefits of compact blocks in bitcoin. In: ICC 2020 \u2010 2020 IEEE International Conference on Communications (ICC) IEEE;2020:1\u20106.","DOI":"10.1109\/ICC40277.2020.9149418"},{"key":"e_1_2_10_12_1","unstructured":"ZhaoC. WangT. ZhangS. LiewS.C..HCB: enabling compact block in ethereum network with secondary pool and transaction prediction.https:\/\/arxiv.org\/abs\/2212.13367;2022."},{"key":"e_1_2_10_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.2969706"},{"key":"e_1_2_10_14_1","unstructured":"MinskyY. TrachtenbergA..Practical set reconciliation. In: 40th Annual Allerton Conference on Communication Control and Computing Vol.\u00a0248 IEEE;2002.https:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.456.7200"},{"key":"e_1_2_10_15_1","doi-asserted-by":"crossref","unstructured":"MinskyY. TrachtenbergA. ZippelR..Set reconciliation with nearly optimal communication complexity. In: Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE CAT. no.01ch37252) IEEE;2001:232\u2013.https:\/\/doi.org\/10.1109\/ISIT.2001.936095","DOI":"10.1109\/ISIT.2001.936095"},{"key":"e_1_2_10_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"e_1_2_10_17_1","doi-asserted-by":"crossref","unstructured":"GoodrichM.T. MitzenmacherM..Invertible bloom lookup tables. In: 2011 49th Annual Allerton Conference on Communication Control and Computing (Allerton) IEEE;2011:792\u2010799.https:\/\/doi.org\/10.1109\/Allerton.2011.6120248","DOI":"10.1109\/Allerton.2011.6120248"},{"key":"e_1_2_10_18_1","doi-asserted-by":"crossref","unstructured":"EppsteinD. GoodrichM.T. UyedaF. VargheseG..What's the difference? Efficient set reconciliation without prior context. In: Proceedings of the ACM SIGCOMM 2011 Conference SIGCOMM '11.Association for Computing MachineryACM;2011;New York NY USA:218\u2010229.https:\/\/doi.org\/10.1145\/2018436.2018462","DOI":"10.1145\/2043164.2018462"},{"key":"e_1_2_10_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3296630"},{"key":"e_1_2_10_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3078181"},{"key":"e_1_2_10_21_1","doi-asserted-by":"crossref","unstructured":"GaoY. ShiJ. WangX. TanQ. ZhaoC. YinZ..Topology measurement and analysis on ethereum P2P network. In: 2019 IEEE Symposium on Computers and Communications (ISCC) IEEE;2019:1\u20107.","DOI":"10.1109\/ISCC47284.2019.8969695"},{"key":"e_1_2_10_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEM.2020.2989170"},{"key":"e_1_2_10_23_1","doi-asserted-by":"crossref","unstructured":"MaX. WuH. XuD. WolterK..CBlockSim: a modular high\u2010performance blockchain simulator. In: 2022 IEEE International Conference on Blockchain and Cryptocurrency (ICBC) IEEE;2022:1\u20105.","DOI":"10.1109\/ICBC54727.2022.9805504"},{"key":"e_1_2_10_24_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_2_10_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"e_1_2_10_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1959045.1959064"},{"key":"e_1_2_10_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-58820-8_6"},{"key":"e_1_2_10_28_1","first-page":"1","article-title":"Gensync: a new framework for benchmarking and optimizing reconciliation of data","volume":"2022","author":"Bokov N.","year":"2022","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"e_1_2_10_29_1","doi-asserted-by":"crossref","unstructured":"KifferL. SalmanA. LevinD. MisloveA. Nita\u2010RotaruC..Under the hood of the ethereum gossip protocol. In: Financial Cryptography and Data security: 25th International Conference fc 2021 Virtual Event March 1\u20105 2021 Revised Selected papers Part ii.Springer\u2010VerlagSpringer Berlin Heidelberg;2021;Berlin Heidelberg:437\u2010456.https:\/\/doi.org\/10.1007\/978-3-662-64331-0_23","DOI":"10.1007\/978-3-662-64331-0_23"},{"key":"e_1_2_10_30_1","unstructured":"Bitcoin developers.Bitcoin referential implementation:GitHub. (Accessed 2022\u201012\u201002);2022."},{"key":"e_1_2_10_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_32"},{"key":"e_1_2_10_32_1","doi-asserted-by":"crossref","unstructured":"GrundmannM. BaumstarkM. HartensteinH..On the peer degree distribution of the bitcoin P2P network. In: 2022 IEEE International Conference on Blockchain and Cryptocurrency (ICBC) IEEE;2022:1\u20105.","DOI":"10.1109\/ICBC54727.2022.9805511"},{"key":"e_1_2_10_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_5"},{"key":"e_1_2_10_34_1","doi-asserted-by":"publisher","DOI":"10.1006\/aama.2001.0720"},{"volume-title":"Stochastic Processes","year":"1995","author":"Ross S.M.","key":"e_1_2_10_35_1"},{"volume-title":"The NIST Handbook of Mathematical Functions","year":"2010","author":"Olver F.","key":"e_1_2_10_36_1"},{"key":"e_1_2_10_37_1","unstructured":"BokovN..SREPSim. (Accessed 2023\u201002\u201002)."},{"key":"e_1_2_10_38_1","doi-asserted-by":"crossref","unstructured":"BannoR. ShudoK..Simulating a blockchain network with SimBlock. In: 2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC) IEEE;2019:3\u20104.","DOI":"10.1109\/BLOC.2019.8751431"},{"key":"e_1_2_10_39_1","doi-asserted-by":"crossref","unstructured":"ImtiazM.A. StarobinskiD. TrachtenbergA..Characterizing orphan transactions in the bitcoin network. In: 2020 IEEE International Conference on Blockchain and Cryptocurrency (ICBC) IEEE;2020:1\u20109.","DOI":"10.1109\/ICBC48266.2020.9169449"},{"key":"e_1_2_10_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2021.3056949"},{"key":"e_1_2_10_41_1","unstructured":"Bitcoin developers.Ancestor score sorting:GitHub. (Accessed 2022\u201012\u201002);2022."},{"key":"e_1_2_10_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0316-0"},{"key":"e_1_2_10_43_1","doi-asserted-by":"crossref","unstructured":"BoralA. MitzenmacherM..Multi\u2010party set reconciliation using characteristic polynomials. In: 2014 52nd Annual Allerton Conference on Communication Control and Computing (ALLERTON) IEEE;2014:1182\u20101187.","DOI":"10.1109\/ALLERTON.2014.7028589"},{"key":"e_1_2_10_44_1","doi-asserted-by":"crossref","unstructured":"JinJ. SiW. StarobinskiD. TrachtenbergA..Prioritized data synchronization for disruption tolerant networks. In: Milcom 2012 \u2010 2012 IEEE Military Communications Conference IEEE;2012:1\u20108.https:\/\/doi.org\/10.1109\/MILCOM.2012.6415678","DOI":"10.1109\/MILCOM.2012.6415678"},{"key":"e_1_2_10_45_1","doi-asserted-by":"crossref","unstructured":"DongZ. ZhengE. ChoonY. ZomayaA.Y..Dagbench: a performance evaluation framework for DAG distributed ledgers. In: 2019 IEEE 12th International Conference on Cloud Computing (Cloud) IEEE;2019:264\u2010271.","DOI":"10.1109\/CLOUD.2019.00053"},{"key":"e_1_2_10_46_1","doi-asserted-by":"crossref","unstructured":"KimS.K. MaZ. MuraliS. MasonJ. MillerA. BaileyM..Measuring ethereum network peers. In: Proceedings of the Internet Measurement Conference 2018 IMC '18.Association for Computing Machinery;2018;New York NY USA:91\u2010104.https:\/\/doi.org\/10.1145\/3278532.3278542","DOI":"10.1145\/3278532.3278542"},{"key":"e_1_2_10_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.031611.00024"},{"key":"e_1_2_10_48_1","doi-asserted-by":"crossref","unstructured":"FanB. AndersenD.G. KaminskyM. MitzenmacherM.D..Cuckoo filter: practically better than bloom. In: Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies CoNEXT '14.Association for Computing Machinery;2014;New York NY USA:75\u201083.https:\/\/doi.org\/10.1145\/2674005.2674994","DOI":"10.1145\/2674005.2674994"}],"container-title":["International Journal of Network Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nem.2265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T12:02:49Z","timestamp":1731844969000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/nem.2265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,24]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["10.1002\/nem.2265"],"URL":"https:\/\/doi.org\/10.1002\/nem.2265","archive":["Portico"],"relation":{},"ISSN":["1055-7148","1099-1190"],"issn-type":[{"type":"print","value":"1055-7148"},{"type":"electronic","value":"1099-1190"}],"subject":[],"published":{"date-parts":[[2024,3,24]]},"assertion":[{"value":"2023-08-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}