cache shortest path to network peers
Open
Nobody has claimed this yet.
- Dominant language
- Go
- Stars
- 10
- Forks
- 6
- PR merge metrics
- No merged PRs in 30d
Description
Because webrtc connections have significantly more overhead than UDP connections we use relayed message propagation instead of KAD traversal. Messages are suffixed with a host id and signature by each relaying peer...
- cache the next hop (the last relaying peer) corresponding to the shortest path to transitive peers
- query cache to inform routing decisions
- add timestamps to hop trailers to compute relative latency to peers
- use khh to filter popular service host ids and store multiple next hops
- estimate deliverability confidence to reduce message replication
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing the existing relayed-message routing and cache behavior described in the issue, including next-hop selection, hop-trailer timestamps, and routing decisions. The remaining work is to filter popular service host IDs with KHH, store multiple next hops, and estimate deliverability confidence; completion criteria are not specified beyond those unchecked items.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- go
- Domain
- distributed-systems, networking
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100