skip to main content
research-article

Traffic-type Assignment for TSN-based Mixed-criticality Cyber-physical Systems

Published:21 January 2020Publication History
Skip Abstract Section

Abstract

This article focuses on mixed-criticality applications with functions that have different timing requirements, i.e., hard real-time (HRT), soft real-time (SRT), and functions that are not time-critical (NC). The applications are implemented on distributed cyber-physical systems that use IEEE Time-sensitive Networking (TSN). TSN is the product of an IEEE effort to bring deterministic real-time capabilities to IEEE 802.3 Ethernet. TSN supports the convergence of multiple traffic types, i.e., critical, real-time, and regular “best-effort” traffic within a single network: Time-triggered (TT), where the messages are transmitted based on static schedule tables, Audio-video Bridging (AVB), for dynamically scheduled messages with a guaranteed bandwidth and bounded delays, and Best Effort (BE), for which no timing guarantees are provided. The HRT messages have deadlines, whereas we capture the quality-of-service for the SRT messages using “utility functions.” Given the network topology, the set of application messages, including their routing, and the set of available AVB classes, we are interested in determining the traffic type of each message, such that all the HRT messages are schedulable and the total utility for the SRT messages is maximized. We propose a Tabu Search-based metaheuristic to solve this optimization problem. The proposed proof-of-concept tool has been evaluated using several benchmarks, including two realistic test cases.

References

  1. Aeronautical Radio, Inc. 2009. ARINC 664P7: Aircraft Data Network, Part 7, Avionics Full-Duplex Switched Ethernet Network.Google ScholarGoogle Scholar
  2. AVB Task Group. 2011. IEEE 802.1ba/D2.5: Audio Video Bridging (AVB) Systems. Retrieved from http://www.ieee802.org/1/pages/802.1ba.html.Google ScholarGoogle Scholar
  3. De Azua, Joan Adria Ruiz, et al. 2014. Complete modelling of AVB in network calculus framework. In Proceedings of the 22nd International Conference on Real-Time Networks and Systems. ACM, 55.Google ScholarGoogle Scholar
  4. Sanjoy Baruah, Bipasa Chattopadhyay, Haohan Li, and Insik Shin. 2014. Mixed-criticality scheduling on multiprocessors. Real-time Syst. 50, 1 (2014), 142--177.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Anne Bouillard and Éric Thierry. 2008. An algorithmic toolbox for network calculus. Discrete Event Dynam. Syst. 18, 1 (2008), 3--49.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Alan Burns and Robert I. Davis. 2018. A survey of research into mixed criticality systems. ACM Comput. Surveys 50, 6 (2018), 82.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Giorgio Buttazzo, Giuseppe Lipari, Luca Abeni, and Marco Caccamo. 2005. Soft Real-time Systems. Springer.Google ScholarGoogle Scholar
  8. Silviu S. Craciunas, Ramon Serna Oliver, Martin Chmelík, and Wilfried Steiner. 2016. Scheduling real-time communication in IEEE 802.1Qbv time sensitive networks. In Proceedings of the 24th International Conference on Real-time Networks and Systems. 183--192.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Silviu S. Craciunas and Ramon Serna Oliver. 2016. Combined task- and network-level scheduling for distributed time-triggered systems. Real-time Syst. 52, 2 (2016), 161--200.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. D. Decotignie. 2005. Ethernet-based real-time and industrial communications. Proc. IEEE 93, 6 (2005), 1102--1117.Google ScholarGoogle ScholarCross RefCross Ref
  11. Frank Dürr and Naresh Ganesh Nayak. 2016. No-wait packet scheduling for IEEE time-sensitive networks (TSN). In Proceedings of the 24th International Conference on Real-time Networks and Systems. 203--212.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. David Eppstein. 1998. Finding the k shortest paths. SIAM J. Comput. 28, 2 (1998), 652--673.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Joachim Feld. 2004. PROFINET—Scalable factory communication for all applications. In Proceedings of the IEEE International Workshop on Factory Communication Systems. IEEE, 33--38.Google ScholarGoogle ScholarCross RefCross Ref
  14. Voica Gavrilut and Paul Pop. 2016. Traffic class assignment for mixed-criticality frames in TTEthernet. ACM SIGBED Rev. 13, 4 (2016), 31--36.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Voica Gavriluţ and Paul Pop. 2018. Scheduling in time sensitive networks (TSN) for mixed-criticality industrial applications. In Proceedings of the 14th IEEE International Workshop on Factory Communication Systems (WFCS’18). 1--4.Google ScholarGoogle ScholarCross RefCross Ref
  16. Voica Gavriluţ, Luxi Zhao, Michael L. Raagaard, and Paul Pop. 2018. AVB-aware routing and scheduling of time-triggered traffic for TSN. IEEE Access 6 (2018), 75229--75243.Google ScholarGoogle ScholarCross RefCross Ref
  17. Tasnim Hamza, Jean-Luc Scharbarg, and Christian Fraboul. 2014. Priority assignment on an avionics switched ethernet network (QoS AFDX). In Proceedings of the IEEE Workshop on Factory Communication Systems. 1--8.Google ScholarGoogle ScholarCross RefCross Ref
  18. IEEE. 2015. 802.3 Standard for Ethernet. IEEE.Google ScholarGoogle Scholar
  19. IEEE. 2016. Official Website of the 802.1 Time-Sensitive Networking Task Group. Retrieved from http://www.ieee802.org/1/pages/tsn.html.Google ScholarGoogle Scholar
  20. Dirk Jansen and Holger Buttner. 2004. Real-time Ethernet: The EtherCAT solution. Comput. Control Eng. 15, 1 (2004), 16--21.Google ScholarGoogle ScholarCross RefCross Ref
  21. David S. Johnson and Michael R. Garey. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman.Google ScholarGoogle Scholar
  22. Graham Kendall and Edmund K. Burke. 2005. Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer.Google ScholarGoogle Scholar
  23. Hermann Kopetz. 1991. Event-triggered versus time-triggered real-time systems. Lecture Notes Comput. Sci. 563 (1991), 87--101.Google ScholarGoogle Scholar
  24. Sune Molgaard Laursen, Paul Pop, and Wilfried Steiner. 2016. Routing Optimization of AVB Streams in TSN Networks. ACM SIGBED Rev. 13, 4 (2016), 43--48.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Dorin Maxim and Ye-Qiong Song. 2017. Delay analysis of AVB traffic in time-sensitive networks (TSN). In Proceedings of the 25th International Conference on Real-time Networks and Systems. 18--27.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Nicolas Navet, Y.-Q. Song, and François Simonot. 2000. Worst-case deadline failure probability in real-time applications distributed over controller area network. J. Syst. Architect. 46, 7 (2000), 607--617.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Naresh Ganesh Nayak, Frank Duerr, and Kurt Rothermel. 2017. Routing algorithms for IEEE802.1Qbv networks. ACM SIGBED Rev. 15, 3 (2017), 6.Google ScholarGoogle Scholar
  28. Maryam Pahlevan, Nadra Tabassam, and Roman Obermaisser. 2018. Heuristic list scheduler for time triggered traffic in time sensitive networks. ACM SIGBED Rev. 16, 1 (2018), 1--6.Google ScholarGoogle Scholar
  29. Paul Pop, Michael L. Raagaard, Silviu S. Craciunas, and Wilfried Steiner. 2016. Design optimization of cyber-physical distributed systems using IEEE time-sensitive networks (TSN). IET Cyber-Phys. Syst.: Theory Appl. 1, 1 (2016), 86--94.Google ScholarGoogle ScholarCross RefCross Ref
  30. Traian Pop, Paul Pop, Petru Eles, and Zebo Peng. 2008. Analysis and optimisation of hierarchically scheduled multiprocessor embedded systems. Int. J. Parallel Program. 36, 1 (2008), 37--67.Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Francisco Pozo, Wilfried Steiner, Guillermo Rodríguez-Navas, and Hans Hansson. 2015. A decomposition approach for SMT-based schedule synthesis for time-triggered networks. In Proceedings of the IEEE Conference on Emerging Technologies and Factory Automation. 1--8.Google ScholarGoogle ScholarCross RefCross Ref
  32. Wolfgang Puffitsch, Rasmus Bo Sorensen, and Martin Schoeberl. 2015. Time-division multiplexing vs. network calculus. In Proceedings of the International Conference on Real Time and Networks Systems. 289--296.Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Michael Lander Raagaard and Paul Pop. 2017. Optimization Algorithms for the Scheduling of IEEE 802.1 Time-Sensitive Networking. Technical Report. Technical University of Denmark. Retrieved from http://www2.compute.dtu.dk/∼paupo/publications/Raagaard2017aa-Optimization%20algorithms%20for%20th-.pdf.Google ScholarGoogle Scholar
  34. John Rushby. 2001. Bus architectures for safety-critical embedded systems. In Embedded Software. Springer, 306--323.Google ScholarGoogle Scholar
  35. SAE. 2011. AS6802: Time-Triggered Ethernet. SAE International.Google ScholarGoogle Scholar
  36. SAE International. 1993. SAE Technical Report J2056/1.Google ScholarGoogle Scholar
  37. Reinhard Schneider, Licong Zhang, Dip Goswami, Alejandro Masrur, and Samarjit Chakraborty. 2013. Compositional analysis for switched ethernet topologies. In Proceedings of Design, Automation and Test in Europe Conference (DATE’13). 1099--1104.Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Eike Schweissguth, Peter Danielis, Dirk Timmermann, Helge Parzyjegla, and Gero Mühl. 2017. ILP-based joint routing and scheduling for time-triggered networks. In Proceedings of the International Conference on Real-time Networks and Systems (RTNS’17). 8--17.Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Ramon Serna Oliver, Silviu S. Craciunas, and Wilfried Steiner. 2018. IEEE 802.1Qbv gate control list synthesis using array theory encoding. In Proceedings of the Real-time and Embedded Technology and Applications Symposium (RTAS’18). 13--24.Google ScholarGoogle Scholar
  40. Oliver Sinnen. 2007. Task Scheduling for Parallel Systems. Vol. 60. John Wiley 8 Sons.Google ScholarGoogle Scholar
  41. Johannes Specht and Soheil Samii. 2016. Urgency-based scheduler for time-sensitive switched Ethernet Networks. In Proceedings of Euromicro Conference on Real-time Systems. 75--85.Google ScholarGoogle ScholarCross RefCross Ref
  42. Wilfried Steiner. 2010. An evaluation of SMT-based schedule synthesis for time-triggered multi-hop networks. In Proceedings of the 31st IEEE Real-time Systems Symposium. 375--384.Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. Domitian Tamas-Selicean, Paul Pop, and Wilfried Steiner. 2015. Design optimization of TTEthernet-based distributed real-time systems. Real-time Syst. 51, 1 (2015), 1--35.Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. TSN Task Group. 2017. IEEE 802.1Qcr/D0.0: Bridges and Bridged Networks Amendment: Asynchronous Traffic Shaping. Retrieved from http://www.ieee802.org/1/pages/802.1cr.html.Google ScholarGoogle Scholar
  45. Licong Zhang, Dip Goswami, Reinhard Schneider, and Samarjit Chakraborty. 2014. Task- and network-level schedule co-synthesis of ethernet-based time-triggered systems. In Proceedings of Asia and South Pacific Design Automation Conference (ASP-DAC’14). 119--124.Google ScholarGoogle ScholarCross RefCross Ref
  46. Luxi Zhao, Paul Pop, and Silviu S. Craciunas. 2018. Worst-case latency analysis for IEEE 802.1 Qbv time sensitive networks using network calculus. IEEE Access 6 (2018), 41803--41815.Google ScholarGoogle ScholarCross RefCross Ref
  47. Luxi Zhao, Paul Pop, Qiao Li, Junyan Chen, and Huagang Xiong. 2017. Timing analysis of rate-constrained traffic in TTEthernet using network calculus. Real-time Syst. 53, 2 (2017), 254--287.Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Luxi Zhao, Paul Pop, Zhong Zheng, and Qiao Li. 2018. Timing analysis of AVB traffic in TSN networks using network calculus. In Proceedings of the 24th IEEE Real-time and Embedded Technology and Applications Symposium. 25--36.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Traffic-type Assignment for TSN-based Mixed-criticality Cyber-physical Systems

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Cyber-Physical Systems
          ACM Transactions on Cyber-Physical Systems  Volume 4, Issue 2
          April 2020
          266 pages
          ISSN:2378-962X
          EISSN:2378-9638
          DOI:10.1145/3372402
          • Editor:
          • Tei-Wei Kuo
          Issue’s Table of Contents

          Copyright © 2020 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 21 January 2020
          • Accepted: 1 October 2019
          • Revised: 1 September 2019
          • Received: 1 September 2018
          Published in tcps Volume 4, Issue 2

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format