General Framework for Routing, Scheduling and Formal Timing Analysis in Deterministic Time-Aware Networks

Authors Anaïs Finzi, Ramon Serna Oliver

Thumbnail PDF


  • Filesize: 0.87 MB
  • 23 pages

Document Identifiers

Author Details

Anaïs Finzi
  • TTTech Computertechnik AG, Wien, Austria
Ramon Serna Oliver
  • TTTech Computertechnik AG, Wien, Austria

Cite AsGet BibTex

Anaïs Finzi and Ramon Serna Oliver. General Framework for Routing, Scheduling and Formal Timing Analysis in Deterministic Time-Aware Networks. In 34th Euromicro Conference on Real-Time Systems (ECRTS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 231, pp. 8:1-8:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


In deterministic time-aware networks, such as TTEthernet (TTE) and Time Sensitive Networking (TSN), time-triggered (TT) communication are often routed and scheduled without taking into account other critical traffic such as Rate-Constrained (RC) traffic. Consequently, the impact of a static transmission schedule for TT traffic can prevent RC traffic from fulfilling their timing constraints. In this paper, we present a general framework for routing, scheduling and formal timing analysis (FTA) in deterministic time-aware networks (e.g. TSN, TTE). The general framework drives an iterative execution of different modules (i.e. routing, scheduling and FTA) searching for a solution that fulfills an arbitrary number of defined constraints (e.g. maximum end-to-end RC and TT latency) and optimization goals (e.g. minimize reception jitter). The result is an iteratively improved solution including the routing configuration for TT and RC flows, the static TT schedule, a formal analysis for the RC traffic, as well as any additional outputs satisfying user constraints (e.g. maximum RC jitter). We then do a performance evaluation of the general framework, with a proposed implementation of the necessary modules for TTEthernet networks with mixed time-triggered and rate-constrained traffic. The evaluation of our studied realistic use case shows that, using the general framework, the end-to-end latency for RC traffic can be reduced up to 28.3%, and the number of flows not fulfilling their deadlines divided by up to 3 compared to existing methods.

Subject Classification

ACM Subject Classification
  • Networks → Network performance evaluation
  • TSN
  • TTEthernet
  • AFDX
  • AVB
  • Modeling
  • Routing
  • Scheduling
  • Formal timing analysis
  • Worst-case analysis
  • Performance evaluation


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


  1. AEEC. ARINC PROJECT PAPER 664, AIRCRAFT DATA NETWORKS, PART7, AFDX NETWORK (DRAFT). AERONAUTIC RADIO, INC., 2551 Riva Road, Annapolis, Maryland 21401-7465, November 2003. Google Scholar
  2. Moses Charikar, Chandra Chekuri, To-yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, and Ming Li. Approximation algorithms for directed steiner problems. Journal of Algorithms, 33(1):73-91, 1999. Google Scholar
  3. Silviu S. Craciunas, Ramon Serna Oliver, Martin Chmelik, and Wilfried Steiner. Scheduling real-time communication in IEEE 802.1Qbv Time Sensitive Networks. In 24th International Conference on Real-Time Networks and Systems (RTNS). ACM, 2016. Google Scholar
  4. J. Diemer, D. Thiele, and R. Ernst. Formal worst-case timing analysis of Ethernet topologies with strict-priority and AVB switching. In Proc. International Symposium on Industrial Embedded Systems (SIES). IEEE Computer Society, 2012. Google Scholar
  5. Frank Dürr and Naresh Ganesh Nayak. No-wait packet scheduling for IEEE Time-sensitive Networks (TSN). In Proc. RTNS. ACM, 2016. Google Scholar
  6. Jonathan Falk, Frank Dürr, and Kurt Rothermel. Exploring practical limitations of joint routing and scheduling for TSN with ILP. In 2018 IEEE 24th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), pages 136-146. IEEE, 2018. Google Scholar
  7. Anaïs Finzi and Silviu S. Craciunas. Integration of SMT-based scheduling with RC network calculus analysis in TTEthernet networks. In 2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), pages 192-199. IEEE, 2019. Google Scholar
  8. Fabrice Frances, Christian Fraboul, and Jérôme Grieu. Using network calculus to optimize the AFDX network. In Embeeded Real Time Software and Systems (ERTS), 2006. Google Scholar
  9. Voica Gavriluţ, Luxi Zhao, Michael L Raagaard, and Paul Pop. AVB-aware routing and scheduling of time-triggered traffic for TSN. Ieee Access, 6:75229-75243, 2018. Google Scholar
  10. Jérôme Grieu. Analyse et évaluation de techniques de commutation Ethernet pour l'interconnexion des systèmes avioniques. PhD thesis, INPT, 2004. Google Scholar
  11. Institute of Electrical and Electronics Engineers, Inc. Time-Sensitive Networking Task Group., 2016. retrieved 30-Nov-2020.
  12. Issuing Committee: As-2d2 Deterministic Ethernet And Unified Networking. SAE AS6802 Time-Triggered Ethernet., 2011. retrieved 30-Nov-2020.
  13. JGraphT team and contributors. JGraphT, September 2016. version: 1.0.0. URL:
  14. J.Y. Le Boudec and P. Thiran. Network calculus: a theory of deterministic queuing systems for the Internet, chapter 1, pages 3-81. Springer-Verlag, 2001. Google Scholar
  15. Dimitrios Michail, Joris Kinable, Barak Naveh, and John V. Sichi. JGraphT—A Java Library for Graph Data Structures and Algorithms. ACM Trans. Math. Softw., 46(2), May 2020. Google Scholar
  16. M Paulitsch, E Schmidt, B Gstottenbauer, C Scherrer, and Kantz H. Time-triggered communication (industrial applications). Time-Triggered Communication, pages 121-152, 2011. Google Scholar
  17. Eike Schweissguth, Peter Danielis, Dirk Timmermann, Helge Parzyjegla, and Gero Mühl. ILP-based joint routing and scheduling for time-triggered networks. In Proceedings of the 25th International Conference on Real-Time Networks and Systems, pages 8-17, 2017. Google Scholar
  18. Ramon Serna Oliver, Silviu S. Craciunas, and Wilfried Steiner. IEEE 802.1Qbv gate control list synthesis using array theory encoding. In Proc. Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE, 2018. Google Scholar
  19. Wilfried Steiner. An evaluation of SMT-based schedule synthesis for time-triggered multi-hop networks. In Proc. RTSS. IEEE, 2010. Google Scholar
  20. Wilfried Steiner, Günther Bauer, Brendan Hall, and Michael Paulitsch. TTEthernet: Time-Triggered Ethernet. In Roman Obermaisser, editor, Time-Triggered Communication. CRC Press, August 2011. Google Scholar
  21. Domiţian Tămaş-Selicean, Paul Pop, and Wilfried Steiner. Synthesis of communication schedules for TTEthernet-based mixed-criticality systems. In Proc. CODES+ISSS. ACM, 2012. Google Scholar
  22. Domiţian Tămaş-Selicean, Paul Pop, and Wilfried Steiner. Synthesis of communication schedules for TTEthernet-based mixed-criticality systems. In Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis, pages 473-482, 2012. Google Scholar
  23. Domiţian Tămaş-Selicean, Paul Pop, and Wilfried Steiner. Design optimization of TTEthernet-based distributed real-time systems. Real-Time Systems, 51(1):1-35, 2015. Google Scholar
  24. Daniel Thiele, Philip Axer, and Rolf Ernst. Improving formal timing analysis of switched Ethernet by exploiting FIFO scheduling. In Proceedings of the 52nd Annual Design Automation Conference, page 41. ACM, 2015. Google Scholar
  25. Qinghan Yu and Ming Gu. Adaptive group routing and scheduling in multicast time-sensitive networks. IEEE Access, 8:37855-37865, 2020. Google Scholar
  26. Luxi Zhao, Paul Pop, Qiao Li, Junyan Chen, and Huagang Xiong. Timing analysis of rate-constrained traffic in TTEthernet using network calculus. Real-Time Systems, 53(2):254-287, 2017. Google Scholar
  27. Zhong Zheng, Feng He, and Huagang Xiong. Routing optimization of Time-Triggered Ethernet based on genetic algorithm. In 2020 AIAA/IEEE 39th Digital Avionics Systems Conference (DASC), pages 1-8. IEEE, 2020. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail