The goal of the simulation is to measure the message dissemination time through the entire network depending on the queueing mechanism used. That is, we are interested in measuring a time necessary for a single message to be received by all nodes in the network.
The topology of the network is randomly generated out of $N$ nodes with $C$ connections per each node. $C$ is the maximal number of connections a node can have. Nodes cannot connect to themselves. Node can have less than $C$ connections if all other nodes have used their connection allowance. The network that does not have connectivity must be rejected, that is, if there exist a pair of nodes that cannot communicate with each other, then there is no connectivity.
The goal of this simulation effort is to measure the message dissemination time through the entire network depending on the queueing mechanism used. That is, we are interested in measuring a time necessary for a single message to be received by all nodes in the network.
Experiments: 1, 2, 3, 4, 5.
We are trying to build an intuition around the impact of parameters on the dissemination time of the network. The results are going to form the basis that we are going to compare to in next sessions
$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
Experiments: 4, 5.
We are looking for a confirmation of the results from the session 1, for a different set of parameters.
$N \in \{10^2, 10^3, 10^4\}$ ← number of nodes in the network
$C \in \{ 4, 8, 16\}$ ← connections per node
$B \in \{ 10, 50, 100 \}$ ← minimal number of messages in a queue (when applicable)
$R \in \{ 1, 10, 100 \}$ ← transmission rate
$I=20$ ← number of executions of runs of experiment
$T \in \{ {B \over 2}, {B}, {2B}\}$ ← 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
Experiments: 4, 5.
We are looking for a confirmation of the results from the session 1, for a different set of parameters. This is a simplified version of the session 2.
$N \in \{210, 210^2, 2*10^3\}$ ← number of nodes in the network
$C \in \{ 4, 6, 8\}$ ← connections per node
$B \in \{ 10, 50, 100 \}$ ← minimal number of messages in a queue (when applicable)
$R \in \{ 1 \}$ ← transmission rate
$I=20$ ← number of executions of runs of experiment
$T \in \{ 1000\}$ ← 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