Abstract
With the development of the industrial Internet, IEEE Time-Sensitive Networking (TSN) has attracted more and more attentions due to its capability of providing deterministic network performance. Unlike most existing studies that only considered a single type of traffic, our work addresses the scheduling problem of mixed-criticality traffic in TSN. Time utility function (TUF) is a utility curve that measures the quality of service (QoS) of streams with respect to end-to-end delays. In this paper, we introduce a variety of TUFs for different streams in TSN according to specific timing requirements. To match the transmission protocol of TSN, we first categorize mixed-criticality traffic into periodic and aperiodic streams, and then design a novel scheduling scheme aiming to maximize the total TUF value of all streams. We compare our proposed scheme with two benchmark schemes, and evaluation results show that our proposed one outperforms the counterparts, especially under the worst-case network settings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
IEEE standard for local and metropolitan area network-bridges and bridged networks. IEEE Std 802.1Q-2018 (Revision of IEEE Std 802.1Q-2014), pp. 1–1993 (2018)
Wang, J., Ravindran, B.: Time-utility function-driven switched ethernet: packet scheduling algorithm, implementation, and feasibility analysis. IEEE Trans. Parallel Distrib. Syst. 15(2), 119–133 (2004)
Craciunas, S.S., Oliver, R.S., Chmelík, M., Steiner, W.: Scheduling real-time communication in IEEE 802.1 QBV time sensitive networks. In: Proceedings 24th International Conference RTNS, pp. 183–192 (2016)
Pahlevan, M., Obermaisser, R.: Genetic algorithm for scheduling time-triggered traffic in time-sensitive networks. In: 23rd International Conference ETFA, vol. 1, pp. 337–344. IEEE (2018)
Dürr, F., Nayak, N.G.: No-wait packet scheduling for IEEE time-sensitive networks (TSN). In: Proceedings 24th International Conference RTNS, pp. 203–212 (2016)
Gavriluţ, V., Pop, P.: Traffic-type assignment for TSN-based mixed-criticality cyber-physical systems. ACM Trans. Cyber-physical Syst. 4(2), 1–27 (2020)
Kim, M., Min, J., Hyeon, D., Paek, J.: TAS scheduling for real-time forwarding of emergency event traffic in TSN. In: ICTC, pp. 1111–1113. IEEE (2020)
Houtan, B., Ashjaei, M., Daneshtalab, M., Sjödin, M., Mubeen, S.: Synthesising schedules to improve QoS of best-effort traffic in TSN networks. In: 29th International Conference RTNS, 07 Apr 2021, Nantes, France (2021)
Yi, C., Cai, J.: Delay-dependent priority-aware transmission scheduling for e-health networks: a mechanism design approach. IEEE Trans. Veh. Technol. 68(7), 6997–7010 (2019)
Yi, C., Cai, J., Zhou, S.: A multi-user mobile computation offloading and transmission scheduling mechanism for delay-sensitive applications. IEEE Trans. Mob. Comput. 19(1), 29–43 (2020)
Yi, C., Cai, J.: A priority-aware truthful mechanism for supporting multi-class delay-sensitive medical packet transmissions in e-health networks. IEEE Trans. Mob. Comput. 16(9), 2422–2435 (2017)
Clark, R.K.: Scheduling dependent real-time activities. Carnegie Mellon University (1990)
Acknowlegement
This work was supported by National Natural Science Foundation of China (NSFC) under Grants 62002164 and 62002165.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Yu, J., Yi, C., Zhang, T., Zhu, F., Cai, J. (2022). A Time Utility Function Driven Scheduling Scheme for Managing Mixed-Criticality Traffic in TSN. In: Wang, L., Segal, M., Chen, J., Qiu, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2022. Lecture Notes in Computer Science, vol 13473. Springer, Cham. https://doi.org/10.1007/978-3-031-19211-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-19211-1_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-19210-4
Online ISBN: 978-3-031-19211-1
eBook Packages: Computer ScienceComputer Science (R0)