mapping peer to peer locality with latency & fancy geometry

แชร์
ฝัง
  • เผยแพร่เมื่อ 8 ก.พ. 2025

ความคิดเห็น • 6

  • @marcomunizaga3022
    @marcomunizaga3022 2 ปีที่แล้ว

    This explanation takes the hypervolume of the cake

  • @marcomunizaga3022
    @marcomunizaga3022 2 ปีที่แล้ว +3

    I wonder if you can get around the trust issue of trusting other nodes’ latency by using secret tokens that T hands out.

  • @stefansteger7642
    @stefansteger7642 ปีที่แล้ว

    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

  • @vaibhavmuchandi8112
    @vaibhavmuchandi8112 ปีที่แล้ว

    I think a better way to frame my question is, why not use virtual coordinates ?

  • @vaibhavmuchandi8112
    @vaibhavmuchandi8112 ปีที่แล้ว

    What are your thoughts on Vivaldi Coordinates? Can they be a better fit in this case ?

  • @GeorgeThomas111
    @GeorgeThomas111 ปีที่แล้ว

    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.