Timely Sharing with Reputation Prototype example code



The software in this data set is the example implementation of the Timely Sharing with Reputation Prototype referenced in the paper "Reputation-Based Data Carrying for Web3 Networks" by Q.A. Stokkink, C.U. Ileri, and J.A. Pouwelse. The parameters of this script are described in the corresponding paper.

The example setup of this script includes a setup of 128 nodes that share randomly-generated strings, 20 bytes in length. Using this setup, the script runs experiments 100 times and then prints the average number of replicas of each randomly-generated string. The average replicas should be roughly equal to 2 (this is probabilistic and may be slightly higher or lower).
Date made available18 Apr 2023
PublisherTU Delft - 4TU.ResearchData
Date of data production2023 -
  • Reputation-Based Data Carrying for Web3 Networks

    Stokkink, Q., Ileri, C. U. & Pouwelse, J., 2022, Proceedings of the 47th IEEE Conference on Local Computer Networks, LCN 2022. Oteafy, S., Bulut, E. & Tschorsch, F. (eds.). Piscataway: IEEE, p. 283-286 4 p. 9843374. (Proceedings - Conference on Local Computer Networks, LCN).

    Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

    Open Access
    27 Downloads (Pure)

Cite this