A message forwarding method, device and equipment

Abstract

The application provides a message forwarding method, device and equipment, the method comprises: receiving network demand of a service sent by a terminal device, the network demand of the service carries at least one of the following: service type of a message and network delay; determining a target network path in a virtual network topology according to the network delay; allocating a forwarding delay for a corresponding network node in the target network path according to the network delay; determining a forwarding priority of a message according to the service type of the message; forwarding the message on the target network path according to the forwarding priority and the forwarding delay of the message; the above scheme of the application can reasonably allocate the load of traffic and bandwidth.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a message forwarding method, apparatus, and device. Background Technology

[0002] More and more applications (such as AR (Augmented Reality) / VR (Virtual Reality), precise industrial control, etc.) have put forward strict and clear requirements for the upper and lower bounds or jitter of network latency, which the service capabilities provided by traditional networks can no longer meet.

[0003] For example, in typical power differential protection scenarios such as URLLC (Ultra-Reliable & Low-Latency Communication), when a switch action command is issued, the communication content between the master and slave terminals involves electrical vector comparison and verification of communication transmission channel path parameters, requiring the network to provide the ability to provide deterministic indicators of "20ms deterministic latency and jitter not exceeding 600us".

[0004] Currently, the industry has proposed a preliminary implementation scheme based on Deadline scheduling to address network latency requirements: predict the link length in advance to obtain the link latency T(L); predict the number of hops n in the path in advance; allocate the dwell time on each device according to the total latency T(S) and the number of hops; and adjust the planned processing latency of subsequent nodes according to the time consumed by previous nodes.

[0005] However, existing technologies at least have the problem of not being able to consider the differential allocation of latency based on topology. Summary of the Invention

[0006] The technical problem to be solved by this invention is to provide a message forwarding method, apparatus, and device. It takes into account the actual network topology and the allocation of forwarding delays to reasonably allocate traffic and bandwidth load.

[0007] To solve the above-mentioned technical problems, the technical solution of the present invention is as follows:

[0008] A message forwarding method, applied to a network management system, the method comprising:

[0009] The network requirements of the service sent by the receiving terminal device carry at least one of the following: the service type of the message and the network latency;

[0010] Based on the network latency, determine the target network path in the virtual network topology;

[0011] Based on the network latency, forwarding latency is allocated to the corresponding network nodes in the target network path;

[0012] Determine the forwarding priority of the message based on its service type;

[0013] The message is forwarded on the target network path according to the forwarding priority and forwarding delay of the message.

[0014] Optionally, the target network path includes: a strongly deterministic path or a weakly deterministic path;

[0015] All network nodes in the strongly deterministic path support forwarding based on remaining time.

[0016] Some network nodes in the weakly deterministic path support forwarding based on remaining time.

[0017] Optionally, based on the network latency, a forwarding latency is allocated to the corresponding network nodes in the target network path, including:

[0018] The network latency is evenly distributed to each network node in the target network path;

[0019] And / or,

[0020] The network latency is distributed to each network node in the target network path according to the weights.

[0021] Optionally, the network latency is distributed to each network node in the target network path according to weights, including:

[0022] For strongly deterministic paths, the forwarding delay of each network node in the target network path is determined based on the exit rate of the last network node in the target network path.

[0023] For weakly deterministic paths, the downstream node allocation delay in the target network path is gradually increased, or the delay of network nodes that do not support remaining time scheduling is accumulated to the downstream nodes.

[0024] Optionally, the forwarding priority of the message is determined based on the service type of the message, including:

[0025] The forwarding priority of the packet is determined based on the original priority corresponding to the service type of the packet and the remaining time of each network node in the target network path.

[0026] Optionally, the forwarding priority of the packet is determined based on the original priority corresponding to the service type of the packet and the remaining time of each network node in the target network path, including:

[0027] If packets of different service types have the same remaining time at each network node in the target network path, the original priority corresponding to the service type of the packet is determined as the forwarding priority of the packet.

[0028] If different service types of packets have different remaining times at various network nodes in the target network path, the forwarding priority of the packets is determined based on the original priority corresponding to the service type of the packet and the length of the remaining time.

[0029] Optionally, forwarding the packet on the target network path according to the packet's forwarding priority and forwarding delay includes:

[0030] Based on the forwarding delay, determine the remaining time for each network node on the target network path;

[0031] The message is forwarded on the target network path according to the forwarding priority of the message and the remaining time of each network node.

[0032] The present invention also provides a message forwarding device for use in a network management system, the device comprising:

[0033] The receiving module is used to receive network requirements of services sent by terminal devices, wherein the network requirements of services carry at least one of the following: the service type of the message and the network latency;

[0034] The processing module is configured to: determine a target network path in the virtual network topology based on the network latency; allocate forwarding delays to the corresponding network nodes in the target network path based on the network latency; determine the forwarding priority of the packet based on the service type of the packet; and forward the packet on the target network path based on the forwarding priority and forwarding delay of the packet.

[0035] The present invention also provides a communication device, comprising: a processor and a memory storing a computer program, wherein the computer program, when executed by the processor, performs the method described above.

[0036] The present invention also provides a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the method described above.

[0037] The above-described solution of the present invention has at least the following beneficial effects:

[0038] By receiving network requests for services sent by terminal devices, the network requests for services carry at least one of the following: the service type of the message and the network latency; determining the target network path in the virtual network topology based on the network latency; allocating forwarding latency to the corresponding network nodes in the target network path based on the network latency; determining the forwarding priority of the message based on the service type of the message; and forwarding the message on the target network path based on the forwarding priority and forwarding latency, thereby realizing the reasonable allocation of traffic and bandwidth load based on forwarding priority and forwarding latency, taking into account the actual network topology and the allocation of forwarding latency. Attached Figure Description

[0039] Figure 1 This is a flowchart of the message forwarding method provided in the embodiments of the present invention;

[0040] Figure 2 This is a schematic diagram illustrating the establishment of a virtual network topology in a specific embodiment provided by the present invention;

[0041] Figure 3 This is a schematic diagram illustrating network latency allocation based on virtual network topology in a specific embodiment provided by the present invention;

[0042] Figure 4 This is a schematic diagram of network traffic overload in a specific embodiment provided by the present invention;

[0043] Figure 5 This is a schematic diagram of the controller structure in a specific embodiment provided by the present invention;

[0044] Figure 6 This is a schematic diagram of the controller SRv6 in a specific embodiment provided by the present invention;

[0045] Figure 7 This is a schematic diagram of the message forwarding process in a specific embodiment provided by the present invention;

[0046] Figure 8 This is a schematic diagram of the module block of the message forwarding device according to an embodiment of the present invention. Detailed Implementation

[0047] Exemplary embodiments of the present disclosure will now be described in more detail with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention may be implemented in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this invention will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.

[0048] like Figure 1 As shown, an embodiment of the present invention provides a message forwarding method applied to a network management system, the method comprising:

[0049] Step 11: Receive the network requirements of the service sent by the terminal device. The network requirements of the service carry at least one of the following: the service type of the message and the network latency.

[0050] Step 12: Determine the target network path in the virtual network topology based on the network latency;

[0051] Step 13: Based on the network latency, allocate forwarding latency to the corresponding network nodes in the target network path;

[0052] Step 14: Determine the forwarding priority of the message based on its service type;

[0053] Step 15: Forward the packet on the target network path according to the forwarding priority and forwarding delay of the packet.

[0054] This embodiment is applied to a network management system. The network management system receives network requests for services sent by terminal devices. Based on these network requests, it determines the target network path in the virtual network topology. According to the network latency in the network requests, it allocates forwarding latency to each network node in the target network path. This allocation of forwarding latency can be either average or weighted. Furthermore, it determines the forwarding priority of packets based on the service type in the network requests. Then, based on the forwarding priority and forwarding latency, it forwards the packets on the target network path. This achieves a deadline-aware mechanism based on remaining time, considering the actual network topology and allocated forwarding latency, and adjusting the overall priority forwarding order by combining priority and remaining time, thus rationally allocating traffic and bandwidth load.

[0055] It should be noted that the network requirements of a service include at least one of the following: the service type of the packet to be forwarded and the network latency. The network requirements of a service may also include network jitter information.

[0056] In an optional embodiment of the present invention, the target network path in step 12 includes:

[0057] A strongly deterministic path, wherein all network nodes in the strongly deterministic path support time-based forwarding; or

[0058] A weakly deterministic path, wherein some network nodes in the weakly deterministic path support forwarding based on remaining time.

[0059] In this embodiment, the virtual network topology in step 12 is established based on the actual network topology. The target network path of the virtual network topology includes strongly deterministic paths and weakly deterministic paths. The target network path may also include nondeterministic paths. All network nodes in the strongly deterministic path support the forwarding function based on the remaining time. Some network nodes in the weakly deterministic path support the forwarding function based on the remaining time. However, all network nodes in the nondeterministic path do not support the forwarding function based on the remaining time.

[0060] The network nodes in the target network path include special network nodes and / or ordinary network nodes. Special network nodes include edge nodes, aggregation nodes, and nodes upstream and downstream of aggregation nodes in the virtual network topology. Ordinary network nodes include intermediate network nodes in strongly deterministic paths.

[0061] Furthermore, the principle for establishing the virtual network topology in step 12 is to retain network nodes that support time-based forwarding functionality;

[0062] The principle for traffic allocation on a well-established virtual network topology is as follows:

[0063] A strongly deterministic flow must pass through all network nodes on a strongly deterministic path;

[0064] A weakly deterministic flow must pass through some network nodes on a strongly deterministic path.

[0065] The target network path in the virtual network topology can be used to distinguish between strongly deterministic flows and weakly deterministic flows.

[0066] like Figure 2 As shown, in a specific embodiment, there are three paths in network topology 21: path 1 corresponding to weakly deterministic flow, path 2 corresponding to strongly deterministic flow, and path 3 corresponding to ordinary flow (non-strongly deterministic flow). It can be seen that the network nodes on the weakly deterministic flow are two of all nodes (shaded parts), the network nodes on the strongly deterministic flow are all nodes, and there are no network nodes among all nodes on the ordinary flow (non-strongly deterministic flow). Therefore, according to the topology establishment principle of retaining network nodes that support the forwarding function based on remaining time, virtual network topology 22 can be obtained based on network topology 21, that is, only network nodes that support the forwarding function based on remaining time are retained. At this time, since there are no network nodes among all nodes on the ordinary flow (non-strongly deterministic flow), there is no path 3 in virtual network topology 22, while the nodes in path 1 retain network nodes, and path 2 retains all nodes.

[0067] In an optional embodiment of the present invention, step 13 includes:

[0068] Step 131, distribute the network latency evenly among the network nodes in the target network path; and / or,

[0069] Step 132: Distribute the network latency to each network node in the target network path according to the weight.

[0070] In this embodiment, forwarding delay is allocated to each network node in the target network path of the virtual network topology. This can be done by allocating the delay evenly or by allocating it according to weight.

[0071] Specifically, step 131 includes:

[0072] Through formula Among them, T n Let T(S) be the average latency of each network node on the target network path, T(L) be the maximum network latency of the target network path, and n be the total number of network nodes on the target network path.

[0073] In an optional embodiment of the present invention, step 132 includes:

[0074] Step 1321: For a strongly deterministic path, determine the forwarding delay of each network node in the target network path based on the exit rate of the last network node in the target network path;

[0075] Step 1322: For weakly deterministic paths, the downstream node allocation delay in the target network path is gradually increased or the delay of network nodes that do not support the remaining time scheduling is accumulated to the downstream nodes.

[0076] In this embodiment, for a strongly deterministic path, network latency is allocated to each network node in the strongly deterministic path according to the exit rate of the last network node in the strongly deterministic path and according to the weight. If the exit rate of the aggregation node is greater than a preset value, the allocated network latency is reduced, and vice versa.

[0077] For weakly deterministic paths, the weights of each network node in the path are determined according to the following principles:

[0078] The network latency allocated to downstream nodes needs to be gradually increased, showing an upward trend;

[0079] Alternatively, network latency can be allocated according to the original network topology, and the network latency of network nodes in the middle part of the weakly deterministic path that do not support the remaining time (deadline) scheduling can be accumulated to the downstream nodes.

[0080] like Figure 3As shown in a specific embodiment, as can be seen from the first virtual network topology 31, the bandwidth of link 1 is 5G, the bandwidth of link 2 is 5G, and the bandwidth of link 3 is 10G. Therefore, the bandwidth of the aggregation node j of links 1, 2, and 3 should be greater than the sum of the bandwidths of the nodes of links 1, 2, and 3, that is, the bandwidth of the aggregation node is ≥20G; where weak deterministic flow corresponds to link 1, strong deterministic flow corresponds to link 2, and ordinary flow (non-strong deterministic flow) corresponds to link 3.

[0081] Furthermore, as can be seen from the second virtual network topology 32, according to the topology establishment principle of retaining network nodes that support the remaining time, the second virtual network topology 32 obtained from the first virtual network topology 31 retains the network nodes therein. Among them, the network latency required for weak deterministic flow is ≤50ms. The bandwidth (10ms) of node b in link 1 is accumulated to the downstream node c of node b. Therefore, the bandwidth of the downstream node is 20ms. At the same time, the network latency allocated to the downstream node in link 1 needs to be gradually increased, showing an upward trend. For link 2 corresponding to strong deterministic flow, the network latency required for strong deterministic flow is 20ms (with jitter of 0.5ms). Network nodes d, h, and f tend to be evenly distributed. Since the outgoing rate of the aggregation node j is faster, the network latency allocated to the aggregation node j can be reduced, that is, the network latency allocated to the aggregation node j is adjusted to 3ms.

[0082] In an optional embodiment of the present invention, step 14 includes:

[0083] Step 141: Determine the forwarding priority of the packet based on the original priority corresponding to the service type of the packet and the remaining time of each network node in the target network path.

[0084] In this embodiment, the service type of the packet carried by the network request of the service sent by the terminal device corresponds to the original priority. Based on the original priority and the remaining time of the target network path, the forwarding priority of the packet is determined to deal with the situation of traffic overload in the target network path. The forwarding priority of the packet can be used to send the higher priority packet first when multiple packets need to be forwarded.

[0085] In an optional embodiment of the present invention, step 141 includes:

[0086] Step 1411: If the remaining time of packets of different service types is the same at each network node in the target network path, the original priority corresponding to the service type of the packet is determined as the forwarding priority of the packet.

[0087] Step 1412: If the remaining time of packets of different service types is different at each network node in the target network path, determine the forwarding priority of the packets according to the original priority corresponding to the service type of the packets and the length of the remaining time.

[0088] In this embodiment, when packets of different service types have the same remaining time at various network nodes in the target network path, the original priority is determined as the packet forwarding priority. When packets of different service types have different remaining time at various network nodes in the target network path, the packet forwarding priority needs to be comprehensively determined based on the original priority and the length of the remaining time to reduce traffic load and avoid traffic overload.

[0089] like Figure 4 As shown in a specific embodiment, the network latency of network nodes a and b in the link corresponding to the weakly deterministic flow is 5ms, and the network latency of the aggregation node c is 10ms. There are a total of 6 paths corresponding to strong deterministic flows 1-6. Each path corresponding to a strong deterministic flow has three network nodes d, e, and f. The network latency of network nodes d, e, and f is 5ms. At this time, when the network latency of aggregation node c is still 10ms, traffic overload occurs.

[0090] In another specific embodiment, the message corresponds to the following stream types: video stream, audio stream, text stream, and control stream. The original priorities of the video stream, audio stream, text stream, and control stream are medium, high, low, and high, respectively, and the remaining time is the same, 5ms, as shown in the table below:

[0091] Table 1

[0092] video stream middle 5ms middle audio stream high 5ms high Text Stream Low 5ms Low Control Flow high 5ms high

[0093] As shown in Table 1, when the remaining time is the same, the forwarding priority is the same as the original priority.

[0094] In another specific embodiment, the flow types corresponding to the messages are APP1, APP2, APP3, and APP4, respectively. The original priorities of APP1, APP2, APP3, and APP4 are medium, high, low, and high, respectively, and the remaining time is 2ms, 5ms, 1ms, and 3ms, respectively, as shown in the table below:

[0095] Table 2

[0096] APP1 middle 2ms high APP2 high 5ms middle APP3 Low 1ms middle APP4 high 3ms high

[0097] As shown in Table 2, when the remaining time is inconsistent, the forwarding priority is inconsistent with the original priority. In this case, the forwarding priority is determined based on the original priority and the remaining time.

[0098] In an optional embodiment of the present invention, step 15 includes:

[0099] Step 151: Determine the remaining time of each network node on the target network path based on the forwarding delay;

[0100] Step 152: Forward the packet on the target network path according to the forwarding priority of the packet and the remaining time of each network node.

[0101] This embodiment determines the remaining time of each network node on the target network path in the virtual network topology based on the forwarding delay. Since the remaining time and forwarding priority of each network node are determined, the packet can be forwarded on the target network path. At this time, the forwarded packet takes into account the actual network topology, forwarding delay, remaining time and forwarding priority, and reasonably allocates the traffic and bandwidth load on the target network path.

[0102] like Figure 5 and 6 As shown, in a specific embodiment, the enhancement controller (network management system) is equipped with a topology establishment module, a path division module, a latency allocation module, and a priority adjustment module, which are used to collect the traffic requirements of each user and application and establish a virtual topology to allocate network latency of network nodes.

[0103] The topology establishment module supports the establishment of virtual network topology; the path partitioning module and delay allocation module support the allocation of network delay; and the priority adjustment module supports the determination of network node priorities.

[0104] Furthermore, network requirements in SRv6 (Segment Routing IPv6) packets carry information such as network latency, and the remaining time T(n) is carried by the TLV option OptionTLV in the SR Header, and is recalculated and reassigned at each domain entry point; among them, the TLV option carries the IPv6 application-aware identifier option and the IPv6 service-aware Para option;

[0105] The time allocation F(A)...F(N) of each network node is carried in the Option TLV of the SR Header, and the time allocation of the network node remains unchanged during the forwarding process;

[0106] The actual time t is carried by the corresponding operation at the Segment [...] of the SR Header, that is, obtaining the current time from the device and comparing it with the remaining time after calculation.

[0107] like Figure 7 As shown, in another specific embodiment, the network management system is a controller, and the process of forwarding packets based on the controller is as follows:

[0108] Step 71: Based on the actual network topology, the controller establishes a virtual network topology with strongly deterministic paths and aggregation nodes. The virtual network topology retains network nodes that support forwarding to the remaining deadline.

[0109] Step 72: Client user A...Z sends a network request message, which carries information such as service type, network latency, and network jitter.

[0110] Step 73: The controller establishes a virtual network topology based on the network requirements of the message, divides network paths based on the virtual network topology, and reserves resources. The path corresponding to a strongly deterministic flow must pass through a strongly deterministic network node, and the path corresponding to a weakly deterministic flow must pass through a partially strongly deterministic network node.

[0111] Step 74: The controller allocates network latency for nodes based on network latency and virtual network topology; specifically, for strongly deterministic paths, this can be achieved using formula T. n The distribution can be averaged using the formula [T(S)-T(L)] / n, or it can be weighted and distributed considering the exit rate of the sink node. When the exit rate of the sink node is high, the transmission time can be reduced. For weakly deterministic paths, the formula T can be used. n =[T(S)-T(L)] / n to distribute the network latency equally. Alternatively, we can consider that some nodes in the middle of the path do not support deadline scheduling, which will cause the latency of downstream nodes to gradually increase and show an upward trend. At the same time, we distribute the network latency according to the original topology and add the network latency corresponding to the nodes that do not support the deadline scheduling of the remaining time to the downstream nodes.

[0112] Step 75: The client begins sending message forwarding requests;

[0113] Step 76: The network device comprehensively determines the overall priority and sending order based on the service type, flow type, and remaining time;

[0114] Step 77: Forward the messages according to the overall priority.

[0115] The solution of this invention receives network requests for services sent by terminal devices, wherein the network requests for services carry at least one of the following: the service type of the message and the network latency; determines a target network path in a virtual network topology based on the network latency; allocates forwarding latency to the corresponding network nodes in the target network path based on the network latency; determines the forwarding priority of the message based on the service type of the message; and forwards the message on the target network path based on the forwarding priority and forwarding latency. This achieves a deadline-aware mechanism based on remaining time, considering the actual network topology and allocated forwarding latency, and adjusting the overall priority forwarding order by combining priority and remaining time, thereby reasonably allocating traffic and bandwidth load.

[0116] like Figure 8 As shown, embodiments of the present invention also provide a message forwarding device 80, applied to a network management system, the device 80 comprising:

[0117] The receiving module 81 is used to receive network requirements of services sent by the terminal device, wherein the network requirements of the services carry at least one of the following: the service type of the message and the network latency;

[0118] The processing module 82 is configured to: determine a target network path in the virtual network topology based on the network latency; allocate forwarding delays to the corresponding network nodes in the target network path based on the network latency; determine the forwarding priority of the packet based on the service type of the packet; and forward the packet on the target network path based on the forwarding priority and forwarding delay of the packet.

[0119] Optionally, the target network path includes: a strongly deterministic path or a weakly deterministic path;

[0120] All network nodes in the strongly deterministic path support forwarding based on remaining time.

[0121] Some network nodes in the weakly deterministic path support forwarding based on remaining time.

[0122] Optionally, based on the network latency, a forwarding latency is allocated to the corresponding network nodes in the target network path, including:

[0123] The network latency is evenly distributed to each network node in the target network path;

[0124] And / or,

[0125] The network latency is distributed to each network node in the target network path according to the weights.

[0126] Optionally, the network latency is distributed to each network node in the target network path according to weights, including:

[0127] For strongly deterministic paths, the forwarding delay of each network node in the target network path is determined based on the exit rate of the last network node in the target network path.

[0128] For weakly deterministic paths, the downstream node allocation delay in the target network path is gradually increased, or the delay of network nodes that do not support remaining time scheduling is accumulated to the downstream nodes.

[0129] Optionally, the forwarding priority of the message is determined based on the service type of the message, including:

[0130] The forwarding priority of the packet is determined based on the original priority corresponding to the service type of the packet and the remaining time of each network node in the target network path.

[0131] Optionally, the forwarding priority of the packet is determined based on the original priority corresponding to the service type of the packet and the remaining time of each network node in the target network path, including:

[0132] If packets of different service types have the same remaining time at each network node in the target network path, the original priority corresponding to the service type of the packet is determined as the forwarding priority of the packet.

[0133] If different service types of packets have different remaining times at various network nodes in the target network path, the forwarding priority of the packets is determined based on the original priority corresponding to the service type of the packet and the length of the remaining time.

[0134] Optionally, forwarding the packet on the target network path according to the packet's forwarding priority and forwarding delay includes:

[0135] Based on the forwarding delay, determine the remaining time for each network node on the target network path;

[0136] The message is forwarded on the target network path according to the forwarding priority of the message and the remaining time of each network node.

[0137] It should be noted that this device is a device corresponding to the method described above. All implementation methods in the above method embodiments are applicable to this embodiment and can achieve the same technical effect.

[0138] Embodiments of the present invention also provide a communication device, including: a processor and a memory storing a computer program, wherein the computer program, when executed by the processor, performs the method described above. All implementations in the above method embodiments are applicable to this embodiment and can achieve the same technical effects.

[0139] Embodiments of the present invention also provide a computer-readable storage medium including instructions that, when executed on a computer, cause the computer to perform the method described above. All implementations in the above method embodiments are applicable to this embodiment and can achieve the same technical effects.

[0140] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this invention.

[0141] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0142] In the embodiments provided by this invention, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0143] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0144] In addition, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0145] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this invention, essentially, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

[0146] Furthermore, it should be noted that in the apparatus and method of the present invention, it is obvious that the components or steps can be decomposed and / or recombined. These decompositions and / or recombinations should be considered equivalent solutions of the present invention. Moreover, the steps performing the above-described series of processes can naturally be executed in the order described, but are not necessarily required to be executed in chronological order; some steps can be executed in parallel or independently of each other. Those skilled in the art will understand that all or any step or component of the method and apparatus of the present invention can be implemented in any computing device (including processors, storage media, etc.) or network of computing devices, in hardware, firmware, software, or a combination thereof. This is something that those skilled in the art can achieve by using their basic programming skills after reading the description of the present invention.

[0147] Therefore, the object of the present invention can also be achieved by running a program or a set of programs on any computing device. The computing device can be a known general-purpose device. Therefore, the object of the present invention can also be achieved simply by providing a program product containing program code implementing the method or apparatus. That is, such a program product also constitutes the present invention, and the storage medium storing such a program product also constitutes the present invention. Obviously, the storage medium can be any known storage medium or any storage medium developed in the future. It should also be noted that in the apparatus and method of the present invention, it is obvious that the components or steps can be decomposed and / or recombined. These decompositions and / or recombinations should be considered equivalent to the present invention. Furthermore, the steps performing the above series of processes can naturally be performed in the order described, but are not necessarily required to be performed in chronological order. Some steps can be performed in parallel or independently of each other.

[0148] The above description represents the preferred embodiments of the present invention. It should be noted that those skilled in the art can make various improvements and modifications without departing from the principles of the present invention, and these improvements and modifications should also be considered within the scope of protection of the present invention.

Claims

1. A message forwarding method, characterized in that, Applied to a network management system, the method includes: The network requirements of the service sent by the receiving terminal device carry at least one of the following: the service type of the message and the network latency; Based on the network latency, a target network path is determined in a virtual network topology; the virtual network topology is established based on the actual network topology, and the target network path includes: a strongly deterministic path and a weakly deterministic path; all network nodes in the strongly deterministic path support forwarding based on remaining time; some network nodes in the weakly deterministic path support forwarding based on remaining time. Based on the network latency, forwarding latency is allocated to the corresponding network nodes in the target network path; Determine the forwarding priority of the message based on its service type; The message is forwarded on the target network path according to the forwarding priority and forwarding delay of the message.

2. The message forwarding method according to claim 1, characterized in that, Based on the network latency, allocate forwarding latency to the corresponding network nodes in the target network path, including: The network latency is evenly distributed to each network node in the target network path; And / or, The network latency is distributed to each network node in the target network path according to the weights.

3. The message forwarding method according to claim 2, characterized in that, Distributing the network latency according to weights to each network node in the target network path includes: For strongly deterministic paths, the forwarding delay of each network node in the target network path is determined based on the exit rate of the last network node in the target network path. For weakly deterministic paths, the downstream node allocation delay in the target network path is gradually increased, or the delay of network nodes that do not support remaining time scheduling is accumulated to the downstream nodes.

4. The message forwarding method according to claim 1, characterized in that, Based on the service type of the message, determine the forwarding priority of the message, including: The forwarding priority of the packet is determined based on the original priority corresponding to the service type of the packet and the remaining time of each network node in the target network path.

5. The message forwarding method according to claim 4, characterized in that, Based on the original priority corresponding to the service type of the message and the remaining time of each network node in the target network path, the forwarding priority of the message is determined, including: If packets of different service types have the same remaining time at each network node in the target network path, the original priority corresponding to the service type of the packet is determined as the forwarding priority of the packet. If different service types of packets have different remaining times at various network nodes in the target network path, the forwarding priority of the packets is determined based on the original priority corresponding to the service type of the packet and the length of the remaining time.

6. The message forwarding method according to claim 1, characterized in that, Based on the forwarding priority and forwarding delay of the packet, the packet is forwarded on the target network path, including: Based on the forwarding delay, determine the remaining time for each network node on the target network path; The message is forwarded on the target network path according to the forwarding priority of the message and the remaining time of each network node.

7. A message forwarding device, characterized in that, The device, used in a network management system, includes: The receiving module is used to receive network requirements of services sent by terminal devices, wherein the network requirements of services carry at least one of the following: the service type of the message and the network latency; The processing module is configured to: determine a target network path in a virtual network topology based on the network latency; allocate forwarding delays to corresponding network nodes in the target network path based on the network latency; determine the forwarding priority of the packet based on the service type of the packet; and forward the packet on the target network path based on the forwarding priority and forwarding delay of the packet. The virtual network topology is established based on the actual network topology, and the target network path includes: a strongly deterministic path and a weakly deterministic path; all network nodes in the strongly deterministic path support forwarding based on remaining time; and some network nodes in the weakly deterministic path support forwarding based on remaining time.

8. A communication device, characterized in that, include: A processor, a memory storing a computer program, wherein the computer program, when executed by the processor, performs the method as described in any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, Store instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 6.

Images