'N45 n80 file' presentation slideshows

Security in Distributed systems

499 views • 30 slides

Chord Advanced issues

Chord Advanced issues Analysis Search takes O(log(N)) time Proof 1 (intuition): At each step, distance between query and peer hosting the object reduces by a factor of at least 2 Takes at most m steps: is at most a constant multiplicative factor above N, lookup is O(log(N))

750 views • 25 slides