CN115499375A

CN115499375A - Time-sensitive traffic scheduling method and electronic equipment

Info

Publication number: CN115499375A
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: 2022-12-20
Anticipated expiration: 2042-07-25
Also published as: CN115499375B

Abstract

The invention discloses a time-sensitive flow scheduling method, which comprises the following steps: when a node forwards a time-sensitive flow data packet to sense link congestion, determining a congested link and a detour path of the time-sensitive flow data packet, 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 target node of the time-sensitive flow data packet into the SRH of the time-sensitive flow data packet so as to indicate the subsequent node to schedule the flow of the time-sensitive flow data packet. By applying the invention, the time-sensitive flow forwarding with high priority can be realized by means of the common route only by putting a small number of necessary nodes into the SRH.

Description

Time-sensitive traffic 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 industrial intelligent development, 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. But the practical deployment range is often very limited due to the construction cost.

The global digital revolution has brought the industrial internet with a demand for remote, wide-area applications. However, to construct an industrial internet platform with omnibearing deep fusion and wide-area application support, global network intelligent interconnection is bound to be involved, that is, a time-sensitive network is constructed locally (inside an industrial park), and the existing internet is used in the middle, so that the cross-domain industrial communication requirement is supported. However, due to the bursty characteristic of the existing internet traffic, hierarchical scheduling of industrial communication traffic and common civil traffic is imperative in a converged network. Among them, the service quality guarantee in the aspects of real-time performance, bandwidth, jitter, etc. of high-priority traffic of industrial communication is one of the key difficult problems.

In order to solve this problem, it is common to adopt QoS scheduling inside a node for high-priority traffic (e.g., time-sensitive traffic) to guarantee its quality of service (e.g., queue scheduling inside a routing switch device), but this local scheduling policy has a limited effect. The reason is as follows: when the local QoS strategy is carried out, certain time delay is increased possibly due to the calculation burden introduced by the scheduling overhead; in addition, the queue scheduling "ceiling" of a single node is low, and even if high-priority services are placed in the most-priority queue, the high delay and bandwidth requirements in industrial application may not be met. Therefore, the patent makes a new way to try to solve the problem from the perspective of finding a higher priority path. However, such path scheduling is not simple. As is well known, the existing internet has not yet completely transitioned to the SD-WAN architecture, and remains a purely distributed architecture. If the route updating method is adopted to complete the above path scheduling, that is, the multipath routing method is adopted to "branch off" high-priority traffic, greater pressure is introduced to the forwarding plane of the router (as late as 2022, millions of IPv4 prefixes are broken). In addition, this method may cause route oscillation, which is not favorable for topology stability.

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

Disclosure of Invention

In view of this, the present invention aims to provide a time-sensitive traffic scheduling method, which can implement time-sensitive traffic forwarding with high priority by using a common route by only placing a small number of necessary nodes in an SRH.

Based on the above purpose, the present invention provides a time-sensitive traffic scheduling method, which includes:

when a node forwards a time-sensitive flow data packet to sense link congestion, determining a congested link and a detour path of the time-sensitive flow data packet, and calculating a node compression sequence of the detour path;

and the node stores a node compression sequence, the congested node of the congested link and the target node of the time-sensitive flow data packet into the SRH of the time-sensitive flow data packet so as to indicate a subsequent node to schedule the flow of the time-sensitive flow data packet.

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

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

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

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

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

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

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

the node before congestion determines the shortest path from the node to the node after the boundary of the detour path; and are

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

the node before congestion is a node which senses link congestion; and the front boundary node of the detour path is a front node adjacent to the rear boundary node on the detour path.

if the number of the detour nodes in the detour path is equal to 1, the node compression sequence of the detour path only comprises the detour node.

The present invention also provides 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, 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 a time-sensitive flow data packet to sense link congestion, determining a congested link and a detour path of the time-sensitive flow data packet, 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 target node of the time-sensitive flow data packet into the SRH of the time-sensitive flow data packet so as to indicate the subsequent node to schedule the flow of the time-sensitive flow 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, and thus, the time-sensitive traffic forwarding with high priority can be realized by means of a common route;

moreover, the technical scheme of the invention aims at the conditions of long detour path and many nodes, the SRH does not need to store all the nodes of the detour path, and the SRH only needs to store the compression sequence which comprises at most two nodes, namely the nodes before and after the boundary of the detour path, thereby greatly reducing the SRH cost and effectively preventing self-loop.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the prior art descriptions will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.

Fig. 1 is a schematic diagram of an SRH packet 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 for determining a detour path after a link is congested according to an embodiment of the present invention;

fig. 4, 5 and 6 are exemplary diagrams of bypass path node sequence compression algorithms provided in the embodiment of the present invention;

FIG. 7 is a flowchart of a bypass 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

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 specific embodiments and the accompanying drawings.

It is to be noted that technical terms or scientific terms used in the embodiments of the present invention should have the ordinary meanings as understood by those having ordinary skill in the art to which the present disclosure belongs, unless otherwise defined. The use of "first," "second," and similar terms in this disclosure is not intended to indicate any order, quantity, or importance, but rather is used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that the element or item listed before the word covers the element or item listed after the word and its equivalents, but does not exclude other elements or items. The terms "connected" or "coupled" and the like are not restricted to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", and the like are used merely to indicate relative positional relationships, and when the absolute position of the object being described is changed, the relative positional relationships may also be changed accordingly.

The basic idea of the invention is that only after a node at the last hop of congestion senses the congestion (for example, multiple ways such as long queue are found), a detour path (topology based on OSPF) is calculated by Dijkstra algorithm (Dijkstra algorithm); then, in order to effectively reduce the link overhead of the SRH (bandwidth waste due to large IPv6 address), a node sequence compression method on the detour path is proposed, which can only put necessary nodes into the SRH (Segment Routing Header) shown in fig. 1 by means of ordinary Routing, and the algorithm can effectively prevent self-looping.

The technical solution of the embodiments of the present invention is described in detail below with reference to the accompanying drawings.

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

step S201: when a node forwards a time-sensitive flow data packet to sense link congestion, determining a congested link and a detour path of the time-sensitive flow data packet.

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

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

further, according to the determined overhead size of each path, sequencing each path, and selecting the path with the minimum overhead as a bypass path of the time-sensitive flow data packet; the overhead of the congested link is then changed to the original value.

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

when the node A before congestion senses that the exit queue is congested, determining a node E after congestion of a congested link, and changing the { A, E } overhead of the congested link from 1 to infinity by the node A;

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

Step S202: and calculating the node compression sequence of the detour path by the node before congestion.

In this step, before calculating the node compression sequence of the detour path, the number of detour nodes in the detour path is determined; the detour node in the detour path refers to a node in the detour path except for a node before congestion and a node after congestion.

When calculating the node compression sequence of the detour path, the processing can be divided into two cases:

the first condition is as follows: when the number of the detour nodes in the detour path is 1, for example, the detour path a → B → E in fig. 4, it is determined that the node compression sequence of the detour path only includes the detour node, that is, the node B in fig. 4;

case two: when the number of detour nodes in the detour path is greater than 1, for example, the detour path 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 sequentially calculates the shortest path from the node on the detour path to the destination node based on the OSPF topology, and determines the node after the boundary of the detour path, namely the first boundary point on the detour path for avoiding the link self-loop;

in this sub-step, the node before congestion starts from the first node on the detour path, and sequentially judges whether each node is a boundary back node of 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 for the node to be judged currently on the detour path; judging whether the shortest path can bypass the congestion link or not; if yes, judging that the node is a boundary node of the detour path; otherwise, continuing to judge the next node of the detour path.

For example, as illustrated in fig. 5, the pre-congestion node H calculates based on the OSPF topology: (1) the shortest path from node I to D2 is I → H → M → N → D2, the congested link { H, M } is not bypassed, resulting in H, M nodes creating self-loops; (2) calculating the shortest path from the node J to the node D2 as J → I → H → M → N → D2, and bypassing the congested link { H, M }, so that the nodes H and M generate self-loops; (3) the shortest path from node K to D2 is calculated as K → L → M → N → D2, successfully bypassing the congested link { H, M }. Therefore, the node after the boundary of the detour path is K.

Substep S702: the node before congestion calculates the shortest path from the node to the node after the boundary of the detour 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 detour path passes through a congestion link or not, and determines whether the node compression sequence of the detour path also comprises the node before the boundary of the detour path or not according to the judgment result;

specifically, if the node before congestion determines that the shortest path from the node to the node after the boundary of the detour path does not pass through the congestion link, the detour path node compression sequence only includes one node, namely the node after the boundary of the detour 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 based on the OSPF topology as H → I → J → K, the path does not pass through the congested link { H, M }, so the detour path node compression sequence only includes the node K;

if the node before congestion judges that the shortest path from the node to the node after the boundary of the detour path passes through the congestion link, the detour path node compression sequence also comprises the node before the boundary of the detour path, namely the node before the boundary, which is adjacent to the node after the boundary, on the detour path; 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 based on the OSPF topology as H → M → L → K, the path being via the congested link { H, M }, so the detour path node compression sequence further includes the node J;

the algorithm has the advantages that no matter the number of nodes of the detour path, the integrated detour compression sequence does not exceed two nodes at most, although the sequence compression rate is stable sometimes, the compression rate is high under the conditions of long detour path and many nodes, and the SRH expense can be greatly reduced.

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

Step S204: and the subsequent node carries out flow scheduling on the time-sensitive flow data packet according to the SRH.

Specifically, after the node before congestion forwards the time-sensitive traffic data packet, the subsequent node that receives the time-sensitive traffic data packet forwards the time-sensitive traffic data packet according to the SRH, so as to implement scheduling of the time-sensitive traffic:

the node receiving the time-sensitive traffic data packet judges whether a stack top node of an SRH of the time-sensitive traffic data packet is a next hop node of the node; if yes, forwarding the time-sensitive flow data packet according to the stack top node; and otherwise, forwarding the time-sensitive flow data packet by taking the stack top node of the SRH as a destination address according to the one-dimensional routing table.

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 traffic forwarding by means of a common route; under the conditions of long detour path and large number of nodes, the node compression sequence stored in the SRH at most comprises two nodes, namely a front node and a rear node of the detour path, the compression rate is high, and the SRH expense can be greatly reduced.

Further, when the node senses that the current detour path is also congested before congestion, the node can continue to search other detour paths: 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 the re-calculated bypass path;

the node before congestion recalculates the node compression sequence of the detour path based on the recalculated detour path, and continues to forward the time-sensitive traffic data packet after updating the SRH of the time-sensitive traffic data packet, and the specific method is the same as the above step S202 to step S204 in fig. 2.

For example, as shown in FIG. 3, when node A senses congestion in detour path { A, B, E }, the congestion link { A, E } cost is changed from 1 to infinity, and the { A, B, E } cost is changed from 4 to infinity;

and then the node A calculates all other detour paths between the congestion links { A, E } by using a Dijkstra algorithm, wherein the detour paths are as follows: (1) a → C → E, the cost is 8, the detour path with the minimum cost A → C → E is selected, and then the costs of the congested link { A, E }, { A, C, E } are changed to 1 and 4;

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

The converged network scenario shown in fig. 8 includes an industrial internet and a civil internet. The shortest path from the node S to the node D of the time-sensitive traffic data packet is S → a → b → c → h → l → n → D; when a node c senses that a 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 node c before congestion changes the cost of the current congestion link { c, h } from 4 to infinity, and then calculates all detour paths between the congestion links { c, h } by using Dijkstra algorithm, which are respectively: (1) c → g → h, overhead 6; (2) c → d → i → j → k → h, overhead is 13; after the detour paths are sorted according to the cost, the detour path with the minimum cost is selected: c → g → h, overhead 6; then, the cost of the current congestion link { c, h } is changed back to 4;

the node c before congestion determines a detour path node compression sequence by using a detour path node sequence compression algorithm: calculating the number of detour nodes of the current optimal detour path c → g → h; if the number of the detour nodes is 1, the detour sequence is the detour node, and at the moment, the number of the detour nodes of the path c → g → h is 1 (namely g), the detour sequence is g; if the number of the bypassing nodes is greater than 1, calculating a compression sequence according to each sub-step of the flow shown in the above fig. 7;

before-congestion node c stores detour path node compression sequence g, congested node h and destination node D into SRH; filling other fields according to the corresponding information of the time-sensitive flow data packet;

when the nodes in the converged network forward the time-sensitive traffic data packet, if the stack top node of the SRH of the time-sensitive traffic data packet is the next hop, forwarding according to the SRH; for example, if the node g receives a time-sensitive traffic data packet with SRH information, and checks that the stack top node h of the data packet is the next hop, the node g directly forwards the data packet to the node h; if the stack top node of the SRH is not the next hop, the stack top node is taken as a destination address and forwarded according to the one-dimensional routing table; for example, when the node h receives a time-sensitive traffic packet with SRH information, and checks that the node D at the top of the stack of the data packet is not the next hop, the node h forwards the data packet to the next hop by checking a one-dimensional routing table with the node D as the destination address.

When the node c before congestion senses that the detour path { c, g, h } is congested, changing the { c, g, h } overhead from 6 to infinity; after the original congestion link { c, h } is changed from 4 to infinity, a new optimal detour path is recalculated: the node c before congestion calculates the rest detour paths between the congestion links { c, h } by using Dijkstra algorithm, and the detour paths are as follows: c → d → i → j → k → h, the overhead is 13, and the detour path with the minimum overhead is provided;

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

(1) the shortest path from node D to D is D → c → h → l → n → D, the link { c, h } is not bypassed, resulting in the c, h node self-looping;

(2) the shortest path from node i to D is i → D → c → h → l → n → D, without bypassing the link { c, h }, resulting in the c, h node self-looping;

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

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

the node c before congestion calculates the shortest path from the node c to the node j after the detour path division based on the OSPF topology, namely c → d → i → j; the shortest path does not go through a congested link, so the detour path node compression sequence is j;

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

and forwarding the time-sensitive flow data packet by other nodes in the converged network according to the SRH.

Fig. 9 is a schematic diagram illustrating a more specific hardware structure of an electronic device according to this embodiment, where the electronic device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein the processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 are communicatively coupled to each other within the device via bus 1050.

The processor 1010 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the time-sensitive traffic scheduling method provided in the embodiments of the present disclosure.

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

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

The communication interface 1040 is used for connecting a communication module (not shown in the drawings) to implement communication interaction between the present apparatus and other apparatuses. The communication module can realize communication in a wired mode (for example, USB, network cable, etc.), and can also realize communication in a wireless mode (for example, mobile network, WIFI, bluetooth, etc.).

Bus 1050 includes a path that transfers information between various components of the device, such as processor 1010, memory 1020, input/output interface 1030, and communication interface 1040.

It should be noted that although the above-mentioned device only shows the processor 1010, the memory 1020, the input/output interface 1030, the communication interface 1040 and the bus 1050, in a specific implementation, the device may also include other components necessary for normal operation. In addition, those skilled in the art will appreciate that the above-described apparatus may also include only the components necessary to implement the embodiments of the present disclosure, and need not include all of the components shown in the figures.

In the technical scheme of the invention, when a node forwards a time-sensitive flow data packet to sense link congestion, a congested link and a detour path of the time-sensitive flow data packet are determined, and a node compression sequence of the detour path is calculated; and the node stores the node compression sequence, the congested node of the congested link and the target node of the time-sensitive flow data packet into the SRH of the time-sensitive flow data packet so as to indicate the subsequent node to schedule the flow of the time-sensitive flow 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, and thus, the time-sensitive traffic forwarding with high priority can be realized by means of a common route;

moreover, the technical scheme of the invention aims at the conditions of long detour path and large number of nodes, the SRH does not need to store all nodes of the detour path, and the stored compression sequence comprises at most two nodes, namely a front node and a rear node of the boundary of the detour path, thereby greatly reducing the SRH overhead and effectively preventing self-loop.

Computer-readable media of the present embodiments, including both non-transitory and non-transitory, removable and non-removable media, may 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 computer storage media 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 that can be used to store information that can be accessed by a computing device.

Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, is limited to these examples; within the idea of the invention, also 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.

In addition, well known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown within the provided figures for simplicity of illustration and discussion, and so as not to obscure the invention. Furthermore, 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., 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 instead of restrictive.

While the present invention has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those of ordinary skill in the art in light of the foregoing description. For example, other memory architectures, such as Dynamic RAM (DRAM), may use the discussed embodiments.

The embodiments of the invention are intended to embrace all such alternatives, modifications and variances that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalents, improvements, and the like that may be made without departing from the spirit or scope of the present invention are intended to be included within the scope of the present invention.

Claims

1. A time-sensitive traffic scheduling method is characterized by comprising the following steps:

and the node stores the node compression sequence, the congested node of the congested link and the target node of the time-sensitive flow data packet into the SRH of the time-sensitive flow data packet so as to indicate the subsequent node to schedule the flow of the time-sensitive flow data packet.

2. The method according to claim 1, wherein the calculating the node compression sequence of the detour path specifically includes:

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

3. The method of claim 2, wherein the post-demarcation node of the detour path is determined according to the following method:

4. The method of claim 2, wherein the computing the node compression sequence of the detour path further comprises:

5. The method according to claim 4, wherein the determining whether the node compression sequence of the detour path further includes a pre-demarcation node of the detour path includes:

the node before congestion determines the shortest path from the node to the node after the boundary of the detour path; and are combined

the node before congestion is a node sensing congestion of a link; and the node before the boundary of the detour path is a previous node adjacent to the node after the boundary on the detour path.

6. The method of claim 2, wherein the computing the node compression sequence of the detour path further comprises:

7. The method according to claim 1, wherein the detour path is determined in particular according to the following method:

the node determining a path that can bypass a congested link; and are

And selecting the path with the minimum cost as the detour path.

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

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

9. The method of 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 congestion link besides the current detour path; and are

Taking the path with the minimum cost in the determined paths as a re-calculated detour path;

and then, based on the recalculated detour path, recalculating the node compression sequence of the detour path, updating the SRH of the time-sensitive flow data packet, and then continuously forwarding the time-sensitive flow data packet.

10. 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 one of claims 1-9 when executing the program.