Start Time Planning for Cyclic Queuing and Forwarding in Time-Sensitive Networks

Daqian Liu, Zhewei Zhang, Yuntao Shi (), Yingying Wang, Jingcheng Guo and Zhenwu Lei
Additional contact information
Daqian Liu: School of Electrical and Control Engineering, North China University of Technology, Beijing 100144, China
Zhewei Zhang: School of Electrical and Control Engineering, North China University of Technology, Beijing 100144, China
Yuntao Shi: School of Electrical and Control Engineering, North China University of Technology, Beijing 100144, China
Yingying Wang: School of Electrical and Control Engineering, North China University of Technology, Beijing 100144, China
Jingcheng Guo: School of Electrical and Control Engineering, North China University of Technology, Beijing 100144, China
Zhenwu Lei: School of Electrical and Control Engineering, North China University of Technology, Beijing 100144, China

Mathematics, 2024, vol. 12, issue 21, 1-18

Abstract: Time-sensitive networking (TSN) is a kind of network communication technology applied in fields such as industrial internet and intelligent transportation, capable of meeting the application requirements for precise time synchronization and low-latency deterministic forwarding. In TSN, cyclic queuing and forwarding (CQF) is a traffic shaping mechanism that has been extensively discussed in the recent literature, which allows the delay of time-triggered (TT) flow to be definite and easily calculable. In this paper, two algorithms are designed to tackle the start time planning issue with the CQF mechanism, namely the flow–path–offset joint scheduling (FPOJS) algorithm and congestion-aware scheduling algorithm, to improve the scheduling success ratio of TT flows. The FPOJS algorithm, which adopts a novel scheduling object—a combination of flow, path, and offset—implements scheduling in descending order of a well-designed priority that considers the resource capacity and resource requirements of ports. The congestion-aware scheduling algorithm identifies and optimizes congested ports during scheduling and substantially improves the scheduling success ratio by dynamically configuring port resources. The experimental results demonstrate that the FPOJS algorithm achieves a 39% improvement in the scheduling success ratio over the naive algorithm, 13% over the Tabu-ITP algorithm, and 10% over the MSS algorithm. Moreover, the algorithm exhibits a higher scheduling success ratio under large-scale TSN.

Keywords: industrial internet; time-sensitive networking; cyclic queuing and forwarding; joint routing scheduling; start time planning (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/21/3382/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/21/3382/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:21:p:3382-:d:1509436

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().