Fig 5 - available via license: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International
Content may be subject to copyright.
The average and the uncertainty of the percentage of the network nodes seen at the end of a gathering with an increase of the threshold for the average number of newly discovered nodes in a draw.
Source publication
A new node joining a blockchain network first synchronizes with the network to verify ledger state by downloading the entire ledger history. We present Aurora, a probabilistic algorithm that \textit{identifies honest nodes} for transient or persistent communication in the presence of malicious nodes in a blockchain network, or ceases operation if i...
Contexts in source publication
Context 1
... before an average is calculated). If the average number of newly discovered nodes in a draw falls below a threshold, the node halts. The threshold varies from 1 to 500, and for each threshold, a total of 1000 experiments is performed, based on which the average and standard deviation of the percentage of the network discovered is calculated. Fig. 5 shows the average of the percentage of the network discovered with an increase of the threshold for the average number of newly discovered nodes. The shaded region around the average represents uncertainty and is bounded by one standard deviation. The experiment confirms the expected behavior, i.e., larger thresholds are not reliable ...
Context 2
... the average represents uncertainty and is bounded by one standard deviation. The experiment confirms the expected behavior, i.e., larger thresholds are not reliable in terms of percentage of network discovered, while smaller thresholds provide a more consistent result, regardless of the number of nodes known by the first contact node. Since Fig. 5 shows that when introducing a minimal threshold on the average number of newly discovered nodes in a draw results with a high percentage of the network nodes discovered, we continue by examining a setup when the threshold is set to 15 (i.e., the node running the algorithm must discover on average at least 15 new nodes after each draw). ...
