Overlay and P2P Networks
Koe
Vuosi | Lukukausi | Päivämäärä | Periodi | Kieli | Vastuuhenkilö |
---|---|---|---|---|---|
2015 | kevät | 12.01-26.02. | 3-3 | Englanti | Sasu Tarkoma |
Luennot
Aika | Huone | Luennoija | Päivämäärä |
---|---|---|---|
Ma 14-16 | D122 | Sasu Tarkoma | 12.01.2015-26.02.2015 |
To 12-14 | D122 | Sasu Tarkoma | 12.01.2015-26.02.2015 |
Harjoitusryhmät
Aika | Huone | Ohjaaja | Päivämäärä | Huomioitavaa |
---|---|---|---|---|
Ti 14-16 | B119 | Juhani Toivonen | 19.01.2015—27.02.2015 |
Yleistä
Overlay networks and peer-to-peer technologies have become key components for building large scale distributed systems. This course will introduce overlay networks and peer-to-peer systems, discuss their general properties, and applications. The course will cover the following topics:
- Currently deployed peer-to-peer systems and how they work
- Distributed Hash Tables as a base for structured peer-to-peer systems
- Peer-to-peer storage systems and their performance evaluation
- Performance issues, legal aspects, and privacy issues
- Peer-to-peer content distribution algorithms
Kurssin suorittaminen
Course grading will be based on the final exam and the assignments. The assignments are done working with a pair. The aim of the assignments are to introduce crucial development and evaluation techniques and illustrate the topics covered during the lectures.
Results of course exam 4.3.2015 16:00 in B123.
Results of the separate exam on 24.4.2015 16:00 in B123. (You can use the exercise score with the first separate exam)
Next separate exams:
18.9.2015 16:00 in B123
27.11.2015 16:00 in B123
Tentative lecture outline (iCal)
12.1. Overview and exercises. Introduction to overlay networks.
15.1. Unstructured networks I. (Additional material on NAT traversal, not part of exam material.)
19.1. Unstructured networks II. (note Bloom filters will be covered in later lectures).
22.1. Bittorrent, modelling and evaluation
26.1. Freenet and intro to power-law networks. (updated)
29.1. Consistent hashing. Introduction to Distributed Hash Tables (DHT). Given by Dr. Samu Varjonen.
2.2. DHT II.
5.2. Power-law networks.
9.2. Power-law networks continued. Applications I started.
12.2. Applications I.
16.2 Aplications II.
19.2. Advanced topics and Summary (updated). Note that publish/subscribe and the research examples were not covered extensively.
Exercises
Current exercise scores (department intranet)
Exercise set 1 (Deadline 26.1. at 12:00) - Answers
Exercice set 2 (Deadline 9.2. at 12:00) - Answers
Exercise set 3 (Deadline 23.2. at 12:00) - Answers
Kirjallisuus ja materiaali
The course material consists of the lectures, a number of additional articles and the assignments. A book is available as a support material.
Lectures are based on the following book:
S. Tarkoma. Overlay Networks: Toward Information Networking. 260 pages. CRC Press / Auerbach, February 2010.
Exam material (in addition to the lectures and assignments)
Article: Theory and Practice of Bloom Filters for Distributed Systems. IEEE Surveys and Tutorials.
Slideset: Modeling and Analysis of Anonymous-Communication Systems. J. Feigenbaum. Presentation at WITS 2008. General idea of MIX and Onion Routing are part of the exam material, this presentation provides additional details on the security model (that are not part of the exam material).
Article: R. Cohen et al. Resilience of the Internet to Random Breakdowns. Phys. Rev. Lett. 85, 4626–4628 (2000). Background info and derivation of the resiliency formula (power law slides). Additional details not part of exam material.
Article: G. DeCandia et al. Dynamo: Amazon’s Highly Available Key-value Store. SOSP 2007.
Kademlia visualizer by Toni Ruottu