Algorithms for Networked SystemsModule description #41126 / Version 2
- 6 CP
- Written exam
- Graded
- Summer semester
- English
| Module / Version | #41126 / #2 |
|---|---|
| Validity | Since Summer semester 2026 |
| Available language(s) | English, German |
| Credit points | 6 |
| Person responsible for the module | Schmid, Stefan |
| Grading | Graded |
| Exam format | Written exam |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Telekommunikationssysteme |
| Academic chair | 34331700 FG Intelligent Networks and Management of Distributed Systems (INET) |
Contact
| Office | EN 18 |
|---|---|
| Contact person | Schmid, Stefan |
| E-mail address | stefan.schmid@tu-berlin.de |
| Website | https://www.tu.berlin/eninet |
Learning outcomes
Most modern computer systems are inherently distributed and networked, including wireless sensorsystems, datacenters, peer-to-peer systems, or cryptocurrencies, to just give some examples. In order to operate correctly and efficiently, all these systems rely on clever algorithms. Some of the underlying algorithms are fundamental and are used by most of the systems, others are specialized and exploit specific features of the particular distributed system.
The goal of the module is to provide the students with tools and techniques to reason about efficient algorithms for networks.
The lecture is problem-oriented and structured around fundamental networking aspects (such as routing, forwarding medium access, etc.) of different networks (e.g., Internet, wireless, cryptocurrency networks, overlay networks, etc.). Each lecture will cover a different fundamental principle (such as use of randomization or indirection) 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 complexity or the communication 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 protocol should be decentralized. The students will further have a good idea of the different natures of today's networked systems. 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
The goal of the module is to provide the students with tools and techniques to reason about efficient algorithms for networks.
The lecture is problem-oriented and structured around fundamental networking aspects (such as routing, forwarding medium access, etc.) of different networks (e.g., Internet, wireless, cryptocurrency networks, overlay networks, etc.). Each lecture will cover a different fundamental principle (such as use of randomization or indirection) 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 complexity or the communication 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 protocol should be decentralized. The students will further have a good idea of the different natures of today's networked systems. 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 for Datacenter Networks, Sensor Networks, Wireless Networks, Mobile Networks etc.
* Robust Network Topology Design: Self-Stabilizing and Self-Optimizing Networks
* Randomization: why and how? Basic Tools
* Algorithms: Local Algorithms, Random Algorithms, Online Algorithms, Dynamic Programming
* Algorithms for Wireless Medium Access
* Resource Allocation and Embedding (e.g., energy, bandwidth, CPU)
* Flow & Congestion Control, Routing
* Theory of Border Gateway Protocols
* Algorithms for Cryptocurrency Networks
* TOR
* Social Networks: An Algorithmic Perspective
* Network Models for Datacenter Networks, Sensor Networks, Wireless Networks, Mobile Networks etc.
* Robust Network Topology Design: Self-Stabilizing and Self-Optimizing Networks
* Randomization: why and how? Basic Tools
* Algorithms: Local Algorithms, Random Algorithms, Online Algorithms, Dynamic Programming
* Algorithms for Wireless Medium Access
* Resource Allocation and Embedding (e.g., energy, bandwidth, CPU)
* Flow & Congestion Control, Routing
* Theory of Border Gateway Protocols
* Algorithms for Cryptocurrency Networks
* TOR
* Social Networks: An Algorithmic Perspective
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Algorithms for Networked Systems | Integrated course | 0432 L 817 | Summer semester | [en] | 4 | WS 2026/27 (1) ISIS |
Courses in the course catalog
Courses created from the teaching units of this module.
Winter semester 2026/27 (1)
Algorithms for Networked Systems (Integrated course) 1
- Algorithms for Networked Systems (Integrierte Veranstaltung) Termingruppe 1 0432 L 817
Workload and credit points
Algorithms for Networked Systems (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance tutorial | 15 | 2 h | 30 h |
| Attendance lecture | 15 | 2 h | 30 h |
| Solving excercises | 15 | 4 h | 60 h |
| Preparation for the exam | 1 | 15 h | 15 h |
| Preparation and rework of the lecture | 15 | 3 h | 45 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.
* 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:
* Module "Diskrete Strukturen" or module "Algorithmen und Datenstrukturen"
* Module "Rechnernetze und Verteilte Systeme"
* Module "Network Architectures - Basics"
* Good knowledge of the English language
* Module "Rechnernetze und Verteilte Systeme"
* Module "Network Architectures - Basics"
* Good knowledge of the English language
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Written exam |
| Language | English |
| Duration/Extent | 90 minutes |
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: Summer semester.
Maximum number of participants
The maximum capacity of participants is 60.
Registration procedures
Registration for the course on ISIS.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available
Recommended literature
- David Peleg: Distributed Computing - A Locality-Sensitive Approach, SIAM 2000
- Korose, James F., Ross, Keith: Computer Networking: A Top-Down Approach. 8th ed. Pearson, 2021. ISBN-13: 978-1292405469
- Mark Newman: Networks. 2nd ed. Oxford University Press, 2018 - https://global.oup.com › networks-9780198805090
- Michael Mitzenmacher, Eli Upfal: Probability and Computing, Cambridge University Press, 2005.
Assigned programs
This module version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Computer Engineering Computer Engineering (B. Sc.) - StuPO 2015 | SS 2026 | Wahlpflichtbereich › Informatik |
| WS 2026/27 | Wahlpflichtbereich › Kataloge › Informatik | |
| Computer Engineering Computer Engineering (M. Sc.) - StuPO 2015 | SS 2026 | Wahlpflicht Studiengebiet B › Eingebettete Systeme und Rechnerarchitekturen / Embedded Systems and Computer Architectures |
| WS 2026/27 | Wahlpflichtbereich › Studiengebiet A › Eingebettete Systeme und Rechnerarchitekturen / Embedded Systems and Computer Architectures | |
| Computer Science Computer Science (B. Sc.) - StuPO 2015 | SS 2026 | Wahlpflichtbereich › Wahlpflichtbereich Katalog Informatik |
| WS 2026/27 | Wahlpflichtbereich › Katalog Informatik | |
| Computer Science Computer Science (B. Sc.) - StuPO 2025 | WS 2026/27 | Wahlpflichtbereich › Studiengebiete › Rechensysteme › Weitere Module |
| Computer Science (Informatik) Computer Science (Informatik) (M. Sc.) - StuPO 2015 | SS 2026 | Studiengebiete › Grundlagen der Informatik / Foundations of Computing |
| WS 2026/27 | Wahlpflichtbereich › Studiengebiet › Verteilte Systeme und Netze / Distributed Systems and Networks | |
| Electrical Engineering Electrical Engineering (M. Sc.) - StuPO 2015 | SS 2026 | Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing |
| WS 2026/27 | Wahlpflichtbereich › Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing | |
| Industrial Engineering and Management Industrial Engineering and Management (M. Sc.) - StuPO 2026 | WS 2026/27 | Engineering Sciences / Specialization › Software Systems Engineering › Distributed Systems and Networks |
| Information Systems Management Information Systems Management (B. Sc.) - StuPO 2015 | SS 2026 | Wahlpflichtbereich › Informatik |
| WS 2026/27 | Wahlpflichtbereich › Informatik | |
| Information Systems Management Information Systems Management (B. Sc.) - StuPO 2021 | SS 2026 | Wahlpflichtbereich › Informatik |
| WS 2026/27 | Wahlpflichtbereich › Informatik | |
| Information Systems Management (Wirtschaftsinformatik) Information Systems Management (Wirtschaftsinformatik) (M. Sc.) - StuPO 2017 | SS 2026 | Wahlpflichtbereich › Fachstudium Informatik › Verteilte Systeme und Netze / Distributed Systems and Networks |
| WS 2026/27 | Wahlpflichtbereich › Fachstudium Informatik › Verteilte Systeme und Netze / Distributed Systems and Networks | |
| Information Technology (teacher training) Kernfach StuPO 2016 | SS 2026 | Fachwissenschaft › Fachwissenschaftlicher Wahlpflichtbereich |
| WS 2026/27 | Fachwissenschaft › Fachwissenschaftlicher Wahlpflichtbereich | |
| Information Technology (teacher training) Kernfach StuPO 2016 | SS 2026 | Fachwissenschaftlicher Wahlpflichtbereich |
| WS 2026/27 | Fachwissenschaftlicher Wahlpflichtbereich | |
| Information Technology (teacher training) Zweitfach StuPO 2016 | SS 2026 | Fachwissenschaft › Fachwissenschaftlicher Wahlpflichtbereich |
| WS 2026/27 | Fachwissenschaft › Fachwissenschaftlicher Wahlpflichtbereich | |
| Information Technology (teacher training) Zweitfach StuPO 2016 | SS 2026 | Fachwissenschaftlicher Wahlpflichtbereich |
| WS 2026/27 | Fachwissenschaftlicher Wahlpflichtbereich |
Miscellaneous
Not specified