A Geography-Based P2P Overlay Network for Fast and Robust Blockchain Systems
Haoran Qiu, Tao Ji, Shixiong Zhao, Xusheng Chen, Ji Qi, Heming Cui, Sen Wang
Abstract
Numerous blockchain systems with various consensus protocols have emerged to achieve high transaction rates (2<inline-formula><tex-math notation="LaTeX">$\sim$</tex-math></inline-formula>10K tps). However, their underlying P2P network primitives constrain further improvements due to two problems (i) high message redundancy and (ii) long broadcast convergence time. The first problem is caused by the excessive robustness of the dominant broadcast approach Gossip. All state-of-the-art blockchain systems only tolerate 20-50% node failure while Gossip can withstand up to 90%. The reason for (ii) is that existing broadcast topologies ignore geographical distances among nodes and incur paths with unnecessarily high latency. We present <small>FRing</small>, a geography-based P2P overlay network for fast and robust broadcast in blockchain systems. <small>FRing</small> has three main features: sufficient robustness, low message redundancy, and fast convergence. To reduce convergence time, <small>FRing</small> forms the network topology by considering geographical proximity. A novel broadcast algorithm based on <small>FRing</small> topology is proposed to lower message redundancy while maintaining sufficient robustness. One major challenge is to eliminate the risk of topology inference by traffic pattern analysis. <small>FRing</small> leverages Intel SGX to guarantee nodes’ behavior integrity and incorporates pattern obfuscation to prevent traffic pattern analysis. The evaluation shows that <small>FRing</small> improved the throughput of EOS by 220% and Hyperledger Fabric by 210%.