'Successor entries' presentation slideshows

CS 525 Advanced Topics in Distributed Systems Spring 08

CS 525 Advanced Topics in Distributed Systems Spring 08. Indranil Gupta Lecture 3 Introduction to Peer to Peer Systems - II January 22, 2008. Two types of P2P Systems. Systems that work well in practice but with no big/famous names Non-academic P2P systems

534 views • 39 slides

CS 598IG Adv. Topics in Dist. Sys. Spring 2006

CS 598IG Adv. Topics in Dist. Sys. Spring 2006. Indranil Gupta Lecture 3 January 24, 2006. DHT=Distributed Hash Table. A hash table allows you to insert, lookup and delete objects with keys A distributed hash table allows you to do the same in a distributed setting (objects=files)

526 views • 38 slides

532 views • 37 slides

Peer-to-peer systems (part II) Slides by Indranil Gupta (modified by N. Vaidya)

Peer-to-peer systems (part II) Slides by Indranil Gupta (modified by N. Vaidya). Chord. Developers: I. Stoica, D. Karger, F. Kaashoek, H. Balakrishnan, R. Morris, Berkeley and MIT Intelligent choice of neighbors to reduce latency and message cost of routing (lookups/inserts). Chord.

494 views • 35 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))

254 views • 25 slides