Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus

summary

The gist

In blockchain systems, peer-to-peer (P2P) overlay networks play a crucial role in providing reliable, scalable and efficient message-delivery services to upper layers.

In short

The work improves rotating-leader consensus protocols by optimizing leader rotation and message dissemination over P2P networks using a cross-layer design called Duet. It introduces accelerated leader rotation, a reliable broadcast paradigm using latency-aware tree structures, and integrates these into Tendermint/libp2p to achieve up to 7.26x higher throughput compared to gossip methods.

Key concepts

Network Reconfiguration (NR) Primitive
This abstraction records network topologies and latencies directly on the blockchain. It allows the system to handle changes in the P2P network smoothly by requiring consensus on updated information, such as which nodes are connected or their current latency values, ensuring the protocol adapts to network evolution.
Tree-Based Dissemination
This is a highly efficient method for sending messages where information spreads like a tree structure. In normal operation, it's used to broadcast proposals quickly. The system constructs these trees based on network topology and latencies to minimize the maximum delay in reaching all necessary nodes.
Latency-Aware Dissemination Trees
These trees are constructed specifically to account for the time it takes for messages to travel across different network paths. The construction uses a greedy algorithm that prioritizes edges based on propagation delays and bandwidth constraints, aiming to minimize the overall maximum delay for proposal delivery.
Duet Prototype
Duet is a cross-layer design that co-optimizes rotating-leader consensus with P2P message propagation. It integrates three main improvements—accelerated leader rotation, reliable broadcast using trees, and latency awareness—into existing frameworks like Tendermint and libp2p to significantly boost performance.

Terminology used across episodes

This episode discusses

The paper

Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus · Read on arXiv

Shanghai Jiao Tong University · Shanghai Academy of Future Internet Technology · Beijing Academy of Blockchain and Edge Computing

In blockchain systems, peer-to-peer (P2P) overlay networks play a crucial role in providing reliable, scalable and efficient message-delivery services to upper layers. However, the consensus layer and the underlying P2P network remain mutually opaque in existing blockchains, waiving the opportunity for further improvement. In contrast to other P2P applications, blockchain can naturally be abstracted as a state machine. We therefore leverage this abstraction to record network topologies and latencies in a trusted and coordinated manner. With this support, we propose three improvements to rotating-leader consensus protocols and their underlying P2P networks: (1) accelerating leader rotation; (2) introducing a reliable-broadcast paradigm that employs tree-based dissemination in the normal case and falls back to gossip only when necessary; and (3) constructing latency-aware dissemination trees. We integrate the above ideas into Tendermint and libp2p, and conduct empirical evaluation on Amazon EC2 platform using up to 300 nodes distributed across 10 regions. The results demonstrate that, compared with gossip-based dissemination over the same topology, our prototype improves peak throughput by up to 7.26 times.

Transcript

Introduction to the show: ident: Computer Science. The day in computer science: software, systems and theory on arXiv.

Tom: We're looking at the paper: "Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus".

Jane: Here's the gist of the paper. In blockchain systems, peer-to-peer (P2P) overlay networks play a crucial role in providing reliable, scalable and efficient message-delivery services to upper layers.

Tom: With this support, we propose three improvements to rotating-leader consensus protocols and their underlying P2P networks: (1) accelerating leader rotation; (2) introducing a reliable-broadcast paradigm that employs tree-based dissemination in the normal case and falls back to gossip only when necessary; and (3) constructing latency-aware dissemination trees.

Jane: The results demonstrate that, compared with gossip-based dissemination over the same topology, our prototype improves peak throughput by up to 7.26×.

Tom: System Context and Motivation Blockchain systems are typically deployed on a peer-to-peer (P2P) overlay network where P2P networks provide reliable, scalable and efficient message transmission services to upper layers Such features are essential for achieving scalability and simplifying the design, implementation, and maintenance of the upper-layer consensus protocol.

Title and authors: Jane: So, we’re looking at "Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus," which sounds pretty technical, but the core idea seems to be tying the message flow directly into how leaders change in a rotating-leader consensus system.

Tom: Exactly. The authors are showing how you can improve both the leader rotation and the underlying P2P network efficiency simultaneously, rather than just tweaking one piece in isolation.

Lu: They focus on three main improvements: first, accelerating leader rotation; second, introducing a reliable broadcast paradigm that uses tree-based dissemination mostly, falling back to gossip only when it’s truly necessary; and third, building these latency-aware dissemination trees.

Meng: Tree-based dissemination sounds good for efficiency but sounds complicated to implement when things go wrong or the network topology changes frequently. What's the catch there?

Tom: Well, they address that by abstracting the network configuration as a Network Reconfiguration primitive, which means they record things like edge set and node set on-chain. This lets the system handle network evolution smoothly because consensus is required on updated information about those structures.

Jane: That sounds like a big piece of work for maintaining state consistency across the whole system, which is crucial when you're dealing with decentralized networks. So, how do they actually accelerate that leader rotation part?

Lu: For accelerating leader rotation, they look at the expected latency of a random cycle in the P2P network and use a greedy heuristic to construct this proposer ring. This aims to minimize total latency by iteratively selecting unvisited nodes closest to the current one.

Tom: So they’re not just picking any next node; they're using proximity based on what the network structure tells them about delays, which sounds much smarter than a simple round-robin approach.

The paper's summary: Jane: Okay, so to wrap up where we are, the paper shows that by combining these ideas—accelerating rotation and using a smarter way to spread messages—they can significantly improve performance compared to just relying on gossip.

Tom: They introduce a specific way of spreading proposals: in normal conditions, they use a tree-based broadcast, which is much faster than the usual gossip method, but they have this safety net where it falls back to gossip only when it's absolutely needed.

Lu: The construction of these latency-aware dissemination trees is key here. They select spanning trees based on network topology and latencies with a greedy algorithm that considers propagation delays, bandwidth constraints, and prioritizing upcoming proposers to minimize the maximum delay.

Meng: That sounds like they are trying to build the fastest possible route for a message, but I wonder how much overhead that tree construction itself adds when the network is already under stress.

Tom: They show empirical results on Amazon EC2 where their prototype, Duet, achieves up to seven point two six times higher throughput compared to gossip-based dissemination over the same network topology.

Jane: seven point two six times! That’s a huge jump in performance when you’re just looking at message delivery speed, and they found it especially pronounced when they combined the tree dissemination with that greedy proposer order.

Lu: They also noted that Duet shows better handling of skewed geographic placements compared to their baseline setups, which is important because real-world blockchain deployments often have uneven node distribution across the globe.

The paper's improvements: Tom: So, let’s talk about those three improvements again in more detail. First, we have accelerating leader rotation through that greedy heuristic we mentioned earlier.

Jane: And second is this reliable broadcast paradigm, which is using tree-based dissemination as the primary method and only resorting to gossip when it's necessary for safety or liveness.

Lu: And third, they specifically constructed latency-aware dissemination trees by solving a Traveling Salesman Problem on a weighted undirected graph to find cycles that minimize total weight.

Meng: Solving the Traveling Salesman Problem sounds computationally intensive, so how do they keep that construction fast enough to run in real-time within the consensus cycle?

Tom: They use a greedy algorithm for the tree construction, which considers propagation delays and bandwidth constraints while prioritizing upcoming proposers to minimize that maximum delay.

Jane: And this leads into what they call latency-aware dissemination trees, which are designed to reduce the maximum possible delay for message delivery within the network structure itself.

Lu: They also built in resilience by showing that the tree phase timer is critical for recovery; you have to wait out that tree timer before retransmission starts if internal relays fail.

Tom: And when a leader fails, they showed Duet extends the wait time beyond what vanilla Tendermint does by having the node wait out one tree timer before entering the propose-timer path itself.

Conclusion: Jane: So, to wrap this up, Duet is essentially a cross-layer design that optimizes rotating-leader consensus by using geographic locality for proposer ordering and cutting out redundant proposal transmissions in normal operation.

Tom: It successfully integrates these ideas into Tendermint and libp2p to achieve those significant throughput improvements we saw on Amazon EC2, proving the co-design approach works.

Lu: The framework they propose is promising because it’s a structure that can be extended to multileader or leaderless consensus protocols, which is a big area for future research.

Meng: From an engineering standpoint, the sensitivity of the gossip retransmission stage to how long that tree-phase timer runs means you have to tune things very carefully for optimal performance in production environments.

Lalam: I’m confident in this direction because the results show a seven point two six times throughput increase over gossip, and it works well under skewed geographic conditions, which is a real-world constraint.

Jane: It really shows how important it is to think about the network topology when you design consensus protocols, not just the logic of voting itself.

Tom: So we’ve seen how recording network data on-chain lets us build these smarter dissemination trees that beat standard gossip methods by a lot, and that’s what Duet does.

More episodes

← Home