-
Correct me if I'm wrong, but if you chord.retrieve a key, and the node that's the closest to that key fails to respond, the chord.retrieve will fail? Is it possible to retry retrieving that key by als…
jure updated
10 years ago
-
I think there is a problem with the calculation of the finger table.
If creating less than `explorer.min-peers` nodes, everything works as expected and the finger table only contains the first finger,…
-
If the cloud part is failed, no new nodes can connect to it and participate in its network.
I think cloud part can be p2p also.
-
It's probably time to investigate decentralizing discovery. Doing so would reduce our infrastructure burden and reduce centralized knowledge of the network. In a DHT we want to be able to look up the …
calmh updated
4 months ago
-
The overlay network's routing table use a custom distance function that is of "ring geometry" instead of XOR. discv5's lookup mechanism should not work unless the routing table itself is Kademlia-lik…
-
#### Description
When using gnrc_sock_udp in my application after a certain amount of hosts in the network (and thus a certain amount of packets/s on a single host), the buffer content returned b…
-
#### Summary
Swarm supports multicast between multiple nodes, multiple nodes form a group (as few as a few nodes, as many as 100,000 nodes, which can limit the maximum number of nodes), and message…
-
Similar to torrent's DHT solution, required features:
- Find peer to specified site file (to allow sites to add optionally download files)
- Ipv6 and tor address support for peers
- It should work usi…
-
Is this still under active development? What are the current items that are being implemented? Would love to work on some of the implementation (would need a LOT of help, of course).
-
## Rationale
Handling failure cases in the current implementation is difficult (eg, transcoder address changes, broadcaster unavailability), and poses challenges for designing large-scale systems.
…