A simulation method and device for superimposing prefix scheduling strategy

Abstract

The present invention discloses a simulation method and device for superimposing prefix scheduling strategies, wherein the method comprises: treating the prefix related to the scheduling strategy as a separate network object, and the original network where it is located has the same next hop as the original network where the target network object is located; the network node configured with the scheduling strategy generates the simulation strategy based on the prefix; removing the prefix traffic related to the scheduling strategy from the edge inflow traffic, and treating the removed prefix traffic related to the scheduling strategy as a separate traffic; abstracting the original network topology into two parts, calculating the traffic information on each path according to the path obtained by the simulation strategy for the special network topology containing the scheduling strategy; superimposing the two abstracted network topologies according to the same path to obtain the final traffic information on each path, thereby obtaining the simulation result. The method and device simulate and predict the existing network closer to the real network.

Description

Technical Field

[0001] The present invention relates to the technical field of traffic prediction of operator networks, and in particular to a simulation method and device for superimposing a prefix scheduling strategy. Background Art

[0002] In the operator network, sometimes the network is expanded, cutover or holiday traffic is predicted, but there is no way to evaluate the impact of expansion and cutover on the existing network. Therefore, it is necessary to use the SPF algorithm (shortest path first algorithm) to predict traffic based on the existing network topology and traffic, so as to determine whether the network planning is reasonable and prevent problems before they occur. However, the results obtained based on the pure SPF algorithm cannot well reflect the actual situation of the existing network, because the existing network often configures many scheduling policies on the equipment. For example, if the traffic is large for a period of time, some paths may be congested while other paths are idle. At this time, the next hop of certain prefix (prefix is ​​the network prefix, which is the IP address part corresponding to the network part of the address, used to uniquely identify the network number of a network connected to the Internet) addresses can be specified on the device through manual intervention or automatic scheduling, and the prefix with large traffic is diverted to the idle path, thereby solving the problem of traffic congestion and ensuring the service quality of the operator. In the above case, the simulation results calculated based on the SPF algorithm will be different from the actual network, and it is impossible to obtain correct simulation results, and thus it is impossible to correctly guide customers to correctly judge the impact of expansion, cutover or holiday traffic increase. Summary of the invention

[0003] In order to solve the problems caused by policy factors, the present invention provides a simulation method and device for superimposing prefix scheduling strategy, which takes into account the influence of prefix scheduling strategy on the basis of compatible standard simulation, simulates and predicts the existing network closer to the real network, thereby helping operators to predict risks more accurately and improve operation and maintenance efficiency.

[0004] To achieve the above object, the present invention adopts the following technical solutions:

[0005] In one embodiment of the present invention, a simulation method for superimposing a prefix scheduling strategy is proposed, and the method includes:

[0006] Treat the prefix related to the obtained scheduling policy as a separate network object, and the original network where the separate network object is located has the same next hop as the original network where the target network object is located;

[0007] The network node configured with the scheduling strategy generates the simulation strategy based on the prefix;

[0008] Eliminate the prefix traffic related to the scheduling policy from the edge inflow traffic, and transmit the eliminated prefix traffic related to the scheduling policy as separate edge inflow traffic;

[0009] The original network topology is abstracted into two parts, and the special network topology containing the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy;

[0010] The two abstracted network topologies are superimposed along the same path to obtain the final traffic information on each path, thereby obtaining the simulation results.

[0011] Furthermore, prefix traffic related to the scheduling policy is removed from the edge inflow traffic, and the removed prefix traffic related to the scheduling policy is transmitted as separate edge inflow traffic, including:

[0012] Collect netflow traffic information flowing in from the edge ports of network nodes configured with scheduling policies;

[0013] Remove the prefix traffic related to the scheduling policy from the netflow traffic;

[0014] Treat the prefix traffic related to the removed scheduling policy as separate edge inflow traffic and transmit it along the path obtained by the simulation policy;

[0015] The edge inflow traffic after removing the prefix traffic related to the scheduling policy is transmitted according to the path obtained by the SPF algorithm.

[0016] Furthermore, the original network topology is abstracted into two parts, and the special network topology containing the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy, including:

[0017] Abstract the original network topology into a basic network topology without scheduling strategy and a special network topology with scheduling strategy;

[0018] The basic network topology that does not contain a scheduling strategy is used to calculate the traffic information on each path based on the shortest path obtained by the SPF algorithm;

[0019] The special network topology containing the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy.

[0020] Furthermore, the special network topology including the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy, including:

[0021] Determine whether the network node from which the traffic flows in through its edge port is configured with a scheduling policy related to the prefix. If so, use the next hop specified by the scheduling policy as the first next hop network node, obtain the path from the network node from which the traffic flows in through its edge port to the first next hop network node, and then calculate the shortest path from the first next hop network node to the second next hop network node;

[0022] Determine whether the first next-hop network node is configured with a scheduling policy related to prefix. If yes, obtain the second next-hop network node according to the scheduling policy. If no, obtain the shortest path from the first next-hop network node to the second next-hop network node according to the SPF algorithm, and take the shortest path as the subsequent path.

[0023] Continue to calculate the shortest path according to the above method until the Nth next-hop network node is the same as the network node from which the traffic flows out of its edge port;

[0024] Each path is spliced ​​together to obtain a final path, and then the traffic information on each path is calculated based on the final path.

[0025] In one embodiment of the present invention, a simulation device for superimposing a prefix scheduling strategy is also proposed, and the device includes:

[0026] The network object module is used to treat the prefix related to the obtained scheduling policy as a separate network object, and the original network where the separate network object is located has the same next hop as the original network where the target network object is located;

[0027] A simulation strategy generation module is used for generating a simulation strategy based on a prefix for a network node configured with a scheduling strategy;

[0028] A network traffic processing module is used to remove the prefix traffic related to the scheduling policy from the edge inflow traffic, and transmit the removed prefix traffic related to the scheduling policy as a separate edge inflow traffic;

[0029] The network topology path calculation module is used to abstract the original network topology into two parts, and calculate the traffic information on each path according to the path obtained by the simulation strategy for the special network topology containing the scheduling strategy;

[0030] The network traffic superposition module is used to superimpose the two abstracted network topologies along the same path to obtain the final traffic information on each path, thereby obtaining the simulation results.

[0031] Furthermore, the network traffic processing module is specifically used to:

[0032] Collect netflow traffic information flowing in from the edge ports of network nodes configured with scheduling policies;

[0033] Remove the prefix traffic related to the scheduling policy from the netflow traffic;

[0034] Treat the prefix traffic related to the removed scheduling policy as separate edge inflow traffic and transmit it along the path obtained by the simulation policy;

[0035] The edge inflow traffic after removing the prefix traffic related to the scheduling policy is transmitted according to the path obtained by the SPF algorithm.

[0036] Furthermore, the network topology path calculation module is specifically used for:

[0037] Abstract the original network topology into a basic network topology without scheduling strategy and a special network topology with scheduling strategy;

[0038] The basic network topology that does not contain a scheduling strategy is used to calculate the traffic information on each path based on the shortest path obtained by the SPF algorithm;

[0039] The special network topology containing the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy.

[0040] Furthermore, the special network topology including the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy, including:

[0041] Determine whether the network node from which the traffic flows in through its edge port is configured with a scheduling policy related to the prefix. If so, use the next hop specified by the scheduling policy as the first next hop network node, obtain the path from the network node from which the traffic flows in through its edge port to the first next hop network node, and then calculate the shortest path from the first next hop network node to the second next hop network node;

[0042] Determine whether the first next-hop network node is configured with a scheduling policy related to prefix. If yes, obtain the second next-hop network node according to the scheduling policy. If no, obtain the shortest path from the first next-hop network node to the second next-hop network node according to the SPF algorithm, and take the shortest path as the subsequent path.

[0043] Continue to calculate the shortest path according to the above method until the Nth next-hop network node is the same as the network node from which the traffic flows out of its edge port;

[0044] Each path is spliced ​​together to obtain a final path, and then the traffic information on each path is calculated based on the final path.

[0045] In one embodiment of the present invention, a computer device is also proposed, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the simulation of the aforementioned overlay prefix scheduling strategy is implemented.

[0046] In one embodiment of the present invention, a computer-readable storage medium is further provided, wherein the computer-readable storage medium stores a computer program for executing a simulation of an overlay prefix scheduling strategy.

[0047] Beneficial effects:

[0048] 1. The simulation of the present invention is closer to the real network and takes into account the influence of the existing network scheduling strategy.

[0049] 2. The present invention abstracts the scheduling strategy into edge traffic and network objects, which is easier to understand.

[0050] 3. The present invention separates complex scenarios from basic functions and processes them separately, thus reducing the complexity of the system.

[0051] 4. The simulation results of the present invention are closer to the existing network production environment, and have higher credibility and availability. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] Figure 1 It is a flow chart of a simulation method for superimposing a prefix scheduling strategy according to the present invention;

[0053] Figure 2 is a schematic diagram of a topology model of an operator backbone network according to an embodiment of the present invention;

[0054] Figure 3 is a schematic diagram of an acquired scheduling strategy and its associated prefix according to an embodiment of the present invention;

[0055] Figure 4 It is a schematic diagram of processing a prefix related to a scheduling strategy into a network object according to an embodiment of the present invention;

[0056] Figure 5 It is a schematic diagram of a network node configured with a scheduling strategy generating a simulation strategy based on a prefix according to an embodiment of the present invention;

[0057] Figure 6 It is a schematic diagram of treating the pefix traffic related to the scheduling policy removed from the edge inflow traffic as a separate edge inflow traffic according to an embodiment of the present invention;

[0058] Figure 7 It is a schematic diagram of performing path calculation based on an abstracted network topology according to an embodiment of the present invention;

[0059] Figure 8 It is a schematic diagram of the structure of the simulation device of the present invention superimposed with the prefix scheduling strategy;

[0060] Fig. 9 It is a schematic diagram of the computer device structure of the present invention. DETAILED DESCRIPTION

[0061] The principles and spirit of the present invention will be described below with reference to several exemplary embodiments. It should be understood that these embodiments are provided only to enable those skilled in the art to better understand and implement the present invention, and are not intended to limit the scope of the present invention in any way. On the contrary, these embodiments are provided to make the present disclosure more thorough and complete, and to fully convey the scope of the present disclosure to those skilled in the art.

[0062] Those skilled in the art will appreciate that the embodiments of the present invention may be implemented as a device, apparatus, equipment, method or computer program product. Therefore, the present disclosure may be implemented in the following forms, namely: complete hardware, complete software (including firmware, resident software, microcode, etc.), or a combination of hardware and software.

[0063] According to an implementation manner of the present invention, a simulation method and device for superimposing prefix scheduling strategies are proposed. The prefix related to the scheduling strategy is regarded as an independent network object, and the prefix traffic related to the scheduling strategy flowing in from the edge is regarded as a separate edge inflow traffic, and then removed from the baseline traffic. In this way, the baseline traffic can be transmitted according to the path calculated by the SPF algorithm, and the prefix traffic related to the scheduling strategy can be transmitted according to a special topology. Finally, the two parts of the calculation results are superimposed to obtain the final traffic information on each path.

[0064] The principle and spirit of the present invention are explained in detail below with reference to several representative embodiments of the present invention.

[0065] Figure 1 Schematic diagram of the simulation method of superimposing prefix scheduling strategy of the present invention. Figure 1 As shown, the method includes:

[0066] 1. Basic simulation principles

[0067] The operator backbone network topology model is as follows: Figure 2 As shown, the backbone BB devices between provinces are connected, and the provincial network PB devices are connected to the backbone BB devices. By default, the traffic of each province will pass through the provincial network PB device-backbone BB-other provincial PB devices to complete the traffic exchange with other provinces. The following is a simulation of the network where the backbone network devices are located.

[0068] If all backbone devices are regarded as a large network, then the BB device connected to the provincial PB device is the edge device of the network. The traffic between provincial networks flows into the backbone network through the edge device. Since the backbone network only forwards traffic and does not consume traffic itself, the incoming traffic must flow to other provinces through the port of another edge device. If each province is regarded as a network object and the edge device is regarded as a network node, then it is abstracted into the path calculation of the incoming traffic from a network node to the target network object. The edge device connected to the network object can be regarded as the next hop network node to reach the target network object, and then the simulation is abstracted into the path calculation of the incoming traffic from a network node to another network node, so that the shortest path can be obtained through the SPF algorithm.

[0069] 2. Get the system scheduling strategy and its associated prefix

[0070] The scheduling system will store the scheduling records of the operator network in the database, record the next-hop network node from the network node to the target network object, and record which prefixes have scheduling policies set.

[0071] like Figure 3 As shown in the figure, there is a flow information prefix1 from JS provincial network to SD provincial network, which needs to be transmitted through the path JS-BB->BB2->SD-BB. If there is congestion on the path JS-BB->BB2 at this time, you can configure a scheduling policy on the JS-BB device to specify the next hop of this flow information as BB1, which reduces the pressure on the path JS-BB->BB2.

[0072] 3. Process the scheduling-related prefix as a network object

[0073] A network object can actually be considered as a collection of address segments, such as Figure 4 The SD provincial network can be regarded as a network object.

[0074] The prefix related to policy scheduling can be treated as an independent network object for processing, and the original network where it is located has the same next hop as the original network where the target network object (SD provincial network) is located, such as Figure 4 prefix1, and then calculate the path that the traffic must take to reach this prefix network object.

[0075] 4. For devices (network nodes) with scheduling strategies, generate simulation strategies based on prefix

[0076] Get the network node configured with the scheduling policy and its scheduling policy-related prefix and the specified next hop, and generate the next hop from this network node to the prefix as the next hop configured by the scheduling policy. In this way, when calculating the path, if there is a specified next hop, the path is calculated according to the specified next hop. If there is no specified next hop, the path is calculated according to the shortest path algorithm.

[0077] like Figure 5 As shown in the figure, the scheduling policy is configured on JS-BB. For the traffic to the prefix1 network object, its next hop is strongly specified as BB1. In this way, when calculating the path, all the traffic that passes through JS-BB to reach the prefix1 network object will take the path JS-BB->BB1.

[0078] 5. Remove the pefix traffic related to the scheduling policy from the edge inflow traffic, and treat the prefix related to the scheduling policy as a separate edge inflow traffic.

[0079] like Figure 6 As shown in the figure, the netflow traffic information flowing into the edge port of the JS-BB device is collected to obtain the traffic information from the source address to the destination address, and then the address record whose destination address belongs to the range of pefix1 is obtained. The traffic information can be summarized to obtain the traffic information from this device to the prefix1 network object. In this way, the traffic flowing in from the edge port of the JS-BB device is divided into two parts:

[0080] One part is the traffic that reaches the prefix1 network object, which can be transmitted according to the path obtained by the simulation strategy in step 4;

[0081] One part is the traffic that does not include the traffic to the prefix1 network object, which can be transmitted according to the path obtained by the SPF algorithm.

[0082] 6. Calculate paths based on the abstracted network topology

[0083] like Figure 7 As shown in the figure, the original network topology will eventually be abstracted into two parts. The first part is the basic topology that does not include the scheduling policy, that is, the topology that only includes the prefix traffic and prefix network objects related to the scheduling policy. The second part is the special topology that includes the scheduling policy, that is, the topology after removing the prefix traffic related to the scheduling policy.

[0084] For the basic topology in the first part, the traffic information on each path can be calculated according to the shortest path obtained by the SPF algorithm.

[0085] Calculate the traffic information on each path: Collect the netflow traffic information flowing into the JS-BB edge port, and obtain the traffic information from the source address to the destination address. Each network object, such as the BJ provincial network, has its own address range. By judging the network object address range to which the destination address belongs, the traffic information from the edge device to each target network object can be obtained. As we have already known, the next hop of the target network object is the device that connects the target network object to the backbone network. Calculate the path for a piece of traffic information, and calculate the path from the edge device to the target network object, that is, calculate the path from the edge device to the next hop of the target network object. A piece of traffic information generally does not change after being propagated through a path, so the path through which a piece of traffic information passes is considered to have traffic of this size of traffic information. Calculate all traffic information in the same way, so that all calculation results are grouped according to the same path to obtain detailed traffic information on each path.

[0086] For the special topology in the second part, the path can be calculated according to the following algorithm.

[0087] Taking the traffic component from JS-BB node to prefx1 network as an example, calculating the path from JS-BB network node to prefix1 network object is actually calculating the shortest path from JS-BB network node to SD-BB network node. First, determine whether there is a scheduling policy related to prefix1 network object on JS-BB. If yes, use the next hop network node pointed by the scheduling policy as the next hop network node to obtain the path JS-BB->BB1. Then calculate the shortest path from BB1 network node to SD-BB network node. Similarly, first determine whether there is a scheduling policy related to prefix1 network object on BB1 network node. If yes, obtain the next hop network node according to the scheduling policy. If no, use the SPF algorithm to obtain the shortest path from BB1 network node to SD-BB network node, and take the shortest path BB1->SD-BB as the subsequent path. The same method is used to calculate the shortest path until the SD-BB network node is calculated to be the same as the target SD-BB network node. The final path is obtained by splicing each path, and then the traffic information on each path is calculated based on the final path.

[0088] 7. Get simulation results

[0089] The same method is used to process other prefixes related to scheduling strategies.

[0090] Finally, the traffic information calculated by the first part of the basic topology and the traffic information calculated by the second part of the special topology are superimposed on the same path to obtain the final traffic information on the path, thereby obtaining the simulation result. According to the simulation result, it is possible to simulate whether the upcoming live network operation will have an impact on the entire network, thereby avoiding major network accidents.

[0091] It should be noted that, although the operations of the method of the present invention are described in a specific order in the above embodiments and the accompanying drawings, this does not require or imply that the operations must be performed in the specific order, or that all the operations shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps.

[0092] Based on the same inventive concept, the present invention also proposes a simulation device for superimposing a prefix scheduling strategy. The implementation of the device can refer to the implementation of the above method, and the repeated parts will not be repeated. The term "module" used below can be a combination of software and / or hardware that implements a predetermined function. Although the device described in the following embodiments is preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0093] Figure 8 Schematic diagram of the structure of the simulation device of the present invention superimposed with the prefix scheduling strategy. Figure 8 As shown, the device comprises:

[0094] The network object module 101 is used to treat the prefix related to the obtained scheduling policy as a separate network object, and the original network where the separate network object is located has the same next hop as the original network where the target network object is located;

[0095] A simulation strategy generating module 102, configured for a network node configured with a scheduling strategy to generate a simulation strategy based on a prefix;

[0096] The network traffic processing module 103 is used to remove the prefix traffic related to the scheduling policy from the edge inflow traffic, and transmit the removed prefix traffic related to the scheduling policy as a separate edge inflow traffic; the details are as follows:

[0097] Collect netflow traffic information flowing in from the edge ports of network nodes configured with scheduling policies;

[0098] Remove the prefix traffic related to the scheduling policy from the netflow traffic;

[0099] Treat the prefix traffic related to the removed scheduling policy as separate edge inflow traffic and transmit it along the path obtained by the simulation policy;

[0100] The edge inflow traffic after removing the prefix traffic related to the scheduling policy is transmitted according to the path obtained by the SPF algorithm;

[0101] The network topology path calculation module 104 is used to abstract the original network topology into two parts, and calculate the traffic information on each path according to the path obtained by the simulation strategy for the special network topology containing the scheduling strategy; the details are as follows:

[0102] Abstract the original network topology into a basic network topology without scheduling strategy and a special network topology with scheduling strategy;

[0103] The basic network topology that does not contain a scheduling strategy is used to calculate the traffic information on each path based on the shortest path obtained by the SPF algorithm;

[0104] The special network topology containing the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy, including:

[0105] Determine whether the network node from which the traffic flows in through its edge port is configured with a scheduling policy related to the prefix. If so, use the next hop specified by the scheduling policy as the first next hop network node, obtain the path from the network node from which the traffic flows in through its edge port to the first next hop network node, and then calculate the shortest path from the first next hop network node to the second next hop network node;

[0106] Determine whether the first next-hop network node is configured with a scheduling policy related to prefix. If yes, obtain the second next-hop network node according to the scheduling policy. If no, obtain the shortest path from the first next-hop network node to the second next-hop network node according to the SPF algorithm, and take the shortest path as the subsequent path.

[0107] Continue to calculate the shortest path according to the above method until the Nth next-hop network node is the same as the network node from which the traffic flows out of its edge port;

[0108] Each path is spliced ​​together to obtain a final path, and then the traffic information on each path is calculated based on the final path;

[0109] The network traffic superposition module 105 is used to superimpose the two abstracted network topologies along the same path to obtain final traffic information on each path, thereby obtaining a simulation result.

[0110] It should be noted that, although several modules of the simulation device of the superposition prefix scheduling strategy are mentioned in the above detailed description, this division is only exemplary and not mandatory. In fact, according to an embodiment of the present invention, the features and functions of two or more modules described above can be concretized in one module. On the contrary, the features and functions of one module described above can be further divided into being concretized by multiple modules.

[0111] Based on the above invention concept, Fig. 9 As shown, the present invention also proposes a computer device 200, including a memory 210, a processor 220, and a computer program 230 stored in the memory 210 and executable on the processor 220. When the processor 220 executes the computer program 230, the simulation of the aforementioned superimposed prefix scheduling strategy is implemented.

[0112] Based on the aforementioned inventive concept, the present invention further proposes a computer-readable storage medium, which stores a computer program for executing the simulation of the aforementioned superimposed prefix scheduling strategy.

[0113] The simulation method and device for superimposing prefix scheduling strategies proposed in the present invention are closer to the real network and take into account the influence of the existing network scheduling strategies. The scheduling strategies are abstracted into edge traffic and network objects, which are easier to understand. Complex scenarios are separated from basic functions and processed separately, which reduces the complexity of the system. The simulation results are closer to the existing network production environment and have higher credibility and availability.

[0114] Although the spirit and principle of the present invention have been described with reference to several specific embodiments, it should be understood that the present invention is not limited to the disclosed specific embodiments, and the division of various aspects does not mean that the features in these aspects cannot be combined to benefit, and such division is only for the convenience of expression. The present invention is intended to cover various modifications and equivalent arrangements contained in the spirit and scope of the attached claims.

[0115] Regarding the limitation of the protection scope of the present invention, those skilled in the art should understand that, based on the technical solution of the present invention, various modifications or variations that can be made by those skilled in the art without creative work are still within the protection scope of the present invention.

Claims

1. A simulation method for superimposing a prefix scheduling strategy, characterized in that: The method includes: Treat the prefix related to the obtained scheduling policy as a separate network object, and the original network where the separate network object is located has the same next hop as the original network where the target network object is located; The network node configured with the scheduling strategy generates the simulation strategy based on the prefix; Eliminate the prefix traffic related to the scheduling policy from the edge inflow traffic, and transmit the eliminated prefix traffic related to the scheduling policy as separate edge inflow traffic; The original network topology is abstracted into two parts, and the special network topology containing the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy; The two abstracted network topologies are superimposed along the same path to obtain the final traffic information on each path, thereby obtaining the simulation results.

2. The simulation method for superimposing prefix scheduling strategy according to claim 1 is characterized in that: Eliminate the prefix traffic related to the scheduling policy from the edge inflow traffic, and transmit the eliminated prefix traffic related to the scheduling policy as separate edge inflow traffic, including: Collect netflow traffic information flowing in from the edge ports of network nodes configured with scheduling policies; Remove the prefix traffic related to the scheduling policy from the netflow traffic; Treat the prefix traffic related to the removed scheduling policy as separate edge inflow traffic and transmit it according to the path obtained by the simulation policy; The edge inflow traffic after removing the prefix traffic related to the scheduling policy is transmitted according to the path obtained by the SPF algorithm.

3. The simulation method for superimposing prefix scheduling strategy according to claim 1 is characterized in that: The original network topology is abstracted into two parts. The special network topology containing the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy, including: Abstract the original network topology into a basic network topology without scheduling strategy and a special network topology with scheduling strategy; The basic network topology that does not contain a scheduling strategy is used to calculate the traffic information on each path based on the shortest path obtained by the SPF algorithm; The special network topology containing the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy.

4. The simulation method for superimposing prefix scheduling strategy according to claim 1 or 3, characterized in that: The special network topology containing the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy, including: Determine whether the network node from which the traffic flows in through its edge port is configured with a scheduling policy related to the prefix. If so, use the next hop specified by the scheduling policy as the first next hop network node, obtain the path from the network node from which the traffic flows in through its edge port to the first next hop network node, and then calculate the shortest path from the first next hop network node to the second next hop network node; Determine whether the first next-hop network node is configured with a scheduling policy related to prefix. If yes, obtain the second next-hop network node according to the scheduling policy. If no, obtain the shortest path from the first next-hop network node to the second next-hop network node according to the SPF algorithm, and take the shortest path as the subsequent path. Continue to calculate the shortest path according to the above method until the Nth next-hop network node is the same as the network node from which the traffic flows out of its edge port; Each path is spliced ​​together to obtain a final path, and then the traffic information on each path is calculated based on the final path.

5. A simulation device for superimposing prefix scheduling strategy, characterized in that: The device includes: The network object module is used to treat the prefix related to the obtained scheduling policy as a separate network object, and the original network where the separate network object is located has the same next hop as the original network where the target network object is located; A simulation strategy generation module is used for generating a simulation strategy based on a prefix for a network node configured with a scheduling strategy; A network traffic processing module is used to remove the prefix traffic related to the scheduling policy from the edge inflow traffic, and transmit the removed prefix traffic related to the scheduling policy as a separate edge inflow traffic; The network topology path calculation module is used to abstract the original network topology into two parts, and calculate the traffic information on each path according to the path obtained by the simulation strategy for the special network topology containing the scheduling strategy; The network traffic superposition module is used to superimpose the two abstracted network topologies along the same path to obtain the final traffic information on each path, thereby obtaining the simulation results.

6. The simulation device for superimposing prefix scheduling strategy according to claim 5, characterized in that: The network traffic processing module is specifically used for: Collect netflow traffic information flowing in from the edge ports of network nodes configured with scheduling policies; Remove the prefix traffic related to the scheduling policy from the netflow traffic; Treat the prefix traffic related to the removed scheduling policy as separate edge inflow traffic and transmit it according to the path obtained by the simulation policy; The edge inflow traffic after removing the prefix traffic related to the scheduling policy is transmitted according to the path obtained by the SPF algorithm.

7. The simulation device for superimposing prefix scheduling strategy according to claim 5, characterized in that: The network topology path calculation module is specifically used for: Abstract the original network topology into a basic network topology without scheduling strategy and a special network topology with scheduling strategy; The basic network topology that does not contain a scheduling strategy is used to calculate the traffic information on each path based on the shortest path obtained by the SPF algorithm; The special network topology containing the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy.

8. The simulation device for superimposing prefix scheduling strategy according to claim 5 or 7, characterized in that: The special network topology containing the scheduling strategy is used to calculate the traffic information on each path according to the path obtained by the simulation strategy, including: Determine whether the network node from which the traffic flows in through its edge port is configured with a scheduling policy related to the prefix. If so, use the next hop specified by the scheduling policy as the first next hop network node, obtain the path from the network node from which the traffic flows in through its edge port to the first next hop network node, and then calculate the shortest path from the first next hop network node to the second next hop network node; Determine whether the first next-hop network node is configured with a scheduling policy related to prefix. If yes, obtain the second next-hop network node according to the scheduling policy. If no, obtain the shortest path from the first next-hop network node to the second next-hop network node according to the SPF algorithm, and take the shortest path as the subsequent path. Continue to calculate the shortest path according to the above method until the Nth next-hop network node is the same as the network node from which the traffic flows out of its edge port; Each path is spliced ​​together to obtain a final path, and then the traffic information on each path is calculated based on the final path.

9. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the method according to any one of claims 1 to 3 is implemented.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program for executing the method according to any one of claims 1 to 3.

Images