Deterministic Network Calculus (DNC) can derive upper bounds on message transfer delay as well as the buffer size requirements of servers – two key metrics of safety-critical real-time systems that cannot tolerate violation of predefined deadlines or data being dropped due to buffer overflows.

This project's goal is to improve DNC, in particular its end-to-end analysis capabilities delivering accurate results, and to focus on applicability enhancements for a wide range of systems. Among these are systems with multicast flows, wireless sensor networks, systems best modeled with complex resource descriptions, or the combination thereof. Key aspects are system modeling and understanding the inherent interdependencies between modeling accuracy, analysis complexity, as well as accuracy of performance bounds obtained by DNC. To facilitate this research, we maintain tool support for DNC in the DiscoDNC project.

Related Projects

  • The DISCO Deterministic Network Calculator (DiscoDNC) [www1][www2]
  • Sensor Network Calculus (SeNeCa) [www

Funding Information

This project is funded by the Carl Zeiss Foundation grant of Steffen Bondorf [www].

Members (present and past)

Dr. Steffen Bondorf (project lead)

Alexander Scheffler (undergraduate student; B.Sc. thesis; graduate student (M.Sc.; Ph.D.))
Philipp Schon (graduate student (M.Sc.))

Bruno Oliveira Cattelan (undergraduate exchange student from UFRGS, Brasil; B.Sc. thesis)
Deepak Paramashivam (graduate student (M.Sc.))
Markus Fögen (graduate student (M.Sc.))

Malte Schütze (B.Sc. thesis)
Tobias Jeske (undergraduate student)
Anja Hamscher (B.Sc. thesis)


[12] Cross-Sender Bit-Mixing Coding (Steffen Bondorf, Binbin Chen, Jonathan Scarlett, Haifeng Yu, Yuda Zhao), In CoRR, volume abs/1807.04449, 2018. [bibtex] [pdf]
[11] Deterministic Network Calculus Analysis of Multicast Flows (Steffen Bondorf and Fabien Geyer), In Antonio Puliafito and Kishor S. Trivedi, editors, Systems Modeling: Methodologies and Tools, EAI/Springer Innovations in Communication and Computing. Springer International Publishing, 2018 (to appear).
[10] Catching Corner Cases in Network Calculus – Flow Segregation Can Improve Accuracy (Steffen Bondorf, Paul Nikolaus, Jens B. Schmitt), In Proceedings of the 19th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems (MMB 2018), 2018. [bibtex] [pdf]
[9] Verification of the FAIR Control System using Deterministic Network Calculus (Malte Schütze, Steffen Bondorf, Mathias Kreider), In Proceedings of the 16th International Conference on Accelerator and Large Experimental Physics Control Systems (ICALEPCS 2017), 2017. [bibtex] [pdf]
[8] Iterative Design Space Exploration for Networks Requiring Performance Guarantees (Bruno Cattelan, Steffen Bondorf), In Proceedings of the IEEE/AIAA 36th Digital Avionics Systems Conference (DASC 2017), 2017. [bibtex] [pdf]
[7] The Sensor Network Calculus as Key to the Design of Wireless Sensor Networks with Predictable Performance (Jens Schmitt, Steffen Bondorf, Wint Yi Poe), In Journal of Sensor and Actuator Networks, volume 6, 2017. [bibtex] [pdf] [doi]
[6] Towards Unified Tool Support for Real-time Calculus & Deterministic Network Calculus (Philipp Schon, Steffen Bondorf), In Proceedings of the 29th Euromicro Conference on Real-Time Systems (ECRTS 2017), Work-in-Progress Session, 2017. [bibtex] [pdf]
[5] Quality and Cost of Deterministic Network Calculus – Design and Evaluation of an Accurate and Fast Analysis (Steffen Bondorf, Paul Nikolaus, Jens B. Schmitt), In Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), ACM, volume 1, 2017. [bibtex] [pdf]
[4] Quality and Cost of Deterministic Network Calculus – Design and Evaluation of an Accurate and Fast Analysis (Steffen Bondorf, Paul Nikolaus, Jens B. Schmitt), In Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2017), 2017. [bibtex] [pdf]
[3] Better Bounds by Worse Assumptions – Improving Network Calculus Accuracy by Adding Pessimism to the Network Model (Steffen Bondorf), In Proceedings of the IEEE International Conference on Communications (ICC 2017), 2017. [bibtex] [pdf]
[2] Generalized Finitary Real-Time Calculus (Kai Lampka, Steffen Bondorf, Jens B. Schmitt, Nan Guan, Wang Yi), In Proceedings of the 36th IEEE International Conference on Computer Communications (INFOCOM 2017), 2017. [bibtex] [pdf]
[1] Generalizing Network Calculus Analysis to Derive Performance Guarantees for Multicast Flows (Steffen Bondorf, Fabien Geyer), In Proceedings of the 10th International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2016), 2016. [bibtex] [pdf]

Completed Theses

[3] Large-Scale Numerical Evaluation of Network Calculus Analyses (Anja Hamscher), B.Sc thesis, TU Kaiserslautern, 2018.
[2] Deterministic Performance Analysis of FIFO-multiplexing Feed-forward Networks (Alexander Scheffler), B.Sc. thesis, TU Kaiserslautern, 2017.
[1] Modelling and Analysis of Timing Constraints of an Industrial Control System (Malte Schütze), B.Sc. thesis, TU Kaiserslautern, 2017. 


Worst-Case Analysis of Distributed Systems lecture (WoCADS, 4 ECTS): winter term 2016/17.

In winter term 2017/18, the lecture was given by Dr.-Ing. Kai Lampka (see also publication [2]).

Related Events

WoNeCa-4 - the 4th Workshop on Network Calculus, 28 February 2018 (collocated with GI/ITG MMB 2018).

NetCal 2018 - the 2018 International Workshop on Network Calculus and Applications, 7 September 2018 (collocated with ITC 30).

Go to top