TY - GEN
T1 - Boost blockchain broadcast propagation with tree routing
AU - Kan, Jia
AU - Zou, Lingyi
AU - Liu, Bella
AU - Huang, Xin
N1 - Publisher Copyright:
© 2018, Springer Nature Switzerland AG.
PY - 2018
Y1 - 2018
N2 - In recent years, with the rapid development and popularization of BitCoin, the research of blockchain technology has also shown growth. It has gradually become a new generation of distributed, non-centralized and trust-based technology solution. However, the blockchain operation is expensive and transaction is delayed. Take BitCoin as an example. On the one hand, a block is produced every ten minute. On the other hand, once the new block is generated, it takes a certain time to propagate world wide. The slow speed of propagation determines that BitCoin can not use too small block interval time. Ethereum also faces similar problems, so the concept of uncle block was introduced to reduce blockchain forks. This paper introduces a new tree structure based broadcast propagation routing model, providing a novel method to organize network nodes and message propagation mechanism. In oder to avoid the single node failure problem, the tree cluster routing is proposed. The research shows that the tree based routing can accelerate broadcast convergence time and reduce redundant traffic.
AB - In recent years, with the rapid development and popularization of BitCoin, the research of blockchain technology has also shown growth. It has gradually become a new generation of distributed, non-centralized and trust-based technology solution. However, the blockchain operation is expensive and transaction is delayed. Take BitCoin as an example. On the one hand, a block is produced every ten minute. On the other hand, once the new block is generated, it takes a certain time to propagate world wide. The slow speed of propagation determines that BitCoin can not use too small block interval time. Ethereum also faces similar problems, so the concept of uncle block was introduced to reduce blockchain forks. This paper introduces a new tree structure based broadcast propagation routing model, providing a novel method to organize network nodes and message propagation mechanism. In oder to avoid the single node failure problem, the tree cluster routing is proposed. The research shows that the tree based routing can accelerate broadcast convergence time and reduce redundant traffic.
KW - Blockchain
KW - Broadcast network
KW - Gossip protocol
KW - Tree based routing
KW - Tree cluster routing
UR - http://www.scopus.com/inward/record.url?scp=85058674230&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-05764-0_8
DO - 10.1007/978-3-030-05764-0_8
M3 - Conference Proceeding
AN - SCOPUS:85058674230
SN - 9783030057633
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 77
EP - 85
BT - Smart Blockchain - 1st International Conference, SmartBlock 2018, Proceedings
A2 - Qiu, Meikang
PB - Springer Verlag
T2 - 1st International Conference on Smart Blockchain, SmartBlock 2018
Y2 - 10 December 2018 through 12 December 2018
ER -