[Sephr]

Does this include any latency or hop estimation schemes? For a truly performant p2p networks involving a central signalling server, it is important to reduce latency where possible with p2p latency estimation schemes involving BGP and cached internet routing graphs.

This would help provide developers with an alternative to blindly matching peers, which will usually result in worse than possible latency if multiple peers have the content being requested.

Currently you can get an approximation of this feature by building on top of MaxMind's GeoIP database, but it's non-free and possibly not as precise for this purpose as other methods[1][2], although it is much easier to use.

[1]: http://nowak.ece.wisc.edu/infocom09.pdf

[2]: https://www.cs.montana.edu/~utkarsh.goel/docs/MickaPcpICCCN1...

[_prometheus]

BTW, we have MaxMind's GeoIP Lite database (we asked first) stored directly on IPFS, indexed with a b-tree. see https://github.com/ipfs/ipfs-geoip :) -- it's what powers our webui globe.

[_prometheus]

we do not yet measure latency, we really need to and have been wanting to for some time. could you help us with this?

IP address signals are good, but we must maintain real measurements of all our connections to be able to adjust over time. also, with things like cjdns and tor, IP addresses wont help much.

I'd love to get network quality estimation at various levels -- as close to the wire as we can for proper measurements, but also across layers of the stack to quantify overheads and so on.

Would love to see how transports like QUIC improve things like parallel fetching of blocks.