You are here: Home Previous Events 2019 Peer-to-Peer-Networks (Sommer …

Peer-to-Peer-Networks (Sommer 2019)


Christian Schindelhauer


  • 16.04.2019 ILIAS link available
  • 15.04.2019 Webpage online
  • 23.04.2019, 10 am, 101-01-018 First lecture
  • 19.08.2019, 10 am. Exam 90 minutes in 082-00-006 (Kinohörsaal)


Peer-to-peer networks are a radical design alternative to the prevalent client-server-model used in the Internet. Started in 2000 with Gnutella, this design paradigm can be traced back to the beginning of the Internet. Nowadays, Bitcoin and block-chain are the best known applications, while a dozen years ago the peer-to-peer networks ruled the Internet, traffic-wise.

In this lecture, we will explore the underlying methods and algorithms for such networks. We concentrate on methods for storing, like Distributed Hash Table, pointer structures based on grids, rings, hyper-cubes, De-Bruijn graphs resulting in networks like CAN, Chord, Pastry, Tapestry, Kademlia and many more.

Then, we concentrate on the recent popular application of cryptographic methods to peer-to-peer networks, where Merkle-Hash-Trees, Distributed Consensus, Byzantine Generals result in the application of Block-chain. We also have a look at self-organizing networks, which allow a resilient repair mechanisms of peer-to-peer networks under churn and attacks.



  • Lecture
    • Tuesday, 10:15 - 12:00, room 101-01-018
    • Thursday, 10:15 - 11:00, room 101-01-018
  • Exercises
    • Thursday, 11:15 - 12:00, room 101-01-018  


Lecture slides, exercises, recordings and forum will be provided on the ILIAS-system. 

 Literature (to be updated soon)

  • 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