{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:18:19Z","timestamp":1781194699639,"version":"3.54.1"},"reference-count":21,"publisher":"Engineering and Technology Publishing","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcm"],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:p>The performance and dependability of modern mission-critical systems significantly depends on the communication infrastructure. In this context, the Time-Sensitive Networking (TSN) task group addressed different requirements of cyber-physical systems such as timing and reliability constraints. TSN provides real-time capabilities through sharing a global time reference and employing transmission schedule tables called Gate Control Lists (GCL). On the other hand, TSN masks faulty behaviors within a system through a technique called Frame Replication and Elimination for Reliability (FRER). FRER fulfills the safety requirements of mission-critical systems by message replication and transmission of message replicas over redundant paths. The scheduling problem for the GCL synthesis is NP-complete. For simplification of the scheduling process, several state-of-the-art solutions provide schedulers for fault-free networks. However, this assumption is very optimistic and in practice networks experience different faulty-behaviors over time. This paper extends our heuristic TSN scheduler which was developed for fault-free TSN systems to support the FRER mechanism. Our fault-tolerant TSN scheduler focuses on enhancing the reliability of a mission-critical system while meeting the deadlines of time-critical jobs. To achieve this goal, we introduce a novel reliability analysis approach for a mission-critical system with a TSN communication infrastructure. This approach models and evaluates the reliability of a system based on the reliability of message transmissions between safety-critical jobs. The reliability of message transmissions is computed based on the reliability of the network components that form the forwarding paths. Thereby, our reliability model enables the system designers to plan networks more optimally.<\/jats:p>","DOI":"10.12720\/jcm.16.7.250-258","type":"journal-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T07:51:00Z","timestamp":1634716260000},"page":"250-258","source":"Crossref","is-referenced-by-count":26,"title":["Fault Tolerant List Scheduler for Time-Triggered Communication in Time-Sensitive Networks"],"prefix":"10.12720","author":[{"name":"University of Siegen, 57068 Siegen, Germany","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maryam","family":"Pahlevan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sarah","family":"Amin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roman","family":"Obermaisser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"4977","published-online":{"date-parts":[[2021]]},"reference":[{"key":"ref0","unstructured":"[1] Institute of Electrical and Electronics Engineers, Time-Sensitive Networking. (2017). In Time-Sensitive Networking Task Group. [Online]. Available: http:\/\/www.ieee802.org\/1\/pages\/tsn.html"},{"key":"ref1","unstructured":"[2] Institute of electrical and electronics engineers, inc. 802.1as-rev - timing and synchronization for time-sensitive applications. (2017). In Time-Sensitive Networking Task Group. [Online]. Available: http:\/\/www.ieee802.org\/1\/pages\/802.1AS-rev.html"},{"key":"ref2","unstructured":"[3] Institute of electrical and electronics engineers, inc. 802.1qbv-enhancements for scheduled traffic. (2016). In Time-Sensitive Networking Task Group. [Online]. Available: http:\/\/www.ieee802.org\/1\/pages\/802.1bv.html"},{"key":"ref3","doi-asserted-by":"publisher","unstructured":"[4] M. Pahlevan, N. Tabassam, and R. Obermaisser, \"Heuristic list scheduler for time triggered traffic in time sensitive networks,\" in Proc. 16th International Workshop on Real-Time Networks (RTN). ACM, 2018.","DOI":"10.1145\/3314206.3314208"},{"key":"ref4","doi-asserted-by":"publisher","unstructured":"[5] S. S. Craciunas, et al., \"Scheduling real-time communication in IEEE 802.1 qbv time sensitive networks,\" in Proc. 24th International Conference on Real-Time Networks and Systems. ACM, 2016, pp. 183-192.","DOI":"10.1145\/2997465.2997470"},{"key":"ref5","doi-asserted-by":"publisher","unstructured":"[6] P. Pop, M. L. Raagaard, S. S. Craciunas, and W. Steiner, \"Design optimisation of cyber-physical distributed systems using ieee time-sensitive networks,\" IET Cyber-Physical Systems: Theory & Applications, vol. 1, no. 1, pp. 86-94, 2016.","DOI":"10.1049\/iet-cps.2016.0021"},{"key":"ref6","doi-asserted-by":"publisher","unstructured":"[7] C. Arar, H. Kalla, S. Kalla, and H. Riadh, \"A reliable fault-tolerant scheduling algorithm for real time embedded systems,\" 2013.","DOI":"10.5120\/12409-9060"},{"key":"ref7","doi-asserted-by":"publisher","unstructured":"[8] L. Su, H. Wan, Y. Qin, X. Zhao, Y. Gao, X. Song, C. Lu, and M. Gu, \"Synthesizing fault-tolerant schedule for time-triggered network without hot backup,\" IEEE Transactions on Industrial Electronics, vol. 66, no. 2, pp. 1345-1355, 2018.","DOI":"10.1109\/TIE.2018.2833022"},{"key":"ref8","doi-asserted-by":"publisher","unstructured":"[9] G. Avni, S. Guha, and G. Rodriguez-Navas, \"Synthesizing time-triggered schedules for switched networks with faulty links,\" in Proc. International Conference on Embedded Software (EMSOFT), 2016, pp. 1-10.","DOI":"10.1145\/2968478.2968499"},{"key":"ref9","doi-asserted-by":"publisher","unstructured":"[10] M. C. E. Hugue and P. D. Stotts, \"Guaranteed task deadlines for fault-tolerant workloads with conditional branches,\" Real-Time Systems, vol. 3, no. 3, pp. 275-305, 1991.","DOI":"10.1007\/BF00364959"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[11] C. Dima, A. Girault, C. Lavarenne, and Y. Sorel, \"Off-line real-time fault-tolerant scheduling,\" in Proc. Ninth Euromicro Workshop on Parallel and Distributed Processing, 2001, pp. 410-417.","DOI":"10.1109\/EMPDP.2001.905069"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"[12] D. Mosse, R. Melhem, and S. Ghosh, \"Analysis of a faulttolerant multiprocessor scheduling algorithm,\" in Proc. IEEE 24th International Symposium on Fault-Tolerant Computing, 1994, pp. 16-25.","DOI":"10.1109\/FTCS.1994.315661"},{"key":"ref12","unstructured":"[13] H. Lee, J. Kim, and S. J. Hong, \"Evaluation of two loadbalancing primary-backup process allocation schemes,\" IEICE Transactions on Information and Systems, vol. 82, no. 12, pp. 1535-1544, 1999."},{"key":"ref13","unstructured":"[14] R. Al-Omari, G. Manimaran, and A. K. Somani, \"A fault-tolerant dynamic scheduling algorithm for multiprocessor real-time systems,\" in Proc. Fault-tolerant Computing Symp. (FTCS), FAST ABSTRACTS, 1999, pp. 63-64."},{"key":"ref14","doi-asserted-by":"publisher","unstructured":"[15] A. Benoit, M. Hakem, and Y. Robert, \"Contention awareness and fault-tolerant scheduling for precedence constrained tasks in heterogeneous systems,\" Parallel Computing, vol. 35, no. 2, pp. 83-108, 2009.","DOI":"10.1016\/j.parco.2008.11.001"},{"key":"ref15","doi-asserted-by":"crossref","unstructured":"[16] V. Izosimov, P. Pop, P. Eles, and Z. Peng, \"Design optimization of time-and cost-constrained fault-tolerant distributed embedded systems,\" in Proc. Design, Automation and Test in Europe, 2005, pp. 864-869.","DOI":"10.1109\/DATE.2005.116"},{"key":"ref16","doi-asserted-by":"publisher","unstructured":"[17] S. M. Shatz, J. P. Wang, and M. Goto, \"Task allocation for maximizing reliability of distributed computer systems,\" IEEE Transactions on Computers, vol. 41, no. 9, pp. 1156-1168, 1992.","DOI":"10.1109\/12.165396"},{"key":"ref17","doi-asserted-by":"publisher","unstructured":"[18] A. Dogan and F. Ozguner, \"Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing,\" IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 3, pp. 308-323, 2002.","DOI":"10.1109\/71.993209"},{"key":"ref18","unstructured":"[19] I. Koren and C. M. Krishna, Fault-tolerant Systems, Elsevier, 2010."},{"key":"ref19","doi-asserted-by":"publisher","unstructured":"[20] O. Sinnen, Task Scheduling for Parallel Systems, vol. 60. John Wiley & Sons, 2007.","DOI":"10.1002\/0470121173"},{"key":"ref20","unstructured":"[21] Snap library 4.0, user reference documentation. [Online]. Available: https:\/\/snap.stanford.edu\/snap\/doc\/snapuserref\/index.html"}],"container-title":["Journal of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.jocm.us\/uploadfile\/2021\/0618\/20210618051453646.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T06:33:54Z","timestamp":1725950034000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/show-257-1666-1.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":21,"URL":"https:\/\/doi.org\/10.12720\/jcm.16.7.250-258","relation":{},"ISSN":["2374-4367"],"issn-type":[{"value":"2374-4367","type":"print"}],"subject":[],"published":{"date-parts":[[2021]]}}}