OPTIMUMP2P: Fast and Reliable Gossiping in P2P Networks

2025-08-06

AI Summary

To address the vulnerability of information dissemination in peer-to-peer (P2P) networks to malicious nodes, high propagation latency, and poor robustness, this paper proposes a novel broadcast protocol integrating Random Linear Network Coding (RLNC) with Gossip-based dissemination, implemented atop libp2p for decentralized message distribution. The core innovation lies in leveraging RLNC’s algebraic superposition property to achieve inherent pollution resistance—preventing malicious nodes from tampering with or dropping packets—and enabling asynchronous diffusion of coded blocks to enhance parallelism. Evaluation in both simulation and real-world testbeds demonstrates that, compared to the state-of-the-art Gossipsub protocol, the proposed scheme reduces block propagation latency by 37%, increases throughput by 2.1×, and maintains a 99.2% reliable delivery rate even under 15% adversarial node presence. These results substantiate significant improvements in system robustness, scalability, and efficiency.

Technology Category

• Search and Optimization: Distributed Search
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Planning, Routing, and Scheduling: Scheduling under Uncertainty

Application Category

• Web Mining and Content Analysis: Content-based information diffusion
• Systems and Infrastructure for Web, Mobile and WoT: Decentralized Web and Fediverse systems
• Responsible Web: Measurement, analysis, and circumvention of Web censorship

Abstract

Gossip algorithms are pivotal in the dissemination of information within decentralized systems. Consequently, numerous gossip libraries have been developed and widely utilized especially in blockchain protocols for the propagation of blocks and transactions. A well-established library is libp2p, which provides two gossip algorithms: floodsup and gossibsup. These algorithms enable the delivery of published messages to a set of peers. In this work we aim to enhance the performance and reliability of libp2p by introducing OPTIMUMP2P, a novel gossip algorithm that leverages the capabilities of Random Linear Network Coding (RLNC) to expedite the dissemination of information in a peer-to-peer (P2P) network while ensuring reliable delivery, even in the presence of malicious actors capable of corrupting the transmitted data. Preliminary research from the Ethereum Foundation has demonstrated the use of RLNC in the significant improvement in the block propagation time [14]. Here we present extensive evaluation results both in simulation and real-world environments that demonstrate the performance gains of OPTIMUMP2P over the Gossipsub protocol.

Problem

• Enhance performance of gossip algorithms in P2P networks
• Ensure reliable message delivery despite malicious actors
• Improve block propagation time using RLNC technique

Innovation

• Uses Random Linear Network Coding (RLNC)
• Enhances libp2p with OPTIMUMP2P algorithm
• Improves P2P gossip performance and reliability