Universität Wien FIND

052714 VU Network Algorithms (2020W)

Continuous assessment of course work


Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).


max. 25 participants
Language: English


Classes (iCal) - next class is marked with N

We planned to use a hybrid model, where attendance is possible in-person (the room has a capacity of 30 under Corona guidelines), but also remotely via BBB. BBB-Details will be provided in the Moodle of the VU. We plan on having a small set of international guest lectures, which would be purely online as well.

However, due to recent developments, we might switch to more purely online. The first lecture will be only online and more details will be discussed there.

We aim at recording the lecture material. (Virtual) attendance is mandatory for project presentations, discussions, and preparations, but not for the lectures.

We realize that in the current times, sickness etc. might prevent you from attending at certain dates, and we will find individual alternatives in these cases.

Monday 05.10. 15:00 - 18:15 Digital
Monday 12.10. 15:00 - 18:15 Digital
Monday 19.10. 15:00 - 18:15 Digital
Monday 09.11. 15:00 - 18:15 Digital
Monday 16.11. 15:00 - 18:15 Digital
Monday 23.11. 15:00 - 18:15 Digital
Monday 30.11. 15:00 - 18:15 Digital
Monday 07.12. 15:00 - 18:15 Digital
Monday 14.12. 15:00 - 18:15 Digital
Monday 11.01. 15:00 - 18:15 Hörsaal 3, Währinger Straße 29 3.OG
Monday 18.01. 15:00 - 18:15 Hörsaal 3, Währinger Straße 29 3.OG
Monday 25.01. 15:00 - 18:15 Hörsaal 3, Währinger Straße 29 3.OG


Aims, contents and method of the course

Aims: We will study network algorithms from a theoretical and practical perspective. The focus lies on computer networks, but we will also investigate algorithms in other networks, such as social networks. After the course, you will be able to understand fundamental models and properties of these networks and to analyze them from an algorithmic point of view. Considered aspects include, among other, routing and traffic engineering, network design (both optical networks and peer-to-peer networks), distributed coordination, network resilience, detection of central nodes and clustering.

Contents: The VU will start with a set of lectures introducing basic concepts and background knowledge to build a solid foundation. We then transition to more specialized lectures and project work. The project will be research-oriented, where students (alone/small groups) will investigate a network algorithm topic in more detail over a longer time period. These topics will combine algorithmic and networking aspects. The project focus can either be steered more towards theoretical or practical directions, but must keep both in mind.

The lectures revolve around the following topics:
Algorithms for ad-hoc and sensor networks (e.g. topology control, (geo-)routing, clustering),
Network algorithms in the context of peer-to-peer networks, social networks, wireless coordination, and self-stabilization,
Specialized lectures on network algorithms for oblivious routing, network design, and selected guest lectures on current topics.

The VU is independent to other courses such as e.g. Distributed and Parallel Algorithms and Advanced Topics in Networks, and it is not required to have taken these courses.

Methodology: 1) Lectures and 2) student project work & associated discussions/presentations

Assessment and permitted materials

The overall evaluation of student performance will be based on the following components:

- Project and its presentation (50%)
- Oral exam at the end of the teaching period (50%)

No material is permitted during the oral exam. We aim at performing the exam in-person, depending on how the situation develops. If you are e.g. quarantined or cannot travel to Vienna during the exam period, we will find individual alternatives in these cases.

Minimum requirements and assessment criteria

The assessment will be based on the sum of points reached over all of the above elements (% = points). It will follow the scheme:

87 <= points Sehr Gut/Very good (1)
74 <= points < 87 Gut/Good (2)
62 <= points < 74 Befriedigend/Satisfactory (3)
50 <= points < 62 Genügend/Sufficient (4)
0 <= P < 50 Nicht Genügend/Not sufficient (5)

Examination topics

Topics presented in the lectures and in the accompanying provided material.

Reading list

The lecture will be self-contained in the sense that all covered and required material will be made available to the students via Moodle.

For additional background material, selected chapters from:
- D. Wagner and R. Wattenhofer: Algorithms for Sensor and Ad Hoc Networks, Advanced Lectures. Springer-Verlag Berlin Heidelberg 2007.
- Lecture Notes on Principles of Distributed Computing (2020): https://disco.ethz.ch/courses/podc_allstars/

For a general background, please see
- M. Newman: Networks (Second Edition). Oxford University Press, 2018.

Association in the course directory

Module: AT-NET

Last modified: We 07.10.2020 08:27