Delay Bounds in Feed-Forward Networks - A Fast and Accurate Network Calculus Solution

@article{Bondorf2016DelayBI,
  title={Delay Bounds in Feed-Forward Networks - A Fast and Accurate Network Calculus Solution},
  author={Steffen Bondorf and Paul Nikolaus and Jens B. Schmitt},
  journal={CoRR},
  year={2016},
  volume={abs/1603.02094}
}
Networks are integral parts of modern safety-critical systems and certification demands the provision of guarantees for data transmissions. Deterministic Network Calculus (DNC) can compute a worst-case bound on a data flow’s end-to-end delay. Accuracy of DNC results has been improved steadily, resulting in two DNC branches: the classical algebraic analysis and the more recent optimization-based analysis. The optimization-based branch provides a theoretical solution for tight bounds. Its… CONTINUE READING
  • GitHub repos referencing this paper

  • Presentations referencing similar topics