Zum Inhalt springen
Technische Universität Berlin English
Vorlesungsverzeichnis und Modultransfersystem

Algorithms for Networked and Distributed SystemsModulbeschreibung #41131 / Version 1

← Zur Modulseite English version
Diese Modulbeschreibung gilt nicht im aktuellen Semester (WiSe 2026/27).
Modul / Version#41131 / #1
GültigkeitWiSe 2022/23 – SoSe 2023
Verfügbare Sprache(n)Deutsch
Leistungspunkte9
Modulverantwortliche*rSchmid, Stefan
BenotungBenotet
PrüfungsformMündliche Prüfung
Lehrsprache(n)Englisch

Zugehörigkeit

FakultätFakultät IV
InstitutInstitut für Telekommunikationssysteme
Fachgebiet34331700 FG Intelligent Networks and Management of Distributed Systems (INET)

Kontakt

SekretariatEN 18
Ansprechpartner*inSchmid, Stefan
E-Mail-Adressestefan.schmid@tu-berlin.de
Webseitehttps://www.tu.berlin/eninet

Lernergebnisse

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

Lehrinhalte

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

Modulbestandteile

Pflichtbereich

Die folgenden Veranstaltungen sind für das Modul obligatorisch:

LehrveranstaltungenArtNummerTurnusSpracheSWSVVZ
Advanced Topics in Networked and Distributed SystemsSeminar0432 L 824 Winter- und Sommersemester[en]2 ISIS
Algorithms for Networked and Distributed SystemsIntegrierte Veranstaltung0432 L 815 Wintersemester[en]4 ISIS

Veranstaltungen im Vorlesungsverzeichnis

Veranstaltungen, die aus den Lehrveranstaltungen dieses Moduls angelegt wurden.

WiSe 2026/27 (1)

Advanced Topics in Networked and Distributed Systems (Seminar) 1

Alle Gruppen dieser Lehrveranstaltung im Verzeichnis

Arbeitsaufwand und Leistungspunkte

Advanced Topics in Networked and Distributed Systems (Seminar)

AufwandbeschreibungMultiplikatorStundenGesamt
Präsenzzeit152 h30 h
Vor-/Nachbereitung154 h60 h
90 h

Algorithms for Networked and Distributed Systems (Integrierte Veranstaltung)

AufwandbeschreibungMultiplikatorStundenGesamt
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

Der Aufwand des Moduls summiert sich zu 270 Stunden. Damit umfasst das Modul 9 Leistungspunkte.

Beschreibung der Lehr- und Lernformen

* 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

Voraussetzungen für die Teilnahme / Prüfung

Wünschenswerte Voraussetzungen für die Teilnahme an den Lehrveranstaltungen:

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

Verpflichtende Voraussetzungen für die Modulprüfungsanmeldung:

Dieses Modul hat keine Prüfungsvoraussetzungen.

Abschluss des Moduls

BenotungBenotet
PrüfungsformMündliche Prüfung
SpracheEnglisch
Dauer/Umfang30 min

Prüfungsbeschreibung (Abschluss des Moduls)

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.

Dauer des Moduls

Für Belegung und Abschluss des Moduls ist folgende Semesteranzahl veranschlagt: 2 Semester.

Dieses Modul kann in folgenden Semestern begonnen werden: Wintersemester.

Maximale teilnehmende Personen

Die maximale Teilnehmerzahl beträgt 40.

Anmeldeformalitäten

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

Literaturhinweise, Skripte

Skript in Papierform

nicht verfügbar

Skript in elektronischer Form

verfügbar – http://www.inet.tu-berlin.de/

Empfohlene Literatur

  • 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.

Zugeordnete Studiengänge

Dieses Modul findet in keinem Studiengang Verwendung.

Sonstiges

Keine Angabe