SSA:CQF-oriented Scheduling Algorithm in Time-Sensitive Networking

被引：0
作者：
Jiang X.-Y. [1 ]
Yan J.-L. [1 ]
Quan W. [1 ]
Sun Z.-G. [1 ]
机构：
[1] College of Computer, National University of Defense Technology, Changsha
来源：
Dongbei Daxue Xuebao/Journal of Northeastern University | 2020年 / 41卷 / 06期
关键词：
Cyclic queuing and forwarding model(CQF); Deterministic transmission; Maximization problem; Network resource scheduling; Time-sensitive networking(TSN);
D O I：
10.12068/j.issn.1005-3026.2020.06.005
中图分类号：
学科分类号：
摘要：
Time-sensitive networking (TSN) is designed for providing determined transmission service with low latency and jitter in industrial control network and 5G.Resource scheduling, the core of TSN, is very crucial to guarantee the quality of service (QoS). Recently, TSN puts forward cyclic queuing and forwarding model (CQF). However, the corresponding scheduling algorithm is demanded for allocating resource rationally to avoid transmission collision.Since the TSN flow is periodic and predetermined, how to allocate resource for multiple TSN flows rationally from time dimension was researched. Resource allocation into multi-constrained maximization problem was abstracted. Then, a start-slot assignment based scheduling algorithm (SSA) was proposed. By adjusting the send slot at end system, SSA maximizes the queue resource utilization with meeting related constraints, which avoids complex time slot allocation hop by hop. Compared with the case without adjusting sending slot, experimental results demonstrate that SSA improves the number of flows scheduled successfully by 41.84% on average. © 2020, Editorial Department of Journal of Northeastern University. All right reserved.
引用
收藏
页码：784 / 791
页数：7
相关论文
共 12 条
  • [1] Nasrallah A, Thyagaturu A, Alharbi Z, Et al., Ultra-low latency (ULL) networks:The IEEE TSN and IETF Det Netstandards and related 5G ULL research[J], IEEE Communications Surveys & Tutorials, 21, 1, pp. 88-145, (2018)
  • [2] Nayak N G, Durr F, Rothermel K., Incremental flow scheduling and routing in time-sensitive software-defined networks[J], IEEE Transactions on Industrial Informatics, 14, 5, pp. 2066-2075, (2017)
  • [3] Chowdhury S R., Packet scheduling algorithms for a software-defined manufacturing environment, (2015)
  • [4] Wilfried S, Silviu C, Ramon S O., Traffic planning for time-sensitive communication[J], IEEE Communications Standards Magazine, 2, 2, pp. 42-47, (2018)
  • [5] Steiner W., Synthesis of static communication schedules for mixed-criticality systems[C], 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops, pp. 11-18, (2011)
  • [6] Craciunas S S, Oliver R S, Chmelik M, Et al., Scheduling real-time communication in IEEE 802.1 Qbv time sensitive networks[C], Proceedings of the 24th International Conference on Real-Time Networks and Systems, pp. 183-192, (2016)
  • [7] Durr F, Nayak N G., No-wait packet scheduling for IEEE time-sensitive networks (TSN)[C], Proceedings of the 24th International Conference on Real-Time Networks and Systems, pp. 203-212, (2016)
  • [8] Steiner W., An evaluation of SMT-based schedule synthesis for time-triggered multi-hop networks[C], 2010 31st IEEE Real-Time Systems Symposium, pp. 375-384, (2010)
  • [9] Pozo F, Rodriguez-Navas G, Hansson H, Et al., SMT-based synthesis of TTEthernet schedules:A performance study[C], 10th IEEE International Symposium on Industrial Embedded Systems (SIES), pp. 1-4, (2015)
  • [10] Pozo F, Steiner W, Rodriguez-Navas G, Et al., A decomposition approach for SMT-based schedule synthesis for time-triggered networks, IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA), pp. 1-8, (2015)
12