Startseite > Fachgruppen > Algorithmen und Komplexität > Lehre > Routing and Data Management in Networks

Routing and Data Management in Networks

Lecture, Winter Term 2018/19


Routing and data management are basic tasks to be solved in order to allow efficient use of large networks like, e.g., the Internet, peer-to-peer systems, or wireless mobile ad-hoc networks. This lecture deals with algorithms and their analysis for routing and data management in such systems, and especially describes methods for handling their dynamics (movement of nodes, joins and leaves of nodes).

The lecture and tutorials will be given in English.


  • Lecture: Friedhelm Meyer auf der Heide
  • Tutorials: Alexander Mäcker


  • Lecture and tutorial will be swapped on the following dates
    Monday, November 5th: lecture
    Friday, November 9th: tutorial
    Monday, December 17th: lecture
    Friday, December 21st: no tutorial (canceled due to Christmas break)
  • During the first week of the semester, there will be a lecture instead of the tutorial on Monday, October 8th. There will be no lecture on Friday, October 12th.
  • The first tutorial will take place on Monday, October 15th.



  • Fridays, 11:15 - 14:00 in F1.110 (Friedhelm Meyer auf der Heide)


  • Mondays, 14:15 - 16:00 in F1.110 (Alexander Mäcker)


Oral examination. The exams will cover the lecture as well as the tutorials and homework exercises.

Prerequisite for admission: in order to take the examination, you need at least 40% of the available points from the homework assignments.

Bonus system: If you participate actively in the tutorials, you can improve your grade as follows:

A minimum of 50% of the points for the homework improves the grade by 1/3 grade points.

A minimum of 75% of the points for the homework improves the grade by 2/3 grade points.

Precondition for such improvements is active participation, especially presentation of own solutions, in the tutorials.

An improvement of the grade 5 is not possible. Bonus points from earlier lectures can not be credited.

Weekly Homework Assignments

During the course, the weekly homework assignments will appear in PANDA each Tuesday.

The submission deadline for each homework assignment is the Thursday the week after it has been released before midnight (23:59). Therefore, you have one week to work on each assignment. Please deliver your homework to Alexander Mäcker via email to in a pdf data format.

The exact date when each assignment has to be submitted can also be found on the corresponding assignment sheet.

The corrected solutions will be returned to you in the tutorials. We accept and encourage homework solutions done in groups of up to three people.

Homework & Lecture Slides

  • Both the homework assignments and the lecture slides can be found in PANDA.

Module Information

  • MuA: III.2.1 Algorithmen I, III.2.2 Algorithmen II, III.2.4 Algorithmen in Rechnernetzen
  • Focus Areas: 2. Algorithm Design, 3. Networks and Communication
  • Master Wirtschaftsinformatik

Further information

  • Basics about randomized algorithms and probability theory (pdf)
  • A related lecture for Bachelor students is Parallelism and Communication.
  • Basics about networks (pdf)
  • Advanced Course on Communication in Networks (pdf)
  • Adaptive Routing (pdf)
  • Routing (pdf)
  • Wireless Overlay Networks (pdf)