CS590A: Topics in Overlay Networks

Fall 2003.
Ananth Grama.

As peer-to-peer networks become popular, the algorithmic basis for these overlay networks has also matured. From the inital days of Napster, these algorithms have improved significantly with respect to their scalability, robustness, and performance. At the same time, significant higher-level functionality has been built atop these overlays. This functionality includes storage systems, streaming media services, services networks, and secure and anonymous data storage and transfer. In this class, we will overview the algorithmic basis for these developments. Specific topics include, but are not limited to: The course will be based on research papers -- covering approximately 2-3 papers a week. Presentations will include those by the students as well as the instructor. Students will be expected to undertake a semester-long project in an area related to overlay networks. These may either be individual, or group projects. The projects are expected to culminate in a presentation and a brief report.

Reading List

Location and Placement in P2P Networks

Media Streaming


Security, Anonymity, and Integrity

Quantitative Analysis

Wireless/ubicomp services


Content distribution networks