Reputation-Based Data Carrying for Web3 Networks

Reputation-Based Data Carrying for Web3 Networks

Stokkink, Q.A. (TU Delft Data-Intensive Systems)
Ileri, Can Umut (TU Delft Data-Intensive Systems)
Pouwelse, J.A. (TU Delft Data-Intensive Systems)

Oteafy, Sharief (editor)
Bulut, Eyuphan (editor)
Tschorsch, Florian (editor)

2022

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

infrastructure
integrity
reputation
Web3
peerto-peer
partitioning
split

http://resolver.tudelft.nl/uuid:4925e770-4623-425b-b647-1a0689fdcbca

https://doi.org/10.1109/LCN53696.2022.9843374

IEEE, Piscataway

2023-07-01

978-1-6654-8002-4

Proceedings of the 47th IEEE Conference on Local Computer Networks, LCN 2022

2022 IEEE 47th Conference on Local Computer Networks (LCN), 2022-09-26 → 2022-09-29, Hybrid hosted in Edmonton, Canada

Proceedings - Conference on Local Computer Networks, LCN

Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.

Institutional Repository

conference paper

© 2022 Q.A. Stokkink, Can Umut Ileri, J.A. Pouwelse