Abstract
Network calculus provides a mathematical framework for deterministically bounding backlog and delay in packet-switched networks. The analysis is compositional and proceeds in several steps. In the first step, a general feed-forward network is reduced to a tandem of servers lying on the path of the flow of interest. This requires to derive bounds on the cross-traffic for that flow. Tight bounds on cross-traffic are crucial for the overall analysis to obtain tight performance bounds. In this paper, we contribute an improvement on this first bounding step in a network calculus analysis. This improvement is based on the so-called total flow analysis (TFA), which so far saw little usage as it is known to be inferior to other methods for the overall delay analysis. Yet, in this work we show that TFA actually can bring significant benefits in bounding the burstiness of cross-traffic. We investigate analytically and numerically when these benefits actually occur and show that they can be considerable with several flows’ delays being improved by more than 40 % compared to existing methods – thus giving TFA’s existence a purpose finally.
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
The Disco Deterministic Network Calculator. http://disco.cs.uni-kl.de/index.php/projects/disco-dnc
Bondorf, S., Schmitt, J.: Statistical response time bounds in randomly deployed wireless sensor networks. In: Proceedings of IEEE LCN (2010)
Bondorf, S., Schmitt, J.: The DiscoDNC v2 - A comprehensive tool for deterministic network calculus. In: Proceedings of ValueTools (2014)
Bondorf, S., Schmitt, J.: Boosting sensor network calculus by thoroughly bounding cross-traffic. In: Proceedings of IEEE INFOCOM (2015)
Bondorf, S., Schmitt, J.: Calculating accurate end-to-end delay bounds - you better know your cross-traffic. In: Proceedings of ValueTools (2015)
Bouillard, A.: Algorithms and efficiency of Network calculus. Habilitation thesis, École Normale Supérieure (2014)
Chang, C.-S.: Performance Guarantees in Communication Networks. Springer, London (2000)
Cruz, R.L.: A calculus for network delay, Part I: network elements in isolation. IEEE Trans. Inf. Theor. 37, 114–131 (1991)
Cruz, R.L.: A calculus for network delay, Part II: network analysis. IEEE Trans. Inf. Theor. 37, 132–141 (1991)
Echagüe, J., Cholvi, V.: Tight arrival curve at the output of a work-conserving blind multiplexing server. Informatica 21, 31–40 (2010)
Fidler, M.: Survey of deterministic and stochastic service curve models in the network calculus. Commun. Surv. Tutorials 12, 59–86 (2010)
Frances, F., Fraboul, C., Grieu, J.: Using network calculus to optimize AFDX network. In: Proceedings of ERTS (2006)
Gollan, N., Schmitt, J.: Energy-efficient TDMA design under real-time constraints in wireless sensor networks. In: Proceedings of IEEE/ACM MASCOTS (2007)
Le Boudec, J.-Y., Thiran, P.: Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer, Heidelberg (2001)
Maxiaguine, A., Kunzli, S., Chakraborty, S., Thiele, L.: Rate analysis for streaming applications with on-chip buffer constraints. In: Proceedings of ASP-DAC (2004)
Perathoner, S., Rein, T., Thiele, L., Lampka, K., Rox, J.: Modeling structured event streams in system level performance analysis. In: Proceedings of ACM LCTES (2010)
Schmitt, J., Gollan, N., Bondorf, S., Martinovic, I.: Pay bursts only once holds for (some) non-FIFO systems. In Proceedings of IEEE INFOCOM, April 2011
Schmitt, J., Zdarsky, F., Thiele, L.: A comprehensive worst-case calculus for wireless sensor networks with in-network processing. In: Proceedings of IEEE RTSS (2007)
Thiele, L., Chakraborty, S., Gries, M., Künzli, S.: Design space exploration of network processor architectures. In: Network Processor Design: Issues and Practices. Morgan Kaufmann Publishers (2002)
Zhu, T., Tumanov, A., Kozuch, M., Harchol-Balter, M., Ganger, G.: PriorityMeister: tail latency QoS for shared networked storage. In: Proceedings of ACM SOCC (2014)
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. (2016). Improving Cross-Traffic Bounds in Feed-Forward Networks – There is a Job for Everyone. In: Remke, A., Haverkort, B.R. (eds) Measurement, Modelling and Evaluation of Dependable Computer and Communication Systems. MMB&DFT 2016. Lecture Notes in Computer Science(), vol 9629. Springer, Cham. https://doi.org/10.1007/978-3-319-31559-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-31559-1_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31558-4
Online ISBN: 978-3-319-31559-1
eBook Packages: Computer ScienceComputer Science (R0)