Measures

Parameters

• N (nodes) = {100, 1000, 10000}
• I (iteration, seeds, repetitions) = {}
  • T (time) = {}
    • observe simulation behaviour?
    • wait until X messages are broadcast (2N is a good approximation)
• • Lottery Config
• C (peering degree) = {4, 6, 8}
• E (sending pattern) = 1 hop per 1s, 1/2 hop per 2s, 1/3 hop per 3s
• S (seeding)
  • Topology
  • Execution
    • Randomness should be fully deterministic

Results

• latency
  • %
    • how much time for % nodes see message
  • effective
    • how much time for receiver see message
• bandwith
  • how often do you get a message
    • histogram
• entropic measure of anonimity
  • when one such event is generated, how many messages arrived/were relayed in the previous S seconds
  • just for nodes generating sending events
• size of the queue