Advertisement

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.

Keywords

Sensor Node Wireless Sensor Network Network Utilization Delay Bound Token Bucket 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    The Disco Deterministic Network Calculator. http://disco.cs.uni-kl.de/index.php/projects/disco-dnc
  2. 2.
    Bondorf, S., Schmitt, J.: Statistical response time bounds in randomly deployed wireless sensor networks. In: Proceedings of IEEE LCN (2010)Google Scholar
  3. 3.
    Bondorf, S., Schmitt, J.: The DiscoDNC v2 - A comprehensive tool for deterministic network calculus. In: Proceedings of ValueTools (2014)Google Scholar
  4. 4.
    Bondorf, S., Schmitt, J.: Boosting sensor network calculus by thoroughly bounding cross-traffic. In: Proceedings of IEEE INFOCOM (2015)Google Scholar
  5. 5.
    Bondorf, S., Schmitt, J.: Calculating accurate end-to-end delay bounds - you better know your cross-traffic. In: Proceedings of ValueTools (2015)Google Scholar
  6. 6.
    Bouillard, A.: Algorithms and efficiency of Network calculus. Habilitation thesis, École Normale Supérieure (2014)Google Scholar
  7. 7.
    Chang, C.-S.: Performance Guarantees in Communication Networks. Springer, London (2000)CrossRefMATHGoogle Scholar
  8. 8.
    Cruz, R.L.: A calculus for network delay, Part I: network elements in isolation. IEEE Trans. Inf. Theor. 37, 114–131 (1991)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Cruz, R.L.: A calculus for network delay, Part II: network analysis. IEEE Trans. Inf. Theor. 37, 132–141 (1991)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Echagüe, J., Cholvi, V.: Tight arrival curve at the output of a work-conserving blind multiplexing server. Informatica 21, 31–40 (2010)MathSciNetMATHGoogle Scholar
  11. 11.
    Fidler, M.: Survey of deterministic and stochastic service curve models in the network calculus. Commun. Surv. Tutorials 12, 59–86 (2010)CrossRefGoogle Scholar
  12. 12.
    Frances, F., Fraboul, C., Grieu, J.: Using network calculus to optimize AFDX network. In: Proceedings of ERTS (2006)Google Scholar
  13. 13.
    Gollan, N., Schmitt, J.: Energy-efficient TDMA design under real-time constraints in wireless sensor networks. In: Proceedings of IEEE/ACM MASCOTS (2007)Google Scholar
  14. 14.
    Le Boudec, J.-Y., Thiran, P.: Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer, Heidelberg (2001)CrossRefMATHGoogle Scholar
  15. 15.
    Maxiaguine, A., Kunzli, S., Chakraborty, S., Thiele, L.: Rate analysis for streaming applications with on-chip buffer constraints. In: Proceedings of ASP-DAC (2004)Google Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    Schmitt, J., Gollan, N., Bondorf, S., Martinovic, I.: Pay bursts only once holds for (some) non-FIFO systems. In Proceedings of IEEE INFOCOM, April 2011Google Scholar
  18. 18.
    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)Google Scholar
  19. 19.
    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)Google Scholar
  20. 20.
    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)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Distributed Computer Systems (DISCO) LabUniversity of KaiserslauternKaiserslauternGermany

Personalised recommendations