Journal of Northeastern University Natural Science ›› 2020, Vol. 41 ›› Issue (6): 784-791.DOI: 10.12068/j.issn.1005-3026.2020.06.005

• Information & Control • Previous Articles     Next Articles

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

JIANG Xu-yan, YAN Jin-li, QUAN Wei, SUN Zhi-gang   

  1. College of Computer, National University of Defense Technology, Changsha 410073, China.
  • Received:2019-09-29 Revised:2019-09-29 Online:2020-06-15 Published:2020-06-12
  • Contact: JIANG Xu-yan
  • About author:-
  • Supported by:
    -

Abstract: 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.

Key words: time-sensitive networking(TSN), deterministic transmission, cyclic queuing and forwarding model(CQF), network resource scheduling, maximization problem

CLC Number: