IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i21p3382-d1509436.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Daqian Liu & Zhewei Zhang & Yuntao Shi & Yingying Wang & Jingcheng Guo & Zhenwu Lei, 2024. "Start Time Planning for Cyclic Queuing and Forwarding in Time-Sensitive Networks," Mathematics, MDPI, vol. 12(21), pages 1-18, October.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:21:p:3382-:d:1509436
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/21/3382/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/21/3382/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:21:p:3382-:d:1509436. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.