Algorithms for Networked and Distributed Systems (6 LP)Module description #40589 / Version 2
- 6 CP
- Oral exam
- Graded
- Winter semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40589 / #2 |
|---|---|
| Validity | Winter semester 2021/22 – Winter semester 2021/22 |
| Available language(s) | German |
| Credit points | 6 |
| Person responsible for the module | Schmid, Stefan |
| Grading | Graded |
| Exam format | Oral 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 | Not specified |
|---|---|
| Contact person | Not specified |
| E-mail address | Not specified |
| Website | Not specified |
Learning outcomes
Most modern computer systems are inherently distributed and networked, including multi-core computers, 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 fundamentaland are used by most of the systems, others are specialized and exploit specific features of the particular distributed system. The goal of this lecture is to provide the students with tools and techniques to reason about efficient algorithms for networks and distributed systems. The lecture is problem-oriented and structured into different fundamental principles, such as Distributed Coordination, Decentralization, Randomization, 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 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 distributed system 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 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:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Network Algorithms | Integrated course | 0432 L 815 | Winter semester | – | 4 | ISIS |
Workload and credit points
Network Algorithms (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| attendance lecture | 15 | 2 h | 30 h |
| attendance tutorial | 15 | 2 h | 30 h |
| preparation and rework of the lecture | 15 | 3 h | 45 h |
| preparation for the exam | 1 | 15 h | 15 h |
| solving exercises | 15 | 4 h | 60 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:
* BINF-GL - MPGI1 Algorithmische und funktionale Lösung diskreter Probleme * BINF-GL - MPGI2 Algorithmen und Datenstrukturen im imperativen Stil * 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 | Oral exam |
| Language | English |
| Duration/Extent | 30 min |
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 40.
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
- Mark Newman: Networks. 2nd ed. Oxford University Press, 2018 - https://global.oup.com › networks-9780198805090
- 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