davalapar

https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Dijkstra's algo can be used for path-finding in a p2p network, which comes handy when relaying information as a unicast (between 2 peers) or multicast (between 3 peers). Instead of relying on the very unreliable geographical data (lat/long) their devices can provide, their network latency values can used instead.

Requirements:

1. Clients should determine the latency of their direct peers periodically.
2. Clients should be able to relay the messages in a forward and backward manner
3. Client should be able to group the messages
4. Encoding of messages

davalapar

• Visual Studio Code: https://code.visualstudio.com/download

  • Color theme: Monokai
  • Windows font, size 10: Open Sans https://fonts.google.com/specimen/Open+Sans
  • Monospaced font, size 14: Cousine https://fonts.google.com/specimen/Cousine
  • Monospaced font, size 14, with ligatures: Liga Cousine https://github.com/davalapar/LigaCousine

• Cygwin: https://cygwin.com/install.html

  • gcc-g++, gcc-core, make, gdb (for CLion)
  • git, curl, wget, putty, openssh, chere