Distributed Sequential Consensus in Networks: Analysis of Partially Connected Blockchains with Uncertainty
Name
COMPLEXITY.2017.4832740.pdf
Size
1.07 MB
Format
Adobe PDF
Checksum (MD5)
b0d3694b8304be0f2230443621dace11
Download all files submitted through automated deposit
Author(s)
Kushch, Sergii
Corchado, Juan Manuel
Prieto Castrillo, Francisco
Date Issued
November 2017
Journal
Complexity
Publisher
Hindawi Publishing Corporation
Citation
Prieto-Castrillo, Francisco et al. "Distributed Sequential Consensus in Networks: Analysis of Partially Connected Blockchains with Uncertainty." Complexity 2017 (November 2017): 4832740 © 2017 Francisco Prieto-Castrillo et al
Version
Final published version
Abstract
This work presents a theoretical and numerical analysis of the conditions under which distributed sequential consensus is possible when the state of a portion of nodes in a network is perturbed. Specifically, it examines the consensus level of partially connected blockchains under failure/attack events. To this end, we developed stochastic models for both verification probability once an error is detected and network breakdown when consensus is not possible. Through a mean field approximation for network degree we derive analytical solutions for the average network consensus in the large graph size thermodynamic limit. The resulting expressions allow us to derive connectivity thresholds above which networks can tolerate an attack.
MIT Department
Massachusetts Institute of Technology. Media Laboratory
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1155/2017/4832740
