• Corpus ID: 233296584

Monitoring Data Requests in Decentralized Data Storage Systems: A Case Study of IPFS

  title={Monitoring Data Requests in Decentralized Data Storage Systems: A Case Study of IPFS},
  author={Leonhard Balduf and Sebastian A. Henningsen and Martin Florian and Sebastian Rust and Bj{\"o}rn Scheuermann},
—Decentralized data storage systems like the Inter- planetary Filesystem (IPFS) are becoming increasingly popular, e.g., as a data layer in blockchain applications and for sharing content in a censorship-resistant manner. In IPFS, data is hosted by an open set of nodes and data requests are broadcast to connected peers in addition to being routed via a distributed hash table (DHT). In this paper, we present a passive monitoring methodology that exploits this design for obtaining data requests… 

Figures and Tables from this paper

IPFS and Friends: A Qualitative Comparison of Next Generation Peer-to-Peer Data Networks
A technical overview of the next generation data networks is provided and a deeper outline of the Interplanetary File System and a general overview of Swarm, the Hypercore Protocol, SAFE, Storj, and Arweave are provided.
Crawling the MobileCoin Quorum System
It is found that the MobileCoin quorum system currently comprises of 7 organisations controlling a total of 10 validator nodes, and current quorum set configurations prioritise safety over liveness.
Passively Measuring IPFS Churn and Network Size
This paper provides a passive measurement study of the IPFS network, investigating peer dynamics and curiosities of the network, and estimates the network size and results of previous active measurement studies.


Mapping the Interplanetary Filesystem
The structure of the resulting overlay network is studied, as it significantly influences the robustness and performance of IPFS and leaves room for improvement in terms of performance and query privacy.
Crawling the IPFS Network
This demo presents a crawler for the IPFS overlay network (ipfs_crawler) that can be used to study and monitor the network’s structure and is an important building block when assessing the state and health of the network.
Understanding I/O Performance of IPFS Storage: A Client's Perspective
This work deploys an IPFS storage system with geographically-distributed storage nodes on Amazon EC2, and conducts extensive experiments to evaluate the performance of data I/O operations from a client's perspective, finding that both resolving and downloading operations can become bottlenecks.
Total Eclipse of the Heart - Disrupting the InterPlanetary File System
This paper identifies a conceptual issue in one of IPFS’s core libraries and demonstrates its exploitation by means of a successful end-to-end attack, and shows that this attack scales well even beyond current network sizes and can disrupt the entire public IPFS network with alarmingly low effort.
Measuring Ethereum Network Peers
Ethereum, the second-largest cryptocurrency valued at a peak of $138 billion in 2018, is a decentralized, Turing-complete computing platform. Although the stability and security of Ethereum---and
A global view of kad
There is a large number of peers, in particular in China, that change their <scp>KAD</ scp> ID, sometimes as frequently as after each session, which makes it difficult to characterize end-user availability or membership turnover.
Long Term Study of Peer Behavior in the kad DHT
This work has been crawling a representative subset of KAD every five minutes for six months and obtained information about geographical distribution of peers, session times, daily usage, and peer lifetime, and found that session times are Weibull distributed.
Measurement study of peer-to-peer file sharing systems
This measurement study seeks to precisely characterize the population of end-user hosts that participate in Napster and Gnutella, and shows that there is significant heterogeneity and lack of cooperation across peers participating in these systems.
Topology Measurement and Analysis on Ethereum P2P Network
A measurement of Ethereum P2P network shows that the graphs of Ethereum network have a small average shortest path length and a large clustering coefficient, and the degree distribution of nodes does not follow a pure power-law distribution, indicating that Ethereum network is very close to a small world network.
Measuring large-scale distributed systems: case of BitTorrent Mainline DHT
This paper presents an efficient methodology for estimating the number of active users in the BitTorrent Mainline DHT based on modeling crawling inaccuracies as a Bernoulli process, which guarantees a very accurate estimation and is able to provide the estimate in about 5 seconds.