Document Open Access Logo

Per-Flow Performance Guarantees in Networked Systems with Complex Feedback Structures

Authors Anja Hamscher , Lukas Wildberger , Jens Schmitt

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ECRTS.2025.18.pdf
  • Filesize: 1.16 MB
  • 25 pages
HTML5 Logo HTML (experimental)
LIPIcs.ECRTS.2025.18.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Networks → Network architectures
  • Networks → Network performance evaluation
  • Computer systems organization → Real-time systems
Keywords
  • Real-Time Networks
  • Network Calculus
  • Feedback Control

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Many modern networked real-time systems encompass complex feedback structures and require stringent timing guarantees, especially bounds on the network delay. Network Calculus (NC) is a versatile methodology to compute such performance guarantees per individual flow; in particular, some fundamental results on how to deal with feedback exist. Yet, these are restricted to simple feedback structures and are mostly constrained to an analysis at the aggregate level (not per flow). In our work, we analyze more complex feedback structures than previously investigated by reducing them to canonical structures. We transform these closed-loop systems (with feedback) into open-loop systems (without feedback) and, subsequently, perform a per-flow analysis exploiting very recent NC results on per-flow performance guarantees. In a numerical experiment, we compare our new method to the current state-of-the-art which only allows for an aggregate FIFO analysis. We also compute how feedback constraints need to be allocated to ensure that a feedback system provides the same service as the system without feedback, in a sense providing for an optimal control. Furthermore, we compare different allocation strategies under a fixed budget for the feedback constraints.

Cite As Get BibTex

Anja Hamscher, Lukas Wildberger, and Jens Schmitt. Per-Flow Performance Guarantees in Networked Systems with Complex Feedback Structures. In 37th Euromicro Conference on Real-Time Systems (ECRTS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 335, pp. 18:1-18:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ECRTS.2025.18

Author Details

Anja Hamscher
  • Distributed Computer Systems Lab (DISCO), RPTU Kaiserslautern-Landau, Germany
Lukas Wildberger
  • Distributed Computer Systems Lab (DISCO), RPTU Kaiserslautern-Landau, Germany
Jens Schmitt
  • Distributed Computer Systems Lab (DISCO), RPTU Kaiserslautern-Landau, Germany

References

  1. Rajeev Agrawal, Rene L. Cruz, Clayton Okino, and Rajendran Rajan. Performance bounds for flow control protocols. IEEE/ACM Trans. Netw., 7(3):310-323, 1999. URL: https://doi.org/10.1109/90.779197.
  2. Rajeev Agrawal and Rajendran Rajan. Performance bounds for guaranteed and adaptive services, volume 20649. Citeseer, 1996. Google Scholar
  3. John Baillieul and Panos J. Antsaklis. Control and communication challenges in networked real-time systems. Proc. IEEE, 95(1):9-28, 2007. URL: https://doi.org/10.1109/JPROC.2006.887290.
  4. Mohamed Bakhouya, Suboh A. Suboh, Jaafar Gaber, and Tarek A. El-Ghazawi. Analytical modeling and evaluation of on-chip interconnects using network calculus. In Third International Symposium on Networks-on-Chips, NOCS 2009, May 10-13 2009, La Jolla, CA, USA. Proceedings, pages 74-79. IEEE, IEEE Computer Society, 2009. URL: https://doi.org/10.1109/NOCS.2009.5071447.
  5. Amit Bose, Xiaoyue Jiang, Bin Liu, and Gang Li. Analysis of manufacturing blocking systems with network calculus. Perform. Evaluation, 63(12):1216-1234, 2006. URL: https://doi.org/10.1016/j.peva.2005.12.001.
  6. Jean-Yves Le Boudec and Patrick Thiran. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet, volume 2050 of Lecture Notes in Computer Science. Springer, 2001. URL: https://doi.org/10.1007/3-540-45318-0.
  7. Anne Bouillard, Marc Boyer, and Euriell Le Corronc. Deterministic Network Calculus: From Theory to Practical Implementation. John Wiley & Sons, 2018. Google Scholar
  8. Anne Bouillard, Linh T. X. Phan, and Samarjit Chakraborty. Lightweight modeling of complex state dependencies in stream processing systems. In 15th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2009, San Francisco, CA, USA, 13-16 April 2009, pages 195-204. IEEE, IEEE Computer Society, 2009. URL: https://doi.org/10.1109/RTAS.2009.27.
  9. Marc Boyer, Amaury Graillat, Benoît Dupont de Dinechin, and Jörn Migge. Bounding the delays of the MPPA network-on-chip with network calculus: Models and benchmarks. Perform. Evaluation, 143:102-124, 2020. URL: https://doi.org/10.1016/j.peva.2020.102124.
  10. Alexandre Brandwajn and Yung-Li Lily Jow. An approximation method for tandem queues with blocking. Oper. Res., 36(1):73-83, 1988. URL: https://doi.org/10.1287/opre.36.1.73.
  11. John A. Buzacott and J. George Shanthikumar. Stochastic models of manufacturing systems. Prentice Hall Englewood Cliffs, 1993. Google Scholar
  12. Cheng-Shang Chang. Performance Guarantees in Communication Networks. Telecommunication Networks and Computer Systems. Springer, 2000. URL: https://doi.org/10.1007/978-1-4471-0459-9.
  13. Martijn Coenen, Srinivasan Murali, Andrei Radulescu, Kees Goossens, and Giovanni De Micheli. A buffer-sizing algorithm for networks on chip using TDMA and credit-based end-to-end flow control. In Reinaldo A. Bergamaschi and Kiyoung Choi, editors, Proceedings of the 4th International Conference on Hardware/Software Codesign and System Synthesis, CODES+ISSS 2006, Seoul, Korea, October 22-25, 2006, pages 130-135. ACM, 2006. URL: https://doi.org/10.1145/1176254.1176287.
  14. Rene L. Cruz. A calculus for network delay, part I: network elements in isolation. IEEE Trans. Inf. Theory, 37(1):114-131, 1991. URL: https://doi.org/10.1109/18.61109.
  15. Rene L. Cruz. A calculus for network delay, part II: network analysis. IEEE Trans. Inf. Theory, 37(1):132-141, 1991. URL: https://doi.org/10.1109/18.61110.
  16. Rene L Cruz and CM Okino. Service guarantees for window flow control. In Proceedings of the Annual Allerton Conference on Communication Control and Computing, volume 34, pages 10-21. Citeseer, 1996. Google Scholar
  17. Sahar Foroutan, Yvain Thonnart, Richard Hersemeule, and Ahmed Jerraya. Analytical computation of packet latency in a 2d-mesh noc. In Joint IEEE North-East Workshop on Circuits and Systems and TAISA Conference, pages 1-4. IEEE, 2009. Google Scholar
  18. Wei-Jing Guan, Wei Kang Tsai, and Douglas M. Blough. An analytical model for wormhole routing in multicomputer interconnection networks. In The Seventh International Parallel Processing Symposium, Proceedings, Newport Beach, California, USA, April 13-16, 1993, pages 650-654. IEEE, IEEE Computer Society, 1993. URL: https://doi.org/10.1109/IPPS.1993.262804.
  19. Anja Hamscher, Vlad-Cristian Constantin, and Jens B. Schmitt. Extending network calculus to deal with min-plus service curves in multiple flow scenarios. In 30th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2024, Hong Kong, May 13-16, 2024, pages 95-107. IEEE, IEEE, 2024. URL: https://doi.org/10.1109/RTAS61025.2024.00016.
  20. Jingcao Hu, Ümit Y. Ogras, and Radu Marculescu. System-level buffer allocation for application-specific networks-on-chip router design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 25(12):2919-2933, 2006. URL: https://doi.org/10.1109/TCAD.2006.882474.
  21. Manjunath Kamath and N. Viswanadham. Applications of petri net based models in the modelling and analysis of flexible manufacturing systems. In Proceedings of the 1986 IEEE International Conference on Robotics and Automation, San Francisco, California, USA, April 7-10, 1986, volume 3, pages 312-317. IEEE, IEEE, 1986. URL: https://doi.org/10.1109/ROBOT.1986.1087700.
  22. Abbas Eslami Kiasari, Zhonghai Lu, and Axel Jantsch. An analytical latency model for networks-on-chip. IEEE Trans. Very Large Scale Integr. Syst., 21(1):113-123, 2013. URL: https://doi.org/10.1109/TVLSI.2011.2178620.
  23. Y. Koren, U. Heisel, F. Jovane, T. Moriwaki, G. Pritschow, G. Ulsoy, and H. Van Brussel. Reconfigurable manufacturing systems. CIRP Annals, 48(2):527-540, 1999. Google Scholar
  24. Shashi Kumar, Axel Jantsch, Mikael Millberg, Johnny Öberg, Juha-Pekka Soininen, Martti Forsell, Kari Tiensyrjä, and Ahmed Hemani. A network on chip architecture and design methodology. In 2002 IEEE Computer Society Annual Symposium on VLSI (ISVLSI 2002), 25-26 April 2002, Pittsburgh, PA, USA, pages 117-124. IEEE, IEEE Computer Society, 2002. URL: https://doi.org/10.1109/ISVLSI.2002.1016885.
  25. Jean-Yves Le Boudec. Rate adaptation, congestion control and fairness: A tutorial. Web page, November, 4, 2005. Google Scholar
  26. Zhonghai Lu, Mikael Millberg, Axel Jantsch, Alistair C. Bruce, Pieter van der Wolf, and Tomas Henriksson. Flow regulation for on-chip communication. In Luca Benini, Giovanni De Micheli, Bashir M. Al-Hashimi, and Wolfgang Müller, editors, Design, Automation and Test in Europe, DATE 2009, Nice, France, April 20-24, 2009, pages 578-581. IEEE, IEEE, 2009. URL: https://doi.org/10.1109/DATE.2009.5090731.
  27. Milos Panic, Carles Hernández, Eduardo Quiñones, Jaume Abella, and Francisco J. Cazorla. Modeling high-performance wormhole nocs for critical real-time embedded systems. In 2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), Vienna, Austria, April 11-14, 2016, pages 267-278. IEEE, IEEE Computer Society, 2016. URL: https://doi.org/10.1109/RTAS.2016.7461342.
  28. HT Papadopolous, Cathal Heavey, and Jimmie Browne. Queueing theory in manufacturing systems analysis and design. Chapman and Hall, 1993. Google Scholar
  29. Chrissoleon T. Papadopoulos, Jingshan Li, and Michael E. J. O'Kelly. A classification and review of timed markov models of manufacturing systems. Computers & Industrial Engineering, 128:219-244, 2019. URL: https://doi.org/10.1016/j.cie.2018.12.019.
  30. Yue Qian, Zhonghai Lu, and Wenhua Dou. Analysis of worst-case delay bounds for best-effort communication in wormhole networks on chip. In Third International Symposium on Networks-on-Chips, NOCS 2009, May 10-13 2009, La Jolla, CA, USA. Proceedings, pages 44-53. IEEE, IEEE Computer Society, 2009. URL: https://doi.org/10.1109/NOCS.2009.5071444.
  31. Pierre Roux, Sophie Quinton, and Marc Boyer. A formal link between response time analysis and network calculus. In Martina Maggio, editor, 34th Euromicro Conference on Real-Time Systems, ECRTS 2022, July 5-8, 2022, Modena, Italy, volume 231 of LIPIcs, pages 5:1-5:22, Modene, Italy, July 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ECRTS.2022.5.
  32. Jens B. Schmitt, Frank A. Zdarsky, and Markus Fidler. Delay bounds under arbitrary multiplexing: When network calculus leaves you in the lurch. In INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13-18 April 2008, Phoenix, AZ, USA, pages 1669-1677. IEEE, IEEE, 2008. URL: https://doi.org/10.1109/INFOCOM.2008.228.
  33. Jens B. Schmitt, Frank A. Zdarsky, and Ivan Martinovic. Improving performance bounds in feed-forward networks by paying multiplexing only once. In Falko Bause and Peter Buchholz, editors, Proceedings 14th GI/ITG Conference on Measurement, Modelling and Evaluation of Computer and Communication Systems (MMB 2008), March 31 - April 2, 2008, Dortmund, Germany, pages 13-28. VDE, VDE Verlag, 2008. Google Scholar
  34. Zheng Shi and Alan Burns. Real-time communication analysis for on-chip networks with wormhole switching. In Second International Symposium on Networks-on-Chips, NOCS 2008, 5-6 April 2008, Newcastle University, UK. Proceedings, pages 161-170. IEEE, IEEE Computer Society, 2008. URL: https://doi.org/10.1109/NOCS.2008.11.
  35. Sundararajan Sriram and Shuvra S Bhattacharyya. Embedded Multiprocessors: Scheduling and Synchronization, Second Edition. CRC press, 2009. Google Scholar
  36. Lothar Thiele, Samarjit Chakraborty, and Martin Naedele. Real-time calculus for scheduling hard real-time systems. In IEEE International Symposium on Circuits and Systems, ISCAS 2000, Emerging Technologies for the 21st Century, Geneva, Switzerland, 28-31 May 2000, Proceedings, volume 4, pages 101-104. IEEE, IEEE, 2000. URL: https://doi.org/10.1109/ISCAS.2000.858698.
  37. Lothar Thiele and Nikolay Stoimenov. Modular performance analysis of cyclic dataflow graphs. In Samarjit Chakraborty and Nicolas Halbwachs, editors, Proceedings of the 9th ACM & IEEE International conference on Embedded software, EMSOFT 2009, Grenoble, France, October 12-16, 2009, pages 127-136. ACM, 2009. URL: https://doi.org/10.1145/1629335.1629353.
  38. Fatih Tüysüz and Cengiz Kahraman. Modeling a flexible manufacturing cell using stochastic petri nets with fuzzy parameters. Expert Syst. Appl., 37(5):3910-3920, 2010. URL: https://doi.org/10.1016/j.eswa.2009.11.026.
  39. Raffaele Zippo and Giovanni Stea. Nancy: an efficient parallel network calculus library. SoftwareX, 19:101178, 2022. URL: https://doi.org/10.1016/j.softx.2022.101178.
  40. Raffaele Zippo and Giovanni Stea. Computationally efficient worst-case analysis of flow-controlled networks with network calculus. IEEE Transactions on Information Theory, 69(4):2664-2690, 2023. URL: https://doi.org/10.1109/TIT.2023.3244276.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact