Deterministic Network Calculus (DNC) 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 Disco Deterministic Network Calculator (DiscoDNC) automates the derivation of bounds.

We provide a Java implementation of the three most common network calculus analyses:

  • Total Flow Analysis (TFA)
    • This analysis derives server-local bounds for delay and backlog along the analyzed flow’s path.
    • The flow’s end-to-end delay bound is computed by summing up the individual delays on its path.
  • Separated Flow Analysis (SFA) and Pay Multiplexing Only Once (PMOO) Analysis
    • These analyses derive the analyzed flow’s end-to-end delay bound as well as its end-to-end backlog bound (maximum amount of data in transit).
    • The bounds compete against each other, i.e., each analysis can outperform the other, depending on the network setting.
    • Flow delay bounds derived by the SFA or the PMOO Analysis are more accurate than the TFA bounds.
    • Server-local bounds are not derived by these analyses.

In version 2 of the DiscoDNC, we focussed on stability, performance and extensibility of the provided analyses.

If you encounter any problem or if you have questions, please contact Steffen Bondorf.

General Information

  • The current version of our tool is: 2.4.0 “Chimera” (2018-Mar-18). (JavaDocsDownload and Changelog)
  • We are on GitHub
  • You can also follow us on Twitter to stay up to date!
  • For feedback, questions, etc., please contact Steffen Bondorf.
  • If you use the Disco Deterministic Network Calculator for research, please include the following reference in any resulting publication.
         DiscoDNC.bib
    If you let us know of your work we will also tweet about it!

See also: