{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T00:39:45Z","timestamp":1776731985564,"version":"3.51.2"},"reference-count":41,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,5,20]]},"DOI":"10.1109\/infocom52122.2024.10621404","type":"proceedings-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T17:25:41Z","timestamp":1723483541000},"page":"1920-1929","source":"Crossref","is-referenced-by-count":8,"title":["IPFS in the Fast Lane: Accelerating Record Storage with Optimistic Provide"],"prefix":"10.1109","author":[{"given":"Dennis","family":"Trautwein","sequence":"first","affiliation":[{"name":"University of Göttingen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiluo","family":"Wei","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science & Technology (GZ)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiannis","family":"Psaras","sequence":"additional","affiliation":[{"name":"Protocol Labs Inc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"Schubotz","sequence":"additional","affiliation":[{"name":"FIZ Karlsruhe – Leibniz Institute for Information Infrastructure"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignacio","family":"Castro","sequence":"additional","affiliation":[{"name":"Queen Mary University of London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bela","family":"Gipp","sequence":"additional","affiliation":[{"name":"University of Göttingen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gareth","family":"Tyson","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science & Technology (GZ)"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3503158"},{"key":"ref2","article-title":"The global internet report: Consolidation in the internet economy","author":"Bommelaer de Leusse","year":"2019","journal-title":"Internet Society"},{"key":"ref3","article-title":"Ethereum Name System","year":"2023"},{"key":"ref4","article-title":"Unstoppable Domains","year":"2023"},{"key":"ref5","first-page":"739","volume-title":"Design and evaluation of ipfs: A storage layer for the decentralized web","author":"Trautwein","year":"2022"},{"key":"ref6","article-title":"IPFS-content addressed, versioned, P2P file system","author":"Benet","year":"2014"},{"key":"ref7","article-title":"Mastodon","year":"2023"},{"key":"ref8","article-title":"Bluesky","year":"2023"},{"key":"ref9","article-title":"IPFS KPIs","year":"2023"},{"key":"ref10","article-title":"Ipfs ecosystem directory","year":"2022"},{"key":"ref11","article-title":"How to host dynamic content on ipfs","year":"2023"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3326285.3329052"},{"key":"ref14","article-title":"Filecoin: A Decentralized Storage Network","year":"2017"},{"key":"ref15","article-title":"Measure performance with the RAIL model","year":"2023"},{"key":"ref16","article-title":"Rfm 17 \u2014 provider record liveness","author":"Cortes-Goicoechea","year":"2022"},{"key":"ref17","article-title":"A new method for estimating p2p network size","year":"2020"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-98144-4","volume-title":"Computational Statistics.","author":"Gentle","year":"2009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3355369.3355572"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3485983.3494838"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.osnem.2018.07.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383071"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.818784"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45518-3_18"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851198"},{"key":"ref28","first-page":"68","article-title":"Incentives build robustness in bittorrent","volume-title":"Workshop on Economics of Peer-to-Peer systems","volume":"6","author":"Cohen"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ccnc.2011.5766541"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44702-4_4"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2012.6335804"},{"key":"ref32","article-title":"An analysis of bittorrent\u2019s two kademlia-based dhts","author":"Crosby","year":"2007"},{"key":"ref33","article-title":"Crawling BitTorrent DHTs for fun and profit","volume-title":"4th USENIX Workshop on Offensive Technologies (WOOT 10)","author":"Wolchok"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.329"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/icnp.2006.320218"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2009.44"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30045-5_23"},{"key":"ref38","article-title":"Network size estimation in a peer-to-peer network","author":"Mane","year":"2005"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.2006.1652131"},{"key":"ref40","first-page":"123","volume-title":"Peer counting and sampling in overlay networks: Random walk methods","author":"Massouli\u00e9","year":"2006"},{"key":"ref41","article-title":"Practical algorithms for size estimation in large and dynamic groups","author":"Psaltoulis","year":"2004"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2004.1281573"}],"event":{"name":"IEEE INFOCOM 2024 - IEEE Conference on Computer Communications","location":"Vancouver, BC, Canada","start":{"date-parts":[[2024,5,20]]},"end":{"date-parts":[[2024,5,23]]}},"container-title":["IEEE INFOCOM 2024 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10621050\/10621073\/10621404.pdf?arnumber=10621404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T05:29:27Z","timestamp":1723526967000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10621404\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,20]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/infocom52122.2024.10621404","relation":{},"subject":[],"published":{"date-parts":[[2024,5,20]]}}}