Basic knowledge of calculus, linear algebra, functional analysis. Recommended: Scheduling Theory (lecture in summer semester), knowledge of computer networks / queueing systems
Deterministic Network Calculus is a theory for worst-case performance modeling and analysis. Students acquire a deep understanding of its correctness. They learn to interpret the behavior of (data forwarding queueing systems) systems modeled by means of cumulative functions, and to apply (min, plus)-algebraic analysis techniques in a proven, correct way.
Upon successful completion of the course, students are able to prove and apply the DNC techniques for derivation of worst-case performance guarantees.
The course covers fundamental and advanced topics in Deterministic Network Calculus. Topics include (min, plus) algebra, system modeling based on bounding functions describing deterministic traffic policies and service (scheduling) guarantees, transformation of bounding functions to capture worst-case queueing effects, as well as network analysis.
The course is delivered through lectures that discuss mathematical models and proof validity of deterministic bounds in depth. Exercises are designed as problem-solving sessions that extend the lectures and provide students with opportunities deepen their understanding of the underlying theory.