Search Results

Documents authored by Bondorf, Steffen

Artifact
Software
DOI: 10.4230/artifacts.26764
NetworkCalculus.org Deterministic Network Calculator (NCorg DNC)

Authors: Wlad Pesotsky and Steffen Bondorf

Abstract
Cite as

Wlad Pesotsky, Steffen Bondorf. NetworkCalculus.org Deterministic Network Calculator (NCorg DNC) (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-26764,
   title = {{NetworkCalculus.org Deterministic Network Calculator (NCorg DNC)}}, 
   author = {Pesotsky, Wlad and Bondorf, Steffen},
   note = {Software, version 3.0.0. (visited on 2026-07-02)},
   url = {https://github.com/NetCal/DNC},
   doi = {10.4230/artifacts.26764},
}
Document
DOI: 10.4230/LIPIcs.ECRTS.2026.6
Automated and Precise Deterministic NetCal Calculations from Models to Bounds

Authors: Wlad Pesotsky, Eric Hermsen, and Steffen Bondorf

Published in: LIPIcs, Volume 375, 38th European Conference on Real-Time Systems (ECRTS 2026)

Abstract
The deterministic variant of Network Calculus (NetCal, NC) enables for calculating worst-case performance guarantees in communication networks. We present the NetworkCalculus.org Deterministic Network Calculator (NCorg DNC), a tool for Deterministic Network Calculus (DNC) that extends the previous DiscoDNC by significantly enhancing its capabilities for modeling and analysis of real-world applications. The tool offers a new end-to-end solution: Starting from the prevalent model of a full-duplex Ethernet-like networks with output queueing, the NCorg DNC offers automated conversion to its DNC model as well as application of state-of-the-research DNC analysis methods to derive worst-case delay bounds. Another significant step forward are new numerical capabilities that can model and analyze, among others, discrete data arrivals as well as service. While we enhance features and capabilities, we keep the cost in terms of tool runtimes at bay. Our numerical evaluation showcases improved performance bounding w.r.t to previous DiscoDNC results and a comparative experimental tool performance study quantifying the computational impact of the added functionality. Overall, the NCorgDNC provides a more versatile and extensible foundation for deterministic performance analysis in modern networked systems.
Cite as

Wlad Pesotsky, Eric Hermsen, and Steffen Bondorf. Automated and Precise Deterministic NetCal Calculations from Models to Bounds. In 38th European Conference on Real-Time Systems (ECRTS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 375, pp. 6:1-6:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{pesotsky_et_al:LIPIcs.ECRTS.2026.6,
  author =	{Pesotsky, Wlad and Hermsen, Eric and Bondorf, Steffen},
  title =	{{Automated and Precise Deterministic NetCal Calculations from Models to Bounds}},
  booktitle =	{38th European Conference on Real-Time Systems (ECRTS 2026)},
  pages =	{6:1--6:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-429-1},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{375},
  editor =	{Kritikakou, Angeliki},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2026.6},
  URN =		{urn:nbn:de:0030-drops-265986},
  doi =		{10.4230/LIPIcs.ECRTS.2026.6},
  annote =	{Keywords: Network Calculus, Real-Time Systems}
}
Document
DOI: 10.4230/DagRep.14.4.1
Network Calculus (Dagstuhl Seminar 24141)

Authors: Steffen Bondorf, Anne Bouillard, Markus Fidler, Jörg Liebeherr, and Lisa Maile

Published in: Dagstuhl Reports, Volume 14, Issue 4 (2024)

Abstract
Network calculus is a versatile method for analysing queueing systems with applications in Internet Quality of Service (QoS), wireless networks, Ethernet with delay guarantees, real-time systems, and feedback control. Using min-plus or max-plus algebra and deterministic or stochastic bounds, this Dagstuhl Seminar aims to bring together the deterministic and stochastic network calculus community to discuss recent research, future directions, and collaboration. The modelling power of network calculus allows it to represent different systems, making it applicable to a wide variety of queueing problems. Thus, it has been proposed in various contexts for new emerging technologies such as IEEE Time Sensitive Networking (TSN), IETF Deterministic Networking (DetNet), and 5G Ultra-Reliable Low Latency Communications (URLLC), with important applications in factory automation, aerospace onboard, and automotive in-vehicle networks. The two communities of deterministic and stochastic network calculus have grown closer in recent years, for example, as deterministic network calculus results have been incorporated into stochastic network calculus, demonstrating the need for and value of strong collaboration between the communities. Recent developments in network calculus algorithms include modular and optimisation approaches, parallelizable methods that improve performance bounds, machine learning techniques, but also the adaptation of network calculus for design automation and system configuration. This report documents the programme, the new contributions, and the results of Dagstuhl Seminar 24141 "Network Calculus".
Cite as

Steffen Bondorf, Anne Bouillard, Markus Fidler, Jörg Liebeherr, and Lisa Maile. Network Calculus (Dagstuhl Seminar 24141). In Dagstuhl Reports, Volume 14, Issue 4, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{bondorf_et_al:DagRep.14.4.1,
  author =	{Bondorf, Steffen and Bouillard, Anne and Fidler, Markus and Liebeherr, J\"{o}rg and Maile, Lisa},
  title =	{{Network Calculus (Dagstuhl Seminar 24141)}},
  pages =	{1--22},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2024},
  volume =	{14},
  number =	{4},
  editor =	{Bondorf, Steffen and Bouillard, Anne and Fidler, Markus and Liebeherr, J\"{o}rg and Maile, Lisa},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.4.1},
  URN =		{urn:nbn:de:0030-drops-213558},
  doi =		{10.4230/DagRep.14.4.1},
  annote =	{Keywords: age of information, effective bandwidths, network calculus, performance evaluation, queueing network}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact