Challenge 3b: Multi-Node Broadcast

desccode

Now it gets interesting! Multiple nodes need to coordinate and share broadcast messages. This is where we enter the land of distributed algorithms.

What it Does

The Approach

Built a gossip protocol:

  1. When a node receives a broadcast, it stores locally

  2. Then forwards to all neighbor nodes

  3. Neighbors store and forward to their neighbors

  4. Eventually all nodes have all messages

Used the topology from Maelstrom to determine who to gossip with.

Key Challenges

Solutions

What I Learned

This sets us up for the fault tolerance challenge - what happens when network partitions occur?

Links

← PrevSeriesNext →