docs(anoncomms): add AnonComms roadmap for Testnet v0.3#471
Conversation
jm-clius
changed the title
| 4. Libp2p nodes can use a general service discovery API to discover peers with specific capabilities | ||
| 5. The service discovery protocol adapts DISC-NG for Kad-DHT to ensure efficient service discovery | ||
| 6. Client nodes can discover addresses of peers with specific capabilities without participating in the Kad-DHT | ||
| 7. Service discovery correctly discovers all advertised peers in a topology of several thousand nodes |
There was a problem hiding this comment.
I think "all advertised peers" contradicts the protocol's early-termination design. It should be "up to F_lookup peers". F_lookup s current default value is 30. The protocol is designed to stop early — finding every single advertiser in the network is not the goal and would break the logarithmic scaling property
May be we can rewrite something like this:
Service discovery correctly discovers up to F_lookup peers for a given service in a topology of several thousand nodes.
| - P2. Capability discovery performs better than discv5 to find a sparse service | ||
| - S1. Capability discovery can be benchmarked in large scale Delivery module simulations | ||
| - S2. Capability discovery can be benchmarked in a standalone p2p capability discovery module | ||
| - F7. Service discovery correctly discovers all advertised peers in a topology of several thousand nodes |
There was a problem hiding this comment.
We can rewrite this part also to something like:
Service discovery correctly discovers up to F_lookup peers for a given service in a topology of several thousand nodes.
to better align with the protocol design
|
|
||
| **FURPS**: | ||
|
|
||
| - P1. The service discovery module provides comparable performance to discv5 when all nodes support the same service |
There was a problem hiding this comment.
When all nodes support the same service is exactly the scenario where service discovery has inherent overhead that discv5 does not — admission control, waiting times, ticket rounds, and K_register × m registration attempts per advertiser. The protocol is designed for the sparse case, not the popular one.
We can reframe as "service discovery performs within an acceptable overhead bound compared to discv5 for popular services"
|
|
||
| **FURPS**: | ||
|
|
||
| - P3. Service discovery integrated in Logos Delivery provides comparable performance to discv5 when all nodes support the same service |
There was a problem hiding this comment.
Similarly here also we can reframe to clarify little on what comparable means as for all nodes participating in same service, ie, a popular service case, service discovery has extra overhead.
|
Thanks for working on this, @jm-clius . I left a few comments that I think could help clarify some of the deliverables. |
3 participants
Add the Roadmap (FURPS and Deliverables) for AnonComms in Testnet v0.3 scope