Network Algorithms - Interactive curriculae of TU Ilmenau
The interactive curriculae provide information on the degree programmes offered by the TU Ilmenau.
Please refer to the respective study and examination rules and regulations for the legally binding curricula (Annex Curriculum).
You can find all details on planned lectures and classes in the course catalogue.
Please note that this page is no longer updated. All modules and study plans from PO version 2021 onwards (Bachelor and Master study programs) are now available on the Campus Portal.
| module properties module number 8215 - common information | |
|---|---|
| module number | 8215 |
| department | Department of Computer Science and Automation |
| ID of group | 2253 (Telematics and Computer Networks) |
| module leader | Prof. Dr. Günter Schäfer |
| language | Deutsch |
| term | Wintersemester |
| previous knowledge and experience | MA Informatik |
| learning outcome |
|
| content | 1. Einführung: Kommunikation in datagrammorientierten Netzwerken, Routingalgorithmen inklusive Korrektheitsbeweise, Modellierung von Datenverkehr mittels Poisson-Prozess, MM1 Wartesystem, Grundlegende Entwurfsprobleme in Netzwerken 2. Netzwerkmodellierung: Modellierung von Netzwerk-Design-Aufgaben als Multi-Commodity-Flow Probleme, Pure-Allocation-Problem, Shortest-Path-Routing, Fair Networks, Tunnel-Design in MPLS Netzwerken, Multilevel Netzwerke 3. Optimierungsmethoden: Grundlagen der Linearen Optimierung, Simplexalgorithmus, Branch-and-Bound, Gomory-Schnitte, Branch-and-Cut 4. Netzwerkentwurf: Zusammenhang von Netzwerkentwurfsproblemen und mathematischer Modellierung in Standardform, kapazitierte Probleme, Pfaddiversität, Limited-Demand-Split, NP-Vollständigkeit von Single-Path-Allocation, Modular Flows, nichtlineare Zielfunktionen und Nebenbedingungen, Lösung von Problemen mit konvexen und konkaven Zielfunktionen bzw. Nebenbedingungen durch lineare Approximation 5. Network Resilience: Zusammenhangsmaße, Biconnected Components, Algorithmen zur Bestimmung der Blockstruktur von Graphen
Praktische Probleme und Protokollfunktionen in Kommunikationsnetzen und ihr algorithmischer Hintergrund. |
| media of instruction and technical requirements for education and examination in case of online participation | Folien, Tafelanschrieb, Bücher Link zum Moodlekurs: |
| literature / references | Michal Pioro, Deepankar Medhi. Routing, Flow, and Capacity Design in Communication and Computer Networks. The Morgan Kaufmann Series in Networking, Elsevier, 2004 |
| evaluation of teaching | |
| Details reference subject | |
|---|---|
| module name | Network Algorithms |
| examination number | 2200229 |
| credit points | 5 |
| SWS | 3 |
| on-campus program (h) | 33.75 |
| self-study (h) | 116.25 |
| obligation | obligatory module |
| exam | oral examination performance, 20 minutes |
| details of the certificate | |
| link to Moodle course | |
| teacher | |
| signup details for alternative examinations | |
| maximum number of participants | |
| Details in degree program Master Wirtschaftsinformatik 2014, Master Wirtschaftsinformatik 2015, Master Wirtschaftsinformatik 2018 | |
|---|---|
| module name | Network Algorithms |
| examination number | 2200229 |
| credit points | 5 |
| on-campus program (h) | 34 |
| self-study (h) | 116 |
| obligation | elective module |
| exam | oral examination performance, 20 minutes |
| details of the certificate | |
| link to Moodle course | |
| signup details for alternative examinations | |
| maximum number of participants | |
| Details in degree program Master Informatik 2013 | |
|---|---|
| module name | Network Algorithms |
| examination number | 2200229 |
| credit points | 5 |
| on-campus program (h) | 34 |
| self-study (h) | 116 |
| obligation | obligatory module |
| exam | oral examination performance, 20 minutes |
| details of the certificate | |
| link to Moodle course | |
| signup details for alternative examinations | |
| maximum number of participants | |