Catching Corner Cases in Network Calculus – Flow Segregation Can Improve Accuracy

  • Steffen BondorfEmail author
  • Paul Nikolaus
  • Jens B. Schmitt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10740)


Worst-case bounds on flow delays are essential for safety-critical systems. Deterministic network calculus is a methodology to compute such bounds. It is actively researched regarding its modeling capabilities as well as analysis accuracy and performance. We provide a contribution to the major part of the analysis: bounding the arrivals of cross flows. In particular, it has been believed that an aggregate view on cross flows outperforms deriving a bound for each cross flow individually. In contrast, we show that the so-called cross-flow segregation, can outperform the aggregation approach under certain conditions. We give a proof of concept, combine the alternative approaches into an analysis computing best bounds, and evaluate accuracy improvements as well as computational effort increases. To that end, we show that flows known to suffer from overly pessimistic delay bounds can see this pessimism reduced by double-digit percentages.


  1. 1.
    Bondorf, S.: Better bounds by worse assumptions - improving network calculus accuracy by adding pessimism to the network model. In: Proceedings of IEEE ICC (2017)Google Scholar
  2. 2.
    Bondorf, S., Nikolaus, P., Schmitt, J.B.: Quality and cost of deterministic network calculus - design and evaluation of an accurate and fast analysis. ACM POMACS 1(1), 16:1–16:34 (2017)Google Scholar
  3. 3.
    Bondorf, S., Schmitt, J.B.: The DiscoDNC v2 - a comprehensive tool for deterministic network calculus. In: Proceedings of EAI ValueTools (2014)Google Scholar
  4. 4.
    Bondorf, S., Schmitt, J.B.: Boosting sensor network calculus by thoroughly bounding cross-traffic. In: Proceedings of IEEE INFOCOM (2015)Google Scholar
  5. 5.
    Bondorf, S., Schmitt, J.B.: Calculating accurate end-to-end delay bounds - You better know your cross-traffic. In: Proceedings of EAI ValueTools (2015)Google Scholar
  6. 6.
    Bondorf, S., Schmitt, J.B.: Improving cross-traffic bounds in feed-forward networks – there is a job for everyone. In: Remke, A., Haverkort, B.R. (eds.) MMB&DFT 2016. LNCS, vol. 9629, pp. 9–24. Springer, Cham (2016). CrossRefGoogle Scholar
  7. 7.
    Bondorf, S., Schmitt, J.B.: Should network calculus relocate? An assessment of current algebraic and optimization-based analyses. In: Agha, G., Van Houdt, B. (eds.) QEST 2016. LNCS, vol. 9826, pp. 207–223. Springer, Cham (2016). CrossRefGoogle Scholar
  8. 8.
    Bouillard, A.: Algorithms and efficiency of network calculus. Habilitation thesis, École Normale Supérieure (2014)Google Scholar
  9. 9.
    Bouillard, A., Jouhet, L., Thierry, E.: Tight performance bounds in the worst-case analysis of feed-forward networks. In: Proceedings of IEEE INFOCOM (2010)Google Scholar
  10. 10.
    Bu, T., Towsley, D.: On distinguishing between internet power law topology generators. In: Proceedings of IEEE INFOCOM (2002)Google Scholar
  11. 11.
    Chang, C.-S.: Performance Guarantees in Communication Networks. Springer, London (2000). CrossRefzbMATHGoogle Scholar
  12. 12.
    Cruz, R.L.: A calculus for network delay, Part I: network elements in isolation. IEEE Trans. Inf. Theory 37(1), 114–131 (1991)CrossRefzbMATHGoogle Scholar
  13. 13.
    Cruz, R.L.: A calculus for network delay, Part II: network analysis. IEEE Trans. Inf. Theory 37(1), 132–141 (1991)CrossRefzbMATHGoogle Scholar
  14. 14.
    Kiefer, A., Gollan, N., Schmitt, J.B.: Searching for Tight Performance Bounds in Feed-Forward Networks. In: Müller-Clostermann, B., Echtle, K., Rathgeb, E.P. (eds.) MMB&DFT 2010. LNCS, vol. 5987, pp. 227–241. Springer, Heidelberg (2010). Google Scholar
  15. 15.
    Le Boudec, J.-Y., Thiran, P. (eds.): Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. LNCS, vol. 2050. Springer, Heidelberg (2001). zbMATHGoogle Scholar
  16. 16.
    Schmitt, J.B., Zdarsky, F.A., Fidler, M.: Delay bounds under arbitrary multiplexing: when network calculus leaves you in the lurch ... In: Proceedings of IEEE INFOCOM (2008)Google Scholar
  17. 17.
    Schmitt, J.B., Zdarsky, F.A., Martinovic, I.: Improving performance bounds in feed-forward networks by paying multiplexing only once. In: Proceedings of GI/ITG MMB (2008)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Steffen Bondorf
    • 1
    Email author
  • Paul Nikolaus
    • 2
  • Jens B. Schmitt
    • 2
  1. 1.National University of Singapore (NUS)SingaporeRepublic of Singapore
  2. 2.Distributed Computer Systems (DISCO) LabTU KaiserslauternKaiserslauternGermany

Personalised recommendations