Deadline-Aware Online Scheduling of TSN Flows for Automotive Applications

Patti, Gaetano; Bello, Lucia Lo; Leonardi, Luca

doi:10.1109/tii.2022.3184069

Cited by 34 publications

(6 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reference [10] proposes an online scheduling with the earliest cutoff time priority, which is simulated and evaluated in the real automobile scene, and can handle real-time periodic traffic and event-driven traffic to meet the needs of the automobile scene. Reference [11] constructs a new hybrid scheduling framework for TSN-based avionics systems, which can complete complex scheduling of large systems and has excellent performance in latency.…”

Section: Related Workmentioning

confidence: 99%

Joint routing and scheduling optimization algorithm for airborne time-sensitive networking

li,

wang

2024

Third International Conference on Electronic Information Engineering, Big Data, and Computer Technology (EIBDCT 2024)

View full text Add to dashboard Cite

The application of drones in rescue, exploration and other fields is becoming increasingly frequent. The existing bus tech-nology has low bandwidth performance, poor mounting capacity and poor interconnectivity, which cannot meet the in-creasingly large transmission needs of video, image, and control information in drone avionics systems, hindering the development of drone informatization and intelligence. Time-Sensitive Networking are a set of standards specified by the IEEE 802 working group, which provide deterministic connections for network devices while being compatible with tra-ditional Ethernet, and can be used to meet the information transmission requirements of Unmanned Aerial Vehicle avionics systems. This article proposes a novel optimization objective using a joint routing and scheduling optimization algorithm based on Integer Linear Programming, which can effectively solve the problems faced by bus technology in Unmanned Aerial Vehicle avionics systems. The simulation experiment results show that the proposed method performs well and reliably in terms of delay, and can provide good bandwidth performance.

show abstract

Section: Related Workmentioning

confidence: 99%

Joint routing and scheduling optimization algorithm for airborne time-sensitive networking

li,

wang

2024

Third International Conference on Electronic Information Engineering, Big Data, and Computer Technology (EIBDCT 2024)

View full text Add to dashboard Cite

show abstract

“…In [18] authors present a deadline-driven scheduling approach for time-sensitive flows in wired TSN. They make use of Per-Stream Filtering and Policing (PSFP) mechanism from [19] to change the traffic flow priority based on the applied schedule.…”

Section: Related Workmentioning

confidence: 99%

To Update or Not: Dynamic Traffic Classification for High Priority Traffic in Wireless TSN

Haxhibeqiri

Jiao

Campos

et al. 2023

2023 IEEE 19th International Conference on Factory Communication Systems (WFCS)

View full text Add to dashboard Cite

End-to-end low-latency deterministic communication, next to high-reliability communication, is one of the key features that communication systems are expected to provide for industrial systems. To achieve time-sensitive networking (TSN), a set of standards have already been designed and deployed for wired industrial communication systems, coexisting or replacing other long-living technologies such as Fieldbus, Profibus, or Modbus. Wireless time-sensitive networking (W-TSN) is getting traction with the development of the newest WiFi generation (IEEE 802.11be) as well as advances in cellular networking. One of the challenges in W-TSN is scheduling and isolation of time-critical traffic in the shared wireless medium. In this paper we present a solution, called dynamic traffic classification, to give faster dedicated access to the wireless medium for packets of highly-time-sensitive flows, that can be generated randomly. Dynamic traffic classification utilizes so-called shadow queues implemented in FPGA-based WiFi baseband SDR platform, openwifi, to prioritize channel access of certain packets over others. We show that the channel access latency in the case of dynamic traffic classification does not depend on the scheduling cycle, but on the distribution of dedicated time slots inside the schedule cycle. As such we achieve to decrease the end-to-end latency by 75% in case of longer communication cycles with wider space between communication time slots.

show abstract

“…Traffic scheduling is a core mechanism in the TSN standard, utilizing scheduling algorithms to determine the order and timing of data frame transmission at all switch output ports. This ensures compliance with the individual latency and bandwidth requirements of each traffic flow while optimizing the overall transmission performance [8]. TSN categorizes transmitted data into three main types based on different traffic requirements: time-triggered (TT) traffic, rate-constrained (RC) real-time traffic, and best effort (BE) non-real-time traffic [9].…”

Section: Introductionmentioning

confidence: 99%

Traffic Classification and Packet Scheduling Strategy with Deadline Constraints for Input-Queued Switches in Time-Sensitive Networking

Zheng,

Wei,

Zhang

et al. 2024

Electronics

View full text Add to dashboard Cite

Deterministic transmission technology is a core key technology that supports deterministic real-time transmission requirements for industrial control in Time-Sensitive Networking (TSN). It requires each network node to have a deterministic forwarding delay to ensure the real-time end-to-end transmission of critical traffic streams. Therefore, when forwarding data frames, the switch nodes must consider the time-limited requirements of the traffic. In the input-queued switch system, an algorithm for clock-synchronized deterministic network traffic classification scheduling (CSDN-TCS) is proposed to address the issue of whether a higher-quality-of-service (QoS) performance can be provided under packet deadline constraints. First, the scheduling problem of the switch is transformed into a decomposition problem of the traffic matrix. Secondly, the maximum weight-matching algorithm in graph theory is used to solve the matching results slot by slot. By fully utilizing the slot resources, as many packets as possible can be scheduled to be completed before the deadline arrives. For two types of packet scheduling problems, this paper uses the maximum flow algorithm with upper- and lower-bound constraints to move packets from a larger deadline set to idle slots in a smaller deadline set, enabling early transmission, reducing the average packet delay, and increasing system throughput. When there are three or more types of deadlines in the scheduling set, this scheduling problem is an NP-hard problem. We solve this problem by polling the two types of scheduling algorithms. In this paper, simulation experiments based on the switching size and line load are designed, and the Earliest Deadline First (EDF) algorithm and the Flow-Based Iterative Packet Scheduling (FIPS) algorithm are compared with the CSDN-TCS algorithm. The simulation results show that under the same conditions, the CSDN-TCS algorithm proposed in this paper outperforms the other two algorithms in terms of success rate, packet loss rate, average delay and throughput rate. Compared with the FIPS algorithm, the CSDN-TCS algorithm has lower time complexity under the same QoS performance.

show abstract

Deadline-Aware Online Scheduling of TSN Flows for Automotive Applications

Cited by 34 publications

References 29 publications

Joint routing and scheduling optimization algorithm for airborne time-sensitive networking

Joint routing and scheduling optimization algorithm for airborne time-sensitive networking

To Update or Not: Dynamic Traffic Classification for High Priority Traffic in Wireless TSN

Traffic Classification and Packet Scheduling Strategy with Deadline Constraints for Input-Queued Switches in Time-Sensitive Networking

Contact Info

Product

Resources

About