The tests assume a mesh network with known connections, the node doesn't,
so unneeded packet leakage isn't really as controllable as I'd hoped.
What's definitely important is that the system doesn't cache entries for
long enough that it starts continuously sending packets the wrong way
no matter what.
In practice it is unlikely that data that's too big for the reliability layer won't need splitting
anyway by the application at some point, and the libraries are already too open to OOM DoS.
The previous testcase was "all nodes communicating randomly", basically a worst-case.
This testcase is somewhat more realistic, a set of nodes communicating between each other via other
nodes, a given TO node recurring once every 5 seconds (approximately).
Notably, the 'packet transfer total' figure should be halved, as in the testcase pings and responses
are used, but only responses are counted.
