Network Calculus
NetworkCalculus.org DNC (NCorg DNC) [GitHub]
Deterministic Network Calculus is a methodology for worst-case modeling and analysis of communication networks. It enables to derive deterministic bounds on a server’s backlog as well as a flow’s end-to-end delay. Given a directed graph of servers (server graph) and the flows crossing these servers, the Deterministic Network Calculator (DNC) automates the derivation of bounds.
Workshop on Network Calculus (WoNeCa)
Network calculus is a versatile methodology for the queueing analysis of resource-sharing systems. It can deal with problems that are fundamentally hard for alternative methodologies, using bounds rather than striving for exact solutions. The high modeling power of network calculus has been used in several important network engineering applications such as time sensitive networks, wireless sensor networks and Systems-on-Chip.
The goal of this workshop is to bring together researchers with an interest in the theory of network calculus as well as those who want to apply existing results in new applications. The workshop will serve to promote the network calculus theory to researchers with an interest in applied queueing models for data communication.
WoNeCa and Related Events:
- WoNeCa-7 (2025) in Trondheim, Norway
- Dagstuhl-Seminar 24141 (2024) in Wadern, Germany
- WoNeCa-6 (2022) in Lausanne, Switzerland
- WoNeCa-5 (2020) in Cyberspace
- Workshop on Network Calculus and Applications (2018) in Vienna, Austria
- WoNeCa-4 (2018) in Erlangen, Germany
- WoNeCa-3 (2016) in Münster, Germany
- Dagstuhl-Seminar 15112 (2015) in Wadern, Germany
- WoNeCa-2 (2014) in Bamberg, Germany
- WoNeCa-1 (2012) in Kaiserslautern, Germany