Abstract
Network calculus (NC) offers a framework for worst-case analysis of queueing networks. It enables to derive deterministic bounds on flow delay and server backlog. The continuous evolution of NC led to a set of different analyses. In fact, it even resulted in two entirely different branches of the methodology. Both start with a common network description based on bounding functions on flow arrivals and forwarding service. Anything that follows, i.e., the actual analysis leading to a worst-case performance bound, vastly differs. For long, there was only the algebraic NC, the formalism created as a system theory for communication networks. It matured and eventually seemed to have reached its limits regarding the accuracy of bounds. The problems preventing it from attaining tight bounds in feed-forward networks were overcome with optimization-based analysis. However, this approach was proven NP-hard without an efficient analysis algorithm known for it. Therefore, it was proposed to confine to a less complex optimization-based analysis instead. Like algebraic NC analyses, it derives tight bounds for some networks and valid bounds with varying accuracy for other networks. In this paper, we investigate the consequences of this tradeoff and identify a new and crucial analysis principle that allows us to compare both NC branches more comprehensively than simply ranking delay bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bisti, L., Lenzini, L., Mingozzi, E., Stea, G.: Estimating the worst-case delay in FIFO tandems using network calculus. In: Proceedings of ValueTools (2008)
Bondorf, S., Schmitt, J.B.: The DiscoDNC v2 – a comprehensive tool for deterministic network calculus. In: Proceedings of ValueTools (2014)
Bondorf, S., Schmitt, J.B.: Boosting sensor network calculus by thoroughly bounding cross-traffic. In: Proceedings of IEEE INFOCOM (2015)
Bondorf, S., Schmitt, J.B.: Calculating accurate end-to-end delay bounds - you better know your cross-traffic. In: Proceedings of ValueTools (2015)
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, Heidelberg (2016)
Bouillard, A.: Algorithms and efficiency of network calculus. Habilitation thesis, ENS (2014)
Bouillard, A., Jouhet, L., Thierry, E.: Tight performance bounds in the worst-case analysis of feed-forward networks. In: Proceedings of IEEE INFOCOM (2010)
Boyer, M., Fraboul, C.: Tightening end-to-end delay upper bound for AFDX network calculus with rate latency FIFO servers using network calculus. In: Proceedings of IEEE WFCS (2008)
Boyer, M., Navet, N., Olive, X., Thierry, E.: The PEGASE project: precise and scalable temporal analysis for aerospace communication systems with network calculus. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010, Part I. LNCS, vol. 6415, pp. 122–136. Springer, Heidelberg (2010)
Chang, C.-S.: Performance Guarantees in Communication Networks. Springer, Heidelberg (2000)
Frances, F., Fraboul, C., Grieu, J.: Using Network Calculus to Optimize AFDX Network. In: ERTS (2006)
Geyer, F., Carle, G.: Network engineering for real-time networks: comparison of automotive and aeronautic industries approaches. IEEE Commun. Mag. 54(2), 106–112 (2016)
Grieu, J.: Analyse et évaluation de techniques de commutation Ethernet pour l’interconnexion des systèmes avioniques. Ph.D. thesis, INPT (2004)
Kerschbaum, S., Hielscher, K.-S.J., Klehmet, U., German, R.: A framework for establishing performance guarantees in industrialautomation networks. In: Fischbach, K., Krieger, U.R. (eds.) MMB & DFT 2014. LNCS, vol. 8376, pp. 177–191. Springer, Heidelberg (2014)
Le Boudec, J.-Y., Thiran, P.: Network calculus. In: Thiran, P., Boudec, J.-Y. (eds.) Network Calculus. LNCS, vol. 2050, pp. 3–81. Springer, Heidelberg (2001)
Ruskey, F.: Combinatorial Generation. CRC Press, Boca Raton (2003)
Schmidt, M., Veith, S., Menth, M., Kehrer, S.: DelayLyzer: a tool for analyzing delay bounds in industrial ethernet networks. In: Fischbach, K., Krieger, U.R. (eds.) MMB & DFT 2014. LNCS, vol. 8376, pp. 260–263. Springer, Heidelberg (2014)
Schmitt, J.B., Gollan, N., Bondorf, S., Martinovic, I.: Pay bursts only once holds for (some) non-FIFO Systems. In: Proceedings of IEEE INFOCOM (2011)
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)
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)
Varol, Y.L., Rotem, D.: An algorithm to generate all topological sorting arrangements. Comput. J. 24(1), 83–84 (1981)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Bondorf, S., Schmitt, J.B. (2016). Should Network Calculus Relocate? An Assessment of Current Algebraic and Optimization-Based Analyses. In: Agha, G., Van Houdt, B. (eds) Quantitative Evaluation of Systems. QEST 2016. Lecture Notes in Computer Science(), vol 9826. Springer, Cham. https://doi.org/10.1007/978-3-319-43425-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-43425-4_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-43424-7
Online ISBN: 978-3-319-43425-4
eBook Packages: Computer ScienceComputer Science (R0)