Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

cache shortest path to network peers #28

Open
3 of 5 tasks
slugalisk opened this issue Jun 2, 2020 · 0 comments
Open
3 of 5 tasks

cache shortest path to network peers #28

slugalisk opened this issue Jun 2, 2020 · 0 comments

Comments

@slugalisk
Copy link
Member

slugalisk commented Jun 2, 2020 •
edited
Loading

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
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@slugalisk