Title: A talk about peer-to-peer lookup systems

Speaker: Roger Khazan

Abstract

Peer-to-peer lookup systems implement large-scale lookup directory services in dynamic peer-to-peer networks. Napster and Gnutella are well-known examples of such systems.

I have recently learned about several peer-to-peer lookup systems: Pastry, Tapestry, and CAN. In this seminar I will present the key design ideas and performance characteristics of these systems. I will also make a number of general observations about their designs and underlying models.