CN115499375B

CN115499375B - Time-sensitive flow scheduling method and electronic equipment

Info

Publication number: CN115499375B
Application number: CN202210880590.6A
Authority: CN
Inventors: 张亚南; 王炫中; 王茜; 宋继高; 欧清海; 高金钊; 李竹天; 孔祥余
Original assignee: Beijing Zhongdian Feihua Communication Co Ltd
Current assignee: Beijing Zhongdian Feihua Communication Co Ltd
Priority date: 2022-07-25
Filing date: 2022-07-25
Publication date: 2024-03-19
Anticipated expiration: 2042-07-25
Also published as: CN115499375A

Abstract

The invention discloses a time-sensitive flow scheduling method, which comprises the following steps: when the node transmits Shi Min flow data packets and perceives link congestion, determining a congestion link and a detour path of the time-sensitive flow data packets, and calculating a node compression sequence of the detour path; and the node stores the node compression sequence, the congested node of the congested link and the destination node of the time-sensitive traffic data packet into the SRH of the time-sensitive traffic data packet to instruct the subsequent node to schedule the traffic of the time-sensitive traffic data packet. By applying the invention, the time-sensitive traffic forwarding with high priority can be realized by means of the common route by only putting a small number of necessary nodes into the SRH.

Description

Time-sensitive flow scheduling method and electronic equipment

Technical Field

The present invention relates to the field of communications technologies, and in particular, to a time-sensitive traffic scheduling method and an electronic device.

Background

The industrial Internet is a key network infrastructure meeting the development of industrial intellectualization, has strong time-sensitive characteristics, and requires low time delay and high stability of the network so as to ensure the smooth operation of an automatic production line. However, due to construction cost problems, the practical deployment range is often quite limited.

The global digital revolution has enabled industrial internet to have remote, wide area application needs. However, to construct an industrial internet platform for comprehensive deep fusion and supporting wide area application, global network intelligent interconnection is necessarily involved, namely, a time-sensitive network is constructed locally (inside an industrial park), and the existing internet is used in the middle to further support the industrial communication requirement of cross-domain. However, due to the bursty characteristics of the existing internet traffic, in the converged network, hierarchical scheduling of industrial communication traffic and common civil traffic is imperative. The quality of service guarantee in the aspects of real-time performance, bandwidth, jitter and the like of high-priority traffic of industrial communication is one of the key difficult problems.

To address this problem, it is common practice to use QoS scheduling inside a node to guarantee its quality of service (e.g., queue scheduling inside a routing switch) for high priority traffic (e.g., shi Min traffic), but such local scheduling policies have limited effectiveness. The reasons are as follows: when the local QoS strategy is carried out, a certain time delay is increased possibly due to the calculation burden introduced by the dispatching overhead; furthermore, single-node queues have a low "ceiling" and may not meet the high latency and bandwidth requirements of industrial applications even if high priority traffic is placed in the most preferred queue. Thus, the present patent creates another approach to try to solve the problem from the perspective of seeking a higher priority path. However, such path scheduling is not simple. It is well known that the existing internet has not yet transitioned completely to SD-WAN architecture, yet is a purely distributed architecture. If the route update mode is adopted to complete the path scheduling, that is, the multi-path route mode is adopted to "branch off" for the high-priority service, a larger pressure is introduced to the forwarding plane of the router (millions of IPv4 prefixes are broken up by 2022 years). In addition, this approach may also cause routing oscillations, which are detrimental to topology stability.

Therefore, it is necessary to provide a time-sensitive traffic scheduling method, which can implement high-priority time-sensitive traffic forwarding by means of normal routing.

Disclosure of Invention

In view of the above, the present invention is directed to a time-sensitive traffic scheduling method, which can implement high-priority time-sensitive traffic forwarding by means of normal routing only by putting a small number of necessary nodes into an SRH.

Based on the above object, the present invention provides a time-sensitive traffic scheduling method, comprising:

when the node transmits Shi Min flow data packets and perceives link congestion, determining a congestion link and a detour path of the time-sensitive flow data packets, and calculating a node compression sequence of the detour path;

and the node stores the node compression sequence, the congested node of the congested link and the destination node of the time-sensitive traffic data packet into the SRH of the time-sensitive traffic data packet to instruct the subsequent node to schedule the traffic of the time-sensitive traffic data packet.

The calculating the node compression sequence of the bypass path specifically includes:

and if the number of the bypass nodes in the bypass path is greater than 1, the node compression sequence of the bypass path comprises the nodes after the boundary of the bypass path.

The node after the boundary of the bypass path is determined according to the following method:

starting from a first node on the bypass path, judging whether each node is a node after the boundary of the bypass path: for the node to be judged currently on the detour path, calculating the shortest path from the node to the destination node; judging whether the shortest path can bypass the congestion link or not; if yes, judging the node as a node after the boundary of the bypass path.

Further, the calculating the node compression sequence of the detour path further includes:

if the number of the bypass nodes in the bypass path is greater than 1, further determining whether the node compression sequence of the bypass path further comprises a node before the boundary of the bypass path.

Preferably, the determining whether the node compression sequence of the bypass path further includes a node before the boundary of the bypass path specifically includes:

the node before congestion determines the shortest path from the node to the node after the boundary of the bypass path; and is combined with

After judging that the shortest path passes through the congestion link, determining that the node compression sequence of the bypass path also comprises a node before boundary of the bypass path;

the node before congestion is a node which perceives link congestion; the node before the boundary of the bypass path is the node before the node adjacent to the node after the boundary on the bypass path.

and if the number of the bypass nodes in the bypass path is equal to 1, only the bypass nodes are included in the node compression sequence of the bypass path.

The invention also provides an electronic device comprising a central processing unit, a signal processing and storing unit, and a computer program stored on the signal processing and storing unit and executable on the central processing unit, wherein the central processing unit performs the time-sensitive traffic scheduling method as described above.

In the technical scheme of the invention, when a node forwards Shi Min flow data packets to sense link congestion, determining a congestion link and a detour path of the time-sensitive flow data packets, and calculating a node compression sequence of the detour path; and the node stores the node compression sequence, the congested node of the congested link and the destination node of the time-sensitive traffic data packet into the SRH of the time-sensitive traffic data packet to instruct the subsequent node to schedule the traffic of the time-sensitive traffic data packet. In this way, the subsequent node can forward the time-sensitive traffic data packet through the detour path according to the node information stored in the SRH, so as to avoid congestion, thereby realizing high-priority time-sensitive traffic forwarding by means of the common route;

in addition, according to the technical scheme of the invention, for the situation that the bypass path is long and the number of nodes is large, the SRH does not need to store all nodes of the bypass path, but only needs to store a compression sequence which comprises at most two nodes, namely nodes before and after the boundary of the bypass path, thereby greatly reducing SRH expenditure and effectively preventing self-loop.

Drawings

In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

Fig. 1 is a schematic diagram of an SRH message format according to an embodiment of the present invention;

FIG. 2 is a flowchart of a time-sensitive traffic scheduling method according to an embodiment of the present invention;

fig. 3 is an exemplary diagram of determining a detour path after link congestion according to an embodiment of the present invention;

FIGS. 4, 5 and 6 are diagrams illustrating an exemplary algorithm for compressing a sequence of nodes of a detour path according to an embodiment of the present invention;

FIG. 7 is a flowchart of a bypass path compression algorithm according to an embodiment of the present invention;

fig. 8 is an exemplary diagram of time-sensitive traffic scheduling in a converged network scenario according to an embodiment of the present invention;

fig. 9 is a schematic diagram of a hardware structure of an electronic device according to an embodiment of the present invention.

Detailed Description

The present invention will be further described in detail below with reference to specific embodiments and with reference to the accompanying drawings, in order to make the objects, technical solutions and advantages of the present invention more apparent.

It should be noted that unless otherwise defined, technical or scientific terms used in the embodiments of the present invention should be given the ordinary meaning as understood by one of ordinary skill in the art to which the present disclosure pertains. The terms "first," "second," and the like, as used in this disclosure, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that elements or items preceding the word are included in the element or item listed after the word and equivalents thereof, but does not exclude other elements or items. The terms "connected" or "connected," and the like, are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", etc. are used merely to indicate relative positional relationships, which may also be changed when the absolute position of the object to be described is changed.

The basic idea of the invention is that the detour path (topology based on OSPF) is calculated by Dijkstra algorithm (Dijkstra algorithm) only after the congested last hop node senses congestion (e.g. find out the overlong mode of the queue, etc.); then, in order to effectively reduce the link overhead of the SRH (bandwidth waste caused by larger IPv6 address), a node sequence compression method on the detour path is proposed, which can put only necessary nodes into the SRH (Segment Routing Header ) as shown in fig. 1 by means of normal routing, and the algorithm can effectively prevent self-looping.

The following describes the technical scheme of the embodiment of the present invention in detail with reference to the accompanying drawings.

The embodiment of the invention provides a time-sensitive flow scheduling method, the flow is shown in figure 2, and the method comprises the following steps:

step S201: when the node forwards Shi Min traffic data packets and perceives link congestion, determining a congested link and a detour path of the time-sensitive traffic data packets.

In the step, when a node forwards Shi Min flow data packets and perceives link congestion, determining a congested link, a congested node of the congested link, namely an exit node of the congested link, and determining that the node is a congestion front node of the congested link; and the overhead of the currently congested link is changed to infinity. That is, the node that perceives link congestion is a pre-congestion node.

The pre-congestion node determines paths capable of bypassing the congestion link, namely other paths between the pre-congestion node and the post-congestion node except the congestion link, by using a Dijkstra algorithm based on an OSPF (Open Shortest Path First ) topology;

further, sorting the paths according to the determined overhead of the paths, and selecting the path with the minimum overhead as the detour path of the time-sensitive flow data packet; and then, the overhead of the congestion link is changed to the original value.

For example, as shown in fig. 3, the time-sensitive traffic packet sent by the node S0 to the destination node D0 has an initial forwarding path that is the shortest path: s0, A, E, F and D0;

when the node A before congestion perceives that the exit queue is congested, determining a node E after congestion of a congestion link, wherein the node A changes the spending of the congestion link { A, E } from 1 to ≡;

node a computes all paths that can bypass the congested link { a, E } using Dijkstra's algorithm, including: (1) a, B, E, the overhead is 4; (2) a- & gt C- & gt E, the overhead is 8, a detour path A- & gt B- & gt E with the minimum overhead is selected, and then the overhead of the congestion links { A, E } is changed to 1.

Step S202: and the node compression sequence of the bypass path is calculated by the node before congestion.

In the step, before calculating the node compression sequence of the bypass path, determining the number of bypass nodes in the bypass path; the detour nodes in the detour path refer to nodes in the detour path except for pre-congestion nodes and post-congestion nodes.

In calculating the node compression sequence of the detour path, two cases can be handled:

case one: when the number of the detour nodes in the detour path is 1, for example, detour paths a→b→e in fig. 4, it is determined that the node compression sequence of the detour path includes only the detour node, that is, the node B in fig. 4;

and a second case: when the number of the detour nodes in the detour path is greater than 1, for example, the detour paths h→i→j→k→l→m in fig. 5 and 6, in order to reduce SRH overhead, the detour path needs to be compressed, and the specific flow is as shown in fig. 7, and includes the following sub-steps:

substep S701: the node before congestion calculates the shortest path from the node on the bypass path to the destination node in turn based on the OSPF topology, and determines the node after the boundary of the bypass path, namely the first boundary point for avoiding the link from ring on the bypass path;

in this substep, the node before congestion starts from the first node on the detour path, and sequentially determines whether each node is a node after the boundary of the detour path:

for the node to be judged currently on the detour path, the node before congestion calculates the shortest path from the node to the destination node of the time-sensitive flow data packet; judging whether the shortest path can bypass the congestion link or not; if yes, judging the node as a node after the boundary of the bypass path; otherwise, continuing to judge the next node of the bypass path.

For example, as illustrated in fig. 5, the pre-congestion node H is calculated based on the OSPF topology: (1) the shortest path of nodes I to D2 is I- & gt H- & gt M- & gt N- & gt D2, and congestion links { H, M } & gt are not bypassed, so that H, M nodes generate self-loops; (2) calculating the shortest path from the node J to the node D2 as J-I-H-M-N-D2, wherein the congestion link { H, M } is not bypassed, so that the H, M node generates a self-ring; (3) the shortest path of the calculation nodes K to D2 is K-L-M-N-D2, and the congestion links { H, M } are successfully bypassed. The node after the boundary of the detour path is K.

Sub-step S702: the node before congestion calculates the shortest path from the node to the node after the boundary of the bypass path based on the OSPF topology;

substep S703: the node before congestion judges whether the shortest path from the node to the node after the boundary of the bypass path passes through a congestion link, and determines whether the node compression sequence of the bypass path also comprises the node before the boundary of the bypass path according to the judging result;

specifically, if the node before congestion judges that the shortest path from the node to the node after the boundary of the bypass path does not pass through the congestion link, the node compression sequence of the bypass path only comprises one node, namely the node after the boundary of the bypass path; for example, taking fig. 5 as an example, the node H before congestion calculates the shortest path from the node H to the node K as h→i→j→k based on the OSPF topology, the path is not via the congestion link { H, M }, and therefore the detour path node compression sequence includes only the node K;

if the node before congestion judges that the shortest path from the node to the node after boundary of the bypass path passes through the congestion link, the bypass path node compression sequence further comprises the node before boundary of the bypass path, namely the node before boundary on the bypass path, which is adjacent to the node after boundary; for example, taking fig. 6 as an example, the node H before congestion calculates the shortest path from the node H to the node K as h→m→l→k based on the OSPF topology, the path is via the congestion link { H, M }, and therefore the detour path node compression sequence further includes the node J;

the algorithm has the advantages that no matter how many nodes are in the bypass path, the integrated bypass compression sequence is not more than two nodes at most, and the compression rate is high under the conditions that the bypass path is long and the number of the nodes is large although the compression rate of the time sequence is stable, so that the SRH overhead can be greatly reduced.

Step S203: the node compression sequence before congestion, the node after congestion and the destination node are stored into the SRH by the node before congestion.

Step S204: and the subsequent node performs traffic scheduling on the time-sensitive traffic data packet according to the SRH.

Specifically, after forwarding Shi Min traffic data packets by the node before congestion, forwarding the time-sensitive traffic data packets by a subsequent node which receives the time-sensitive traffic data packets according to SRH, so as to realize scheduling of time-sensitive traffic:

the node which receives the time-sensitive flow data packet judges whether the trestle top node of the SRH of the time-sensitive flow data packet is the next hop node of the node; if yes, forwarding the time-sensitive flow data packet according to the trestle top node; otherwise, the stack top node of the SRH is used as a destination address, and the time-sensitive flow data packet is forwarded according to a one-dimensional routing table.

In this way, the subsequent node can forward the time-sensitive flow data packet through the detour path according to the node information stored in the SRH, so as to avoid congestion, and thus, the high-priority flow forwarding can be realized by means of the common route; and under the conditions that the bypass path is very long and the number of nodes is very large, the node compression sequence stored in the SRH comprises at most two nodes, namely nodes before and after the boundary of the bypass path, so that the compression rate is high, and the SRH overhead can be greatly reduced.

Further, when the pre-congestion node senses that the current detour path is also congested, other detour paths can be continuously searched: the node before congestion determines other paths which can bypass the congestion link except the current bypass path, and takes the path with the minimum cost in the determined paths as a recalculated bypass path;

the node compression sequence of the bypass path is recalculated based on the recalculated bypass path by the node before congestion, and after the SRH of the time-sensitive traffic packet is updated, the time-sensitive traffic packet is continuously forwarded, and the specific method is the same as the steps S202 to S204 in fig. 2.

For example, as shown in FIG. 3, when the pre-congestion node A perceives congestion to occur around the paths { A, B, E }, changing the overhead of the congestion link { A, E } from 1 to ≡, { A, B, E } from 4 to ≡;

and then the node A calculates all the rest bypass paths among the congestion links { A, E } by using a Dijkstra algorithm, and the rest bypass paths are as follows: (1) a- & gt C- & gt E, the overhead is 8, a detour path A- & gt C- & gt E with the minimum overhead is selected, and the overhead of the congestion links { A, E }, { A, C, E } is changed to 1 and 4;

the node A determines a new bypass path node compression sequence as C by using a bypass path node sequence compression algorithm; and C, E, D0 is pressed into the SRH in sequence, so that the optimal bypass path from S0 to D0 is realized.

The converged network scenario shown in fig. 8 includes industrial internet and civil internet. The shortest path of the Shi Min flow data packet from the node S to the node D is S- & gt a- & gt b- & gt c- & gt h- & gt l- & gt n- & gt D; when the node c perceives that the link { c, h } is congested, determining that a node before congestion of the congested link { c, h } is c and a node after congestion is h;

the pre-congestion node c changes the overhead of the current congested link c, h from 4 to +. and then, calculating all detour paths between the congestion links { c, h } by using a Dijkstra algorithm, wherein the detour paths are respectively as follows: (1) c, g, h, the overhead is 6; (2) c- & gt d- & gt i- & gt j- & gt k- & gt h, wherein the overhead is 13; after ordering the detour paths according to their overhead, selecting the detour path with the smallest overhead: c, g, h, the overhead is 6; afterwards, the overhead of the current congestion link { c, h } is changed back to 4;

the node c before congestion determines a bypass path node compression sequence by using a bypass path node sequence compression algorithm: calculating the number of detour nodes of the current optimal detour path c- & gt g- & gt h; if the number of the detour nodes is 1, the detour sequence is detour node, and if the number of the detour nodes of the paths c-g-h is 1 (i.e. g), the detour sequence is g; if the number of the detour nodes is greater than 1, calculating a compression sequence according to each sub-step of the flow shown in the above-mentioned figure 7;

the node c before congestion stores the bypass path node compression sequence g, the node h after congestion and the destination node D into SRH; the other fields are filled in according to the corresponding information of the time-sensitive flow data packet;

when a node in the converged network forwards a Shi Min flow data packet, if the stack top node of the SRH of the Shi Min flow data packet is the next hop, forwarding according to the SRH; for example, the node g receives a time-sensitive flow data packet with SRH information, and if the node h at the stack top of the data packet is the next hop, the data packet is directly forwarded to the node h; if the trestle top node of the SRH is not the next hop, forwarding the trestle top node serving as a destination address according to a one-dimensional routing table; for example, when the node h receives the time-sensitive traffic packet with the SRH information and the node D at the stack top of the data packet is not the next hop, the node D is used as the destination address, and the data packet is forwarded to the next hop by looking up the one-dimensional routing table.

When the node c before congestion perceives congestion of the bypass paths { c, g, h }, the overhead of { c, g, h } is changed from 6 to ≡; after changing the original congestion link { c, h } from 4 to ≡, recalculating a new optimal detour path: the node c before congestion calculates the rest of detour paths between the congestion links { c, h } by using Dijkstra algorithm, and the detour paths are: c- & gt d- & gt i- & gt j- & gt k- & gt h, wherein the overhead is 13, and the bypass path with the minimum overhead is adopted;

the node c before congestion determines a bypass path node compression sequence by using a bypass path node sequence compression algorithm: calculating the number of the detour nodes of the current optimal detour path c- & gt d- & gt i- & gt j- & gt k- & gt h to be 4; since this number of path detouring nodes is greater than 1, the pre-congestion node c computes based on the OSPF topology:

(1) the shortest path from node D to D is D- & gt c- & gt h- & gt l- & gt n- & gt D, the links { c, h } are not bypassed, and the c, h nodes are caused to generate self-loops;

(2) the shortest path of nodes i to D is i- & gt D- & gt c- & gt h- & gt l- & gt n- & gt D, and the links { c, h } are not bypassed, so that the c, h nodes are generated from the ring;

(3) the shortest path from node j to D is j- & gt k- & gt h- & gt l- & gt n- & gt D, and the link { c, h } is successfully bypassed;

therefore, the node after the boundary of the bypass path is j;

the node c before congestion calculates the shortest path from the node c to the node j after the boundary of the bypass path based on the OSPF topology as c- & gt d- & gt i- & gt j; the shortest path is not via a congested link, so the detour path node compresses the sequence j;

the node c before congestion stores the bypass path node compression sequence j, the node h after congestion and the destination node D into the SRH field; the other fields are filled according to the corresponding information of the time-sensitive flow data packet, and then the time-sensitive flow data packet is forwarded;

other nodes in the converged network forward Shi Min the traffic packets according to the SRH.

Fig. 9 shows a more specific hardware architecture of an electronic device according to this embodiment, where the device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 implement communication connections therebetween within the device via a bus 1050.

The processor 1010 may be implemented as a general-purpose CPU (Central Processing Unit ), microprocessor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, etc. for executing associated programs to implement the time-sensitive traffic scheduling methods provided by embodiments of the present disclosure.

The Memory 1020 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), static storage device, dynamic storage device, or the like. Memory 1020 may store an operating system and other application programs, and when the embodiments of the present specification are implemented in software or firmware, the associated program code is stored in memory 1020 and executed by processor 1010.

The input/output interface 1030 is used to connect with an input/output module and may be connected with a nonlinear receiver to receive information from the nonlinear receiver for information input and output. The input/output module may be configured as a component in a device (not shown) or may be external to the device to provide corresponding functionality. Wherein the input devices may include a keyboard, mouse, touch screen, microphone, various types of sensors, etc., and the output devices may include a display, speaker, vibrator, indicator lights, etc.

Communication interface 1040 is used to connect communication modules (not shown) to enable communication interactions of the present device with other devices. The communication module may implement communication through a wired manner (such as USB, network cable, etc.), or may implement communication through a wireless manner (such as mobile network, WIFI, bluetooth, etc.).

Bus 1050 includes a path for transferring information between components of the device (e.g., processor 1010, memory 1020, input/output interface 1030, and communication interface 1040).

It should be noted that although the above-described device only shows processor 1010, memory 1020, input/output interface 1030, communication interface 1040, and bus 1050, in an implementation, the device may include other components necessary to achieve proper operation. Furthermore, it will be understood by those skilled in the art that the above-described apparatus may include only the components necessary to implement the embodiments of the present description, and not all the components shown in the drawings.

in addition, according to the technical scheme of the invention, for the situations that the bypass path is long and the number of nodes is large, the SRH does not need to store all nodes of the bypass path, and the stored compressed sequence comprises at most two nodes, namely the nodes before and after the boundary of the bypass path, so that the SRH overhead can be greatly reduced, and the self-loop can be effectively prevented.

The computer readable media of the present embodiments, including both permanent and non-permanent, removable and non-removable media, may be used to implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device.

Those of ordinary skill in the art will appreciate that: the discussion of any of the embodiments above is merely exemplary and is not intended to suggest that the scope of the disclosure, including the claims, is limited to these examples; the technical features of the above embodiments or in the different embodiments may also be combined within the idea of the invention, the 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.

Additionally, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown within the provided figures, in order to simplify the illustration and discussion, and so as not to obscure the invention. Furthermore, the devices may be shown in block diagram form in order to avoid obscuring the invention, and also in view of the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform within which the present invention is to be implemented (i.e., such specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the invention, it should be apparent to one skilled in the art that the invention can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative in nature and not as restrictive.

While the invention has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of those embodiments will be apparent to those skilled in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed.

The embodiments of the invention are intended to embrace all such alternatives, modifications and variances which fall within the broad scope of the appended claims. Therefore, any omission, modification, equivalent replacement, improvement, etc. of the present invention should be included in the scope of the present invention.

Claims

1. A time-sensitive traffic scheduling method, comprising:

when a node forwards Shi Min flow data packets and perceives link congestion, determining a congestion link and a detour path of the time-sensitive flow data packets, and if the number of detour nodes in the detour path is greater than 1, calculating a node compression sequence comprising nodes after boundary and nodes before boundary of the detour path;

the nodes before and after the boundary of the bypass path are determined according to the following method:

starting from a first node on the bypass path, judging whether each node is a node after the boundary of the bypass path: for the node to be judged currently on the detour path, calculating the shortest path from the node to the destination node; judging whether the shortest path can bypass the congestion link or not; if yes, judging the node as a node after the boundary of the bypass path;

the node before congestion is a node which perceives link congestion; the node before the boundary of the bypass path is a preceding node adjacent to the node after the boundary on the bypass path;

2. The method as recited in claim 1, further comprising:

3. The method according to claim 1, characterized in that the detour path is determined in particular according to the following method:

the node determining a path capable of bypassing a congested link; and is combined with

And selecting a path with the minimum cost as the bypass path.

4. The method according to claim 1, wherein the traffic scheduling of the time-sensitive traffic data packets by the subsequent node specifically comprises:

after forwarding the time-sensitive traffic data packet by the node before congestion, forwarding the time-sensitive traffic data packet by the node which subsequently receives the time-sensitive traffic data packet according to SRH:

5. The method as recited in claim 1, further comprising:

if the node before congestion senses that the current detour path is also congested, determining other paths which can detour the congested link except the current detour path; and is combined with

Taking the path with the minimum cost in the determined paths as a recalculated bypass path;

and further, based on the recalculated bypass path, recalculating the node compression sequence of the bypass path, updating the SRH of the time-sensitive traffic data packet, and continuing forwarding the time-sensitive traffic data packet.

6. An electronic device comprising a central processing unit, a signal processing and storage unit, and a computer program stored on the signal processing and storage unit and executable on the central processing unit, characterized in that the central processing unit implements the method according to any of claims 1-5 when executing the program.