gatherer_p2p 1.1.1

[theoden-dd]

See comments in the last message for #9.

[jsb]

Thanks for the code! However, I'm not so happy with the current approach of increasing the broadcast frequency for skipping duplicate nodes. I thought about a different, deterministic algorithm which would rely on a constant cycle frequency:

• Initialization: Create a broadcast queue containing all nodes of the current database. Randomly shuffle the order of this queue.
• Every 10 seconds: Pop the first element from the broadcast queue and send it. When the queue is empty, just repeat the initialization.

Optional, to prevent sending known nodes:

• When a broadcast is received from another player, search the current broadcast queue for a matching item. If found, remove it from the current queue.

The strength of this approach is that we don't need to sample the entire database multiple times to find an unsent node. What do you think?

[theoden-dd]

Excellent idea!

That's generally the same, what I wanted to implement, but achieved by other means.

I'll do that in the 1.2.0 version instead of searching the first unset node after a randomly selected one: theoden-dd#13

The toughest things to find out are:

1. how to effectively remove an element from lua table without breaking the sequenced indexing,
2. how to effectively shuffle a lua table.