Abstract
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.
Supported by Brahma OS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Demers, A., et al.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 1–12. ACM, December 1987
Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)
Kan, J., Chen, S., Huang, X.: Improve blockchain performance using graph data structure and parallel mining (2018)
Bi, W., Yang, H., Zheng, M.: An accelerated method for message propagation in blockchain networks (2018). arXiv preprint arXiv:1809.00455
Delgado-Segura, S., Pérez-Solà , C., Herrera-JoancomartÃ, J., Navarro-Arribas, G., Borrell, J.: Cryptocurrency networks: a new P2P paradigm. Mob. Inf. Syst. (2018)
Xie, H., Wang, J.: Study on block chain technology and its applications. Netinfo Secur. 9, 192–195 (2016)
Watson, T.J., Golumbic, M.C.: The general gossip problem (1974)
Swan, M.: Blockchain: Blueprint for a New Economy. O’Reilly Media Inc., Newton (2015)
Decker, C., Wattenhofer, R.: Information propagation in the bitcoin network. In: 2013 IEEE Thirteenth International Conference on Peer-to-Peer Computing (P2P), pp. 1–10. IEEE, September 2013
Lind, P.G., et al.: Spreading gossip in social networks. Phys. Rev. E 76, 036117 (2007)
Rosnow, R.L.: Rumor and gossip in interpersonal interaction and beyond: a social exchange perspective. In: Kowalski, R.M. (ed.) Behaving Badly: Aversive Behaviours in Interpersonal Relationships, pp. 203–232. American Psychological Association (2001)
Baumeister, R.F., et al.: Gossip as cultural learning. Rev. Gen. Psychol. 8, 111–121 (2004)
Athreya, K.B., Ney, P.E., Ney, P.E.: Branching processes. Courier Corporation (2004)
Gu, X.L.: Research progress and development prospect of block chaining technology. Inf. Comput. 106–107+112 (2018)
Pourebrahimi, B., Vassiliadis, S., Bertels, K.: A survey of peer-to-peer networks. In: Proceedings of Annual Workshop on Circuits Systems & Signal Processing, vol. 94, no. 8–10, pp. 263–270 (2005)
Acknowledgment
The authors thank Brahma OS and the team advisors’ help on information collection and idea pitching.
This work was supported in part by the National Natural Science Foundation of China under Grant No. 61701418, in part by Innovation Projects of The NextGeneration Internet Technology under Grant NGII20170301.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Kan, J., Zou, L., Liu, B., Huang, X. (2018). Boost Blockchain Broadcast Propagation with Tree Routing. In: Qiu, M. (eds) Smart Blockchain. SmartBlock 2018. Lecture Notes in Computer Science(), vol 11373. Springer, Cham. https://doi.org/10.1007/978-3-030-05764-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-05764-0_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05763-3
Online ISBN: 978-3-030-05764-0
eBook Packages: Computer ScienceComputer Science (R0)