Message Dissemination Experiments

Session 1 [Redo in Rust]

$N \in \{20, 40, 80\}$ ← number of nodes in the network

$C \in \{ { N \over 5 }, { N \over 4}, {N \over 2 }\}$ ← connections per node

$B \in \{ {N \over 2}, N, 2N \}$ ← minimal number of messages in a queue (when applicable)

$R \in \{ {N \over 2}, N, 2N \}$ ← transmission rate

$I={N \over 2}$ ← number of executions of runs of experiment

$T \in \{8, 16, 32\}$ ← number of sent messages (this should be a function of dissemination time, but for now let us do it like that).

$M \in \{{N \over 10}, {N \over 5}, {N \over 2}\}$ ← number of nodes sending message

Experiment 1 — Single sender sending single message

• [x] No Mix
• [x] Pure Coin-Flipping
• [x] Pure Random Sampling
• [x] Permuted Coin-Flipping
• [x] Noisy Coin-Flipping
• [ ] Noisy Coin-Flipping with Random Release
• [ ] Responsive Coin-Flipping
• [ ] Responsive Permuted Coin-Flipping

Experiment 2 — Single sender over time

• [x] No Mix
• [x] Pure Coin-Flipping
• [x] Pure Random Sampling
• [x] Permuted Coin-Flipping
• [x] Noisy Coin-Flipping
• [ ] Noisy Coin-Flipping with Random Release
• [ ] Responsive Coin-Flipping