Toronto Metropolitan University
Gholamrezazadeh Motlagh, Saeideh.pdf (6.37 MB)

Analysis of Data Propagation in Blockchain Network

Download (6.37 MB)
posted on 2023-08-28, 16:22 authored by Saeideh Gholamrezazadeh Motlagh

Bitcoin is the first cryptocurrency based on blockchain technology emerged in 2008 to provide a peer-to-peer (P2P) electronic cash system without a financial third party. Much research has been done to analyze different aspects of blockchain-based networks and improve their performance. This dissertation presents an innovative approach to evaluating the churning process (the dynamic participation of nodes in the P2P network) in the Bitcoin network. We propose an analytical model based on the Continuous Time Markov Chain (CTMC) and queuing model to evaluate node churn impact on Bitcoin network performance and calculate the synchronization time needed for nodes when rejoining the net- work.

This dissertation also proposes an analytical model for the Bitcoin network’s churning process with relay nodes that is the first to the best of our knowledge. Relay nodes only distribute blocks in the network and have a higher number of connections. We introduce two different CTMCs for ordinary and relay nodes to model each type of node’s behavior separately. We analyze the transaction and block propagation in the network and calculate synchronization time. We show that the churn of relay nodes has a higher impact on traffic performance than ordinary nodes.

Moreover, we introduce an analytical model to evaluate the impact of node churn in the Bitcoin network when compact block protocol is in use. Compact block protocol aims to reduce bandwidth usage and probably latency by propagating a smaller version of blocks in the network. We model the node’s behavior with CTMC and calculate synchronization time including transaction deficit recovery.

Finally, we propose an analytical model to evaluate the impact of selfish behavior on Bitcoin network performance. We evaluate the Bitcoin network’s performance metrics, including network connectivity, block arrival rate, delivery time, and block response time in the presence of selfish miners. We also calculate the probability of intentional forking caused by selfish behavior compared to unintentional forking caused by network delay and show that intentional forking probability is higher than unintentional forking, which may result in ledger inconsistency. 





  • Doctor of Philosophy


  • Computer Science

Granting Institution

Ryerson University

LAC Thesis Type

  • Dissertation

Thesis Advisor

Dr. Jelena Misic



Usage metrics

    Computer Science (Theses)


    Ref. manager