CN117596200A - Time-sensitive network route scheduling method, electronic equipment and medium - Google Patents
Time-sensitive network route scheduling method, electronic equipment and medium Download PDFInfo
- Publication number
- CN117596200A CN117596200A CN202410050996.0A CN202410050996A CN117596200A CN 117596200 A CN117596200 A CN 117596200A CN 202410050996 A CN202410050996 A CN 202410050996A CN 117596200 A CN117596200 A CN 117596200A
- Authority
- CN
- China
- Prior art keywords
- message
- link
- mth
- path
- tsn
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 230000005540 biological transmission Effects 0.000 claims abstract description 72
- 230000001934 delay Effects 0.000 claims abstract description 5
- 238000012545 processing Methods 0.000 claims description 16
- 230000008569 process Effects 0.000 claims description 11
- 238000003860 storage Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 3
- 230000004048 modification Effects 0.000 claims description 3
- 238000012986 modification Methods 0.000 claims description 3
- 238000001514 detection method Methods 0.000 claims 1
- 230000006870 function Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 239000000523 sample Substances 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 241001522296 Erithacus rubecula Species 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 238000013475 authorization Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/06—Synchronising arrangements
- H04J3/0635—Clock or time synchronisation in a network
- H04J3/0638—Clock or time synchronisation among nodes; Internode synchronisation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
- H04L47/2433—Allocation of priorities to traffic types
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/30—Peripheral units, e.g. input or output ports
- H04L49/3009—Header conversion, routing tables or routing tags
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a time-sensitive network routing scheduling method, electronic equipment and a medium, wherein the method comprises the following steps: the controller obtains TSN network topology according to a link layer discovery protocol; configuring clocks for each TSN exchanger, transmitting terminal and receiving terminal to realize time synchronization; the controller receives a connection request sent by a sending terminal, wherein the connection request comprises description information of TT flow; configuring transmission priority of each message according to the description information of the TT flow, and configuring route path constraint, path link constraint, link transmission time slot constraint and path scheduling constraint based on TSN network topology, aiming at minimizing the sum of delays in the TT flow, and solving to obtain a route path of each message in the TT flow and a transmission time slot on the route path; the controller configures a flow table for the TSN switch according to the route path of each message in the TT flow, configures a gating list for the TSN switch according to the transmission time slot of each message in the TT flow, and configures a scheduling time table for the sending terminal.
Description
Technical Field
The present invention relates to the field of time-sensitive networks, and in particular, to a time-sensitive network routing scheduling method, an electronic device, and a medium.
Background
With the rapid development of technologies such as intelligent manufacturing and industrial internet, the requirements of low-delay transmission and low jitter from end to end are important demands of delay sensitive services, and standard Ethernet has the advantages of high bandwidth, strong compatibility and the like, but only provides best-effort network services, and is difficult to meet the deterministic transmission demands of delay sensitive services. The Time sensitive network (Time-sensitive Networking, TSN) based on the Ethernet protocol is a series of traffic scheduling standards proposed by IEEE 802.1 working group, mainly comprises protocol standards such as Time synchronization, traffic scheduling, reliable transmission, network management and the like, ensures the transmission of Time sensitive data with low Time delay, low jitter, certainty and reliability, and simultaneously satisfies the transmission compatibility of non-Time sensitive data.
The time-sensitive network standard is developed so far, and a core mechanism based on the following four types of protocols is established:
(1) Clock synchronization: for supporting time synchronization between devices, including IEEE 802.1AS;
(2) And (3) data flow scheduling: control of packet forwarding is supported on forwarding nodes, including IEEE 802.1Qav (forwarding and queuing), IEEE 802.1Qbv (gating scheduling), IEEE 802.1Qbu (frame preemption), IEEE 802.1Qci (flow filtering), IEEE 802.1Qch (round robin forwarding);
(3) Flow reliability: guaranteeing the reliability of network transmission and the integrity of data flow, comprising: IEEE 802.1Qca (path control and flow reservation), IEEE 802.1 CB (frame duplication and frame erasure);
(4) And (3) network management: a control plane protocol for a time sensitive network, comprising: IEEE 802.1Qcp (YANG model), IEEE 802.1Qcc (network management architecture).
The time-sensitive network protocol proposed by the TSN task group of IEEE only gives a technical framework, and no specific provision has been made for specific implementation. In the Time-triggered (TT) flow deterministic scheduling problem of a Time-sensitive network, if only gating scheduling is considered, and routing influence is not considered, a shortest path from a transmitting end to a receiving end is adopted to forward the TT flow, so that congestion among TT flows or among TT flows and non-TT flows in different periods on a link may be caused, the network packet loss rate is increased, and the gating scheduling table cannot be calculated.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a time-sensitive network routing scheduling method, electronic equipment and a medium.
In a first aspect, an embodiment of the present invention provides a time-sensitive network routing scheduling method, where the method relies on a time-sensitive network routing scheduling network architecture, and includes a controller, and a plurality of TSN switches, a plurality of transmitting terminals, and a plurality of receiving terminals, which are coupled to the controller and serve as nodes; the TSN exchanger is respectively communicated with the sending terminal and the receiving terminal; the method comprises the following steps:
the controller obtains TSN network topology according to a link layer discovery protocol;
configuring clocks for each TSN exchanger, transmitting terminal and receiving terminal to realize time synchronization;
the controller receives a connection request sent by a sending terminal, wherein the connection request comprises description information of TT flow; configuring transmission priority of each message according to the description information of the TT flow, and configuring route path constraint, path link constraint, link transmission time slot constraint and path scheduling constraint based on TSN network topology, aiming at minimizing the sum of delays in the TT flow, and solving to obtain a route path of each message in the TT flow and a transmission time slot on the route path;
the controller configures a flow table for the TSN switch according to the route path of each message in the TT flow, configures a gating list for the TSN switch according to the transmission time slot of each message in the TT flow, and configures a scheduling time table for the sending terminal.
In a second aspect, an embodiment of the present invention provides an electronic device, including a memory and a processor, the memory coupled to the processor; the memory is used for storing program data, and the processor is used for executing the program data to realize the time-sensitive network routing scheduling method.
In a third aspect, an embodiment of the present invention provides a computer readable storage medium having a computer program stored thereon, where the program when executed by a processor implements the time-sensitive network routing scheduling method described above.
Compared with the prior art, the invention has the beneficial effects that: the invention provides a routing scheduling method of a time-sensitive network, which aims at TT flow characteristics in the time-sensitive network, considers the characteristics of the flow such as frame period, frame size, priority, maximum delay, maximum jitter, propagation delay, processing delay, sending delay and the like, and simultaneously considers routing path problems and scheduling problems of TT flow paths, thereby avoiding the problem that TT flow cannot be scheduled caused by independently aiming at routing or scheduling problems. Meanwhile, the controller issues a flow table for the TSN switch and configures time slots, so that the flexibility of the network is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort to a person skilled in the art.
Fig. 1 is a flowchart of a time-sensitive network routing scheduling method according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a routing scheduling structure of a time-sensitive network according to an embodiment of the present invention;
fig. 3 is a schematic flow chart of solving a routing path and a transmission time slot on the routing path of each message in a TT stream according to an embodiment of the present invention;
fig. 4 is a schematic diagram of a controller and a TSN switch according to an embodiment of the present invention;
fig. 5 is a schematic diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The features of the following examples and embodiments may be combined with each other without any conflict.
As shown in fig. 1 and fig. 2, the embodiment of the present invention provides a time-sensitive network routing scheduling method, where the method is implemented by means of a time-sensitive network routing scheduling network architecture, where the time-sensitive network routing scheduling network architecture includes a controller, a plurality of TSN switches, a plurality of transmitting terminals, and a plurality of receiving terminals, where the controller is connected to all the TSN switches, the transmitting terminals, and the receiving terminals through control links, and the TSN switches are respectively connected to the transmitting terminals and the receiving terminals through wired links.
Further, the controller is an ONOS controller, and the ONOS controller comprises a topology discovery module, a flow monitoring module, a TSN configuration module and a route management module; the topology discovery module is used for maintaining a unified view of the whole network; the flow monitoring module is used for monitoring the bandwidth, the flow and the network speed information of the whole network link; the TSN configuration module is used for issuing configuration for the TSN switch and the sending terminal; the routing management module is used for routing decisions and routing TT flows from the sending terminal to the receiving terminal through the issuing flow table.
Further, the TSN switch is a switch supporting IEEE 802.1AS, IEEE 802.1Qbv, IEEE 802.1Qci, IEEE 802.1Qch, openFlow, LLDP, and Netconf functions.
Further, the sending terminal and the receiving terminal select a host supporting an IEEE 802.1AS, an IEEE 802.1Qbv protocol, an IEEE 802.1Qci protocol and an IEEE 802.1Qch protocol.
As shown in fig. 1, the method for scheduling a time-sensitive network route according to the embodiment of the present invention is described in detail, and specifically includes the following steps:
step S1: the controller obtains the TSN network topology according to a link layer discovery protocol (Link Layer Discovery Protocol, LLDP).
In the specific implementation process of the step S1, the method includes the following sub-steps:
step S101, the controller sends a modification message (flow-mod message) to all TSN switches; the TSN switch sets the flow table item to match the LLDP message and sends the matched LLDP message to the ONOS controller.
In step S102, the controller constructs a probe frame including the device number of the first TSN switch, constructs an LLDP (Link Layer Discovery Protocol ) message, and sends a packet-out message to the first TSN switch.
Step S103, the first TSN switch receives the LLDP message and then broadcasts the LLDP message. When the second TSN exchanger receives the LLDP message, the LLDP message is packaged into a report data packet, and the report data packet is uploaded to the controller.
In step S104, the controller constructs a directed edge (a first TSN switch, a second TSN switch) according to the uploaded report packet. And by analogy, the controller sends LLDP messages to all the switches, and a TSN network topology is constructed according to the acquired report data packets, wherein the TSN network topology is a TSN network topology directed graph.
Illustratively, the ONOS controller constructs a probe frame containing the device number of the first TSN switch, constructs an LLDP (Link Layer Discovery Protocol ) message, and sends a packet-out message to the first TSN switch. The first TSN switch receives the LLDP message and broadcasts the LLDP message on all ports. And after the neighbor second TSN switch and the eighth TSN switch receive the LLDP message, packaging the LLDP message into a report data packet, and uploading the report data packet to the ONOS controller. The controller constructs a directed edge based on the uploaded report data packet, denoted (V 1 ,V 8 )，(V 1 ,V 2 ) Sum (V) 1 ,V E1 ) Wherein, (V) 1 ,V 2 ,V 8 ,V E1 ) Respectively (first TSN switch, second TSN switch, eighth TSN switch, first transmitting terminal). Similarly, the ONOS controller sends LLDP messages to all TSN switches, and constructs a TSN network topology map according to the acquired report data packets.
Step S2: and configuring clocks for each TSN switch, the sending terminal and the receiving terminal to realize time synchronization.
It should be noted that, the TSN switch provided in this example performs time synchronization by using the general precision time configuration protocol (gPTP, generic precision time protocol) of IEEE 802.1AS, gPTP uses the BMCA algorithm to establish a master-slave structure and form gPTP domain, then selects the most accurate clock source in clocks of all TSN switches AS a master clock, then sends a synchronization (Sync) message and a Follow (follow_up) message by using a message transceiving manner, calculates to obtain a first correspondence between clock bias and link Delay, then sends a Delay request (delay_req) message and a Delay response (delay_resp) message by using a Delay request response mechanism, calculates to obtain a second correspondence between clock bias and link Delay, calculates clock bias value and link Delay by using the first correspondence and the second correspondence, and uses the clock bias value to correct local time from the clock, thereby completing time synchronization with the master clock, and requiring the clock bias to be less than 1 μs.
Step S3: the controller receives a connection request sent by a sending terminal, wherein the connection request comprises description information of TT flow; configuring transmission priority of each message according to the description information of the TT flow, and configuring route path constraint, path link constraint, link transmission time slot constraint and scheduling constraint based on TSN network topology, aiming at minimizing the sum of delays in the TT flow, and solving and obtaining a route path of each message in the TT flow and a transmission time slot on the route path.
As shown in fig. 3, in the implementation process of step S3, the following sub-steps are included:
in step S301, the controller receives a connection request sent by the sending terminal, where the connection request includes description information of a TT stream (Time-triggered stream).
Specifically, the connection request is a control flow F, f= (F) composed of a series of messages 1 ,f 2 ,f 3 ,……,f m , ……,f N ），m∈[1,N]N is the number of messages, wherein each message f m Comprises the following steps: transmitting terminal s m Receiving terminal d m Message f m Frame period c of (2) m Message f m Frame size l of (2) m Message f m Priority sp of (2) m Message f m Maximum delay del of (2) m And message f m Maximum acceptable jitter j m . Wherein, the traffic with different priority levels is identified by different VLAN IDs, which are higher than the message f m Maximum delay del of (2) m It is deemed that reliable transmission of the data cannot be guaranteed.
Meanwhile, the network architecture provided by the invention can be recorded as a TSN network model N= { F, V, E }, wherein F represents TT flow in a network, V represents network node comprising a transmitting terminal, a receiving terminal and a TSN switch, E represents network link formed by connecting two nodes, (V) a ,V b ) E, where V a ，V b Respectively source and destination network nodes. Mth message f in TT stream m ∈F，f m =(s m ,d m ,c m ,sp m ,l m ,del m ,j m ) Wherein s is m Representing a transmitting terminal node, d m Representing a receiving terminal node, c m Representing the transmission period of a data frame, sp m Represents f m Priority size, l m Represents f m Data frame size, del m Representing the maximum delay of a data frame, j m Represents f m Maximum jitter acceptable. For (V) a ,V b ) E E, TT stream f m Propagation delay of (2)Data is shown at (V a ,V b ) Is transmitted at a transmission rate send of (c) ab For V a E V, by TSN switch V a Processing delay for deciding at which port to forward a packet>TSN switch V a TT stream f at the egress port m Serialized transmission delay->TSN switch V a Processing TT stream f m Jitter J of (1) am 。
Step S302, configuring each message f according to the description information of TT flow in the connection request m The transmission priority of e F specifically includes:
1) For the mth and nth messages (f m ,f n ) E F if the priority of the mth message is higher than the priority sp of the nth message m ＞sp n The controller will send the mth message f m Arranged in the nth message f n Previously transmitted.
2) For the mth and nth messages(f m ,f n ) E F if the priority of the mth message is the same as the priority of the nth message sp m =sp n According to the transmission period of the data frame corresponding to the mth messagec m Transmission period c of data frame corresponding to nth message n Judging if the transmission period of the data frame corresponding to the mth message is greater than the transmission period c of the data frame corresponding to the nth message m ＞c n The controller will send the mth message f m Arranged in the nth message f n Previously transmitted.
3) For the mth and nth messages (f m ,f n ) E F if the priority of the mth message is the same as the priority of the nth message sp m =sp n And the transmission period of the data frame corresponding to the mth message is the same as the transmission period of the data frame corresponding to the nth message m =c n Then according to the maximum delay del of the data frame corresponding to the mth message m Maximum delay del of data frame corresponding to nth message n Judging if the maximum delay of the data frame corresponding to the mth message is smaller than the maximum delay del of the data frame corresponding to the nth message m ＜del n The controller will send the mth message f m Arranged in the nth message f n Previously transmitted.
4) For the mth and nth messages (f m ,f n ) E F if the priority of the mth message is the same as the priority of the nth message sp m =sp n The transmission period of the data frame corresponding to the mth message is the same as the transmission period of the data frame corresponding to the nth message m =c n Maximum delay del of data frame corresponding to mth message and maximum delay del of data frame corresponding to mth message m =del n Then according to the maximum jitter j acceptable by the mth message m And maximum jitter j acceptable to the nth message n Making a judgment if the maximum jitter acceptable for the mth message is less than the maximum jitter j acceptable for the nth message m ＜j n The controller will stream the mth message f m Arranged in the nth message f n If the maximum jitter acceptable for the mth message is the same as the maximum jitter acceptable for the nth message, j m =j n The controller randomly selects a message to be transmitted first.
Step S303, route path constraint is configured according to the description information of TT flow and TSN network topology.
The path constraint is as follows: when the mth message f m Via the link (source network node, destination network node), the mth message f will be m The routing path variable corresponding to the current link is recorded as 1; when the mth message f m Without going through the link (source network node, destination network node), the mth message f m The routing path variable corresponding to the current link is noted 0.
Further, the path constraint variable is noted asThe expression is as follows:
∈{0,1},/> (V a ,V b )∈E, />f m ∈F
in this case, when the path constraint variable is recorded asWhen=1, represents the mth message f m Through a link (V) a ,V b ) The method comprises the steps of carrying out a first treatment on the surface of the When the path constraint variable is recorded as +.>When=0, represents the mth message f m Without going through a link (V) a ,V b )。
And step S404, configuring link constraint according to the description information of the TT flow and the TSN network topology.
The path link constraints include a first path link constraint, a second path link constraint, and a third path link constraint.
Wherein the first path link constraint is: when the mth message f m If the TSN switch which is used as the route to flow through the node exists in the corresponding link, the number of the input port link of the TSN switch which is used as the route to flow through the node is equal to the number of the output port link; the first path link expression is as follows:
wherein V is a Representing TSN switches flowing through the node as routes,representing the mth message f m Through a link (V) a ,V b )，/>Representing the mth message f m Through a link (V) b , V a )。
The second path link constraint is: the number of outgoing port links of the transmitting terminal should be equal to the number of incoming port links of the receiving terminal and both be 1, and the second path link constraint expression is as follows:
in the method, in the process of the invention,representing the mth message f m Through a link(s) m ,V a )，/>Representing the mth message f m Through a link (V) b ,d m )。
The third path link constraint is: to prevent the generation of routing loops, it is guaranteed that each message of the selected link passes only once, and the third path link constraint expression is defined as follows:
step S305, configuring link transmission time slot constraint according to the description information of TT flow and TSN network topology; the expression of the link transmission time slot constraint is as follows:
in the method, in the process of the invention,for the mth message f m On the link (V) a ,V b ) Start time slot of up-transmission,/->For the mth message f m On the link (V) a ,V b ) Cycle time experienced above, +.>Representing a natural number set.
Step S306, path scheduling constraint is configured according to the description information of TT flow and TSN network topology. When selecting a routing path, it is necessary to ensure that the selected routing path satisfies the path scheduling constraint. The path scheduling constraints include a first path scheduling constraint,
Wherein the expression of the first path scheduling constraint is as follows:
in the method, in the process of the invention,is infinite constant, when the controller selects a link (V a ,V b ) When the mth message f m On the link (V) a ,V b ) Start time slot ∈of up-transmission>And the mth message f m On the link (V) a ,V b ) Cycle time experienced above->Is a non-negative integer; when the controller does not select a link (V a ,V b ) When the mth message f m On the link (V) a ,V b ) Start time slot ∈of up-transmission>And the mth message f m On the link (V) a ,V b ) Cycle time experienced above->Is 0.
Second path scheduling constraint considers TT stream mth message f m At a certain TSN switch V a Processing delay atTransmission delay->And jitter J am The difference between the time slot of the outgoing port link and the time slot of the incoming port link must be equal to or greater than the mth message f m The processing time at a certain TSN switch is expressed as follows:
in the method, in the process of the invention,representing the mth message f m Through a link (V) a ,V b )。
The third path scheduling constraint is: mth message f m The difference between the link time slot of the receiving terminal inlet port and the link time slot of the transmitting terminal outlet port is smaller than the mth message f m Maximum delay with mth message f m On the link (V) a ,V b ) Difference in propagation delay; the expression is as follows:
in the method, in the process of the invention,representing the mth message f m On the link (V) b ,d m ) Start time slot of up-transmission,/->Representing the mth message f m On the link (V) b , d m ) Cycle time experienced above, +.>Representing the mth message f m On the link(s) m ,V a ) Start time slot of up-transmission,/->Representing the mth message f m On the link(s) m ,V a ) Cycle time experienced above, +.>Representing the mth message f m On the link (V) a ,V b ) Propagation delay on the antenna.
Wherein the mth message f m On the link (V) a ,V b ) Propagation delay on EComputing means of (a)The formula is as follows:
in send ab Representing data on a link (V a ,V b ) At the transmission rate.
The fourth path scheduling constraint is: when the priority of the mth message is higher than that of the nth message, considering the transmission times of the message in the super period, and in order to ensure the deterministic transmission of the TT stream, a plurality of data frames are not allowed to compete for the same channel at the same moment, and the nth message is transmitted after the transmission of the mth message is completed when the transmission of the mth message is required to be ensured to be transmitted through the same link; the fourth path scheduling constraint is expressed as follows:
in the method, in the process of the invention,representing the nth message f m On the link (V) a ,V b ) Start time slot of up-transmission,/->Representation intervalIntegers in c n Representing the transmission period of the data frame corresponding to the nth message,/or->Representing the mth message f m On the link (V) a ,V b ) The starting time slot of the up-transmission, mu represents the interval +.>Integer in>Represents f m At->Is a transmission number of times.
Wherein the mth message f m Number of transmissions in an overcycleThe expression is as follows:
wherein T is F Representing the supersycle, the expression is as follows:
T F = LCM(c m )，f m ∈F
wherein LCM (·) represents the least common multiple of all message transmission periods, c m Representing the mth message f m Is used for the transmission period of (a).
In this example, the gating list is precisely controlled by time slot division based on IEEE 802.1Qbv protocol, and the gating list is driven and controlled by the transmission period of the TT flow, and the controller sets the super period due to different transmission periods of the TT flowTo control the gating list loop scheduling.
Step S307, defining an objective function, which is the sum of minimizing TT stream delays, as follows:
in the method, in the process of the invention,representing the mth message f m On the link (V) b ,d m ) Start time slot of up-transmission,/->Representing the mth message f m On the link (V) b ,d m ) Cycle time experienced above, +.>Representing the mth message f m On the link(s) m ,V a ) Start time slot of up-transmission,/->Representing the mth message f m On the link(s) m ,V a ) Cycle time experienced.
Step S308, according to the route path constraint, the path link constraint, the link transmission time slot constraint and the path scheduling constraint modeling, solving the sum of the delay of the TT stream minimized by an objective function solution through an integer linear programming (Integer Linear Programming, ILP) solver, and solving the route path of each message in the TT stream and the transmission time slot on the route path.
In this embodiment, the TT stream is randomly generated according to the network topology of fig. 1, two non-repeated terminals are randomly selected as the transmitting terminal and the receiving terminal, the frame period is selected from a random number of 100 to 500 μs, the frame size is a random number of 100 to 4000B, the stream priority is a random number of 1 to 7, the maximum delay is smaller than the frame period of the stream, the maximum jitter is smaller than 1/8 of the maximum delay, the link transmission rate is 1Gbit/s, the processing delay is between 1 to 5 μs, the transmission delay is between 1 to 20 μs, and the jitter of the switch processing the TT stream is smaller than 5 μs. Solving the integer linear programming model by using a IBM ILOG CPLEX Optimization Studio solver, and solving by using an objective function and constraint conditions:
，
，
is a value of (2).
The time-sensitive network routing scheduling method provided by the invention can further comprise the following steps after the step S3 and before the step S4: and traversing to inquire whether the uncomputed sending terminal and the uncomputed receiving terminal exist, returning to repeatedly execute the step S3 when the uncomputed sending terminal and the uncomputed receiving terminal exist, and otherwise, executing the step S4.
Step S4: the controller configures a flow table for the TSN switch according to the route path of each message in the TT flow, configures a gating list for the TSN switch according to the transmission time slot of each message in the TT flow, and configures a scheduling time table for the sending terminal.
As shown in fig. 4, in the step S4, a gating list is configured for the TSN switch according to the transmission time slot of each message in the TT stream, which specifically includes:
s401: the TSN configuration module of the controller calls a Client (Netconf Client) to trigger Netconf session establishment, establishes SSH connection with a Server (Server) of the TSN switch, and performs authentication and authorization.
S402: the controller and the TSN switch complete Netconf session establishment and capability negotiation.
S403: the routing path is sent to the controller via a REST request (representational state transfer ), and the controller issues a forwarding flow table for the TSN switch according to the routing management module.
S404: and sending the TT stream transmission time slot to a controller through a REST request, and calling a Netconf RPC by the controller through a TSN configuration module to configure a gating list for the TSN switch.
S405: the TSN configuration module of the controller calls a Client (Netconf Client) to trigger closing of the Netconf session, and a Server (Server) of the TSN switch closes SSH connection.
Further, in the step S4, the process of configuring the scheduling schedule for the transmitting terminal includes: the controller converts the transmission time slot on the routing path of each message in the TT stream into an XML file through a TSN configuration module, and sends the XML file to the sending terminal through a REST request.
Correspondingly, the application also provides electronic equipment, which comprises: one or more processors; a memory for storing one or more programs; the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the time-sensitive network routing scheduling method as described above. As shown in fig. 5, a hardware structure diagram of an arbitrary device with data processing capability, where the time-sensitive network routing scheduling method provided by the embodiment of the present invention is located, is except for the processor, the memory and the network interface shown in fig. 5, where the arbitrary device with data processing capability in the embodiment is located, generally according to the actual function of the arbitrary device with data processing capability, may also include other hardware, which is not described herein again.
Accordingly, the present application also provides a computer readable storage medium having stored thereon computer instructions which, when executed by a processor, implement a time-sensitive network routing scheduling method as described above. The computer readable storage medium may be an internal storage unit, such as a hard disk or a memory, of any of the data processing enabled devices described in any of the previous embodiments. The computer readable storage medium may also be an external storage device, such as a plug-in hard disk, a Smart Media Card (SMC), an SD Card, a Flash memory Card (Flash Card), or the like, provided on the device. Further, the computer readable storage medium may include both internal storage units and external storage devices of any device having data processing capabilities. The computer readable storage medium is used for storing the computer program and other programs and data required by the arbitrary data processing apparatus, and may also be used for temporarily storing data that has been output or is to be output.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure herein. This application is intended to cover any variations, uses, or adaptations of the application following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the application pertains. The specification and examples are to be regarded in an illustrative manner only.
It is to be understood that the present application is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof.
Claims (10)
1. The time-sensitive network routing scheduling method is characterized by depending on a time-sensitive network routing scheduling network architecture and comprises a controller, a plurality of TSN switches, a plurality of transmitting terminals and a plurality of receiving terminals, wherein the TSN switches, the transmitting terminals and the receiving terminals are used as nodes and are coupled with the controller; the TSN exchanger is respectively communicated with the sending terminal and the receiving terminal; the method comprises the following steps:
the controller obtains TSN network topology according to a link layer discovery protocol;
configuring clocks for each TSN exchanger, transmitting terminal and receiving terminal to realize time synchronization;
the controller receives a connection request sent by a sending terminal, wherein the connection request comprises description information of TT flow; configuring transmission priority of each message according to the description information of the TT flow, and configuring route path constraint, path link constraint, link transmission time slot constraint and path scheduling constraint based on TSN network topology, aiming at minimizing the sum of delays in the TT flow, and solving to obtain a route path of each message in the TT flow and a transmission time slot on the route path;
the controller configures a flow table for the TSN switch according to the route path of each message in the TT flow, configures a gating list for the TSN switch according to the transmission time slot of each message in the TT flow, and configures a scheduling time table for the sending terminal.
2. The method of claim 1, wherein the controller obtaining the TSN network topology according to a link layer discovery protocol comprises:
the controller sends a stream modification message to all TSN switches; the TSN switch sets a stream table item to match with the LLDP message and sends the matched LLDP message to the controller;
the controller constructs a detection frame containing the equipment number of the first TSN switch, constructs an LLDP message and sends the LLDP message to the first TSN switch;
broadcasting the LLDP message after the first TSN switch receives the LLDP message; after the second TSN exchanger receives the LLDP message, the LLDP message is packaged into a report data packet, and the report data packet is uploaded to the controller;
the controller constructs a directed edge according to the uploaded report data packet, and marks the directed edge as a first TSN switch and a second TSN switch; and by analogy, the controller sends LLDP messages to all the switches, and builds TSN network topology according to the acquired report data packets.
3. The time-sensitive network routing scheduling method according to claim 1, wherein the TT stream transmitted by the controller receiving the transmitting terminal is recorded as f= (F) 1 ,f 2 ,f 3 ,……,f m , ……,f N ），m∈[1,N]N is the number of messages; each message f m Comprising the following steps: transmitting terminal, receiving terminal, message f m Frame period of (f), message f m Frame size of (f), message f m Priority sp of (2) m Message f m Maximum delay of (2) and message f m Maximum jitter acceptable.
4. A time-sensitive network routing method according to claim 1 or 3, wherein configuring the transmission priority of each message according to the description information of the TT stream comprises:
when the priority of the m-th message is higher than that of the n-th message, the controller arranges the m-th message before the n-th message for transmission;
when the priority of the mth message is the same as that of the nth message, if the transmission period of the data frame corresponding to the mth message is greater than that of the data frame corresponding to the nth message, the controller arranges the mth message before the nth message for transmission;
when the priority of the mth message is the same as the priority of the nth message and the transmission period of the data frame corresponding to the mth message is the same as the transmission period of the data frame corresponding to the nth message, if the maximum delay of the data frame corresponding to the mth message is smaller than the maximum delay of the data frame corresponding to the nth message, the controller arranges the mth message before the nth message for transmission;
when the priority of the mth message is the same as that of the nth message, the transmission period of the data frame corresponding to the mth message is the same as that of the data frame corresponding to the nth message, the maximum delay of the data frame corresponding to the mth message is the maximum delay of the data frame corresponding to the nth message, and if the maximum jitter acceptable by the mth message is less than the maximum jitter acceptable by the nth message, the controller arranges the mth message in the stream before the nth message for transmission; if the maximum jitter acceptable by the mth message is the same as the maximum jitter acceptable by the nth message, the controller randomly selects a message to be transmitted first.
5. The method for scheduling time-sensitive network routing according to claim 1, wherein the routing path constraint is:
when the mth message f m Via the link (source network node, destination network node), the mth message f will be m The routing path variable corresponding to the current link is recorded as 1;
when the mth message f m Without going through the link (source network node, destination network node), the mth message f m The routing path variable corresponding to the current link is noted 0.
6. The method of claim 1, wherein the path link constraints include a first path link constraint, a second path link constraint, and a third path link constraint;
the first path link constraint is: when the mth message f m If the TSN switch serving as the route flow node exists in the corresponding link, the number of the input port links serving as the route flow node TSN switch is equal to the number of the output port links;
the second path link constraint is: the number of the outgoing port links of the sending terminal is equal to that of the incoming port links of the receiving terminal and is 1;
the third path link constraint is: the selected link passes each message only once.
7. The method for scheduling time-sensitive network routing of claim 1, wherein the link transmission slot constraint is expressed as follows:
；
；
in the method, in the process of the invention,for the mth message f m On the link (V) a ,V b ) Start time slot of up-transmission,/->For the mth message f m On the link (V) a ,V b ) Cycle time experienced above, +.>Representing a natural number set.
8. The method of claim 1, wherein the path scheduling constraints include a first path scheduling constraint, a second path scheduling constraint, a third path scheduling constraint, and a fourth path scheduling constraint;
the first path scheduling constraint is: when the controller selects the link (V a ,V b ) When the mth message f m On the link (V) a ,V b ) Start time slot of up transmission and mth message f m On the link (V) a ,V b ) The cycle number time experienced above is a non-negative integer; when the controller does not select a link (V a ,V b ) When the mth message f m On the link (V) a ,V b ) Start time slot of up transmission and mth message f m On the link (V) a ,V b ) The cycle number time experienced above is 0;
the second path scheduling constraint is: mth message f m The difference between the time slot of the exit port link and the time slot of the entry port link at a certain TSN switch is greater than or equal to the mth message f m Processing time at a certain TSN switch; wherein the mth message f m Processing time at a certain TSN switch considers the mth message f m Processing delay, transmission delay, and jitter at a certain TSN switch;
the third path scheduling constraint is: mth message f m The difference between the link time slot of the receiving terminal inlet port and the link time slot of the transmitting terminal outlet port is smaller than the mth message f m Maximum delay with mth message f m On the link (V) a ,V b ) Difference in propagation delay;
the fourth path scheduling constraint is: when the priority of the mth message is higher than that of the nth message, considering the transmission times of the message in the overcycle, and ensuring that the mth message is transmitted through the same link, the mth message is transmitted after the transmission of the mth message is completed.
9. An electronic device comprising a memory and a processor, wherein the memory is coupled to the processor; wherein the memory is configured to store program data and the processor is configured to execute the program data to implement the time-sensitive network routing scheduling method of any one of the preceding claims 1-8.
10. A computer readable storage medium having stored thereon a computer program, wherein the program when executed by a processor implements a time-sensitive network routing scheduling method according to any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410050996.0A CN117596200B (en) | 2024-01-15 | 2024-01-15 | Time-sensitive network route scheduling method, electronic equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410050996.0A CN117596200B (en) | 2024-01-15 | 2024-01-15 | Time-sensitive network route scheduling method, electronic equipment and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117596200A true CN117596200A (en) | 2024-02-23 |
| CN117596200B CN117596200B (en) | 2024-05-07 |
Family
ID=89918602
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410050996.0A Active CN117596200B (en) | 2024-01-15 | 2024-01-15 | Time-sensitive network route scheduling method, electronic equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117596200B (en) |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847151A (en) * | 2016-05-25 | 2016-08-10 | 安徽大学 | Multi-constraint QoS routing strategy design method for software defined network |
| CN111600754A (en) * | 2020-05-11 | 2020-08-28 | 重庆邮电大学 | Industrial heterogeneous network scheduling method for interconnection of TSN (transmission time network) and non-TSN (non-Transmission time network) |
| CN111740924A (en) * | 2020-07-29 | 2020-10-02 | 上海交通大学 | Traffic shaping and routing planning scheduling method of time-sensitive network gating mechanism |
| CN113285872A (en) * | 2021-03-09 | 2021-08-20 | 清华大学 | Time-sensitive network communication flow scheduling method based on deep reinforcement learning |
| CN113300960A (en) * | 2021-07-27 | 2021-08-24 | 南京中网卫星通信股份有限公司 | Delay deterministic transmission method based on routing scheduling and joint optimization |
| US20210306910A1 (en) * | 2020-03-27 | 2021-09-30 | Mitsubishi Electric Research Laboratories, Inc. | Scheduling Data Traffic in Wireless Time Sensitive Networks |
| CN114172843A (en) * | 2022-01-17 | 2022-03-11 | 重庆邮电大学 | Joint optimization method for path selection and gating scheduling in time-sensitive network |
| CN114389946A (en) * | 2022-02-14 | 2022-04-22 | 重庆邮电大学 | Network configuration management method for TSN switch |
| CN115460130A (en) * | 2022-09-20 | 2022-12-09 | 重庆邮电大学 | Multi-path joint scheduling method in time-sensitive network |
| CN115834511A (en) * | 2022-11-28 | 2023-03-21 | 电子科技大学 | Gating scheduling method for periodic messages of each priority in time-sensitive network |
| CN115883438A (en) * | 2022-11-16 | 2023-03-31 | 重庆邮电大学 | Routing and scheduling method and device of time trigger flow in time-sensitive network and readable storage medium |
| CN116192651A (en) * | 2023-03-06 | 2023-05-30 | 重庆邮电大学 | Time sensitive network scheduling method based on bandwidth reservation |
| CN116366550A (en) * | 2023-03-03 | 2023-06-30 | 重庆邮电大学 | End-to-end low-delay scheduling method for time trigger stream of time sensitive network |
| CN117278487A (en) * | 2023-10-23 | 2023-12-22 | 北京航空航天大学 | Flow scheduling method of avionic system based on Qbv protocol of time sensitive network |
-
2024
- 2024-01-15 CN CN202410050996.0A patent/CN117596200B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847151A (en) * | 2016-05-25 | 2016-08-10 | 安徽大学 | Multi-constraint QoS routing strategy design method for software defined network |
| US20210306910A1 (en) * | 2020-03-27 | 2021-09-30 | Mitsubishi Electric Research Laboratories, Inc. | Scheduling Data Traffic in Wireless Time Sensitive Networks |
| US20220353195A1 (en) * | 2020-05-11 | 2022-11-03 | Chongqing University Of Posts And Telecommunications | Scheduling method applied in industrial heterogeneous network in which tsn and non-tsn are interconnected |
| CN111600754A (en) * | 2020-05-11 | 2020-08-28 | 重庆邮电大学 | Industrial heterogeneous network scheduling method for interconnection of TSN (transmission time network) and non-TSN (non-Transmission time network) |
| CN111740924A (en) * | 2020-07-29 | 2020-10-02 | 上海交通大学 | Traffic shaping and routing planning scheduling method of time-sensitive network gating mechanism |
| CN113285872A (en) * | 2021-03-09 | 2021-08-20 | 清华大学 | Time-sensitive network communication flow scheduling method based on deep reinforcement learning |
| CN113300960A (en) * | 2021-07-27 | 2021-08-24 | 南京中网卫星通信股份有限公司 | Delay deterministic transmission method based on routing scheduling and joint optimization |
| CN114172843A (en) * | 2022-01-17 | 2022-03-11 | 重庆邮电大学 | Joint optimization method for path selection and gating scheduling in time-sensitive network |
| CN114389946A (en) * | 2022-02-14 | 2022-04-22 | 重庆邮电大学 | Network configuration management method for TSN switch |
| CN115460130A (en) * | 2022-09-20 | 2022-12-09 | 重庆邮电大学 | Multi-path joint scheduling method in time-sensitive network |
| CN115883438A (en) * | 2022-11-16 | 2023-03-31 | 重庆邮电大学 | Routing and scheduling method and device of time trigger flow in time-sensitive network and readable storage medium |
| CN115834511A (en) * | 2022-11-28 | 2023-03-21 | 电子科技大学 | Gating scheduling method for periodic messages of each priority in time-sensitive network |
| CN116366550A (en) * | 2023-03-03 | 2023-06-30 | 重庆邮电大学 | End-to-end low-delay scheduling method for time trigger stream of time sensitive network |
| CN116192651A (en) * | 2023-03-06 | 2023-05-30 | 重庆邮电大学 | Time sensitive network scheduling method based on bandwidth reservation |
| CN117278487A (en) * | 2023-10-23 | 2023-12-22 | 北京航空航天大学 | Flow scheduling method of avionic system based on Qbv protocol of time sensitive network |
Non-Patent Citations (3)
| Title |
|---|
| YING WANG; YUFAN CHENG; ZHIHAN ZHUANG; JUNYE ZHANG; PENG YU; SHAOYONG GUO; XUESONG QIU: "Joint Routing and GCL Scheduling Algorithm Based on Tabu Search in TSN", 《2023 19TH INTERNATIONAL CONFERENCE ON NETWORK AND SERVICE MANAGEMENT (CNSM)》, 28 November 2023 (2023-11-28) * |
| 左卫松;: "基于时间敏感网络的芯片架构和应用", 集成电路应用, no. 06, 9 June 2020 (2020-06-09) * |
| 陈志刚;曾锋;李庆华;: "无线mesh网中时延约束抖动优化的多路径流量分配算法", 通信学报, no. 01, 25 January 2011 (2011-01-25) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117596200B (en) | 2024-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104170291B (en) | Method and network node for handling Precision Time Protocol | |
| JP6032824B2 (en) | Scheduling method, end node and core network switch in packet switched communication network | |
| US20240214323A1 (en) | Packet transmission method and apparatus | |
| Imtiaz et al. | A performance study of Ethernet Audio Video Bridging (AVB) for Industrial real-time communication | |
| CN107888499A (en) | A kind of distribution subscription system and message forwarding method based on SDN | |
| Garbugli et al. | End-to-end qos management in self-configuring tsn networks | |
| Schweissguth et al. | Application-aware industrial ethernet based on an SDN-supported TDMA approach | |
| EP3981133A1 (en) | Control device, switch device and methods | |
| CN115242728B (en) | Message transmission method and device | |
| CN115037399A (en) | Message forwarding method, electronic device and storage medium | |
| CN111698787B (en) | Scheduling rule determining method and device | |
| CN109921972A (en) | The method that data packet transfers and/or receives | |
| CN113765825B (en) | Planning method and system architecture for chained service flow scheduling | |
| US20230090803A1 (en) | Network Infrastructure Device, Communication Terminal and Method for Synchronizing Control Applications via a Communication Network for Transferring Time-Critical Data | |
| CN117596200B (en) | Time-sensitive network route scheduling method, electronic equipment and medium | |
| Zheng et al. | Mix-flow scheduling for concurrent multipath transmission in time-sensitive networking | |
| Baldi et al. | Time-driven priority router implementation: Analysis and experiments | |
| Cavalieri | Modelling and analysing congestion in KNXnet/IP | |
| Wu et al. | Joint optimization of time-slot allocation and traffic steering for large-scale deterministic networks | |
| Steiner et al. | IEEE 802.1 Audio/Video Bridging and Time-Sensitive Networking | |
| CN115396378B (en) | Cross-domain collaborative delay sensitive network scheduling method and system based on time slot mapping | |
| WO2024093676A1 (en) | Deterministic service processing method and apparatus | |
| WO2022185587A1 (en) | Communication method, communication system, and switch | |
| JP2010050670A (en) | Data communications system, data communications method, and information processing apparatus configuring the data communications system | |
| Nasrallah | Time Sensitive Networking in Multimedia and Industrial Control Applications |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |