Skip to content
Technische Universität Berlin Deutsch
Course catalog and module transfer system

Network Algorithms (6 LP)Module description #40589 / Version 1

← Module page Deutsche Fassung
This module description is not valid in the current semester (Winter semester 2026/27).
Module / Version#40589 / #1
ValidityWS 2013/14 – SS 2019
Available language(s)English
Credit points6
Person responsible for the moduleFeldmann, Anja
GradingGraded
Exam formatWritten exam
Language(s) of instructionEnglish

Affiliation

FacultyFakultät IV
InstituteInstitut für Telekommunikationssysteme
Academic chair34331700 FG Intelligent Networks and Management of Distributed Systems (INET)

Contact

OfficeNot specified
Contact personNot specified
E-mail addressNot specified
WebsiteNot specified

Learning outcomes

Most modern computer systems are inherently distributed and networked: from multi-core computer architectures over wireless sensor systems and datacenters to peer-to-peer systems. Accordingly, network algorithms are needed to design and operate
these computer systems in a scalable and robust way.

The goal of this lecture is to provide the students with tools and techniques to reason about efficient network algorithms. The lecture is problem-oriented and structured into different fundamental princi-ples, such as Randomization,
Decentralization, Indirection, etc. Each lecture will cover a different basic problem (such as Load Balancing, Medium Access, Symmetry Breaking, etc.) and will be self-contained.

By the end of the lecture, the student will be able to develop her/his own network algorithms, and formally prove correctness as well as complexity guarantees (e.g., on the computational or message complexity).

The students will also have a good understanding of when to apply which principle, i.e., where randomization can be useful and where not, or to which extent a distributed system should be decentralized.

The students will also have a good idea of the different natures of today's networks. If time permits, we will also extend our discussion beyond computer networks and have an algorithmic look at social networks.

This module is principally designed to impart:
technical skills: 40x, method skills: 40x, system skills 10x, social skills 10x

Content

The lectures revolve around fundamental problems and design principles. A tentative outline of the main topics to be covered in the course are

* Network Models and Distributed Systems
* Robust Network Topology Design: Self-Stabilizing and Self-Optimizing Networks
* Decentralization: why and how? Complexity Measures
* Randomization: why and how? Basic Tools
* Algorithms: Local Algorithms, Random Algorithms, Online Algorithms, Dynamic Programming
* Network Algorithms for Leader Election, Coloring, Maximal Independent Sets, Medium Access
* Resource Allocation and Embedding (e.g., energy, bandwidth, CPU)
* Flow & Congestion Control, Routing
* Social Networks: An Algorithmic Perspective

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Network AlgorithmsIntegrated course0432 L 815 Winter semester–4 ISIS

Workload and credit points

Network Algorithms (Integrated course)

Workload descriptionMultiplierHoursTotal
attendance lecture152 h30 h
attendance tutorial152 h30 h
preparation and rework of the lecture153 h45 h
preparation for the exam115 h15 h
solving exercises154 h60 h
180 h

The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.

Description of teaching and learning methods

* Common lecture
* Exercises and/or programming assignments: to be issued weekly; half to be solved individually and half to be solved in groups of 2 (if the class has an odd number of participants then there will be a group of 3); to be graded by the instructor;
solutions to be jointly discussed (by instructor + students) during the tutorials
* English language for both the lecture and the tutorials

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

Desirable - knowledge and qualifications equivalent to:

* BINF-GL - MPGI1 Algorithmische und funktionale Lösung diskreter Probleme
* BINF-GL - MPGI2 Algorithmen und Datenstrukturen im imperativen Stil
* Network Protocols and Architectures
* English language

Mandatory requirements for the module examination registration:

This module has no examination requirements.

Completion of the module

GradingGraded
Exam formatWritten exam
LanguageEnglish

Exam description

There is a written exam. In order to register for the exam the students must obtain at least 50% of the points for exercises and/or programming assignments.

Duration of the module

The following number of semesters is estimated for taking and completing the module: 1 semester(s).

This module can be started in the following semesters: Winter semester.

Maximum number of participants

The maximum capacity of participants is 30.

Registration procedures

Registration for the course on ISIS. Registration for the complete module on QISPOS / registration office.

Recommended reading, lecture notes

Lecture notes

unavailable

Electronic lecture notes

available – http://www.inet.tu-berlin.de/

Recommended literature

  • David Peleg: Distributed Computing - A Locality-Sensitive Approach, SIAM 2000
  • Michael Mitzenmacher and Eli Upfal, Probability and Computing, Cambridge University Press, 2005.

Assigned programs

This module is not used in any program.

Miscellaneous

Not specified