CN112804151A - Data processing method and device and electronic equipment - Google Patents
Data processing method and device and electronic equipment Download PDFInfo
- Publication number
- CN112804151A CN112804151A CN202110084113.4A CN202110084113A CN112804151A CN 112804151 A CN112804151 A CN 112804151A CN 202110084113 A CN202110084113 A CN 202110084113A CN 112804151 A CN112804151 A CN 112804151A
- Authority
- CN
- China
- Prior art keywords
- node
- period
- data stream
- delay
- bandwidth
- 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
Images
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/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- 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/12—Shortest path evaluation
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
Abstract
The embodiment of the invention relates to the technical field of information, in particular to a data processing method and device and electronic equipment. The method comprises the following steps: setting a bandwidth constraint condition of the node; setting a delay constraint condition of the network; and generating a period mapping table according to the bandwidth constraint condition of the node and the time delay constraint condition so that the node sends the data stream according to the period mapping table, wherein the period mapping table comprises a corresponding relation between a period for the node to send the data stream and a period for an upstream node of the node to send the data stream. Through the method, the embodiment of the invention can comprehensively consider the bandwidth constraint and the time delay constraint so as to set the period mapping table. Meanwhile, the bandwidth of the network and the time delay of the network are adjusted according to actual requirements when bandwidth constraint and time delay constraint are integrated, so that the utilization rate of the bandwidth in the network can be improved, and the time delay of the network can be reduced to the maximum extent.
Description
Technical Field
The embodiment of the invention relates to the technical field of information, in particular to a data processing method and device and electronic equipment.
Background
The deterministic network technology has become one of the hot spots for research and attention in the academic and industrial fields, and has a wide research space in the academic field and a huge market prospect in the industrialization aspect. The core of a deterministic network is to guarantee end-to-end bandwidth, delay and jitter of the traffic flow. The Large-scale Deterministic Network (LDN) draft is a standard draft applicable to Large-scale Deterministic Network deployment. The core idea is to control the forwarding behavior of each data flow at each node, and once the time of a given data flow entering a node is determined, the time of the data flow exiting the node can be determined. The data stream only needs to carry the current cycle number of the sending node before each node sends it. After receiving the data stream, the downstream node can determine in which cycle the received data stream needs to be forwarded again according to the cycle mapping table. Each node is called as an LDN router, and each pair of adjacent LDN routers guides the data packet forwarding behavior of the subsequent LDN routers through a stable periodic mapping relation.
However, in implementing the embodiments of the present invention, the inventors found that: in the prior art, the periodic mapping relationship is for the case of a single data stream, the network bandwidth is sufficient, only the delay constraint of the network needs to be ensured, and for the case of multiple data streams, the bandwidth constraint and the delay constraint are not comprehensively considered.
Disclosure of Invention
In view of the above problems, embodiments of the present invention provide a method, an apparatus, and an electronic device for data processing, which overcome or at least partially solve the above problems.
According to an aspect of the embodiments of the present invention, there is provided a data processing method applied to a network, where the network includes a plurality of connected nodes, the method including: setting a bandwidth constraint condition of the node; setting a delay constraint condition of the network; and generating a period mapping table according to the bandwidth constraint condition of the node and the time delay constraint condition so that the node sends the data stream according to the period mapping table, wherein the period mapping table comprises a corresponding relation between a period for the node to send the data stream and a period for an upstream node of the node to send the data stream.
In an optional manner, the step of setting the bandwidth constraint condition of the node further includes: calculating a bandwidth required for the data stream passing through the node; setting a bandwidth constraint condition of the node according to the bandwidth required by the data flow passing through the node, wherein the bandwidth constraint condition comprises that the maximum value of the bandwidth required by the data flow passing through the node is not more than the bandwidth of the node, and the bandwidth of the node is not more than the product of the length and the number of a circular transmission queue of the node.
In an alternative mode, the number of the data streams is multiple, and the first formula for calculating the bandwidth required by the data streams passing through the node is as follows:
wherein the WTtThe bandwidth required for the data stream passing through the node, n is the number of the data stream, i is the number of the data stream, and f is the number of the data streamiFor data flow, said fiBand is said data flow fiJ is the number of the node, t is the cycle number, and the data stream fiAnd defining the O (i, j, t) to be 1 when the node passes through the period with the period number of t, otherwise defining the O (i, j, t) to be 0.
In an optional manner, the step of setting the delay constraint condition of the network further includes: calculating the link time delay between the node and a downstream node of the node; calculating the forwarding time delay of the data stream at the node; and setting a delay constraint condition of the network according to the link delay and the forwarding delay, wherein the delay constraint condition comprises that the forwarding delay is not more than the maximum forwarding delay of the data stream at the node, and the sum of the link delay and the forwarding delay is not more than the delay upper limit of the network.
In an optional manner, the step of calculating a forwarding delay of the data stream at the node further includes: acquiring a period offset of the data stream transmitted by the node, wherein the period offset is an offset value relative to a period in which the data stream can be transmitted by the node at the earliest time; and calculating the forwarding time delay of the data stream at the node according to the period deviation.
In an optional manner, the second formula that the forwarding delay is not greater than the maximum forwarding delay of the data stream at the node is:
Latencyij≥(2+kij)T
wherein i is the number of the data stream, j is the number of the node, and Latency isijFor a data stream fiMaximum forwarding delay at the node, kijFor the period shift, the (2+ k)ij) And T is the forwarding time delay of the data stream at the node.
In an optional manner, a third formula that a sum of the link delay and the forwarding delay is not greater than an upper delay limit of the network is:
wherein m is the number of the nodes, the LatencyijFor said data stream fiMaximum forwarding delay at the node, the ljFor the link delay between the node and the downstream node, fiLatency is said data stream fiAt the upper delay limit of the network.
In an optional manner, the step of generating a period mapping table according to the bandwidth constraint condition of the node and the delay constraint condition further includes: judging whether the network is time delay-first or bandwidth-first; if the network is time delay priority, the period deviation is made to be 0, and the period mapping table is generated; if the network is bandwidth-first, calculating the period offset of the data stream according to the second formula and the third formula, and generating the period mapping table according to the period offset.
In an optional manner, the step of calculating the period offset of the data stream according to the second formula and the third formula, and generating the period mapping table according to the period offset further includes: calculating the period offset satisfying the second and third equations; calculating a bandwidth required for the data stream passing through the node according to the first formula and the period offset; obtaining a selected periodic offset, wherein the selected periodic offset is the periodic offset corresponding to the minimum value of the bandwidth required by the data stream passing through the node; generating the period mapping table according to the selected period offset.
In an optional manner, before the step of determining whether the network is delay-first or bandwidth-first, the method further includes: judging whether the number of the data streams sent to the node in the current period is greater than 1; if not, entering a step of generating the period mapping table by making the period offset be 0 if the network is time delay priority; if so, entering the step of judging whether the network is time delay first or bandwidth first.
According to an aspect of an embodiment of the present invention, there is provided an apparatus for data processing, including: the bandwidth setting module is used for setting a bandwidth constraint condition of the node; the time delay setting module is used for setting time delay constraint conditions of the network; a mapping table generating module, configured to generate a period mapping table according to the bandwidth constraint condition of the node and the delay constraint condition, so that the node sends the data stream according to the period mapping table, where the period mapping table includes a correspondence between a period in which the node itself sends the data stream and a period in which an upstream node of the node sends the data stream.
In an optional manner, the bandwidth setting module includes: a first calculation module for calculating a bandwidth required for the data stream passing through the node; and the bandwidth setting unit is used for setting a bandwidth constraint condition of the node according to the bandwidth required by the data stream passing through the node, wherein the bandwidth constraint condition comprises that the maximum value of the bandwidth required by the data stream passing through the node is not more than the bandwidth of the node, and the bandwidth of the node is not more than the product of the length and the number of a circular transmission queue of the node.
In an alternative mode, the number of the data streams is multiple, and the first formula for calculating the bandwidth required by the data streams passing through the node is as follows:
wherein the WTtThe bandwidth required for the data stream passing through the node, n is the number of the data stream, i is the number of the data stream, and f is the number of the data streamiFor data flow, said fiBand is said data flow fiJ is the number of the node, t is the cycle number, and the data stream fiAnd defining the O (i, j, t) to be 1 when the node passes through the period with the period number of t, otherwise defining the O (i, j, t) to be 0.
In an optional manner, the delay setting module includes: the second calculation unit is used for calculating the link time delay between the node and a downstream node of the node; a third calculating unit, configured to calculate a forwarding delay of the data stream at the node; and a delay setting unit, configured to set a delay constraint condition of the network according to the link delay and the forwarding delay, where the delay constraint condition includes that the forwarding delay is not greater than a maximum forwarding delay of the data stream at the node, and a sum of the link delay and the forwarding delay is not greater than an upper delay limit of the network.
In an optional manner, the third computing unit is specifically configured to obtain a cycle offset of the data stream transmitted by the node, where the cycle offset is an offset value relative to a cycle at which the node can transmit the data stream earliest; and calculating the forwarding time delay of the data stream at the node according to the period deviation.
In an optional manner, the second formula that the forwarding delay is not greater than the maximum forwarding delay of the data stream at the node is:
Latencij≥(2+kij)T
wherein i is the number of the data stream, j is the number of the node, and Latency isijFor a data stream fiMaximum forwarding delay at the node, kijFor the period shift, the (+ k)ij) And T is the forwarding time delay of the data stream at the node.
In an optional manner, a third formula that a sum of the link delay and the forwarding delay is not greater than an upper delay limit of the network is:
wherein m is the number of the nodes, the LatencyijFor said data stream fiMaximum forwarding delay at the node, the ljFor the link delay between the node and the downstream node, fiLatency is said data stream fiAt the upper delay limit of the network.
In an optional manner, the mapping table generating module includes: the first judgment unit is used for judging whether the network is time delay-first or bandwidth-first; a first generating unit, configured to, if the network is delay-first, make the period shift be, and generate the period mapping table; and a second generating unit, configured to calculate the period offset of the data stream according to the second formula and a third formula if the network is bandwidth-first, and generate the period mapping table according to the period offset.
In an alternative manner, the second generating unit is specifically configured to calculate the period offset satisfying the second formula and a third formula; calculating a bandwidth required for the data stream passing through the node according to the first formula and the period offset; obtaining a selected periodic offset, wherein the selected periodic offset is the periodic offset corresponding to the minimum value of the bandwidth required by the data stream passing through the node; generating the period mapping table according to the selected period offset.
In an optional manner, the mapping table generating module further includes a second determining unit. The second judging unit is configured to judge whether the number of data streams sent to the node in the current period is greater than 1, if not, enter the first generating unit, and if not, enter the first judging unit.
According to an aspect of an embodiment of the present invention, there is provided an electronic apparatus including: at least one processor, and a memory communicatively coupled to the at least one processor, the memory storing instructions executable by the at least one processor to enable the at least one processor to perform a method as described above.
The embodiment of the invention has the beneficial effects that: different from the existing data processing method, the data processing method in the embodiment of the invention can be used for the condition of aggregation of a plurality of data streams. Setting a bandwidth constraint condition of the node, setting a delay constraint condition of the network, and generating a period mapping table according to the bandwidth constraint condition of the node and the delay constraint condition, so that the node sends the data stream according to the period mapping table, wherein the period mapping table comprises a corresponding relation between a period in which the node sends the data stream and a period in which an upstream node of the node sends the data stream, and the bandwidth constraint and the delay constraint can be comprehensively considered to set the period mapping table. Meanwhile, the bandwidth of the network and the time delay of the network can be adjusted according to actual requirements when bandwidth constraint and time delay constraint are synthesized, so that the utilization rate of the bandwidth in the network can be improved on one hand, and the time delay of the network can be reduced to the maximum degree on the other hand.
Drawings
One or more embodiments are illustrated by way of example in the accompanying drawings, which correspond to the figures in which like reference numerals refer to similar elements and which are not to scale unless otherwise specified.
Fig. 1 is a schematic flow chart of a data processing method according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating a method for setting a bandwidth constraint condition of the node according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of receiving and transmitting a data stream according to an embodiment of the present invention;
fig. 4 is a flowchart illustrating a method for setting a delay constraint condition of the network according to an embodiment of the present invention;
fig. 5 is a flowchart illustrating a method for generating a period mapping table according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of another data stream receiving and transmitting provided by the embodiment of the present invention;
FIG. 7 is a diagram of an apparatus for data processing according to an embodiment of the present invention;
fig. 8 is a schematic diagram of a hardware structure of an electronic device that executes a data processing method according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Example one
Referring to fig. 1, fig. 1 is a schematic flowchart of a data processing method applied to a network, where the network includes a plurality of connected nodes, and the data processing method includes the following steps:
and step S10, setting the bandwidth constraint condition of the node.
In a Deterministic Network (DetNet) system, a plurality of devices for receiving and forwarding data streams are included, each device becomes an LDN router, and each device is a receiving and forwarding node of a data stream.
In practical applications, to reduce the network load, it is common to set the frequency of receiving or forwarding data streams by nodes to be consistent, and set the nodes to use the same period value for receiving or forwarding data streams.
Specifically, referring to fig. 2, the step S10 includes the following steps:
step S101, calculating a bandwidth required by the data stream passing through the node.
The data stream is typically periodic, with the amount of data sent in each period being fixed. The attributes of the data flow may be expressed in terms of source address, destination address, periodicity, size, deterministic path, and end-to-end latency.
The first formula for calculating the bandwidth required for the data stream passing through the node is:
wherein the WTtThe bandwidth required for the data stream passing through the node, n is the number of the data stream, i is the number of the data stream, and f is the number of the data streamiFor data flow, said fiBand is said data flow fiJ is the number of the node, t is the cycle number, and the data stream fiAnd defining the O (i, j, t) to be 1 when the node passes through the period with the period number of t, otherwise defining the O (i, j, t) to be 0.
It should be noted that the number of the data streams is 1, that is, a single data stream passes through the network, the first formula is also applicable, and the O (i, j, t) is 1.
It should be noted that, if the number of the data streams is multiple, if one data stream passes through the node in the current period, O (i, j, t) is 1, that is, the bandwidth of the node is occupied. If another data stream does not pass through the node in the current period, O (i, j, t) is 0, that is, the bandwidth of the node is not occupied.
Wherein, the fiBand is said data flow fiContracted average bandwidth, said fiThe fourth formula that the band needs to satisfy is:
fi·band≥fi·size/fi·period
wherein, the fiBand is said data flow fiThe bandwidth of fiSize is the data stream fiThe size of fiPeriod is said data flow fiA minimum interval when periodic transmission is performed.
Wherein the f in the attributes of the data streamiSize and fiPeriod is usually a known number, then the data stream fiBandwidth f ofiBand can be set, in turn, the bandwidth WT required for the data flow through the nodetCan be calculated.
In addition, f is the same as fiPeriod, the minimum intervals of different data streams when transmitted periodically are different, and for different nodes, the period value T may be the same value or different values, and when different period values are used, the respective period values need to be announced between adjacent nodes. The period value can be selected according to requirements, and the period value is too large, which may cause the maximum delay increase of data streams with particularly high delay requirements; too small a period value may result in increased overhead for the system, such as an increased number of circular queues. In the embodiment of the invention, each network node uses the same period value T and sets T as the fiMaximum common divisor of period.
In addition, the node has a scheduling period S. The scheduling period S refers to the time for completing a scheduling plan. Since the data flow is periodic, the scheduling scheme repeats every S times. In the embodiment of the invention, S is set to be fiThe least common multiple of period. In a scheduling period S, each node divides the number of periods according to a period value T, and the maximum period number num is S/T. Will be as toThe period is numbered t, and t is more than or equal to 0 and is more than or equal to num-1.
Step S102, setting the bandwidth constraint condition of the node according to the bandwidth required by the data stream passing through the node.
Wherein the bandwidth constraint includes that a maximum value of a bandwidth required for the data flow passing through the node is not greater than a bandwidth of the node, and that the bandwidth of the node is not greater than a product of a length and a number of a circular queue of the node.
The number of the nodes is multiple, the number of the data streams passing through the nodes may be the same or different, and the bandwidth of the node should be greater than or equal to the maximum value of the bandwidth required by the data streams passing through the nodes. That is, the maximum value of the bandwidth required for the data stream passing through the node is not greater than the bandwidth of the node, which can be expressed as a fifth formula:
wherein The (WT) is a maximum value of a bandwidth required for the data flow passing through the node, p is an egress port of the node, and the
Node V with node number jjP port of (1), the
Is the node
Bandwidth of the p-port.
It is noted that
Representing an egress port of the data flow at the node.
The circular queue comprises a receiving queue and a sending queue, and the receiving and sending roles of the circular queue are circularly interchanged, namely the receiving queue is used in one period and the sending queue is used in the next period.
In this embodiment of the present invention, for example, if the number of the circular queues is n, it indicates that the sum of the numbers of the transmit queues and the receive queues in the circular queues is n.
The number of circular queues is related to the time frame of all the received data streams sent to the node in the same period, and also related to the period in which the data is to be sent. For example, referring to fig. 3, node a sends a data stream with period number X to node B within period number X, node B has received all data streams with period number X from node a before the end time of period number Y, node B may forward the data stream to the next node within period number Y +1, and when node B receives all data streams with period number X of node a and forwards the data stream, the time span spanned is period Y and period Y +1, that is, 2T, and the number of circular queues of node B may be 2.
Assuming that node C receives all the data streams with the cycle number Y from node D and the cycle number Z from node E in a certain cycle number, but node C transmits the data streams from node D and node E in different cycles, the number of circular queues of node C is also 2.
The bandwidth of the node is not greater than the product of the length and the number of circular queues of the node, which can be expressed as a sixth formula:
WT≥CQF·num×CQF·len
wherein The (WT) is a maximum value of a bandwidth required by the data flow passing through the node, the CQF · num is a number of the circular queues, and the CQF · len is a length of the circular queues.
By setting the bandwidth constraint condition, when the node receives or forwards the data stream, the bandwidth constraint condition is satisfied, so that the situation of micro-burst when a plurality of data streams pass through the node at the same time can be avoided, and the stability of a network system is effectively improved.
And step S20, setting a time delay constraint condition of the network.
The delay is a period value required by the node to receive the data stream and forward the data stream. For a single data stream, the maximum value of the delay of each node in the network with the period value of T is 2T. In other words, the data stream is received in one cycle and forwarded in another cycle. For multiple data streams, if the data streams are received in one period and the data streams are forwarded in another period, the requirement of network bandwidth will be increased. How to comprehensively consider the bandwidth requirement and the delay requirement is the key point considered by the embodiment of the invention.
Specifically, referring to fig. 4, the step S20 includes the following steps:
step S201, calculating a link delay between the node and a downstream node of the node.
The network comprises a plurality of continuous nodes, wherein the node sending the data stream to the node is an upstream node, and the node receiving the data stream sent by the node is a downstream node.
Step S202, calculating the forwarding delay of the data stream at the node.
The step of calculating the forwarding delay of the data stream at the node further includes: acquiring a period offset of the data stream transmitted by the node, wherein the period offset is an offset value relative to a period in which the data stream can be transmitted by the node at the earliest time; and calculating the forwarding time delay of the data stream at the node according to the period deviation.
For the period offset, for example, if the node a1 receives the data streams transmitted by the node B1, the node C1, and the node D1 in the period with the period number t, the number of the period in which the node a1 can transmit the data stream at the earliest is t +1, if the node a1 transmits the data stream transmitted by the node B1 in the period t +1, the period offset of the data stream transmitted by the node B1 is 0, if the node a1 transmits the data stream transmitted by the node C1 in the period t +2, the period offset of the data stream transmitted by the node C1 is 1, and if the node a1 transmits the data stream transmitted by the node D1 in the period t +3, the period offset of the data stream transmitted by the node D1 is 2.
It should be noted that, the node a1 receives, in a period with a period number t, the cycle numbers of the data streams sent by the node B1, the node C1, and the node D1 respectively, where the corresponding nodes are located when the data streams are sent.
The period deviation needs to satisfy the following conditions:
0≥kij≥CQF·num-1
and the number of the first and second groups,
0≤kij≥fi·period/T-1
wherein i is the number of the data stream, j is the number of the node, and k isijFor the period offset, the CQF num is the number of the circular queues, fiPeriod is said data flow fiThe T is the period value at a minimum interval when periodic transmission is performed.
Wherein the forwarding delay of the data stream at the node is (2+ k)ij) And T, wherein i is the number of the data stream, and j is the number of the node.
Step S203, setting the time delay constraint condition of the network according to the link time delay and the forwarding time delay.
The delay constraint condition includes that the forwarding delay is not greater than the maximum forwarding delay of the data stream at the node, and the sum of the link delay and the forwarding delay is not greater than the delay upper limit of the network.
Wherein, the second formula that the forwarding delay is not greater than the maximum forwarding delay of the data stream at the node is:
Latencyij≥(2+kij)T
wherein i is the number of the data stream, j is the number of the node, and Latency isijFor a data stream fiMaximum forwarding delay at the node, kijFor the period shift, the (2+ k)ij) T is the data streamA forwarding delay of the node.
Wherein, a third formula that the sum of the link delay and the forwarding delay is not greater than the delay upper limit of the network is:
wherein m is the number of the nodes, the LatencyijFor said data stream fiMaximum forwarding delay at the node, the ljFor the link delay between the node and the downstream node, fiLatency is said data stream fiAt the upper delay limit of the network.
Step S30, generating a period mapping table according to the bandwidth constraint condition of the node and the delay constraint condition, so that the node sends the data stream according to the period mapping table.
The period mapping table includes a correspondence between a period in which the node itself sends the data stream and a period in which an upstream node of the node sends the data stream.
Specifically, referring to fig. 5, the step of generating the period mapping table according to the bandwidth constraint condition of the node and the delay constraint condition, and the step S30 includes the following steps:
step S301, determining whether the network is delay-first or bandwidth-first, if the network is delay-first, performing step S302, and if the network is bandwidth-first, performing step S303.
The time delay priority means that the forwarding time delay of the network is reduced under the condition of meeting the bandwidth.
The bandwidth priority means that the requirement for the bandwidth or the circular queue is reduced under the condition that the maximum forwarding delay of the network is met.
For the convenience of the reader to understand the delay priority and the bandwidth priority, please refer to fig. 6 for example, where node a, node B, and node C use the same period value. The period number of the node A is tA、tA+1、tA+2, node B has period number tB、tB+1、tB+2, … node C has a period number tC、tC+1、tC+2, … data flow A (f) from node AA) And data flow B (f) of node BB) And converged at the node C. The cycle number of a node is a circular number, which is related to the number of circular queues and the number of bits that identify the cycle number. For simplicity, the cyclic nature of the cycle numbering is not considered for the moment.
When there are two data streams simultaneously transmitted to node C, that is, node C receives the data streams of node a and node B at the same time, please refer to P1 in fig. 6, node a transmits data stream a to node C (f)A) Data stream A (f)A) The transmission time range at node A is TA，TAA time less than one period T, the period being numbered TAThen the transmission time range at node A is TAData stream A (f) ofA) The carried cycle number is tA. Node C receives data stream A (f)A) Is TA'. When node A is at TATransmitting data stream A (f) to node C continuously in time rangeA) When the node C is at TAThe data stream is continuously received in the time frame. Node A sends data stream A (f) to node CA) The shortest time delay of (1) is Δ min and the longest time delay is Δ max. In the figure TA' two period numbers spanning node C, tC+1 and tC+2。
Similarly, referring to P1 in fig. 6, node B sends data stream B (f) to node CB). Data stream B (f)B) The transmission time range at the node B is TB。TBA time less than one period T, the period being numbered TBThen the transmission time range at node B is TBData stream B (f) ofB) The carried cycle number is tB. The reception time range for node C to receive data stream B is TB′，TB' period number t falling at node CC+ 2.
Data stream A (f)A) And aStream B (f)B) T at node CCIs received in full in the time frame. T isC' the time range spans 2 cycles, and the cycle numbers are tC+1 and tC+2. At least 4 circular queues, 2 circular receive queues and 2 circular transmit queues, are therefore required for node C.
If the network is time delay first, then data flow A (f)A) And data stream B (f)B) T to be at node CCAnd transmitting in +3 period. Data stream A (f)A) And data stream B (f)B) The maximum forwarding delay at node C does not exceed 2T.
If the network is bandwidth first, then data flow B (f)B) The maximum allowable forwarding delay at node C is greater than 2T, for example, 3T, and then the maximum allowable forwarding delay may be determined according to data flow a (f)A) And data stream B (f)B) For example, data stream a (f)A) T available at node CCThe data stream B (f) is sent out in the +3 cycle numberB) T available at node CCAnd +4 cycle numbers. In this case, the bandwidth requirement of node C will be reduced, and the circular queue will vary according to the waiting period of the data stream. For example, the circular queue may still buffer data stream a (f) using 4, i.e., 2, circular receive queues, respectivelyA) And data stream B (f)B) But data stream B (f)B) The time that is kept in the circular queue is one cycle time longer than the time delay priority strategy.
When there is one data stream simultaneously transmitted to node C, that is, node C receives data streams of node a and node B at different times, referring to P2 in fig. 6, node a transmits data stream a to node C (f)A) Data stream A (f)A) The transmission time range at node A is TA，TAA time less than one period T, the period being numbered TA+4, the transmission time range at node A is TAData stream A (f) ofA) The carried cycle number is tA+4. Node C receives data stream A (f)A) Is TA'. In the figure TA' two period coding crossing over node CNumbers, each being tC+5 and tC+6。
Similarly, referring to P2 in fig. 6, node B sends data stream B (f) to node CB). Data stream B (f)B) The transmission time range at the node B is TB。TBA time less than one period T, the period being numbered TB+3, the transmission time range at node B is TBData stream B (f) ofB) The carried cycle number is tB+3. The reception time range for node C to receive data stream B is TB′，TB' period number t falling at node CC+ 5.
Data stream A (f)A) And data stream B (f)B) T at node CCIs received in full in the time frame. T isC' the time range spans 2 cycles, and the cycle numbers are tC+5 and tC+6. At least 4 circular queues, 2 circular receive queues and 2 circular transmit queues, are therefore required for node C.
Data flow A (f) may be sent regardless of whether the network is latency-first or bandwidth-firstA) T at node CCTransmitting in +7 period, and transmitting data stream B (f)B) T at node CCIn +6 period, since node C sends data stream A (f) in different periodA) And data stream B (f)B) If the data stream is sent out, that is, there is no situation that the bandwidth is not satisfied, if the data stream sent to the node C at the same time is one, that is, the node C receives the data streams of the node a and the node B at different times, the step S302 may be directly entered without performing the step S301 to determine whether the network is delay-first or bandwidth-first. In some embodiments, whether the network supports latency first or bandwidth first is predetermined.
In some embodiments, when the bandwidth of the node is less than a preset threshold, the network is determined to be bandwidth-first.
In some embodiments, before the step of determining whether the network is delay-first or bandwidth-first, the method further includes determining whether data passing through the network is a single data stream, if so, generating the period mapping table directly according to delay-first, and if so, determining whether the network is delay-first or bandwidth-first. Specifically, before the step of determining whether the network is delay-first or bandwidth-first, the method further includes: judging whether the number of the data streams sent to the node in the current period is greater than 1; if not, go to step S302; if yes, the process proceeds to step S301.
Step S302, setting the period offset to 0, and generating the period mapping table.
The period offset is 0, then the first formula
Is 1, the bandwidth WT required for the data flow through the node can be calculatedtAnd further, the minimum value of the bandwidth of the node and the minimum value of the circular queue can be obtained according to the fifth formula and the sixth formula, so that the utilization rate of the network is improved. The period offset is 0, the period mapping table may be obtained. For example, the entry number of the node is said pj1And pj2The data stream is fa1And fa2Upstream of said node sending said data flow fa1And fa2Respectively, is t1And t2The earliest node can send the data stream with a period t3If the period offset is 0, the node transmits the data stream fa1And fa2Has a period of t3. The period mapping table may be represented as table 1 below.
TABLE 1 time delay priority periodic mapping table
| Entry numbering of nodes | Data flow | Inlet cycle | Outlet period |
| pj1 | fa1 | t1 | t3 |
| pj2 | fa2 | t2 | t3 |
After the data stream is forwarded by the node, the entry cycle number carried by the data stream when entering the downstream node is replaced by the exit cycle number of the node.
Step S303, calculating the period offset of the data stream according to the second formula and the third formula, and generating the period mapping table according to the period offset.
Said step of calculating said period offset of said data stream according to said second and third formulas and generating said period mapping table according to said period offset further comprises calculating said period offset satisfying said second and third formulas; calculating a bandwidth required for the data stream passing through the node according to the first formula and the period offset; obtaining a selected periodic offset, wherein the selected periodic offset is the periodic offset corresponding to the minimum value of the bandwidth required by the data stream passing through the node; generating the period mapping table according to the selected period offset.
For example, the entry number of the node is said pj1、pj2And pj3The data stream is f1、f2And f3Upstream of said node sending said data flow f1、f2And f3Respectively, is t1、t2And t3The earliest node can send the data stream with a period t4The period offsets satisfying the second and third equations are a set of 0, 1 and 2, and a set of 0, 1 and 1, respectively. Substituting the first formula for data in the periodic offsets in the one and two sets, respectively, so that the bandwidth required for the data flow through the node can be obtained. Selecting the cycle offset corresponding to the minimum value of the bandwidth required for the data stream passing through the node as the selected cycle offset. One of the above-mentioned groups and two of the groups is the selected period offset. The period mapping table may be table 2 below.
| Entry numbering of nodes | Data flow | Inlet cycle | Outlet period |
| pj1 | f1 | t1 | t4 |
| pj2 | f2 | t2 | t4+1 |
| pj3 | f3 | t3 | t4+2 |
It should be noted that, after the period offset is selected, the bandwidth of the node in the network may be set according to the bandwidth required by the data stream passing through the node.
It should be noted that, the two sets of corresponding period offsets may also be selected to form a period mapping table for transmitting data streams, so that the requirement of bandwidth is considered, and the delay of the network is also considered.
For the convenience of the reader to understand the concept of the present invention, the method of data processing of the present invention will now be exemplified.
Assume data flow fAAnd fBThe information of (1) is as follows: f. ofA·period＝400us，fA·size＝2000B；fB·period＝300us，fB·size＝750B。fAThe maximum allowable forwarding delay at node C is 400us, fBThe maximum allowable forwarding delay at node C is 300us, namely LatencyAC＝400us，LatencyBC＝300us。
The calculation period T is 100us and the scheduling period S is 1200us according to the method. f. ofAThe total number of bytes allowed to be transmitted in each period T is 500B, fBThe total number of bytes allowed to be transmitted in each cycle is 250B. From this f is calculatedA·band＝40Mbps，fBBand equals 20 Mbps. Suppose fAEach message has a length of 250B, fBEach message has a length of 125B, i.e. data flow f in each period TAAnd fBBoth messages can be sent.
Suppose fAAnd fBTwo transmitted in the period T of node A and node BEach message is MA1、MA2And MB1、MB2And converged at node C. Node C at tC+1 and tC+2 received M respectivelyA1And MA2At tC+2 then receives MB1、MB2。MA1And MA2Respectively represents the minimum delay and the maximum delay from node A to node C, MB1And MB2The forwarding delay of (a) then represents the minimum delay and the maximum forwarding delay from node B to node C, respectively.
Node C at tC+1 and tC+2 reception of data stream f in two periodsAAnd fBThen at least 2 circular receive queues are needed for node C.
In the latency priority strategy, fAAnd fBT to be at node CCAnd transmitting in +3 period. I.e. fAAnd fBThe period number offset values k sent by the node C are all 0, O (A, C, t)c+3)＝1，O(B，C，tc+3) ═ 1, node C at period tC+3 requires a bandwidth of 60Mbps + 40Mbpstc+3＝60Mbps。
MA1、MA2And MB1、MB2The maximum forwarding delay at the node C exceeds 2T and satisfies fAAnd fBMaximum allowed forwarding delay Latency at node CACAnd LatencyBC。
In the bandwidth priority policy, fAAnd fBWill be sent out in different periods of node C. According to fAAnd fBMaximum allowed forwarding delay Latency at node CACAnd LatencyBCE.g. fAAt tCIs sent out in +3 periods, and fBAt tCAnd transmitting in +4 period. Namely:
O(A，C，tc+3)＝1，O(A，C，tc+4)＝0，
O(B，C，tc+3)＝0，O(B，C，tc+4)＝1，
thus, node C is at tCWithin +3 periodThe required bandwidth is 40Mbps, i.e., WTtc+3At t, 40MbpsCThe required bandwidth in +4 period is 20Mbps, i.e., WTtc+420 Mbps. The maximum bandwidth in a single period actually needed is 40Mbps, so the bandwidth of the port of the node C needs to be at least 40 Mbps. At the same time, MA1、MA2Maximum forwarding delay at node C exceeds 2T, and MB1、MB2The maximum forwarding delay at node C exceeds 3T. All can satisfy LatencyACAnd LatencyBC。
In the embodiment of the invention, the bandwidth constraint condition of the node is set; setting a delay constraint condition of the network; and generating a period mapping table according to the bandwidth constraint condition and the delay constraint condition of the node so that the node sends the data stream according to the period mapping table, wherein the period mapping table comprises a corresponding relation between a period for sending the data stream by the node and a period for sending the data stream by an upstream node of the node, and when a plurality of data streams are converged, the bandwidth constraint and the delay constraint can be comprehensively considered so as to set the period mapping table. Meanwhile, the bandwidth of the network and the time delay of the network can be adjusted according to actual requirements when bandwidth constraint and time delay constraint are synthesized, so that the utilization rate of the bandwidth in the network can be improved on one hand, and the time delay of the network can be reduced to the maximum degree on the other hand.
Example two
Referring to fig. 7, fig. 7 is a schematic diagram of a data processing apparatus according to an embodiment of the present invention, where the apparatus 400 includes: a bandwidth setting module 401, a delay setting module 402 and a mapping table generating module 403. The bandwidth setting module 401 is configured to set a bandwidth constraint condition of the node; a delay setting module 402, configured to set a delay constraint condition of the network; a mapping table generating module 403, configured to generate a period mapping table according to the bandwidth constraint condition of the node and the delay constraint condition, so that the node sends the data stream according to the period mapping table, where the period mapping table includes a correspondence between a period in which the node itself sends the data stream and a period in which an upstream node of the node sends the data stream.
In some embodiments, the bandwidth setting module 401 includes: a first calculation module 4011, and a bandwidth setting unit 4012. The first calculating module 4011 is configured to calculate a bandwidth required by the data stream passing through the node; a bandwidth setting unit 4012, configured to set a bandwidth constraint condition of the node according to a bandwidth required by the data stream passing through the node, where the bandwidth constraint condition includes that a maximum value of the bandwidth required by the data stream passing through the node is not greater than a bandwidth of the node, and the bandwidth of the node is not greater than a product of a length and a number of a circular transmission queue of the node.
In some embodiments, the number of the data streams is plural, and the first formula for calculating the bandwidth required by the data streams passing through the node is as follows:
wherein the WTtThe bandwidth required for the data stream passing through the node, n is the number of the data stream, i is the number of the data stream, and f is the number of the data streamiFor data flow, said fiBand is said data flow fiJ is the number of the node, t is the cycle number, and the data stream fiAnd defining the O (i, j, t) to be 1 when the node passes through the period with the period number of t, otherwise defining the O (i, j, t) to be 0.
In some embodiments, the latency setting module 402 comprises: a second calculating unit 4021, a third calculating unit 4022, and a delay setting unit 4023. The second calculating unit 4021 is configured to calculate a link delay between the node and a downstream node of the node; a third calculating unit 4022, configured to calculate a forwarding delay of the data stream at the node; a delay setting unit 4023, configured to set a delay constraint condition of the network according to the link delay and the forwarding delay, where the delay constraint condition includes that the forwarding delay is not greater than the maximum forwarding delay of the data stream at the node, and a sum of the link delay and the forwarding delay is not greater than an upper delay limit of the network.
In some embodiments, the third computing unit 4022 is specifically configured to acquire a period offset of the data stream transmitted by the node, where the period offset is an offset value from a period at which the node can transmit the data stream earliest; and calculating the forwarding time delay of the data stream at the node according to the period deviation.
In some embodiments, the second formula that the forwarding delay is not greater than the maximum forwarding delay of the data stream at the node is:
Latencyij≥(2+kij)T
wherein i is the number of the data stream, j is the number of the node, and Latency isijFor a data stream fiMaximum forwarding delay at the node, kijFor the period shift, the (2+ k)ij) And T is the forwarding time delay of the data stream at the node.
In some embodiments, the third formula that the sum of the link delay and the forwarding delay is not greater than the delay upper limit of the network is:
wherein m is the number of the nodes, the LatencyijFor said data stream fiMaximum forwarding delay at the node, the ljFor the link delay between the node and the downstream node, fiLatency is said data stream fiAt the upper delay limit of the network.
In some embodiments, the mapping table generating module 403 includes: first determination unit 4031, first generation unit 4032, and second generation unit 4033. The first determining unit 4031 is configured to determine whether the network is delay-first or bandwidth-first; a first generating unit 4032, configured to, if the network is delay-first, set the period offset to 0, and generate the period mapping table; a second generating unit 4033, configured to, if the network is bandwidth-first, calculate the period offset of the data flow according to the second formula and a third formula, and generate the period mapping table according to the period offset.
In some embodiments, the second generation unit 4033 is specifically configured to calculate the period offset satisfying the second and third equations; calculating a bandwidth required for the data stream passing through the node according to the first formula and the period offset; obtaining a selected periodic offset, wherein the selected periodic offset is the periodic offset corresponding to the minimum value of the bandwidth required by the data stream passing through the node; generating the period mapping table according to the selected period offset.
In some embodiments, the mapping table generating module 403 further includes a second determining unit 4034. The second determining unit 4034 is configured to determine whether the number of data streams sent to the node in the current cycle is greater than 1, if not, enter the first generating unit 4032, and if not, enter the first determining unit 4031.
In the embodiment of the present invention, a bandwidth setting module 401 sets a bandwidth constraint condition of the node; setting a delay constraint condition of the network through a delay setting module 402; generating a period mapping table by a mapping table generating module 403 according to the bandwidth constraint condition of the node and the delay constraint condition, so that the node sends the data stream according to the period mapping table, where the period mapping table includes a correspondence between a period in which the node itself sends the data stream and a period in which an upstream node of the node sends the data stream, and when multiple data streams converge, the bandwidth constraint and the delay constraint can be comprehensively considered to generate the period mapping table. Meanwhile, the bandwidth of the network and the time delay of the network can be adjusted according to actual requirements when bandwidth constraint and time delay constraint are synthesized, so that the utilization rate of the bandwidth in the network can be improved on one hand, and the time delay of the network can be reduced to the maximum degree on the other hand.
EXAMPLE III
Referring to fig. 8, fig. 8 is a schematic diagram of a hardware structure of an electronic device for executing a data processing method according to an embodiment of the present invention. The electronic device 500 includes: one or more processors 501 and memory 502, one for example in fig. 8.
The processor 501 and the memory 502 may be connected by a bus or other means, and in the embodiment of the present invention, the bus connection is taken as an example.
The memory 502, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules, such as program instructions/modules (e.g., the various modules shown in fig. 7) corresponding to the method of data processing in embodiments of the present invention. The processor 501 executes various functional applications of the apparatus for performing data processing and data processing, that is, a method of implementing data processing of the above-described method embodiments, by executing nonvolatile software programs, instructions, and modules stored in the memory 502.
The memory 502 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to use of the data processing apparatus, and the like. Further, the memory 502 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, memory 502 optionally includes memory located remotely from processor 501, which may be connected to a database access device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The one or more modules are stored in the memory 502 and when executed by the one or more processors 501 perform the method of data processing in any of the method embodiments described above.
The product can execute the method provided by the embodiment of the invention, and has corresponding functional modules and beneficial effects of the execution method. For technical details that are not described in detail in this embodiment, reference may be made to the method provided by the embodiment of the present invention.
Embodiments of the present invention provide a non-volatile computer-readable storage medium, where computer-executable instructions are stored, and the computer-executable instructions are used by an electronic device to perform the method for data processing in any of the above method embodiments.
Embodiments of the present invention provide a computer program product comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program comprising program instructions which, when executed by a computer, cause the computer to perform a method of data processing in any of the method embodiments described above.
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.
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 general hardware platform, and certainly can also be implemented by hardware. It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware related to instructions of a computer program, which can be stored in a computer readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
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; within the idea of the invention, also technical features in the above embodiments or in different embodiments may be combined, steps may be implemented in any order, and there are many other variations of the different aspects of the invention as described above, which are not provided in detail for the sake of brevity; 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 the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (12)
1. A method of data processing for use in a network comprising a plurality of connected nodes, the method comprising:
setting a bandwidth constraint condition of the node;
setting a delay constraint condition of the network;
and generating a period mapping table according to the bandwidth constraint condition of the node and the time delay constraint condition so that the node sends the data stream according to the period mapping table, wherein the period mapping table comprises a corresponding relation between a period for the node to send the data stream and a period for an upstream node of the node to send the data stream.
2. The method of claim 1, wherein the step of setting the bandwidth constraint of the node further comprises:
calculating a bandwidth required for the data stream passing through the node;
setting a bandwidth constraint condition of the node according to the bandwidth required by the data flow passing through the node, wherein the bandwidth constraint condition comprises that the maximum value of the bandwidth required by the data flow passing through the node is not more than the bandwidth of the node, and the bandwidth of the node is not more than the product of the length and the number of a circular transmission queue of the node.
3. The method of claim 2, wherein the number of the data streams is plural, and the first formula for calculating the bandwidth required by the data streams passing through the node is:
wherein the WTtThe bandwidth required for the data stream passing through the node, n is the number of the data stream, i is the number of the data stream, and f is the number of the data streamiFor data flow, said fiBand is said data flow fiJ is the number of the node, t is the cycle number, and the data stream fiAnd defining the O (i, j, t) to be 1 when the node passes through the period with the period number of t, otherwise defining the O (i, j, t) to be 0.
4. The method of claim 3, wherein the step of setting the latency constraint of the network further comprises:
calculating the link time delay between the node and a downstream node of the node;
calculating the forwarding time delay of the data stream at the node;
and setting a delay constraint condition of the network according to the link delay and the forwarding delay, wherein the delay constraint condition comprises that the forwarding delay is not more than the maximum forwarding delay of the data stream at the node, and the sum of the link delay and the forwarding delay is not more than the delay upper limit of the network.
5. The method of claim 4, wherein the step of calculating the forwarding delay of the data flow at the node further comprises:
acquiring a period offset of the data stream transmitted by the node, wherein the period offset is an offset value relative to a period in which the data stream can be transmitted by the node at the earliest time;
and calculating the forwarding time delay of the data stream at the node according to the period deviation.
6. The method of claim 5, wherein the forwarding delay is not greater than the maximum forwarding delay of the data flow at the node according to a second formula:
Latencyij≥(2+kij)T
wherein i is the number of the data stream, j is the number of the node, and Latency isijFor a data stream fiMaximum forwarding delay at the node, kijFor the period shift, the (2+ k)ij) And T is the forwarding time delay of the data stream at the node.
7. The method of claim 6, wherein a third formula that the sum of the link delay and the forwarding delay is not greater than the delay upper bound of the network is:
wherein m is the number of the nodes, the LatencyijFor said data stream fiMaximum forwarding delay at the node, the ljFor the link delay between the node and the downstream node, fiLatency is said data stream fiAt the upper delay limit of the network.
8. The method of claim 7, wherein the step of generating a period mapping table according to the bandwidth constraint of the node and the delay constraint further comprises:
judging whether the network is time delay-first or bandwidth-first;
if the network is time delay priority, the period deviation is made to be 0, and the period mapping table is generated;
if the network is bandwidth-first, calculating the period offset of the data stream according to the second formula and the third formula, and generating the period mapping table according to the period offset.
9. The method of claim 8, wherein the step of calculating the period offset of the data stream according to the second formula and a third formula, and generating the period mapping table according to the period offset further comprises:
calculating the period offset satisfying the second and third equations;
calculating a bandwidth required for the data stream passing through the node according to the first formula and the period offset;
obtaining a selected periodic offset, wherein the selected periodic offset is the periodic offset corresponding to the minimum value of the bandwidth required by the data stream passing through the node;
generating the period mapping table according to the selected period offset.
10. The method of claim 8, wherein prior to the step of determining whether the network is latency-first or bandwidth-first, the method further comprises:
judging whether the number of the data streams sent to the node in the current period is greater than 1;
if not, entering a step of generating the period mapping table by making the period offset be 0 if the network is time delay priority;
if so, entering the step of judging whether the network is time delay first or bandwidth first.
11. An apparatus for data processing, applied to a network including a plurality of connected nodes, the apparatus comprising:
the bandwidth setting module is used for setting a bandwidth constraint condition of the node;
the time delay setting module is used for setting time delay constraint conditions of the network;
a mapping table generating module, configured to generate a period mapping table according to the bandwidth constraint condition of the node and the delay constraint condition, so that the node sends the data stream according to the period mapping table, where the period mapping table includes a correspondence between a period in which the node itself sends the data stream and a period in which an upstream node of the node sends the data stream.
12. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor, the memory storing instructions executable by the at least one processor to enable the at least one processor to perform the method of any of claims 1-10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110084113.4A CN112804151B (en) | 2021-01-21 | 2021-01-21 | Data processing method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110084113.4A CN112804151B (en) | 2021-01-21 | 2021-01-21 | Data processing method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112804151A true CN112804151A (en) | 2021-05-14 |
| CN112804151B CN112804151B (en) | 2022-11-08 |
Family
ID=75811110
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110084113.4A Active CN112804151B (en) | 2021-01-21 | 2021-01-21 | Data processing method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112804151B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114338555A (en) * | 2021-11-16 | 2022-04-12 | 北京邮电大学 | Method and device for realizing whole-network periodic label planning of wide-area deterministic network |
| CN115208837A (en) * | 2022-07-26 | 2022-10-18 | 武汉烽火技术服务有限公司 | Message scheduling method and system |
| WO2023040650A1 (en) * | 2021-09-16 | 2023-03-23 | 华为技术有限公司 | Message period determination method and apparatus related thereto |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160021011A1 (en) * | 2014-07-21 | 2016-01-21 | Cisco Technology, Inc. | Predictive time allocation scheduling for tsch networks |
| CN108777660A (en) * | 2018-05-29 | 2018-11-09 | 电子科技大学 | A method of the traffic scheduling in time triggered FC networks |
| CN108847961A (en) * | 2018-05-28 | 2018-11-20 | 中国电子科技集团公司第五十四研究所 | A kind of extensive, high concurrent certainty network system |
| CN109818876A (en) * | 2019-03-11 | 2019-05-28 | 西安电子科技大学 | The generation method of global optimization's time trigger traffic scheduling table |
| CN110545241A (en) * | 2018-05-28 | 2019-12-06 | 华为技术有限公司 | message processing method and device |
| CN110868363A (en) * | 2018-08-27 | 2020-03-06 | 华为技术有限公司 | Method and network device for periodic mapping |
| CN111030835A (en) * | 2019-10-23 | 2020-04-17 | 东南大学 | Task scheduling model of TTFC network and message scheduling table generation method |
| CN111049611A (en) * | 2019-12-30 | 2020-04-21 | 西安电子科技大学 | Method for generating time-triggered service scheduling table for multi-matrix periodic combined scheduling |
-
2021
- 2021-01-21 CN CN202110084113.4A patent/CN112804151B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160021011A1 (en) * | 2014-07-21 | 2016-01-21 | Cisco Technology, Inc. | Predictive time allocation scheduling for tsch networks |
| CN108847961A (en) * | 2018-05-28 | 2018-11-20 | 中国电子科技集团公司第五十四研究所 | A kind of extensive, high concurrent certainty network system |
| CN110545241A (en) * | 2018-05-28 | 2019-12-06 | 华为技术有限公司 | message processing method and device |
| CN108777660A (en) * | 2018-05-29 | 2018-11-09 | 电子科技大学 | A method of the traffic scheduling in time triggered FC networks |
| CN110868363A (en) * | 2018-08-27 | 2020-03-06 | 华为技术有限公司 | Method and network device for periodic mapping |
| CN109818876A (en) * | 2019-03-11 | 2019-05-28 | 西安电子科技大学 | The generation method of global optimization's time trigger traffic scheduling table |
| CN111030835A (en) * | 2019-10-23 | 2020-04-17 | 东南大学 | Task scheduling model of TTFC network and message scheduling table generation method |
| CN111049611A (en) * | 2019-12-30 | 2020-04-21 | 西安电子科技大学 | Method for generating time-triggered service scheduling table for multi-matrix periodic combined scheduling |
Non-Patent Citations (1)
| Title |
|---|
| 强鹂 等: "大规模确定性网络转发技术", 《电信科学》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023040650A1 (en) * | 2021-09-16 | 2023-03-23 | 华为技术有限公司 | Message period determination method and apparatus related thereto |
| CN114338555A (en) * | 2021-11-16 | 2022-04-12 | 北京邮电大学 | Method and device for realizing whole-network periodic label planning of wide-area deterministic network |
| CN114338555B (en) * | 2021-11-16 | 2024-02-06 | 北京邮电大学 | Method and device for realizing full-network periodic label planning of wide area deterministic network |
| CN115208837A (en) * | 2022-07-26 | 2022-10-18 | 武汉烽火技术服务有限公司 | Message scheduling method and system |
| CN115208837B (en) * | 2022-07-26 | 2023-12-01 | 烽火通信科技股份有限公司 | Message scheduling method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112804151B (en) | 2022-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112804151B (en) | Data processing method and device and electronic equipment | |
| JP5895202B2 (en) | Repeater, repeater control method, and computer program | |
| US7898953B2 (en) | Deficit and group round robin scheduling for efficient network traffic management | |
| JP5335892B2 (en) | High-speed virtual channel for packet-switched on-chip interconnect networks | |
| JP5271876B2 (en) | Device having packet distribution function and packet distribution method | |
| JP5276220B2 (en) | Bus control device and control device for outputting instructions to bus control device | |
| CN111030835B (en) | Task scheduling model of TTFC network and message scheduling table generation method | |
| US9369408B1 (en) | High performance and resilience in wide area networking | |
| WO2010137572A1 (en) | Network-on-chip, network routing method, and system | |
| CN107204933B (en) | Distributed flow adjusting method and device | |
| JP5895153B2 (en) | Interface device and bus system | |
| CN103036792A (en) | Transmitting and scheduling method for maximizing minimal equity multiple data streams | |
| Kentis et al. | Effects of port congestion in the gate control list scheduling of time sensitive networks | |
| CN114374647A (en) | Planning method and device for time-sensitive service flow and route combined scheduling | |
| JP6468193B2 (en) | Communication device, network available bandwidth estimation method in communication device, and network available bandwidth estimation program | |
| CN109104382B (en) | Dynamic scheduling method, device and system | |
| JP6662375B2 (en) | Parameter determining device, parameter determining method, and program | |
| CN106105282A (en) | Link buffer zone state is utilized to carry out the system and method for traffic engineering | |
| CN104935524A (en) | Link delay control-based light load balancing method for multipath network | |
| JP5307745B2 (en) | Traffic control system and method, program, and communication relay device | |
| WO2012149748A1 (en) | Network optimization traffic control method, device and system | |
| JP2006287919A (en) | Communication network, content distribution node, tree construction method, and content distribution control program | |
| CN108712345B (en) | Distributed load balancing method based on hop-by-hop calculation | |
| WO2023236832A1 (en) | Data scheduling processing method, device, and apparatus, and storage medium | |
| CN116684360A (en) | Deterministic network delay control method, system and readable storage medium |
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 |