CN113992601A - Traffic scheduling method and device for time-sensitive network - Google Patents

Traffic scheduling method and device for time-sensitive network Download PDF

Info

Publication number
CN113992601A
CN113992601A CN202111164207.9A CN202111164207A CN113992601A CN 113992601 A CN113992601 A CN 113992601A CN 202111164207 A CN202111164207 A CN 202111164207A CN 113992601 A CN113992601 A CN 113992601A
Authority
CN
China
Prior art keywords
traffic
time
flow
periodic
priority
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.)
Pending
Application number
CN202111164207.9A
Other languages
Chinese (zh)
Inventor
杨铮
赵毅
贺骁武
曹昊
董亮
党凡
吴家行
刘云浩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tsinghua University
Original Assignee
Tsinghua University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Tsinghua University filed Critical Tsinghua University
Priority to CN202111164207.9A priority Critical patent/CN113992601A/en
Publication of CN113992601A publication Critical patent/CN113992601A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/6215—Individual queue per QOS, rate or priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/821—Prioritising resource allocation or reservation requests
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/826—Involving periods of time

Abstract

The invention provides a flow scheduling method and a device of a time sensitive network, wherein periodic flow and burst flow are transmitted in the time sensitive network, and the method comprises the following steps: performing probability flow modeling on the bursty traffic, so that the bursty traffic is modeled into periodic traffic with probability properties represented in the form of probability flow; setting condition constraint on the flow scheduling problem of periodic flow and sudden flow in a time sensitive network according to a priority time slice sharing rule and a prudent reservation rule, and establishing a satisfiability model theoretical model; and obtaining a result of the traffic scheduling problem through a solver according to the established satisfiability model theoretical model. The priority time slice sharing rule and the prudent reservation rule restrict the traffic scheduling problem in the time sensitive network, the bursty traffic preemption mechanism is realized through the priority time slice sharing rule, and the time slice is reserved only on the link with the bursty traffic in the network through the prudent reservation rule, so that the waste of network resources is avoided.

Description

Traffic scheduling method and device for time-sensitive network
Technical Field
The invention relates to the technical field of industrial internet, in particular to a flow scheduling method and device of a time-sensitive network.
Background
With the rapid development of network communication technology, information technology and operation technology are continuously fused in the industrial 4.0 era to enable industrial control to become more automatic and intelligent, and the fusion of the information technology and the operation technology also enables the data volume in the network to become more huge. In the industrial field, the requirements of edge computing, industrial internet of things, intelligent manufacturing and the like are gradually urgent, the real-time performance and the certainty of data transmission are particularly important, and although the traditional ethernet has introduced the characteristics of datagram priority and the like to ensure the service quality as much as possible, the "Best Effort" strategy adopted by the traditional ethernet still cannot ensure the certainty delay of data transmission under the condition of network congestion. Therefore, conventional ethernet cannot be used in industrial control applications with high latency and stability.
With the development of technology, time-sensitive networks are becoming a key technology of widespread focus in order to meet the demand of industrial automation applications for real-time data transmission. The Time-Sensitive Network (TSN) mainly works on a data link layer, and is used for constructing an ethernet with high reliability and low delay, and providing infrastructure for applications such as vehicle-mounted communication and industrial internet. In the time sensitive network, the equipment and the switch are time synchronized, and the generation and transmission time of the data is planned in advance through a traffic scheduling strategy, so that the time sensitive network can provide deterministic time delay for data transmission in the Ethernet. However, in the existing paradigm, the time-sensitive network can only support deterministic transmission of periodic traffic, and there is no suitable scheduling method for the case of coexistence of bursty traffic and periodic traffic.
Disclosure of Invention
The invention provides a traffic scheduling method and a traffic scheduling device for a time-sensitive network, which are used for solving the problem of scheduling conflict of periodic traffic and bursty traffic in the time-sensitive network in the prior art and realizing a strategy for cooperatively scheduling the periodic traffic and the bursty traffic in the time-sensitive network.
The invention provides a flow scheduling method of a time sensitive network, wherein periodic flow and burst flow are transmitted in the time sensitive network, and the method comprises the following steps:
performing probability flow modeling on the bursty traffic, so that the bursty traffic is modeled into periodic traffic with probability properties represented in the form of probability flow;
setting condition constraint on the flow scheduling problem of periodic flow and sudden flow in a time sensitive network according to a priority time slice sharing rule and a prudent reservation rule, and establishing a satisfiability model theoretical model; wherein bursty traffic is inserted into the periodic traffic being transmitted by the priority time slice sharing rule to be preferentially transmitted, and the priority time slice sharing rule is executed on a link of a time sensitive network in which the bursty traffic exists by a prudent reservation rule;
and obtaining the result of the traffic scheduling problem through a solver according to the established satisfiability model theoretical model.
According to the traffic scheduling method of the time sensitive network provided by the invention, the probability flow modeling is performed on the bursty traffic, so that the bursty traffic is modeled into the periodic traffic with probability property, and the method specifically comprises the following steps:
determining a sending period of the periodic traffic, wherein the sending period is an interval period of adjacent periodic traffic;
and carrying out probability distribution on the burst traffic in the sending period in a preset probability distribution mode.
According to the traffic scheduling method of the time sensitive network provided by the invention, the traffic scheduling problem of the periodic traffic and the bursty traffic in the time sensitive network is subjected to condition setting constraint according to the priority time slice sharing rule and the prudent reservation rule, and a satisfiability model theoretical model is established, which specifically comprises the following steps:
defining a traffic scheduling problem in a time sensitive network;
carrying out time constraint on the traffic scheduling problem so that the sudden traffic is sent before a preset cut-off time;
performing data packet overlapping constraint on the traffic scheduling problem, so that two data packets which belong to the same bursty traffic and are generated can share the same time slice, and two data packets which respectively belong to the bursty traffic and the periodic traffic can share the same time slice;
carrying out priority constraint on the traffic scheduling problem according to a priority time slice sharing rule, and setting priority for the bursty traffic so that the bursty traffic has the priority on a time slice in a periodic traffic setting range;
and carrying out adjacent link constraint on the traffic scheduling problem according to a prudent reservation rule, so that on the link provided with the reserved time slice, the time slice of the adjacent downlink starts scheduling after the last time slice of the link provided with the reserved time slice is finished.
According to the traffic scheduling method of the time sensitive network provided by the invention, the traffic scheduling problem in the time sensitive network is defined, which specifically comprises the following steps:
representing the set of flows to be scheduled as S ═ S<s1，s2，s3，...，sN>Including probabilistic flows modeled as periodic and bursty traffic,
stream s in stream setiOn time sensitive network links<va，vb>The set of data packets to be transmitted is represented as follows:
Figure BDA0003291153150000031
wherein the content of the first and second substances,
Figure BDA0003291153150000032
data packets containing periodic traffic as well as bursty traffic,
Figure BDA0003291153150000033
representing the flow siOn time sensitive network links<va，vb>The jth data packet transmitted above, each data packet containing three attributes:
Figure BDA0003291153150000034
where φ is the start time of the reserved time slice of the data packet, T is the transmission period of the periodic traffic or the shortest interval time of the bursty traffic, and L is the time in the link<va，vb>The time taken to transmit the data packet, each time being<va，vb>Tu is the unit.
According to the traffic scheduling method of the time-sensitive network provided by the present invention, the time constraint is performed on the traffic scheduling problem, so that the bursty traffic is sent before the preset deadline, specifically comprising:
the transmission of the data packets of the stream is to be completed within its cycle time:
Figure BDA0003291153150000041
wherein s isiPath represents a flow siA path through a time sensitive network;
for a probability flow generated by bursty traffic, its scheduled time of the first frame on the first link in a time sensitive network, phi, should be after its occurrence time:
Figure BDA0003291153150000042
where s.type denotes the type of stream, Prob denotes the abbreviation of probability stream, siOt represents the probability flow siThe time of occurrence of (c);
data packets of the same stream are sequentially sent through a link:
Figure BDA0003291153150000043
the end-to-end delay requirements of the flow should also be met:
Figure BDA0003291153150000044
where Det denotes the abbreviation of periodic flow, siE2e denotes maximum end-to-end delay is allowed;
and according to the end-to-end delay requirement, circularly traversing each probability flow generated by the bursty flow, so that the time sensitive network sends the data packet of the bursty flow before the preset cut-off time.
According to the traffic scheduling method of the time-sensitive network provided by the present invention, the data packet overlapping constraint is performed on the traffic scheduling problem, so that two data packets belonging to the same bursty traffic can share the same time slice, and two data packets respectively belonging to the bursty traffic and the periodic traffic can share the same time slice, which specifically comprises:
the packet overlap constraint is formalized as follows:
Figure BDA0003291153150000051
where E represents the link set in the time sensitive network and "overlap" represents the overlap.
According to the traffic scheduling method of the time-sensitive network provided by the invention, the traffic scheduling problem is subjected to priority constraint according to a priority time slice sharing rule, and the priority is set for the bursty traffic, so that the bursty traffic has the priority on a time slice in a periodic traffic setting range, and the method specifically comprises the following steps:
the third number of priorities are preset in the time-sensitive network, one of the priorities is set as the priority of the bursty traffic, the remaining priorities are divided into two groups, one group of the priorities is from low to high according to the priority and is used for the periodic traffic of the shared time slice, the other group of the priorities is from low to high according to the priority and is used for the periodic traffic of the non-shared time slice, and therefore the priority constraint is formalized as follows:
Figure BDA0003291153150000052
wherein s isiP represents the priority of the flow, EP represents the priority of the bursty traffic, NSH _ PL represents the lowest priority of the periodic traffic of the unshared time slices, NSH _ PH represents the highest priority of the periodic traffic of the unshared time slices, SH _ PL represents the lowest priority of the periodic traffic of the shared time slices, and SH _ PH represents the highest priority of the periodic traffic of the shared time slices.
According to the traffic scheduling method of the time-sensitive network provided by the present invention, the adjacent link constraint is performed on the traffic scheduling problem according to a prudent reservation rule, so that on a link with reserved time slices, the time slices of the adjacent downlink start scheduling after the last time slice of the link with reserved time slices is finished, specifically comprising:
the adjacent link constraint is formalized as:
Figure BDA0003291153150000061
wherein the content of the first and second substances,<va，vb>d represents the transmission delay of the link.
The invention also provides a traffic scheduling device of a time sensitive network, wherein the time sensitive network transmits periodic traffic and bursty traffic, and the device comprises:
the sudden flow modeling unit is used for carrying out probability flow modeling on the sudden flow so that the sudden flow is modeled into periodic flow with probability property represented in a probability flow form;
the satisfiability model theoretical modeling unit is used for setting condition constraint on the flow scheduling problem of the periodic flow and the burst flow in the time sensitive network according to the priority time slice sharing rule and the prudent reservation rule and establishing a satisfiability model theoretical model; wherein bursty traffic is inserted into the periodic traffic being transmitted by the priority time slice sharing rule to be preferentially transmitted, and the priority time slice sharing rule is executed on a link of a time sensitive network in which the bursty traffic exists by a prudent reservation rule;
and the satisfiability model theoretical processing unit is used for obtaining the result of the traffic scheduling problem through a solver according to the established satisfiability model theoretical model.
The present invention also provides an electronic device, including a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the steps of the traffic scheduling method of the time-sensitive network according to any one of the above-mentioned embodiments.
According to the traffic scheduling method and device of the time sensitive network, provided by the invention, the bursty traffic is modeled into the periodic traffic with probability property, and the traffic in the network is all considered as the periodic traffic in the scheduling of the time sensitive network, so that the traffic scheduling problem in the time sensitive network is simplified; meanwhile, the priority time slice sharing rule and the prudent reservation rule restrict the flow scheduling problem of the periodic flow and the burst flow in the time sensitive network, the burst flow preemption mechanism is realized through the priority time slice sharing rule, and the time slice is reserved only on the link with the burst flow in the network through the prudent reservation rule, so the waste of network resources is avoided.
Drawings
In order to more clearly illustrate the technical solutions of the present invention or the prior art, the drawings needed for the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
FIG. 1 is a flow chart of a traffic scheduling method for a time sensitive network according to the present invention;
FIG. 2 is a schematic diagram of a link structure in a time-sensitive network provided by the present invention;
FIG. 3 is a schematic diagram of a superposition structure of probability stream packets provided by the present invention;
FIG. 4 is a diagram illustrating a structure of reserving a fixed time slice exclusively for bursty traffic in the prior art;
FIG. 5 is a schematic diagram of a preferred time slice sharing rule provided by the present invention;
FIG. 6 is a schematic diagram of the time slice correspondence between uplink and downlink of the prudent reservation rule provided by the present invention;
FIG. 7 is a schematic flow chart illustrating the process of the present invention corresponding to step 120 in FIG. 1;
fig. 8 is a schematic structural diagram of a traffic scheduling apparatus of a time-sensitive network provided by the present invention;
fig. 9 is a schematic structural diagram of an electronic device provided by the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is obvious that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The burst traffic and the periodic traffic belong to network traffic common in the industrial field, the burst traffic refers to network traffic triggered by a certain burst event, and different from the periodic traffic, the generation time of the burst traffic is often uncertain, and a time schedule maintained in a time-sensitive network in the prior art does not include scheduling of the burst traffic. If periodic traffic and bursty traffic are scheduled simultaneously in a time sensitive network, two challenges are mainly faced, one is how to simultaneously meet the delay requirements of the periodic traffic and the bursty traffic, and the other is how to design a reasonable bursty traffic preemption mechanism, so as to ensure that the service quality of the periodic traffic is not affected.
As shown in fig. 1, an embodiment of the present invention provides a traffic scheduling method for a time-sensitive network, where periodic traffic and bursty traffic are transmitted in the time-sensitive network, and the method includes:
step 110: performing probability flow modeling on the bursty traffic, so that the bursty traffic is modeled into periodic traffic with probability properties represented in the form of probability flow;
in this embodiment of the present invention, corresponding to step 110, performing probabilistic flow modeling on bursty traffic to enable the bursty traffic to be modeled as periodic traffic with probabilistic properties specifically includes:
determining a sending period of the periodic traffic, wherein the sending period is an interval period of adjacent periodic traffic;
and carrying out probability distribution on the burst traffic in the sending period in a preset probability distribution mode.
Specifically, taking the network topology shown in fig. 2 as an example, the network of fig. 2 is composed of three devices (D)1，D2，D3) And a Switch (SW)1) Composition s1Is from D1To D3Periodic flow of (S)2Is from D2To D3In order to model the bursty traffic, the embodiment of the invention provides a modeling method of the bursty critical traffic based on the probability flow.
Let T be in a network linkThe time required to transmit a packet is assumed to be the bursty traffic s in fig. 22The shortest interval time between adjacent events is 5T, i.e. the required delay is less than or equal to 5T, the periodic flow s1The transmission period of (2) is 5T, that is, the required delay is 5T or less. s1Three data packets, s, are sent consecutively in each cycle2Each time a data packet, s, is transmitted2Can be driven from D at any time during the 5T period2And sending the burst traffic. A probabilistic flow refers to a flow that maps bursty traffic to a different flow with a different probability of occurrence. Suppose s2N network flows are created, respectively ps21，ps22，ps23，...，ps2NIs used to represent s2Probability flows occurring with different possibilities, where N is a set value, ps2iViewed as a periodic flow triggered from a point in time (i-1) × (5T/N), its start and end points and s2Same, its period is s2The shortest interval time of 5T. If s2Occurs at psi-1And psiIn the case of s2Delayed to sum with psiAlignment, s in this case2The maximum allowable delay of the time delay is shortened from 5T to 5T/N. The probability flow model can cover all the possibility of occurrence of the sudden flow, the sudden flow is modeled into a periodical flow with probability property, in the actual scheduling of the time sensitive network, the flow in the network can be all used as the periodical flow for scheduling, and the scheduling method provided below can meet the delay requirements of all the flows, and then can meet the delay requirements of the sudden flow.
In the embodiment of the present invention, bursty traffic has been modeled as periodic traffic with probabilistic properties, but is different from periodic traffic in scheduling. In the scheduling of the traditional time-sensitive network, two periodic flow data packets transmitted by the same link cannot be overlapped, and only one data packet can be transmitted on one link at most once. However, after the bursty traffic is introduced into the probability flow model, because the probabilistic flow model is decomposed in the form of probability distribution, at most one of different probability flows of the same bursty traffic is trueAnd therefore allow the superposition of probability streams belonging to the same bursty traffic during the scheduling. FIG. 3 is a schematic diagram of probability flow overlay scheduling, wherein
Figure BDA0003291153150000101
Representing periodic flow s1The jth data packet in (1), using ps2iRepresentative of bursty traffic s2Is the probability of the probability stream of (a),
Figure BDA0003291153150000102
representing the probability flow ps2iT is the time required to transmit a packet on the link. Suppose s2There are 5 different probability streams, ps each21，ps22，ps23，...，ps25At link SW1-D3In the above, the scheduling policy is
Figure BDA0003291153150000103
And
Figure BDA0003291153150000104
three overlapping data packets between
Figure BDA0003291153150000105
The same time slice is reserved to ensure the satisfaction
Figure BDA0003291153150000106
The delay requirement of (c). In that
Figure BDA0003291153150000107
Then, the scheduling strategy is two overlapped data packets
Figure BDA0003291153150000108
And
Figure BDA0003291153150000109
the same time slice is reserved to ensure the satisfaction
Figure BDA00032911531500001010
And
Figure BDA00032911531500001011
the delay requirement of (c). Thus, the bursty traffic s2All probability flows meet the delay requirement, although a plurality of probability flow data packets are scheduled on some time slices, at most one data packet can be filled in the actual network operation, and no flow conflict can be generated.
Step 120: setting condition constraint on the flow scheduling problem of periodic flow and sudden flow in a time sensitive network according to a priority time slice sharing rule and a prudent reservation rule, and establishing a satisfiability model theoretical model; wherein bursty traffic is inserted into the periodic traffic being transmitted by the priority time slice sharing rule to be preferentially transmitted, and the priority time slice sharing rule is executed on a link of a time sensitive network in which the bursty traffic exists by a prudent reservation rule;
in the embodiment of the present invention, corresponding to step 120, the priority time slice sharing rule in the traffic scheduling method in the time-sensitive network is embodied as:
prolonging the sending period of the periodic traffic according to the priority time slice sharing rule, so that the sending period of the periodic traffic is expanded from a first number of time slices to a second number of time slices; the time slices of the second quantity are shared by the periodic traffic and the bursty traffic, and the time slices of the difference value between the second quantity and the first quantity are reserved for the bursty traffic;
and traversing each link in the time-sensitive network according to the prudent reservation rule, and executing the priority time slice sharing rule on the link with the sudden traffic.
Specifically, embodiments of the present invention model bursty traffic as probabilistic flows, which can reduce scheduling efficiency if a dedicated time slice is reserved for bursty traffic. As shown in fig. 4, in this schedule, the time sensitive network reserves one time slice (T) for bursty traffic every 6T period, while the other 5 time slices are reserved for periodic traffic. At the mostIn bad case, when the burst traffic packet f1 eJust missing the reserved time slice, it is necessary to wait for 5T for transmission, which is not enough for the bursty traffic with high delay requirement, and it also increases the network jitter of the bursty traffic transmission.
In order to solve the above problem, the embodiment of the present invention proposes a priority time slice sharing mechanism, so that bursty traffic can be transmitted at a higher priority in time slices of periodic traffic. As shown in fig. 5, it is assumed that time slices of 5T +1T duration are reserved for periodic traffic, which may be shared with bursty traffic. So whenever a bursty traffic packet f1 eThe transmission can be immediately made at the time of arrival and the remaining packets of the periodic traffic are accordingly delayed from being transmitted. To ensure that the deferred packets are also transmitted successfully, some extra time slices are reserved for the periodic traffic, for example, the time slices reserved for the periodic traffic in fig. 5 are increased by 1T. Therefore, the time slice sharing is prioritized, so that the rapid transmission can be ensured when the burst traffic occurs, and the network delay and the jitter are remarkably reduced.
In the embodiment of the present invention, corresponding to step 120, the prudent reservation rule in traffic scheduling in the time-sensitive network is embodied as follows:
as can be seen from the above priority time slice sharing rule, the bursty traffic can preempt the shared time slice of the periodic traffic, so that an extra time slice is reserved for the periodic traffic and it is ensured that the worst-case delay of the periodic traffic does not exceed the limit. However, if the length of the traffic (i.e. the number of packets) is set to be a constant value on each link, the extra time slice reserved for the bursty traffic on each link will result in resource waste. Also taking FIG. 2 as an example, assume a periodic flow s1And bursty traffic s2Time slices are shared. Due to s1And s2Only on the link SW1-D3Overlap, and therefore do not need to be along s1Each link of the path of (1) additionally reserves a time slice, namely link D1-SW1Due to no weightOverlapping bursty traffic s2No extra reserved time slice needs to be set. Therefore, in order to minimize the extra reserved time slice, a careful reservation rule is designed in the embodiment of the invention at the link level. The input is two types of traffic and the output is an extended periodic traffic. For each link on the path, traverse all bursty traffic for each link, and according to length(s)e.l，stL) and minimum separation time(s)eT) the number of extra time slices it needs, T being the time to transmit one packet. Specifically, the calculation formula of the number of reserved time slices added in the transmission of the periodic traffic is as follows:
Figure BDA0003291153150000121
wherein s iseL represents the number of data packets contained in the bursty traffic, stL denotes the number of data packets contained in the periodic traffic, stL × T represents the time consumed for one transmission of the periodic traffic, st.l×T/seT denotes the number of bursty traffic that can be transmitted in the time it takes for a periodic traffic transmission once.
Due to the careful reservation of time slices, the number of scheduled packets on adjacent links may differ, and the time slice for which a packet is reserved on the downlink should be after the time slice for which it is on the uplink. Since the generation time of the bursty traffic has uncertainty, the time slice correspondence on the adjacent links is also uncertain. To ensure that a data packet of a periodic flow does not miss its corresponding time slice, it is necessary to schedule the time slice on the downlink after the latest time slice at which the same frame may be transmitted on the uplink. An example is given in fig. 6, the upstream link SWa-SWbThe upper periodic traffic overlaps with the bursty traffic, but in the downstream link SWb-SWcThere is no overlap. Thus, the periodic traffic is on the link SWa-SWbA time slice is reserved. Then the downstream link fiWhen (2) is in contact withThe inter-slice should be on the upstream link fi+1Then scheduled, not upstream link fiAnd then. After applying this rule along the entire path of the flow, its worst-case delay can be modeled as the time from transmission on the first link to reception on the last link.
In the embodiment of the present invention, corresponding to step 120, the constraint of setting conditions is performed on the traffic scheduling problem of the periodic traffic and the bursty traffic in the time sensitive network according to the priority time slice sharing rule and the prudent reservation rule, and a satisfiability model theoretical model is established, as shown in fig. 7, which specifically includes:
step 710: defining a traffic scheduling problem in a time sensitive network;
in particular, the network topology is abstracted as a directed graph G (V, E), where the vertex V represents a switch or device, an edge
Figure BDA0003291153150000131
Representing links between switches and/or devices. If two network nodes vaAnd vbAre connected to each other to form a border<va，vb>And<vb，vc>will be added to E to represent the full duplex link between them. A link<va，vb>Having three attributes<va，vb>.b，<va，vb>D and<va，vb>tu, where b is the link bandwidth, d is the transmission delay, tu is the smallest unit of time on the link, which determines the granularity of the scheduling time.
Without loss of generality, only a single stream is considered to simplify the description. Stream s can be characterized by 8 attributes: s.path, s.e2e, s.p, s.l, s.T, s.type, s.share, and s.ot. s.path ═ 2 [, ]<v1，v2>，<v2，v3>，...，<vn-1，vn>]Is the path that the stream s flows through in the network; e2e, s.p and s.l represent maximum end-to-end delay allowed, priority of the stream and byte length of the stream, respectively; for periodic traffic s.T is the transmission period, for a burstFor probabilistic flows derived from sexual traffic, s.T is the minimum interval time for which bursty traffic occurs; type is the type of flow, Determini (Det) for periodic flows and Probabistic (Prob) for probabilistic flows; share is only valid for periodic traffic, which represents whether stream s shares a time slice with bursty traffic; ot is valid only for the probability stream, representing its time of occurrence, i.e. the time it starts transmission on the source device.
Representing the set of flows to be scheduled as S ═ S<s1，s2，s3，...，sN>Including probabilistic flows modeled as periodic and bursty traffic,
stream s in stream setiOn time sensitive network links<va，vb>The set of data packets to be transmitted is represented as follows:
Figure BDA0003291153150000132
wherein the content of the first and second substances,
Figure BDA0003291153150000133
data packets containing periodic traffic as well as bursty traffic,
Figure BDA0003291153150000134
representing the flow siOn time sensitive network links<va，vb>The jth data packet transmitted above, each data packet containing three attributes:
Figure BDA0003291153150000141
where φ is the start time of the reserved time slice of the data packet, T is the transmission period of the periodic traffic or the shortest interval time of the bursty traffic, and L is the time in the link<va，vb>The time taken to transmit the data packet, each time being<va，vb>Tu is aA bit.
Based on the above defined notation, the following proposes a Satisfiability Modeling Theory (SMT) problem modeling process of the scheduling method.
Step 720: carrying out time constraint on the traffic scheduling problem so that the sudden traffic is sent before a preset cut-off time;
the method specifically comprises the following steps:
first, the scheduling time of the data packet cannot be a negative value, the transmission of the data packet is to be completed within its cycle time, and the transmission of the data packet of the flow is to be completed within its cycle time:
Figure BDA0003291153150000142
for a probability flow generated by bursty traffic, its scheduled time of the first frame on the first link in a time sensitive network, phi, should be after its occurrence time:
Figure BDA0003291153150000143
secondly, the data packets of the same stream are sequentially sent through a link:
Figure BDA0003291153150000144
furthermore, the end-to-end delay requirement of the flow should also be met:
Figure BDA0003291153150000145
Figure BDA0003291153150000151
according to the end-to-end delay requirement, each probability flow generated by the bursty traffic is traversed through a formula (7) in a circulating mode, so that the time-sensitive network sends the data packet of the bursty traffic before the preset cut-off time. I.e., to ensure that whenever bursty traffic occurs, a time sensitive network can deliver its data packets before the deadline.
Step 730: performing data packet overlapping constraint on the traffic scheduling problem, so that two data packets which belong to the same bursty traffic and are generated can share the same time slice, and two data packets which respectively belong to the bursty traffic and the periodic traffic can share the same time slice;
only one data packet can be transmitted by one link at a time, so when the periodic traffic is scheduled independently, the time slices scheduled by the two periodic traffic data packets cannot be overlapped. However, in the present embodiment, there are two cases where the time slices are allowed to overlap: (1) when two packets belong to different probability flows derived from the same bursty traffic, at most one of them will actually happen; (2) when one is a probabilistic flow and the other is a periodic flow sharing a time slice, because the reserved time slice of the periodic flow has been expanded in time slice setting according to a prudent reservation rule, the packet overlap constraint in this step is formalized as follows:
Figure BDA0003291153150000152
where E represents the link set in the time sensitive network and "overlap" represents the overlap.
Step 740: carrying out priority constraint on the traffic scheduling problem according to a priority time slice sharing rule, and setting priority for the bursty traffic so that the bursty traffic has the priority on a time slice in a periodic traffic setting range;
the method specifically comprises the following steps:
the third number of priorities are preset in the time-sensitive network, one of the priorities is set as the priority of the bursty traffic, the remaining priorities are divided into two groups, one group of the priorities is from low to high according to the priority and is used for the periodic traffic of the shared time slice, the other group of the priorities is from low to high according to the priority and is used for the periodic traffic of the non-shared time slice, and therefore the priority constraint is formalized as follows:
Figure BDA0003291153150000161
the priority determines in which queue the packet should wait for transmission, enabling spatial isolation from flow to flow in the switch or device. For example, a time sensitive network may have up to 8 priorities, one of which is reserved for bursty traffic and the remaining priorities are then divided into two groups. One set of priorities is from SH _ PL to SH _ PH for sharing the periodic traffic of the time slice, and the other set of priorities is from NSH _ PL to NSH _ PH for not sharing the periodic traffic of the time slice.
Step 750: and carrying out adjacent link constraint on the traffic scheduling problem according to a prudent reservation rule, so that on the link provided with the reserved time slice, the time slice of the adjacent downlink starts scheduling after the last time slice of the link provided with the reserved time slice is finished.
It has been discussed in prudent reservation rules that the time slice on the downlink should be scheduled after the latest time slice on the uplink where the same frame is likely to be transmitted, so the adjacent link constraint can be formalized as:
Figure BDA0003291153150000162
Figure BDA0003291153150000171
step 130: and obtaining the result of the traffic scheduling problem through a solver according to the established satisfiability model theoretical model.
The embodiment of the invention converts the cooperative scheduling of the periodic traffic and the bursty traffic into a satisfiability model theory problem, and solves the problem through an SMT solver such as z 3.
The XX device provided in the embodiment of the present invention is described below, where a traffic scheduling device of a time sensitive network described below and a traffic scheduling method of the time sensitive network described above may be referred to correspondingly, as shown in fig. 8, where the embodiment of the present invention provides a traffic scheduling device of a time sensitive network, where periodic traffic and bursty traffic are transmitted in the time sensitive network, the traffic scheduling device includes:
a bursty traffic modeling unit 810, configured to perform probability flow modeling on bursty traffic, so that the bursty traffic is modeled into a periodic traffic with probability properties represented in a form of probability flow;
in this embodiment of the present invention, the bursty traffic modeling unit 810 includes:
a sending period determining subunit, configured to determine a sending period of a periodic traffic, where the sending period is an interval period of adjacent periodic traffic;
and the probability distribution subunit is used for performing probability distribution on the bursty traffic in the sending period in a preset probability distribution mode.
All the possibilities of the occurrence of the bursty traffic can be covered through the established probability flow model, the bursty traffic is modeled into a periodic traffic with probability property, and in the actual scheduling of the time sensitive network, all the traffic in the network can be scheduled as the periodic traffic.
The satisfiability model theoretical modeling unit 820 is used for setting condition constraints on the traffic scheduling problem of the periodic traffic and the bursty traffic in the time sensitive network according to the priority time slice sharing rule and the prudent reservation rule, and establishing a satisfiability model theoretical model; wherein bursty traffic is inserted into the periodic traffic being transmitted by the priority time slice sharing rule to be preferentially transmitted, and the priority time slice sharing rule is executed on a link of a time sensitive network in which the bursty traffic exists by a prudent reservation rule;
in this embodiment of the present invention, the satisfiability model theory modeling unit 820 includes:
the flow scheduling problem definition subunit is used for defining the flow scheduling problem in the time sensitive network;
the time constraint subunit is used for carrying out time constraint on the traffic scheduling problem so as to enable the bursty traffic to be sent before a preset cut-off time;
the data packet overlapping constraint is used for carrying out data packet overlapping constraint on the flow scheduling problem, so that two data packets which belong to the same bursty flow and are generated can share the same time slice, and two data packets which respectively belong to the bursty flow and the periodic flow can share the same time slice;
the priority constraint is used for carrying out priority constraint on the traffic scheduling problem according to a priority time slice sharing rule and setting priority for the bursty traffic so that the bursty traffic has priority on a time slice in a set range of the periodic traffic;
and the adjacent link constraint is used for carrying out adjacent link constraint on the traffic scheduling problem according to a prudent reservation rule, so that on the link provided with the reserved time slice, the time slice of the adjacent downlink starts scheduling after the last time slice of the link provided with the reserved time slice is finished.
And the satisfiability model theoretical processing unit 830 is configured to obtain a result of the traffic scheduling problem through a solver according to the established satisfiability model theoretical model.
The embodiment of the present invention converts the cooperative scheduling of the periodic traffic and the bursty traffic into the satisfiability model theory problem, and the satisfiability model theory processing unit 830 performs solving through an SMT solver such as z 3.
An entity structure schematic diagram of an electronic device provided in an embodiment of the present invention is described below with reference to fig. 9, and as shown in fig. 9, the electronic device may include: a processor (processor)910, a communication Interface (Communications Interface)920, a memory (memory)930, and a communication bus 940, wherein the processor 910, the communication Interface 920, and the memory 930 communicate with each other via the communication bus 940. Processor 910 may invoke logic instructions in memory 930 to perform a method of traffic scheduling for a time-sensitive network, the method comprising: performing probability flow modeling on the bursty traffic, so that the bursty traffic is modeled into periodic traffic with probability properties represented in the form of probability flow; setting condition constraint on the flow scheduling problem of periodic flow and sudden flow in a time sensitive network according to a priority time slice sharing rule and a prudent reservation rule, and establishing a satisfiability model theoretical model; wherein bursty traffic is inserted into the periodic traffic being transmitted by the priority time slice sharing rule to be preferentially transmitted, and the priority time slice sharing rule is executed on a link of a time sensitive network in which the bursty traffic exists by a prudent reservation rule; and obtaining the result of the traffic scheduling problem through a solver according to the established satisfiability model theoretical model.
Furthermore, the logic instructions in the memory 930 may be implemented in software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. Based on such understanding, the technical solutions of the embodiments of the present invention may be essentially implemented or make a contribution to the prior art, or may be implemented in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
In another aspect, an embodiment of the present invention further provides a computer program product, where the computer program product includes a computer program stored on a non-transitory computer-readable storage medium, the computer program includes program instructions, and when the program instructions are executed by a computer, the computer can execute a traffic scheduling method for a time-sensitive network provided by the above methods, where the method includes: performing probability flow modeling on the bursty traffic, so that the bursty traffic is modeled into periodic traffic with probability properties represented in the form of probability flow; setting condition constraint on the flow scheduling problem of periodic flow and sudden flow in a time sensitive network according to a priority time slice sharing rule and a prudent reservation rule, and establishing a satisfiability model theoretical model; wherein bursty traffic is inserted into the periodic traffic being transmitted by the priority time slice sharing rule to be preferentially transmitted, and the priority time slice sharing rule is executed on a link of a time sensitive network in which the bursty traffic exists by a prudent reservation rule; and obtaining the result of the traffic scheduling problem through a solver according to the established satisfiability model theoretical model.
In yet another aspect, an embodiment of the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method for traffic scheduling of a time-sensitive network provided by the foregoing methods to: performing probability flow modeling on the bursty traffic, so that the bursty traffic is modeled into periodic traffic with probability properties represented in the form of probability flow; setting condition constraint on the flow scheduling problem of periodic flow and sudden flow in a time sensitive network according to a priority time slice sharing rule and a prudent reservation rule, and establishing a satisfiability model theoretical model; wherein bursty traffic is inserted into the periodic traffic being transmitted by the priority time slice sharing rule to be preferentially transmitted, and the priority time slice sharing rule is executed on a link of a time sensitive network in which the bursty traffic exists by a prudent reservation rule; and obtaining the result of the traffic scheduling problem through a solver according to the established satisfiability model theoretical model.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims (10)

1. The traffic scheduling method of the time sensitive network is characterized in that the time sensitive network transmits periodical traffic and bursty traffic, and the method comprises the following steps:
performing probability flow modeling on the bursty traffic, so that the bursty traffic is modeled into periodic traffic with probability properties represented in the form of probability flow;
setting condition constraint on the flow scheduling problem of periodic flow and sudden flow in a time sensitive network according to a priority time slice sharing rule and a prudent reservation rule, and establishing a satisfiability model theoretical model; wherein bursty traffic is inserted into the periodic traffic being transmitted by the priority time slice sharing rule to be preferentially transmitted, and the priority time slice sharing rule is executed on a link of a time sensitive network in which the bursty traffic exists by a prudent reservation rule;
and obtaining the result of the traffic scheduling problem through a solver according to the established satisfiability model theoretical model.
2. The traffic scheduling method of the time-sensitive network according to claim 1, wherein the performing probabilistic flow modeling on the bursty traffic to make the bursty traffic modeled as a periodic traffic with a probabilistic property specifically comprises:
determining a sending period of the periodic traffic, wherein the sending period is an interval period of adjacent periodic traffic;
and carrying out probability distribution on the burst traffic in the sending period in a preset probability distribution mode.
3. The traffic scheduling method of the time-sensitive network according to claim 2, wherein the constraint of setting conditions is performed on the traffic scheduling problem of the periodic traffic and the bursty traffic in the time-sensitive network according to the priority time slice sharing rule and the prudent reservation rule, and a satisfiability model theoretical model is established, which specifically comprises:
defining a traffic scheduling problem in a time sensitive network;
carrying out time constraint on the traffic scheduling problem so that the sudden traffic is sent before a preset cut-off time;
performing data packet overlapping constraint on the traffic scheduling problem, so that two data packets which belong to the same bursty traffic and are generated can share the same time slice, and two data packets which respectively belong to the bursty traffic and the periodic traffic can share the same time slice;
carrying out priority constraint on the traffic scheduling problem according to a priority time slice sharing rule, and setting priority for the bursty traffic so that the bursty traffic has the priority on a time slice in a periodic traffic setting range;
and carrying out adjacent link constraint on the traffic scheduling problem according to a prudent reservation rule, so that on the link provided with the reserved time slice, the time slice of the adjacent downlink starts scheduling after the last time slice of the link provided with the reserved time slice is finished.
4. The traffic scheduling method of a time sensitive network according to claim 3, wherein the defining of the traffic scheduling problem in the time sensitive network specifically comprises,
representing the set of flows to be scheduled as S ═ S1，s2，s3，...，sN>. includes probabilistic flows modeled as periodic and bursty traffic,
stream s in stream setiAt time sensitive network link < va，vbThe set of packets to be transmitted > is represented as follows:
Figure FDA0003291153140000021
wherein the content of the first and second substances,
Figure FDA0003291153140000022
data packets containing periodic traffic as well as bursty traffic,
Figure FDA0003291153140000023
representing the flow siAt time sensitive network link < va，vbThe jth data packet transmitted on the data packet, each data packet contains three attributes:
Figure FDA0003291153140000024
where φ is the start time of the reserved time slice of the data packet, T is the transmission period of the periodic traffic or the shortest interval time of the bursty traffic, L is < v at the linka，vbThe time taken to transmit the data packet, each time being < >va，vbTu is the unit.
5. The traffic scheduling method of the time-sensitive network according to claim 4, wherein the time-constraining the traffic scheduling problem to make the bursty traffic sent before a preset deadline specifically comprises:
the transmission of the data packets of the stream is to be completed within its cycle time:
Figure FDA0003291153140000031
Figure FDA0003291153140000032
Figure FDA0003291153140000033
wherein s isiPath represents a flow siA path through a time sensitive network;
for a probability flow generated by bursty traffic, its scheduled time of the first frame on the first link in a time sensitive network, phi, should be after its occurrence time:
Figure FDA0003291153140000034
Figure FDA0003291153140000035
where s.type denotes the type of stream, Prob denotes the abbreviation of probability stream, siOt represents the probability flow siThe time of occurrence of (c);
data packets of the same stream are sequentially sent through a link:
Figure FDA0003291153140000036
Figure FDA0003291153140000037
Figure FDA0003291153140000038
the end-to-end delay requirements of the flow should also be met:
Figure FDA0003291153140000039
ifsi.type＝Det：
Figure FDA00032911531400000310
else：
Figure FDA00032911531400000311
where Det denotes the abbreviation of periodic flow, siE2e denotes maximum end-to-end delay is allowed;
and according to the end-to-end delay requirement, circularly traversing each probability flow generated by the bursty flow, so that the time sensitive network sends the data packet of the bursty flow before the preset cut-off time.
6. The traffic scheduling method of the time-sensitive network according to claim 5, wherein the performing packet overlap constraint on the traffic scheduling problem enables two packets generated by the same bursty traffic to share the same time slice, and enables two packets respectively belonging to the bursty traffic and the periodic traffic to share the same time slice, specifically comprising:
the packet overlap constraint is formalized as follows:
Figure FDA0003291153140000041
Figure FDA0003291153140000042
if si and sj can not overlap：
Figure FDA0003291153140000043
Figure FDA0003291153140000044
Figure FDA0003291153140000045
where E represents the link set in the time sensitive network and "overlap" represents the overlap.
7. The traffic scheduling method of the time-sensitive network according to claim 6, wherein the performing priority constraint on the traffic scheduling problem according to a priority time slice sharing rule and setting a priority for bursty traffic so that bursty traffic enjoys priority on a time slice in a periodic traffic setting range specifically comprises:
the third number of priorities are preset in the time-sensitive network, one of the priorities is set as the priority of the bursty traffic, the remaining priorities are divided into two groups, one group of the priorities is from low to high according to the priority and is used for the periodic traffic of the shared time slice, the other group of the priorities is from low to high according to the priority and is used for the periodic traffic of the non-shared time slice, and therefore the priority constraint is formalized as follows:
Figure FDA0003291153140000046
wherein s isiP represents the priority of the flow, EP represents the priority of the bursty traffic, NSH _ PL represents the lowest priority of the periodic traffic of the unshared time slices, NSH _ PH represents the highest priority of the periodic traffic of the unshared time slices, SH _ PL represents the lowest priority of the periodic traffic of the shared time slices, and SH _ PH represents the highest priority of the periodic traffic of the shared time slices.
8. The traffic scheduling method of a time-sensitive network according to claim 7, wherein the constraining of the neighboring links to the traffic scheduling problem according to a prudent reservation rule is performed such that, on the link with the reserved time slice, the time slice of the neighboring downlink starts scheduling after the last time slice of the link with the reserved time slice ends, specifically comprising:
the adjacent link constraint is formalized as:
Figure FDA0003291153140000051
Figure FDA0003291153140000052
Figure FDA0003291153140000053
Figure FDA0003291153140000054
wherein, < va，vbD denotes the transmission delay of the link.
9. A traffic scheduling device for a time sensitive network, wherein periodic traffic and bursty traffic are transmitted in the time sensitive network, the device comprising:
the sudden flow modeling unit is used for carrying out probability flow modeling on the sudden flow so that the sudden flow is modeled into periodic flow with probability property represented in a probability flow form;
the satisfiability model theoretical modeling unit is used for setting condition constraint on the flow scheduling problem of the periodic flow and the burst flow in the time sensitive network according to the priority time slice sharing rule and the prudent reservation rule and establishing a satisfiability model theoretical model; wherein bursty traffic is inserted into the periodic traffic being transmitted by the priority time slice sharing rule to be preferentially transmitted, and the priority time slice sharing rule is executed on a link of a time sensitive network in which the bursty traffic exists by a prudent reservation rule;
and the satisfiability model theoretical processing unit is used for obtaining the result of the traffic scheduling problem through a solver according to the established satisfiability model theoretical model.
10. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor when executing the program performs the steps of the method for traffic scheduling for a time-sensitive network according to any of claims 1 to 8.
CN202111164207.9A 2021-09-30 2021-09-30 Traffic scheduling method and device for time-sensitive network Pending CN113992601A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111164207.9A CN113992601A (en) 2021-09-30 2021-09-30 Traffic scheduling method and device for time-sensitive network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111164207.9A CN113992601A (en) 2021-09-30 2021-09-30 Traffic scheduling method and device for time-sensitive network

Publications (1)

Publication Number Publication Date
CN113992601A true CN113992601A (en) 2022-01-28

Family

ID=79737540

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111164207.9A Pending CN113992601A (en) 2021-09-30 2021-09-30 Traffic scheduling method and device for time-sensitive network

Country Status (1)

Country Link
CN (1) CN113992601A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115118603A (en) * 2022-06-21 2022-09-27 烽火通信科技股份有限公司 Bandwidth allocation method, system and device
CN115225587A (en) * 2022-07-05 2022-10-21 国家电网有限公司 Asynchronous terminal system scheduling optimization method based on constraint programming
CN115604200A (en) * 2022-10-08 2023-01-13 燕山大学（Cn） Rolling production line heterogeneous equipment real-time cooperation oriented deterministic resource scheduling method
CN116819943A (en) * 2023-08-30 2023-09-29 浙江大学 Control system and method capable of realizing task migration flexible function reconstruction

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1775899A2 (en) * 1999-07-09 2007-04-18 Malibu Networks Inc. TCP/IP packet-centric wireless transmission system architecture
US20200136894A1 (en) * 2018-10-24 2020-04-30 General Electric Company System and method for establishing reliable time-sensitive networks
CN111385224A (en) * 2020-02-14 2020-07-07 重庆邮电大学 Traffic scheduling method for EtherCAT and time sensitive network
US20200236038A1 (en) * 2019-01-18 2020-07-23 Rise Research Institutes of Sweden AB Dynamic Deployment of Network Applications Having Performance and Reliability Guarantees in Large Computing Networks
CN112953830A (en) * 2021-01-28 2021-06-11 北京邮电大学 Routing planning and scheduling method and device for flow frames in time-sensitive network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1775899A2 (en) * 1999-07-09 2007-04-18 Malibu Networks Inc. TCP/IP packet-centric wireless transmission system architecture
US20200136894A1 (en) * 2018-10-24 2020-04-30 General Electric Company System and method for establishing reliable time-sensitive networks
US20200236038A1 (en) * 2019-01-18 2020-07-23 Rise Research Institutes of Sweden AB Dynamic Deployment of Network Applications Having Performance and Reliability Guarantees in Large Computing Networks
CN111385224A (en) * 2020-02-14 2020-07-07 重庆邮电大学 Traffic scheduling method for EtherCAT and time sensitive network
CN112953830A (en) * 2021-01-28 2021-06-11 北京邮电大学 Routing planning and scheduling method and device for flow frames in time-sensitive network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
曹志鹏等: "面向时间敏感网络的流量调度方法", 《计算机工程》, vol. 47, no. 7, pages 168 - 182 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115118603A (en) * 2022-06-21 2022-09-27 烽火通信科技股份有限公司 Bandwidth allocation method, system and device
CN115118603B (en) * 2022-06-21 2023-08-08 烽火通信科技股份有限公司 Bandwidth allocation method, system and device
CN115225587A (en) * 2022-07-05 2022-10-21 国家电网有限公司 Asynchronous terminal system scheduling optimization method based on constraint programming
CN115225587B (en) * 2022-07-05 2023-08-15 国家电网有限公司 Asynchronous terminal system scheduling optimization method based on constraint planning
CN115604200A (en) * 2022-10-08 2023-01-13 燕山大学（Cn） Rolling production line heterogeneous equipment real-time cooperation oriented deterministic resource scheduling method
CN115604200B (en) * 2022-10-08 2024-03-26 燕山大学 Real-time cooperative deterministic resource scheduling method for heterogeneous equipment of rolling production line
CN116819943A (en) * 2023-08-30 2023-09-29 浙江大学 Control system and method capable of realizing task migration flexible function reconstruction
CN116819943B (en) * 2023-08-30 2023-11-14 浙江大学 Control system and method capable of realizing task migration flexible function reconstruction

Similar Documents

Publication Publication Date Title
CN113992601A (en) Traffic scheduling method and device for time-sensitive network
CN108965132B (en) Method and device for selecting path
Malcolm et al. Hard real-time communication in multiple-access networks
CN111030835B (en) Task scheduling model of TTFC network and message scheduling table generation method
CN110545241B (en) Message processing method and device
Houtan et al. Synthesising schedules to improve QoS of best-effort traffic in TSN networks
US11463346B2 (en) Data processing method, device, and system
KR100259308B1 (en) Transmission control method for network system
CN112019363B (en) Method, device and system for determining service transmission requirement
EP4152703A1 (en) Network control method and device
Schweissguth et al. Application-aware industrial ethernet based on an SDN-supported TDMA approach
CN114374647B (en) Planning method and device for time-sensitive service flow and route combined scheduling
CN113543210B (en) 5G-TSN cross-domain QoS and resource mapping method, equipment and computer readable storage medium
US11411818B2 (en) Method and apparatus for a communication network
CN112261681B (en) Low earth orbit satellite DTN network routing path selection method and system
CN113630893A (en) 5G and TSN joint scheduling method based on wireless channel information
CN115766884A (en) Computing task processing method, device, equipment and medium
CN111698787B (en) Scheduling rule determining method and device
Qian et al. A linux real-time packet scheduler for reliable static sdn routing
CN112688812B (en) Reliability perception time-sensitive network routing method applied to power data transmission
Kinoshita et al. Joint bandwidth scheduling and routing method for large file transfer with time constraint and its implementation
JP2007104605A (en) Parameter setting system and method
KR102595945B1 (en) Joint Traffic Routing and Scheduling Method Eliminating the Nondeterministic Interruption for TSN Networks Used in IIoT
Tariq et al. Quality of service study in synchronized time-triggered aerial networks
Sutanthavibul A data-flow model of real-time systems

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