|
|
|
|
| LEADER |
01431 am a22001933u 4500 |
| 001 |
112142 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Kushch, Sergii
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Media Laboratory
|e contributor
|
| 100 |
1 |
0 |
|a Prieto Castrillo, Francisco
|e contributor
|
| 700 |
1 |
0 |
|a Corchado, Juan Manuel
|e author
|
| 700 |
1 |
0 |
|a Prieto Castrillo, Francisco
|e author
|
| 245 |
0 |
0 |
|a Distributed Sequential Consensus in Networks: Analysis of Partially Connected Blockchains with Uncertainty
|
| 260 |
|
|
|b Hindawi Publishing Corporation,
|c 2017-11-08T16:23:06Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/112142
|
| 520 |
|
|
|a 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.
|
| 546 |
|
|
|a en
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Complexity
|
