Calculating Accurate End-to-End Delay Bounds - You Better Know Your Cross-Traffic

@article{Bondorf2016CalculatingAE,
  title={Calculating Accurate End-to-End Delay Bounds - You Better Know Your Cross-Traffic},
  author={Steffen Bondorf and Jens B. Schmitt},
  journal={EAI Endorsed Trans. Ubiquitous Environments},
  year={2016},
  volume={3},
  pages={e1}
}
Bounds on the end-to-end delay of data flows play a crucial role in di↵erent areas, ranging from certification of hard real-time communication capabilities to quality of experience assurance for end users. Deterministic Network Calculus (DNC) allows to derive worst-case delay bounds; for instance, DNC is applied by the avionics industry to formally verify aircraft networks against strict delay requirements. Calculating tight end-to-end delays, however, was proven to be NP-hard. As a result… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS
13 Citations
22 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Network Calculus: A Theory of Deterministic Queuing Systems for the Internet

  • J.-Y. Le Boudec, P. Thiran
  • 2001
Highly Influential
16 Excerpts

Experimental Assessment of Timing Verification Techniques for AFDX

  • M. Boyer, N. Navet, M. Fumey
  • In Proc. ERTS,
  • 2012
2 Excerpts

Similar Papers

Loading similar papers…