Kaashoek

Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications

By Mosharaf on November 2, 2009

I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” ACM SIGCOMM Conference, 2001. [PDF] Summary Chord is a DHT-based distributed lookup protocol – one of too many actually – for P2P systems that looks up a value given a key. What makes it more interesting ...

Continue reading →

Posted in Reviews | Tagged Balakrishnan, Chord, DHT, Kaashoek, Karger, Morris, P2P, Stoica, UCB CS268 F09 | Leave a response

Looking Up Data in P2P Systems

By Mosharaf on November 1, 2009

H. Balakrishnan, F. Kaashoek, D. Karger, R. Morris, I. Stoica, “Looking Up Data in P2P Systems,” Communications of the ACM, V. 46, N. 2, (February 2003). [ACM] Summary P2P systems have attracted large following due to their manageability, flexibility, resource-aggregation capabilities, and fault-tolerance properties. One of the biggest challenges in this area of research is ...

Continue reading →

Posted in Reviews | Tagged Balakrishnan, CAN, Chord, DHT, Kaashoek, Karger, Morris, P2P, Pastry, Stoica, UCB CS268 F09 | 2 Responses

Resilient Overlay Networks

By Mosharaf on October 29, 2009

D. Andersen. H. Balakrishnan, F. Kaashoek, R. Morris, “Resilient Overly Networks,” 18th Symposium on Operating Systems Principles, (December 2001). [PDF] Summary Routing scalability in BGP comes at the cost of reduced fault-tolerance and slower fault-recovery procedures. BGP hides paths due to policy concerns, damps routing updates to avoid route flapping, and has or uses little ...

Continue reading →

Posted in Reviews | Tagged Andersen, Balakrishnan, Kaashoek, Morris, overlay, RON, UCB CS268 F09 | Leave a response