Owner: @Youngjoon Lee

This document contains all results of message dissemination time experiments with various queuing mechanism, as planned in ‣.

Definitions

Message Dissemination Time

The time it takes for a single message generated from a sender to reach all nodes in the network by gossiping, as defined in the methodology document,

Queuing Mechanisms

Each node in the network is connected through the Nomos Gossip protocol. All nodes use the same queuing mechanism when gossiping messages to their peers, minimizing the correlation between messages coming into the node and messages going out.

5 queuing mechanisms have been experimented, as defined in ‣.

• NONE (Just FIFO with GTR and noise)
• PURE_COIN_FLIPPING
• PURE_RANDOM_SAMPLING
• PERMUTED_COIN_FLIPPING
• NOISY_COIN_FLIPPING

Common Parameters

All can be found in the Python code. Here, only few important parameters are introduced.

• Topology: Full Random
  • As described in the methodology, each node establishes connections with randomly chosen peers. The simulator ensures that there is no node isolated.
• Network latency: 0
  • How long a message is sent along a connection
• Message interval: 0.1
  • How often a sender sends a message (Effective only for the experiment 2 and 4)
• Queue initialization
  • Fill up the queue with $B$ noise messages ($B$: min queue size)
    • only for PURE_COIN_FLIPPING, PURE_RANDOM_SAMPLING, PERMUTED_COIN_FLIPPING