Gossip is used widely in the Zilliqa network for messaging. However, the gossip protocol by design needs the information of all peers that must eventually receive the rumor.
This basic requirement for peer information is usually available to a node, except at the point when a new DS block has been mined. The DS block contains the peer information for all shards, which is extracted by each node to initialize its peer list and restart the gossip engine.
However, distributing the DS block itself is a problem that has to be dealt with in a different manner. The solution employed is tree-based cluster broadcasting. At the start of a new DS epoch, before DS block distribution, shard nodes don't know the information of the other nodes in the same shard. Thus, we leverage clustered multicasting in order to broadcast the DS block to all the nodes within a shard.
- Assume that we have
Xnodes in a shard. We form clusters - each of
Ynodes - out of these shard nodes. Each cluster, in turn, has
- Every node is assigned a sequence number
0, such that
n/Yrepresents the cluster it belongs to. For example,
2/10 = 0,
11/10 = 1.
- Therefore, we should have a total of
X/Yclusters, indexed from
X/Y-1. A node
nbelonging to cluster
n/Yis at level
- A node multicasts messages to nodes within the range
(n/Y * Z + 1)*Y~
((n/Y * Z + Z + 1)* Y - 1). Bound checks on node index need to be done before multicasting. If the checks fail, we don’t broadcast.
These are the parameters that control the broadcasting of DS blocks from DS committee nodes to shard nodes according to the design above.