implement a proper relay v2 search strategy
Open
effort/days
exp/wizard
kind/enhancement
P3
topic/libp2p
- Dominant language
- Go
- Stars
- 17.1k
- Forks
- 3.2k
- Avg merge
- 3d 18h
- Merged PRs (30d)
- 11
Description
### Description
Our current relay search is pretty bad.
It just constantly poll our K cluster with some exp-backoff.
The goal of this is to avoid convergence on a few nodes and spread the relaying load more or less evenly on all reachable dhtservers.
However the actual strategy we were supposed to implement is an outward search until success. If no nodes in our K cluster support relaying, it probably will never change.
Maybe a random polling of the DHT is not that bad after all ?
### API
Currently this is implemented with a long running task, this would need to be rewriten to be statefull and executing in the libp2p callback.
Contributor guide
Assessment
This issue has not been assessed yet.