Skip to main content
Toggle Dark/Light/Auto mode Toggle Dark/Light/Auto mode Toggle Dark/Light/Auto mode Back to homepage

Deterministic Network Calculus (DNC)

  • Audience: M.Sc., advanced
  • Language of Instruction: English
  • Hours: 4 SWS (lecture) + 2 SWS (exercise)
  • Credits: 9 CP

Contents

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.

Precognitions

Strongly Recommended:
Basic knowledge of calculus, linear algebra, functional analysis.

Recommended:
Scheduling Theory (lecture in summer semester), knowledge of computer networks / queueing systems

Learning goals

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.

Teaching Methods

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.

Literature

  • Francois Baccelli, Guy Cohen, Geert Jan Olsder and Jean-Pierre Quadrat. Synchronization and Linearity - An Algebra for Discrete Event Systems. Wiley, 1992.
  • Jean-Yves Le Boudec and Patrick Thiran. Network Calculus. Springer, 2001. (PDF@author)
  • Cheng-Shang Chang. Performance Guarantees in Communication Networks. Springer, 2000.
  • Anne Bouillard, Marc Boyer and Euriell Le Corronc. Deterministic Network - Calculus From Theory to Practical Implementation. Wiley, 2018.
  • Jörg Liebeherr. Duality of the Max-Plus and Min-Plus Network Calculus. Foundation and Trends in Networking, 2017. (PDF@author)