TL;DR This lecture will be about deterministic network calculus.
Contact Steffen Bondorf by email if you are interested in taking the lecture.
Distributed systems are omnipresent nowadays and networking them is fundamental for the continuous dissemination and thus availability of data. Provision of data in real- time is one of the most important non-functional aspects that safety-critical networks must guarantee. Formal verification of data communication against worst-case deadline requirements is key to certification of emerging x-by-wire systems. Verification allows aircraft to take off, cars to steer by wire, and safety-critical industrial facilities to oper- ate. Therefore, different methodologies for worst-case modeling and analysis of real-time systems have been established. Among them is deterministic Network Calculus (NC), a versatile technique that is applicable across multiple domains such as packet switching, task scheduling, system on chip, software-defined networking, data center networking and network virtualization. NC is a methodology to derive deterministic bounds on two crucial performance metrics of communication systems:
(a) the end-to-end delay data flows experience and
(b) the buffer space required by a server to queue all incoming data.
___
This course will be in English.
Please note the public course website.
___
This Moodle course's password can be found in the Moodle course "Mathematikstudium-Info" that was created for students of Mathematics at RUB. In case you are not subscribed to that course, please contact the Mathematics studies counseling service (studienberatung-mathe@rub.de).
- Kursleiter/in: Steffen Bondorf