Network Optimization by RandomizationModulbeschreibung #40601 / Version 1
- 6 LP
- Schriftliche Prüfung
- Benotet
- Winter- und Sommersemester
- Englisch
Diese Modulbeschreibung gilt nicht im aktuellen Semester (WiSe 2026/27).
| Modul / Version | #40601 / #1 |
|---|---|
| Gültigkeit | SS 2014 – WS 2018/19 |
| Verfügbare Sprache(n) | Englisch |
| Leistungspunkte | 6 |
| Modulverantwortliche*r | Feldmann, Anja |
| Benotung | Benotet |
| Prüfungsform | Schriftliche Prüfung |
| Lehrsprache(n) | Englisch |
Zugehörigkeit
| Fakultät | Fakultät IV |
|---|---|
| Institut | Institut für Telekommunikationssysteme |
| Fachgebiet | 34331700 FG Intelligent Networks and Management of Distributed Systems (INET) |
Kontakt
| Sekretariat | TEL 16 |
|---|---|
| Ansprechpartner*in | Keine Angabe |
| E-Mail-Adresse | anja@net.t-labs.tu-berlin.de |
| Webseite | Keine Angabe |
Lernergebnisse
All modern computer and wireless networks include a random component. Concrete applications of randomness abound in as diverse fields as communication protocols, network security, or distributed computing. By taking this module the students will be capable to understand
1. a set of general principles underlying the essence of randomness for network protocol design: foiling the adversary, random sampling, load balancing, or symmetry breaking
2. the benefits of randomness, e.g., in terms of simplicity, efficiency, or fast execution times, for network optimization
Moreover, the students will be able to make judicios use of randomness when developing new network protocols.
This module is principally designed to impart:
technical skills: 30x, method skills: 30x, system skills 30x, social skills 10x
1. a set of general principles underlying the essence of randomness for network protocol design: foiling the adversary, random sampling, load balancing, or symmetry breaking
2. the benefits of randomness, e.g., in terms of simplicity, efficiency, or fast execution times, for network optimization
Moreover, the students will be able to make judicios use of randomness when developing new network protocols.
This module is principally designed to impart:
technical skills: 30x, method skills: 30x, system skills 30x, social skills 10x
Lehrinhalte
The lectures mix basic elements from probability directly applicable to practical problems in network protocol design and analysis. A tentative outline of the main topics to be covered in the course are
* Multiple Access Protocols
* Scheduling (e.g., backpressure, opportunistic, approximate)
* Flow & Congestion Control, Routing
* Resource Allocation (e.g., energy, bandwidth, CPU)
* Peer-to-Peer & Social Networks
* Online Algorithms
* Network Security
* Network Coding
* Network Reliability
* Multiple Access Protocols
* Scheduling (e.g., backpressure, opportunistic, approximate)
* Flow & Congestion Control, Routing
* Resource Allocation (e.g., energy, bandwidth, CPU)
* Peer-to-Peer & Social Networks
* Online Algorithms
* Network Security
* Network Coding
* Network Reliability
Modulbestandteile
Pflichtbereich
Die folgenden Veranstaltungen sind für das Modul obligatorisch:
Arbeitsaufwand und Leistungspunkte
Network Optimization by Randomization (Vorlesung)
| Aufwandbeschreibung | Multiplikator | Stunden | Gesamt |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 4 h | 60 h |
| 90 h | |||
Tutorial fpr Network Optimization by Randomization (Übung)
| Aufwandbeschreibung | Multiplikator | Stunden | Gesamt |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 4 h | 60 h |
| 90 h | |||
Der Aufwand des Moduls summiert sich zu 180 Stunden. Damit umfasst das Modul 6 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
* 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 Losung diskreter Probleme
* BINF-GL - MPGI2 Algorithmen und Datenstrukturen im imperativen Still
* BINF-GL - StochInf Stochastik fur Informatiker
* English language
* BINF-GL - MPGI1 Algorithmische und funktionale Losung diskreter Probleme
* BINF-GL - MPGI2 Algorithmen und Datenstrukturen im imperativen Still
* BINF-GL - StochInf Stochastik fur Informatiker
* English language
Verpflichtende Voraussetzungen für die Modulprüfungsanmeldung:
Dieses Modul hat keine Prüfungsvoraussetzungen.
Abschluss des Moduls
| Benotung | Benotet |
|---|---|
| Prüfungsform | Schriftliche Prüfung |
| Sprache | Englisch |
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: 1 Semester.
Dieses Modul kann in folgenden Semestern begonnen werden: Winter- und Sommersemester.
Maximale teilnehmende Personen
Die maximale Teilnehmerzahl beträgt 20.
Anmeldeformalitäten
Materials regarding the course and references are offered via the website for the corresponding course.(http://www.net.t-labs.tu-berlin.de)
General references:
* M. J. Neely. Stochastic Network Optimization with Application to Communication and Queueing Systems. Morgan & Claypool 2010
* Michael Mitzenmacher and Eli Upfal, Probability and Computing, Cambridge University Press, 2005
General references:
* M. J. Neely. Stochastic Network Optimization with Application to Communication and Queueing Systems. Morgan & Claypool 2010
* Michael Mitzenmacher and Eli Upfal, Probability and Computing, Cambridge University Press, 2005
Literaturhinweise, Skripte
Skript in Papierform
nicht verfügbar
Skript in elektronischer Form
nicht verfügbar
Empfohlene Literatur
- M. J. Neely. Stochastic Network Optimization with Application to Communication and Queueing Systems. Morgan & Claypool 2010
- Michael Mitzenmacher and Eli Upfal, Probability and Computing, Cambridge University Press, 2005
Zugeordnete Studiengänge
Dieses Modul findet in keinem Studiengang Verwendung.
Master Computer Engineering (focus: Technical Applications)
Sonstiges
Keine Angabe