A Theoretical Model for Block Propagation Analysis in Bitcoin Network

Shahsavari, Yahya; Zhang, Kaiwen; Talhi, Chamseddine

doi:10.1109/tem.2020.2989170

Cited by 44 publications

(28 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This model can be suitable for modeling the blockchain networks with no hubs or relay networks. As well it can be a suitable for modeling large scale public blockchains such as Bitcoin when the relay networks are not taken into account and instead, the average values of the network (e.g., average number of connections per node) are considered (Shahsavari et al, 2020). The ER model does not exhibit a power-law degree distribution or preferential attachment.…”

Section: Erdös-rény Modelmentioning

confidence: 99%

“…The output result contains GCC, LCC, and the average shortest path length (ASPL) in each network as presented in Table 1. In order to compare our results with the experimental data mined from the Bitcoin network, we use the concept of dissemination waves (Shahsavari et al, 2020). Block propagation is modeled using a set of subsequent waves, each of which covers one hop in the Bitcoin P2P network.…”

Section: Model Validationmentioning

confidence: 99%

See 1 more Smart Citation

Toward Quantifying Decentralization of Blockchain Networks With Relay Nodes

2022

Self Cite

View full text Add to dashboard Cite

In this paper, we present a methodology for quantifying the decentralization degree of a blockchain network. To accomplish this, we use two well-known graph models of Erdös-Rény and Barabási–Albert in order to study the blockchain network topology. We then quantify the decentralization degree using the clustering coefficient of our network models. We validate our approach through extensive simulations and analyze the decentralization degree with respect to network parameters such as the number of connections per node and the peer selection algorithm. Our results expose the trade-off between the average shortest path and the decentralization degree. Furthermore, we observe the impact of the average shortest path on the network speed and traffic overhead. Finally, we demonstrate that the presence of hub-like nodes such as relay gateways negatively impacts the decentralization degree of blockchain networks.

show abstract

Section: Erdös-rény Modelmentioning

confidence: 99%

Section: Model Validationmentioning

confidence: 99%

Toward Quantifying Decentralization of Blockchain Networks With Relay Nodes

2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…Bitcoin's block propagation has been measured by Decker and Wattenhofer [31] and later by Croman et al [32] who proposed guidelines on block size and interval to ensure adequate throughput for 90% of nodes. Shahsavari et al [33] propose a random graph model for modelling performance of block propagation. Dotan et al's [34] recent survey article covers block propagation (section 3) and mapping of blockchain networks (section 8).…”

Section: Block Propagationmentioning

confidence: 99%

Mind Your Outcomes: The ∆Q approach to Quality-Centric Systems Development and Its Application to a Blockchain Case-Study

HAERI¹,

Thompson²,

Davies³

et al. 2022

Preprint

View full text Add to dashboard Cite

This paper directly addresses a long-standing issue that affects the development of many1 complex distributed software systems: how to establish quickly, cheaply, and reliably whether2 they can deliver their intended performance before expending significant time, effort and money on3 detailed design and implementation. We describe ∆QSD, a novel metrics-based and quality-centric4 paradigm that uses formalised outcome diagrams to explore the performance consequences of design5 decisions, as a performance blueprint of the system. The distinctive feature of outcome diagrams is6 that they capture the essential observational properties of the system, independent of the details of7 system structure and behaviour. The ∆QSD paradigm derives bounds on performance expressed as8 probability distributions encompassing all possible executions of the system. The ∆QSD paradigm9 is both effective and generic: it allows values from various sources to be combined in a rigorous10 way, so that approximate results can be obtained quickly and subsequently refined. ∆QSD has been11 successfully used by Predictable Network Solutions for consultancy on large-scale applications in a12 number of industries, including telecommunications, avionics, and space and defence, resulting in13 cumulative savings worth billions of US dollars. The paper outlines the ∆QSD paradigm, describes14 its formal underpinnings, and illustrates its use via a topical real-world example taken from the15 blockchain/cryptocurrency domain. ∆QSD has enabled challenging throughput targets to be met for16 a globally distributed blockchain operating on the public internet.

show abstract

“…e block transmission delay, block verification delay, and node information exchange delay are included in the block propagation delay [38]. e block propagation delay is not only related to the reputation of incoming link and outgoing link but also affected by parameter c. erefore, this experiment synthesizes three factors to analyze the influence of incoming link reputation, outgoing link reputation, and parameter c on block propagation delay.…”

Section: Block Propagation Delaymentioning

confidence: 99%

A Blockchain-Based Microgrid Data Disaster Backup Scheme in Edge Computing

Zhang

Cao

Zhang

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

In view of the problems of low security, poor reliability, inability to backup automatically, and overreliance on the third party in traditional microgrid data disaster backup schemes based on cloud backup, the edge computing is used to preprocess power big data, and a microgrid data disaster backup scheme based on blockchain in edge computing environment is proposed in this paper. First, the honey encryption (HE) technology and advanced encryption standard (AES) are combined to propose a new encryption algorithm HE-AES, which is used to encrypt the preprocessed data. Second, the Kademlia algorithm is embedded in the edge server to realize the distributed storage and automatic recovery of microgrid data. Finally, the traditional proof of authority (PoA) consensus mechanism is improved partially, and the improved PoA is used to make each node reach consensus and pack blocks on the chain. The scheme can not only realize the data disaster backup automatically but also has high efficiency of data processing, which can provide a new idea for improving the current data disaster backup schemes.

show abstract

A Theoretical Model for Block Propagation Analysis in Bitcoin Network

Cited by 44 publications

References 28 publications

Toward Quantifying Decentralization of Blockchain Networks With Relay Nodes

Toward Quantifying Decentralization of Blockchain Networks With Relay Nodes

Mind Your Outcomes: The ∆Q approach to Quality-Centric Systems Development and Its Application to a Blockchain Case-Study

A Blockchain-Based Microgrid Data Disaster Backup Scheme in Edge Computing

Contact Info

Product

Resources

About