Uni-Logo
Sie sind hier: Startseite Lehre Frühere Veranstaltungen Universität Freiburg Peer-to-Peer-Networks (WS 16)
Artikelaktionen

Peer-to-Peer-Networks (Winter 2016)

 

Lecture of Dr. Christian Ortolf

News

  • 12.10.2016 Webpage online
  • 17.10.2016 First lecture

Contents

Peer-to-peer networks started in 1999 when the 19 year old Shawn (Napster) Fanning programmed a simple network software which facilitated a distributed file sharing over the Internet. The direct access is called peer to peer since the server of this small network just served as a mediator and not as a database system storing all the data. The following year Gutella was released as the first full peer-to-peer network allowing also the indexing and search in full peer-to-peer mode. Yet, Gnutella was slow and unreliable. The inefficiency of Gnutella was the chief motivation to invent better peer-to-peer networks. In 2001 the scientific world saw CAN and Chord as such networks with an efficient search and soon further networks followed. While researcher kept improving the distributed network algorithms, programmers released better software implementing these ideas. The dark side of this story is the misuse of theses peer-to-peer networks for massive copyright infringements. Although this is not a problem specific to peer-to-peer networks, the lack of a central client providing the material made it harder to find the evil-doers.  The goal of this lecture is to present methods and algorithms suited for the design of up-to-date peer-to-peer networks. The lecture aims at students studying at least four semester of computer science for bachelor or master of science. As prerequisites participants should have basic knowledge in algorithms and computer networks (as being taught in Datenstrukturen und Algorithmen and Systeme II). 

Possible topics of the lectures are among the following

  • Napster
  • Gnutella
  • CAN
  • Chord
  • Pastry
  • Distance-Halving, Koorde
  • Self-organization
  • Kelips, epidemic algorithms
  • Anynomity
  • Security

 

Organisation

Schedule

  • Lecture
    • Monday, 16:15 - 18:00, room 101-01-018
    • Wednesday, 10:15 - 11:00, room 101-01-018
  • Exercises
    • Aditya Oak
    • Wednesday, 11:15 - 12:00, room 101-01-018 

Forum

Please use the forum for general questions about the lecture. Maybe your question and the answer is probably interesting to other students. Please feel free to start new threads and interesting discussion.

 

Material

 

Lecture Recordings Slides Exercises
1. Introduction, Motivation, Napster, Gnutella webm pdf   
2. Pareto-Distribution webm pdf pdf
3. CAN webm pdf  
4. CAN, DHT webm pdf pdf
5. Chord webm   pdf Link fixed
6. Pastry webm pdf  
7. DHT Analysis webm pdf pdf
8. Degree Optimal Networks webm pdf pdf
9. Kelips, Epidemic Algorithms replacement recording mp4 pdf  
10. Kelips, Epidemic Algorithms webm   pdf
11. Epidemic Algorithms, Random Graphs webm pdf  
12. Random Graphs webm   pdf
13. Fast Download webm pdf  
14. Fast Download webm   pdf
15. Game Theory webm pdf  
16. PAST webm pdf pdf
17. The Internet mp4 pdf  
18. The Internet mp4   pdf
19. The Internet mp4    
20. Security , Motivation webm pdf pdf
21. Security , Cryptography webm    
22. Security webm  

pdf updated 20.1. 10:20 am

23. Security webm  

pdf

24. Self Organisation, P2P in the Wild webm pdf pdf  
25. BitCoin webm  

pdf

26. BitCoin webm  

 

 

 

 

Literature

  • Mahlmann, Schindelhauer: Peer-to-Peer-Netzwerke - Methoden und Algorithmen, Springer 2007
  • S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Computer Communication Review, volume 31, pages 161–172. Dept. of Elec. Eng. and Comp. Sci., University of California, Berkeley, 2001.
  • Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Roch Guerin, editor, Proceedings of the ACM SIGCOMM 2001 Con- ference (SIGCOMM-01), volume 31, 4 of Computer Communication Review, pages 149–160, New York, August 27–31 2001. ACM Press.
  • Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Com- puter Science, In Proc. of the International Conference on Distributed Systems Platforms (IFIP/ACM), 2218:329–350, 2001.
  • Druschel, Peter, and Antony Rowstron. "PAST: A large-scale, persistent peer-to-peer storage utility." Hot Topics in Operating Systems, 2001. Proceedings of the Eighth Workshop on. IEEE, 2001.
  • Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, and Ben Y. Zhao. Distributed object location in a dynamic network. In SPAA ’02: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, pages 41–52, New York, NY, USA, 2002. ACM Press.
  • Moni Naor and Udi Wieder. Novel architectures for p2p applications: the continuous-discrete approach. In SPAA ’03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pages 50–59, New York, NY, USA, 2003. ACM Press.
  • M. Frans Kaashoek and David R. Karger. Koorde: A simple degree-optimal distributed hash table. In 2nd International Workshop on Peer-to-Peer Systems, Berkeley, California, 2003.
  • Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer and Alec Wolman, SkipNet: A Scalable Overlay Network with Practical Locality Properties, USENIX Symposium on Internet Technologies and Systems, 2003.
  • Peter Mahlmann, Christian Schindelhauer, Distributed Random Digraph Transformations for Peer-to-Peer Networks,18th ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, MA, USA. July 30 - August 2, 2006
  • Peter Mahlmann, Christian Schindelhauer,  Peer-to-Peer Networks based on Random Transformations of Connected Regular Undirected Graphs,  17th ACM Symposium on Parallelism in Algorithms and Architectures 2005,155-164 (SPAA 2005)
  • Awerbuch, Baruch, and Christian Scheideler. "Towards a scalable and robust DHT." Theory of Computing Systems 45.2 (2009): 234-260
  • Montresor, Alberto, Márk Jelasity, and Ozalp Babaoglu. "Chord on demand." Peer-to-Peer Computing, 2005. P2P 2005. Fifth IEEE International Conference on. IEEE, 2005.
  • Kurose, James F. Computer Networking: A Top-Down Approach Featuring the Internet, Pearson, 2005
  • Andrew S. Tannenbaum, Computer Networks, Prentice Hall, 2010

 

Benutzerspezifische Werkzeuge