mapping peer to peer locality with latency & fancy geometry
Ғылым және технология
Papers:
• OASIS: Anycast for any service: www.scs.stanford.edu/~dm/home...
• Meridian: A Lightweight Network Location Service without Virtual Coordinates www.cs.cornell.edu/people/egs...
00:00 Coral DSHT, maybe not
01:06 Mapping the entire internet as a service
02:41 Meridian: Network Location Service
04:02 Latency Rings
06:20 Distance Calculation
06:43 K-buckets in rings
08:11 Ring membership management
09:45 Hypervolume of the k-polytope
12:34 Closest Node Discovery
16:59 Byzantine Fault Tolerance
17:56 Prioritizing peers with rings
19:25 Works with just PING!
19:40 Closing thoughts
Пікірлер: 6
I wonder if you can get around the trust issue of trusting other nodes’ latency by using secret tokens that T hands out.
This explanation takes the hypervolume of the cake
Will adding a Cache along with any of these systems help with locality? Intuitively i feel Cache seems like a natural way to solve locality problems. But wonder if there will be problems with that.
I have a few questions, maybe somebody can help me with that. @13:14 Why would one request A to give the closests node to T, especially if T is known. Why not to request T directly? Related question, why to iterate until
What are your thoughts on Vivaldi Coordinates? Can they be a better fit in this case ?
I think a better way to frame my question is, why not use virtual coordinates ?