Reputation-Based Data Carrying for Web3 Networks

Conference paper (2022)

Authors

Q.A. Stokkink Data-Intensive Systems - EEMCS
Can Umut Ileri Data-Intensive Systems - EEMCS
J.A. Pouwelse Data-Intensive Systems - EEMCS
Research Group
Data-Intensive Systems (EEMCS) (TU Delft)
Copyright: © 2022 Q.A. Stokkink, Can Umut Ileri, J.A. Pouwelse
DOI: https://doi.org/10.1109/LCN53696.2022.9843374
Infrastructure Partitioning Reputation Web3 Integrity Peerto-peer Split
More Info
expand_more

Published Date

2022

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Data-Intensive Systems

Abstract

Web3 networks are emerging to replace centrally-governed networking infrastructure. The integrity of the shared public infrastructure of Web3 networks is guaranteed through data sharing between nodes. However, due to the unstructured and highly partitioned nature of Web3 networks, data sharing between nodes in different partitions is a challenging task. In this paper we present the TSRP mechanism, which approaches the data sharing problem through nodes auditing each other to enforce carrying of data between partitions. Reputation is used as an analogue for the likelihood of nodes interacting with nodes from other partitions in the future. The number of copies of data shared with other nodes is inversely related to the nodes’ reputation. We use a real-world trace of Twitter to show how our implementation can converge to an equal number of copies as structured approaches