DBPF: An Efficient Dynamic Block Propagation Framework for Blockchain Networks

Scalability poses a significant challenge in blockchain networks, particularly in optimizing the propagation time of new blocks. This paper introduces an approach, termed “DBPF” - Dynamic Block Propagation Framework for Blockchain Networks, aimed at addressing this challenge. The approach focuses on optimizing neighbor selection during block propagation to mitigate redundancy and enhance network efficiency. By employing informed neighbor selection and leveraging the Brotli lossless compression algorithm to reduce block size, the objective is to optimize network bandwidth and minimize transmission time. The DBPF framework calculates the Minimum Spanning Tree (MST) to ensure efficient communication paths between nodes, while the Brotli compression algorithm reduces the block size to optimize network bandwidth. The core objective of DBPF is to streamline the propagation process by selecting optimal neighbors and eliminating unnecessary data redundancy. Through experimentation and simulation of the block propagation process using(DBPF), we demonstrate a significant reduction in the propagation time of new blocks compared to traditional methods. Comparisons against approaches such as selecting neighbors with the least Round-Trip Time RTT, random neighbor selection, and the DONS approach reveal a notable decrease in propagation time up to more than ( 45%) compared to them based on network type and number of nodes. The effectiveness of (DBPF) in boosting blockchain network efficiency and decreasing propagation time is emphasized by the experimental findings. Additionally, various compression algorithms such as zstandard and zlib were tested during the research. Nevertheless, the results suggest that Brotli produced the most positive outcomes. Through the integration of optimized neighbor selection and effective data compression, DBPF presents a hopeful resolution to the scalability issues confronting blockchain networks. These results showcase the capability of (DBPF) to notably enhance network performance, leading the path toward smoother and more efficient blockchain operations.

@article{Farouk2024,
  title     = {DBPF: An Efficient Dynamic Block Propagation Framework for Blockchain Networks},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {15},
  number    = {10},
  year      = {2024},
  publisher = {The Science and Information Organization},
  author    = {Osama Farouk and Mahmoud Bakrey and Mohamed Abdallah},
  doi       = {10.14569/IJACSA.2024.01510117},
  url       = {https://doi.org/10.14569/IJACSA.2024.01510117}
}