Deterministic scheduling method and device for time-sensitive network data

Abstract

The invention provides a time-sensitive network data deterministic scheduling method and device, and the method comprises the steps: constructing a time-sensitive network model which comprises a flow sub-model, a switch sub-model, and a topology sub-model; determining an optimal solution based on a local search algorithm, wherein the optimal solution comprises the sending time of each stream; and scheduling the data streams of the time-sensitive network according to the sending time of each stream. According to the method, the starting time of each flow when the 802.1 QCH protocol is used for building the TSN network can be calculated, the collision among a large number of flows can be reduced under the condition that each switch queue of the TSN network is determined, the number of the flows capable of being scheduled by the TSN network is increased, and the queue length required by the switch can be reduced and the time delay and jitter can be reduced under the condition that all the flows are scheduled. Compared with 802.1 QBV, the topology supported by the method is more complex, the number of streams is larger, calculation is simpler, and consumed time is shorter.

Description

technical field [0001] The present application relates to the field of communication technologies, and in particular to a method and device for deterministic scheduling of time-sensitive network data. Background technique [0002] Time Sensitive Networking (TSN) is a set of protocol standards being developed by the TSN task group in the IEEE802.1 working group. This standard defines a time-sensitive mechanism for Ethernet data transmission, adding determinism and reliability to standard Ethernet to ensure that Ethernet can provide a stable and consistent service level for the transmission of critical data. [0003] The IEEE 802.1QBV protocol provides a method for scheduling time-sensitive flows (referred to as "flows") through gating, but the calculation method of gating is complicated, and it is not easy to use topology coupling. As the complexity of the algorithm increases, the time-consuming increases greatly, and even an effective solution cannot be calculated. To simp...

AI Technical Summary

Problems solved by technology

[0005] The embodiment of the present application provides a method and device for deterministic scheduling of time-sensitive network data to solve the technical problems of the small number of flows that can be scheduled by the TSN network and the long queue length of the switch

Images