Network Optimization by RandomizationModule description #40601 / Version 1
- 6 CP
- Written exam
- Graded
- Winter and summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40601 / #1 |
|---|---|
| Validity | SS 2014 – WS 2018/19 |
| Available language(s) | English |
| Credit points | 6 |
| Person responsible for the module | Feldmann, Anja |
| 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 | TEL 16 |
|---|---|
| Contact person | Not specified |
| E-mail address | anja@net.t-labs.tu-berlin.de |
| Website | Not specified |
Learning outcomes
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
Content
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
Module components
Compulsory area
The following courses are mandatory for this module:
Workload and credit points
Network Optimization by Randomization (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 4 h | 60 h |
| 90 h | |||
Tutorial fpr Network Optimization by Randomization (Exercise)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 4 h | 60 h |
| 90 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:
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
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 |
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 and summer semester.
Maximum number of participants
The maximum capacity of participants is 20.
Registration procedures
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
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
unavailable
Recommended literature
- 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
Assigned programs
This module is not used in any program.
Master Computer Engineering (focus: Technical Applications)
Miscellaneous
Not specified