A proposed extension to libp2p GossipSub that uses PREAMBLE and IMRECEIVING notifications to reduce duplicate large-message transmissions, cutting reported bandwidth by up to 61% and dissemination latency by up to 35% in shadow simulations.
Staggering and Fragmentation for Improved Large Message Handling in libp2p GossipSub
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
The libp2p GossipSub protocol leverages a full-message mesh with a lower node degree and a more densely connected metadata-only (gossip) mesh. This combination allows an efficient dissemination of messages in unstructured peer-to-peer (P2P) networks. However, GossipSub needs to consider message size, which is crucial for the efficient operation of many applications, such as handling large Ethereum blocks. This paper proposes modifications to improve GossipSub's performance when transmitting large messages. We evaluate the proposed improvements using the shadow simulator. Our results show that the proposed improvements significantly enhance GossipSub's performance for large message transmissions in sizeable networks.
citation-role summary
background 1
citation-polarity summary
fields
cs.NI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
PREAMBLE and IMRECEIVING for Improved Large Message Handling in libp2p GossipSub
A proposed extension to libp2p GossipSub that uses PREAMBLE and IMRECEIVING notifications to reduce duplicate large-message transmissions, cutting reported bandwidth by up to 61% and dissemination latency by up to 35% in shadow simulations.