Distributed Sequential Consensus in Networks: Analysis of Partially Connected Blockchains with Uncertainty
Author(s)
Kushch, Sergii; Corchado, Juan Manuel; Prieto Castrillo, Francisco
DownloadCOMPLEXITY.2017.4832740.pdf (1.071Mb)
PUBLISHER_CC
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2017-11Department
Massachusetts Institute of Technology. Media LaboratoryJournal
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
ISSN
1076-2787
1099-0526