Implement peer-discovery interface

As per https://github.com/libp2p/interface-peer-discovery

This interface would be implemented by:

• mdns
• bootstrap
• random walk (does this currently exist in go-libp2p?)
• in the future: webrtc, ...

[vyzo]

do we want this to be dht based?
It could be the solution to the generalized rendezvous problem, and be usable for pubsub, relay, etc

[Kubuxu]

Additional provider of peer-discovery is "old peers". This way we could make the network independent from the bootstrap nodes after first run.

[daviddias]

do we want this to be dht based?

DHT is Peer Routing + Content Routing. Read:

• https://github.com/libp2p/js-libp2p/tree/master/examples/peer-and-content-routing
• https://github.com/libp2p/specs/blob/master/4-architecture.md#41-peer-routing
• https://github.com/libp2p/specs/blob/master/4-architecture.md#43-distributed-record-store
• Splitting Routing into (Peer Routing, Content Routing) ipfs/specs#1

Peer Discovery is things like MulticastDNS or Bootstrap. Read:

• https://github.com/libp2p/js-libp2p/tree/master/examples/discovery-mechanisms
• https://github.com/libp2p/specs/blob/master/4-architecture.md#44-discovery

peer-discovery is "old peers"

Yeah, we can have a resurrect Peer Discovery that knows how to store to disk old peers and then brings them back on node boot. 👍 👍

[deckbsd]

Hello everybody,

If i understand correctly, does that mean that actually from a go-libp2p peer i can't try to find some other peers ? that's why i was wondering how, when i start a host i can't make that host to connect to any other nodes. Because actually in the examples, each nodes are created like in client/server basic model (the client know the ip of the "server"(an other node that it can communicate with). m i wrong ?

[Kubuxu]

If i understand correctly, does that mean that actually from a go-libp2p peer i can't try to find some other peers ?

No, finding peers works (it is sometimes difficult in case of complicated/layered NATs).

This issue is about internal go-libp2p interface allowing better code structure when it comes to peer discovery.

[agahEbrahimi]

@Kubuxu Are there any examples of the peer discovery? I've been wandering around for 2-3 days trying to find an example and only found one in JS https://github.com/libp2p/js-libp2p/tree/master/examples/discovery-mechanisms which was also mentioned above, but none in go.
Even though the website says that they are all complete in go.

Thank you

[Kubuxu]

@agahEbrahimi most of them should work by default. We are working on clearing up the bootstraping but for an example you can look here: #302

Random walk (DHT) should work by default and so should mdns AFAIK.

[daviddias]

Can someone point me to an up to date example of how to enable/disable random-walk in go-libp2p?

[daviddias]

Just did a quick "chase the PR" exercised and discovered that:

• There is an example created for Bootstrapping Examples/bootstrapping railing #302
• There is a refactor by @florianlenz to make go-libp2p-bootstrap nicer https://github.com/florianlenz/go-libp2p-bootstrap/pull/3

Still looking for random-walk

[aschmahmann]

@daviddias Would the DisableAutoBootstrap kad option help?

https://github.com/libp2p/go-libp2p-kad-dht/blob/4fd64988b55d6e93405eceffeb3037da46d1848b/opts/options.go#L155

[daviddias]

@aschmahmann I would say no but given that there is a bunch of terms that are overloaded, the best is for me to clarify my intent: What I want to achieve is to enable/disable the routine that searches the DHT for a random peer (most likely that doesn't exist) with the purpose of refreshing the routing tables. Is there a way to enable/disable this (known in the P2P literature as random-walk)?