Overlay and P2P Networks
5
Networking and Services
Advanced studies
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: Overlay and p2p algorithms and systems, currently deployed systems, resource location, data delivery, reliability and performance issues, and legal and privacy issues.
Exam
27.02.2013
16.00
B123
| Year | Semester | Date | Period | Language | In charge |
|---|---|---|---|---|---|
| 2013 | spring | 14.01-21.02. | 3-3 | English | Sasu Tarkoma |
Lectures
| Time | Room | Lecturer | Date |
|---|---|---|---|
| Mon 14-16 | D122 | Sasu Tarkoma | 14.01.2013-21.02.2013 |
| Thu 12-14 | D122 | Sasu Tarkoma | 14.01.2013-21.02.2013 |
Exercise groups
| Time | Room | Instructor | Date | Observe |
|---|---|---|---|---|
| Fri 14-16 | D122 | Toni Ruottu | 21.01.2013—22.02.2013 |
Information for international students
General
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
Completing the course
Course grading will be based on the final exam and the assignments. The assignments are done as group work. The aim of the assignments are to introduce crucial development and evaluation techniques and illustrate the topics covered during the lectures.
- Exercise Package I (deadline:
Thursday 24.1.2013 at 16:00)- We have moved the deadline to Friday 25.1.2013 at 12:00 for regular assignments
- We have moved the turbo challenge deadline to Thursday 31.1.2013 at 16:00
- See the updated Exercise Package for details
- Some Answers!
- Exercise Package II (deadline: Thursday 7.2.2013 at 16:00)
- Exercise Package III (deadline: Friday 22.2.2013 at 12:00)
- Common Quotation Problems
- Tentative Exercise Score Matrix ( complete: 15/15 )
- Course exam 27.2.2013 16:00 CK112
- 27.2. exam results are available.
- Final exam on 19.4.2013 16:00 in A111
- 19.4.2013 exam results available.
- 18.6.2013 exam results available.
- 20.9.2013 exam results available.
- 22.11.2013 exam results available.
Literature and material
Tentative Schedule
- 14.1. Overview and exercises. Introduction.
- 17.1. Unstructured networks I
- 21.1. Unstructured networks II including BitTorrent. Additional notes on Freenet 0.75 and review questions.
- 24.1. Modelling and evaluation (Petri Savolainen). Bloom filter worked example.
- 28.1. Power-law networks. Structured networks
- 31.1. Power-law networks II. Consistent Hashing.
- 4.2. Distributed Hash Tables (DHT) I
- 7.2. DHT II. Kademlia visualization by Toni Ruottu. The visualization illustrates how the Kademlia routing tables are constructed. You will notice that with an address of m bits, there will be m k-buckets. Each k-bucket contains other nodes and the first n-1 need to match for the nth bucket. This means that the list of k-buckets resembles the Plaxton/Tapestry routing table with the long distance links. In this case, the long distance links are those in the first and the second buckets.
- 11.2. Applications
- 14.2. Advanced topics: Secure resolution and indirection (Dr. Samu Varjonen)
- 18.2. Conclusions and summary
Support material
Article: Theory and Practice of Bloom Filters for Distributed Systems. IEEE Surveys and Tutorials. (I updated link, the IEEE link had changed).
Slideset: Network Address Translation (ppt) (pdf). Only general NAT traversal issues covered in lecture slides are part of the exam material. (Skype uses solutions presented in the slides. If one node is behind a NAT, Skype uses Connection Reversal, if both are then Skype uses a relay node. More information here).
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: P. Savolainen et al. Windowing BitTorrent for Video-on-Demand: Not All is Lost with Tit-for-Tat. Globecom 2008. Background information on Video-on-Demand with BitTorrent, and simulation. Not part of exam material.
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.
G. DeCandia et al. Dynamo: Amazon’s Highly Available Key-value Store. SOSP 2007.
Weixiong Rao, Lei Chen, Pan Hui, Sasu Tarkoma. Move: A Large Scale Keyword-based Content Filtering and Dissemination System. ICDCS 2012. This article is not part of the exam material. It shows how to implement a scalable full text search based on a 1-hop DHT such as Dynamo.
Lectures are based on the following book:
S. Tarkoma. Overlay Networks: Toward Information Networking. 260 pages. CRC Press / Auerbach, February 2010.