Accelerating Message Propagation in Blockchain Networks

Author(s):  
Carlos Santiago ◽  
Choonhwa Lee
Keyword(s):  
2018 ◽  
Vol 18 (01) ◽  
pp. 1850001
Author(s):  
NAOKI TAKEUCHI ◽  
SATOSHI FUJITA

Scale-free networks have several favorable properties as the topology of interconnection networks such as the short diameter and the quick message propagation. In this paper, we propose a method to construct scale-free networks in a semi-deterministic manner. The proposed algorithm extends the Bulut's algorithm for constructing scale-free networks with designated minimum degree k and maximum degree m, in such a way that: (1) it determines the ideal number of edges derived from the ideal degree distribution; and (2) after connecting each new node to k existing nodes as in the Bulut’s algorithm, it adjusts the number of edges to the ideal value by conducting add/removal of edges. We prove that such an adjustment is always possible if the number of nodes in the network exceeds [Formula: see text]. The performance of the algorithm is experimentally evaluated.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Junjie Huang ◽  
Liang Tan ◽  
Sun Mao ◽  
Keping Yu

Blockchain is a mainstream technology in which many untrustworthy nodes work together to maintain a distributed ledger with advantages such as decentralization, traceability, and tamper-proof. The network layer communication mechanism in its architecture is the core of the networking method, message propagation, and data verification among blockchain nodes, which is the basis to ensure blockchain’s performance and key features. When blocks are propagated in peer-to-peer (P2P) networks with gossip protocol, the high propagation delay of the protocol itself reduces the propagation speed of the blocks, which is prone to the chain forking phenomenon and causes double payment attacks. To accelerate the propagation speed and reduce the fork probability, this paper proposes a blockchain network propagation mechanism based on proactive network provider participation for P2P (P4P) architecture. This mechanism first obtains the information of network topology and link status in a region based on the internet service provider (ISP), then it calculates the shortest path and link overhead of peer nodes using P4P technology, prioritizes the nodes with good local bandwidth conditions for transmission, realizes the optimization of node connections, improves the quality of service (QoS) and quality of experience (QoE) of blockchain networks, and enables blockchain nodes to exchange blocks and transactions through the secure propagation path. Simulation experiments show that the proposed propagation mechanism outperforms the original propagation mechanism of the blockchain network in terms of system overhead, rate of data success transmission, routing hops, and propagation delay.


Author(s):  
Ming Zhu ◽  
Jiannong Cao ◽  
Deming Pang ◽  
Zongjian He ◽  
Ming Xu
Keyword(s):  

2016 ◽  
Vol 25 (6) ◽  
pp. 993-1005 ◽  
Author(s):  
Ram Gopal ◽  
Hooman Hidaji ◽  
Raymond A. Patterson ◽  
Erik Rolland ◽  
Dmitry Zhdanov

2011 ◽  
Vol 5 (1) ◽  
pp. 51-58
Author(s):  
Zhongtian Jia ◽  
Shudong Li ◽  
Haipeng Peng ◽  
Yixian Yang ◽  
Shize Guo

Sign in / Sign up

Export Citation Format

Share Document