Start Time Planning for Cyclic Queuing and Forwarding in Time-Sensitive Networks
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 queuin...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-10-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/12/21/3382 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846173325739425792 |
|---|---|
| author | Daqian Liu Zhewei Zhang Yuntao Shi Yingying Wang Jingcheng Guo Zhenwu Lei |
| author_facet | Daqian Liu Zhewei Zhang Yuntao Shi Yingying Wang Jingcheng Guo Zhenwu Lei |
| author_sort | Daqian Liu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-88a29cee6a4c40f2b8da5fcb77fcefbd |
| institution | Kabale University |
| issn | 2227-7390 |
| language | English |
| publishDate | 2024-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj-art-88a29cee6a4c40f2b8da5fcb77fcefbd2024-11-08T14:37:43ZengMDPI AGMathematics2227-73902024-10-011221338210.3390/math12213382Start Time Planning for Cyclic Queuing and Forwarding in Time-Sensitive NetworksDaqian Liu0Zhewei Zhang1Yuntao Shi2Yingying Wang3Jingcheng Guo4Zhenwu Lei5School of Electrical and Control Engineering, North China University of Technology, Beijing 100144, ChinaSchool of Electrical and Control Engineering, North China University of Technology, Beijing 100144, ChinaSchool of Electrical and Control Engineering, North China University of Technology, Beijing 100144, ChinaSchool of Electrical and Control Engineering, North China University of Technology, Beijing 100144, ChinaSchool of Electrical and Control Engineering, North China University of Technology, Beijing 100144, ChinaSchool of Electrical and Control Engineering, North China University of Technology, Beijing 100144, ChinaTime-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.https://www.mdpi.com/2227-7390/12/21/3382industrial internettime-sensitive networkingcyclic queuing and forwardingjoint routing schedulingstart time planning |
| spellingShingle | Daqian Liu Zhewei Zhang Yuntao Shi Yingying Wang Jingcheng Guo Zhenwu Lei Start Time Planning for Cyclic Queuing and Forwarding in Time-Sensitive Networks Mathematics industrial internet time-sensitive networking cyclic queuing and forwarding joint routing scheduling start time planning |
| title | Start Time Planning for Cyclic Queuing and Forwarding in Time-Sensitive Networks |
| title_full | Start Time Planning for Cyclic Queuing and Forwarding in Time-Sensitive Networks |
| title_fullStr | Start Time Planning for Cyclic Queuing and Forwarding in Time-Sensitive Networks |
| title_full_unstemmed | Start Time Planning for Cyclic Queuing and Forwarding in Time-Sensitive Networks |
| title_short | Start Time Planning for Cyclic Queuing and Forwarding in Time-Sensitive Networks |
| title_sort | start time planning for cyclic queuing and forwarding in time sensitive networks |
| topic | industrial internet time-sensitive networking cyclic queuing and forwarding joint routing scheduling start time planning |
| url | https://www.mdpi.com/2227-7390/12/21/3382 |
| work_keys_str_mv | AT daqianliu starttimeplanningforcyclicqueuingandforwardingintimesensitivenetworks AT zheweizhang starttimeplanningforcyclicqueuingandforwardingintimesensitivenetworks AT yuntaoshi starttimeplanningforcyclicqueuingandforwardingintimesensitivenetworks AT yingyingwang starttimeplanningforcyclicqueuingandforwardingintimesensitivenetworks AT jingchengguo starttimeplanningforcyclicqueuingandforwardingintimesensitivenetworks AT zhenwulei starttimeplanningforcyclicqueuingandforwardingintimesensitivenetworks |