Checking method of slice topology, network controller and system

Abstract

The invention discloses a slice topology verification method, a network controller and a system, relates to the technical field of communication, can verify slice topologies in an initial state and in operation, and facilitates maintenance of the slice topologies by operation and maintenance personnel. The method comprises the following steps: acquiring slice topology information of a slice topology, historical flow information of the slice topology, physical topology information of a physical topology associated with the slice topology and a slice strategy; verifying the slice topology according to the slice topology information, the historical flow information, the physical topology information and the slice strategy to obtain verification information; outputting verification information; wherein the verification information comprises slice topology verification passing or verification failing; if the verification is passed, the slice topology satisfies the slice strategy, and if the verification is not passed, the slice topology does not satisfy the slice strategy.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a slice topology verification method, a network controller and a system. Background Art

[0002] In addition to serving individual users, communication networks such as the fifth generation (5G) network also need to meet the digital transformation needs of various industries. The digital transformation of industries requires that communication networks have deterministic service assurance capabilities and have high requirements for key indicators such as latency, jitter, and packet loss rate.

[0003] The 3rd Generation Partnership Project (3GPP) and other standard organizations have proposed the network slice (NS) technology, which divides a physical network into multiple logical slice topologies that can meet different needs and are isolated from each other, and deploys different services on different slices, thereby meeting the different needs of highly differentiated services. This technology is considered to be a key technology that can meet the diverse business needs of 5G.

[0004] During the deployment of the slice topology, problems such as incorrect configuration of the slice topology may occur, causing the slice topology to be unable to run services normally, affecting the use of services. Summary of the invention

[0005] The present application provides a slice topology verification method, which can obtain the error configuration information of the slice topology and facilitate the maintenance of the slice topology.

[0006] In order to achieve the above objectives, the embodiments of the present application provide the following technical solutions:

[0007] In a first aspect, a method for verifying a slice topology is provided, comprising: obtaining slice topology information of a slice topology, historical traffic information of the slice topology, physical topology information of a physical topology associated with the slice topology, and a slice strategy; verifying the slice topology according to the slice topology information, the historical traffic information, the physical topology information, and the slice strategy to obtain verification information; outputting the verification information; wherein the verification information includes whether the slice topology verification passes or fails; if the verification passes, it indicates that the slice topology satisfies the slice strategy, and if the verification fails, it indicates that the slice topology does not satisfy the slice strategy.

[0008] Through the method provided in the present application, the slice topology can be verified according to the slice topology information, the historical traffic information, the physical topology information and the slice strategy when the slice topology is initially established and during the operation of the slice topology, and the verification information can be output to enable the user to understand whether the running slice topology satisfies the slice strategy and ensure the normal transmission of business data in the slice topology.

[0009] In a possible design, if the slice topology verification fails, the verification information also includes the reason why the slice topology does not satisfy the slice strategy. The reason why the slice topology does not satisfy the slice strategy and the location of the slice node or slice link that does not satisfy the slice topology are output. Through the above possible design, the user can trust the output result, and the user can refer to the reason and further set the slice topology according to the location of the slice node or slice link of the slice topology.

[0010] In another possible design, if the slice topology verification fails, the verification information also includes an update strategy, and the update strategy is used to update the slice topology information. When the slice topology verification fails, an update strategy for updating the slice topology is output, so that the controller or the user can configure the slice topology according to the update strategy so that the slice topology satisfies the slice strategy.

[0011] In another possible design, the physical topology information includes at least one of the following information: a physical node identification ID, a source physical port ID of a physical link, a destination physical port ID of the physical link, a total bandwidth of the physical link, a sliceable bandwidth of the physical link, a slice type supported by the physical link, or an affinity attribute of the physical link, wherein the sliceable bandwidth is a bandwidth that allows the physical link to be allocated to a slice link.

[0012] In another possible design, the slice topology information includes at least one of the following information: slice ID, slice node ID, mapping relationship between slice node ID and physical node ID, mapping relationship between slice link and physical link, slice link bandwidth, source slice port ID of slice link, or destination slice port ID of slice link, affinity attribute of slice link.

[0013] In another possible design, the slice topology satisfies the slice policy, including: the slice nodes selected by the slice topology, the slice links between the slice nodes, or the bandwidth reserved for the slice links satisfy the slice policy; the slice topology does not satisfy the slice policy, including: the slice nodes selected by the slice topology, the slice links between the slice nodes, or the bandwidth reserved for the slice links do not satisfy the slice policy. Through this possible design, the network controller verifies the nodes selected by the slice topology, the slice links between the slice nodes, or the bandwidth reserved for the slice links, so that the network controller performs a more specific verification of the slice topology and directly finds out whether the slice topology information satisfies the slice policy.

[0014] In another possible design, the slicing strategy includes at least one of the following: there is a connected primary and backup slicing path between the slicing nodes selected by the slicing topology; the bandwidth reserved for the slicing link between the slicing nodes meets the slicing reserved bandwidth requirement; the bandwidth reserved for the slicing link meets the historical traffic value requirement corresponding to the slicing link in the historical traffic information; the combined score of the first score of the bandwidth reserved for the slicing link and the second score of the separation of the primary and backup slicing paths between the slicing nodes meets the first condition; the first score is determined based on the difference between the bandwidth reserved for the slicing link and the slicing reserved bandwidth requirement; the separation is used to characterize the number of overlapping slicing nodes or slicing links that the primary and backup slicing paths pass through. Through this possible design, the network controller can verify the slicing topology according to the above slicing strategy, so that the method provided in the present application can have multiple slicing strategies.

[0015] In another possible design, the first condition includes: the comprehensive score is higher than a threshold, and the comprehensive score is the highest comprehensive score of the primary and backup slice paths between the slice nodes. Through this possible design, when the comprehensive score is higher than the threshold, it can be obtained that the slice topology satisfies multiple slice strategies, so that the configuration of the slice topology is comprehensively judged in multiple aspects.

[0016] In another possible design, the slicing strategy also includes: the first score of the difference between the bandwidth reserved by the slice link and the slice reserved bandwidth requirement satisfies the second condition, and the second condition includes that the difference value is higher than the first threshold; the second score of the separation of the primary and backup slice paths satisfies the third condition; the third condition includes that the separation of the primary and backup paths is less than the second threshold.

[0017] Through this possible design method, the network controller separately scores the bandwidth reserved by the slice link or the primary and backup slice paths. The network controller can score different slice strategies, which is conducive to the subsequent analysis or processing of each slice strategy.

[0018] In another possible design, the method further includes: obtaining information about a new access site, the site information including: the access bandwidth of the site, the number of sites, and the location of the site; verifying the slice topology according to the slice topology information, the historical traffic information, the physical topology information, and the slice strategy to obtain verification information includes: verifying the slice topology according to the slice topology information, the historical traffic information, the physical topology information, the information about the new access site, and the slice strategy to obtain verification information. In this possible design, by obtaining information about the new access site, verifying the slice topology, and obtaining verification information, a specific implementation method is provided for enabling the network controller to verify the slice topology.

[0019] In another possible design, outputting the verification information includes: displaying the verification information in a report. Through the above possible design, the user can view the verification information through a report, which is convenient for the user to receive the verification information more intuitively.

[0020] In another possible design, the report includes the primary and backup slice paths that are recommended to be updated or the bandwidth reserved for the slice link; the report includes the primary and backup slice paths that are recommended to be updated and / or the bandwidth reserved for the slice link. Through the above possible design, the user can view the primary and backup slice paths that are recommended to be updated or the bandwidth reserved for the slice link in the report, so that the user can receive the recommended update information more intuitively, which is convenient for the user to modify the slice topology.

[0021] In a second aspect, the present application provides a slice topology verification device, comprising: an acquisition unit, used to obtain slice topology information of the slice topology, historical traffic information of the slice topology, physical topology information of the physical topology associated with the slice topology, and a slice strategy; a verification unit, used to verify the slice topology according to the slice topology information, the historical traffic information, the physical topology information and the slice strategy, and obtain verification information; an output unit, used to output the verification information; wherein, the verification information includes whether the slice topology verification passes or fails; the verification passes, indicating that the slice topology satisfies the slice strategy, and the verification fails, indicating that the slice topology does not satisfy the slice strategy.

[0022] In one possible design, if the slice topology verification fails, the verification information also includes the reason why the slice topology does not satisfy the slice strategy.

[0023] In another possible design, if the slice topology check fails, the check information also includes an update strategy, and the update strategy is used to update the slice topology information.

[0024] In another possible design, the physical topology information includes at least one of the following information: a physical node identification ID, a source physical port ID of a physical link, a destination physical port ID of the physical link, a total bandwidth of the physical link, a sliceable bandwidth of the physical link, a slice type supported by the physical link, or an affinity attribute of the physical link, wherein the sliceable bandwidth is a bandwidth that allows the physical link to be allocated to a slice link.

[0025] In another possible design, the slice topology information includes at least one of the following information: slice ID, slice node ID, mapping relationship between slice node ID and physical node ID, mapping relationship between slice link and physical link, slice link bandwidth, source slice port ID of slice link, or destination slice port ID of slice link, affinity attribute of slice link.

[0026] In another possible design, the slicing topology satisfies the slicing policy, including: the slicing nodes selected by the slicing topology, the slicing links between the slicing nodes, or the bandwidth reserved for the slicing links satisfy the slicing policy; the slicing topology does not satisfy the slicing policy, including: the slicing nodes selected by the slicing topology, the slicing links between the slicing nodes, or the bandwidth reserved for the slicing links do not satisfy the slicing policy.

[0027] In another possible design, the slicing strategy includes at least one of the following: there is a connected primary and backup slicing path between the slice nodes selected by the slicing topology; the bandwidth reserved for the slice link meets the slice reserved bandwidth requirement; the bandwidth reserved for the slice link meets the historical traffic value requirement corresponding to the slice link in the historical traffic information; the comprehensive score of the first score of the bandwidth reserved for the slice link and the second score of the separation of the primary and backup slicing paths meets the first condition; the first score is: determined according to the difference between the bandwidth reserved for the slice link and the slice reserved bandwidth requirement; the separation is used to characterize the number of overlapping slice nodes or slice links passed by the primary and backup slicing paths.

[0028] In another possible design, the first condition includes: the comprehensive score is higher than a threshold.

[0029] In another possible design, the slicing strategy also includes: the difference between the bandwidth reserved by the slice link and the slice reserved bandwidth requirement satisfies the second condition, and the second condition includes that the difference value is higher than the first threshold; the first score of the separation of the primary and backup slice paths satisfies the third condition; and the third condition includes that the separation of the primary and backup paths is less than the second threshold.

[0030] In another possible design, the acquisition unit is also used to acquire information of a new access site, the information of the site including: the access bandwidth of the site, the number of the sites, and the location of the site; the slice topology is verified according to the slice topology information, the historical traffic information, the physical topology information and the slice strategy to obtain the verification information including: the slice topology is verified according to the slice topology information, the historical traffic information, the physical topology information, the information of the new access site and the slice strategy to obtain the verification information.

[0031] In another possible design, outputting the verification information includes: presenting the verification information in the form of a report.

[0032] In another possible design, the report includes recommended updated primary and backup slice paths or bandwidth reserved for the slice link; the report includes recommended updated primary and backup slice paths and / or bandwidth reserved for the slice link.

[0033] It can be understood that the beneficial effects of the possible technical solutions executed by the various functional modules described in the second aspect and any possible design thereof can all be referred to the description of the beneficial effects of the technical solutions provided by the above-mentioned first aspect or its corresponding possible designs, and will not be repeated here.

[0034] In a third aspect, the present application provides a network controller comprising: a memory, a network interface, and one or more processors, which receive or send data through the network interface, and the one or more processors are configured to read program instructions stored in the memory to execute any method provided in the first aspect and any possible design thereof.

[0035] In a fourth aspect, the present application provides a slice topology verification system, the analysis system comprising: multiple network elements and a network controller, the multiple network elements communicate with the network controller respectively, and the network controller is used to execute any method provided in the first aspect and any possible design method thereof.

[0036] In a fifth aspect, the present application provides a computer-readable storage medium, which includes program instructions. When the program instructions are executed on a computer or a processor, the computer or the processor executes any method provided by any possible implementation in the first aspect.

[0037] In a sixth aspect, the present application provides a computer program product, which, when executed on a computer or a network controller, enables the computer or the network controller to execute any method provided in any possible implementation manner of the first aspect.

[0038] In a seventh aspect, the present application provides a chip system, comprising: a processor, the processor being used to call and run a computer program stored in a memory from the memory, and execute any one of the methods provided by the implementation in the first aspect.

[0039] It can be understood that any of the network controllers, verification systems, computer storage media, computer program products or chip systems provided above can be applied to the corresponding methods provided above. Therefore, the beneficial effects that can be achieved can refer to the beneficial effects in the corresponding methods and will not be repeated here.

[0040] In this application, the name of the network controller does not limit the device or functional module itself. In actual implementation, these devices or functional modules may appear with other names. As long as the functions of each device or functional module are similar to those of this application, they fall within the scope of the claims of this application and their equivalent technologies. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] Figure 1 A schematic diagram of a process for a network controller to verify a slice topology in a related art;

[0042] Figure 2 A schematic diagram of a flow chart of a network controller executing a method for verifying slice topology according to an embodiment of the present application;

[0043] Figure 3 A schematic diagram of another flow chart of a network controller executing a method for verifying slice topology according to an embodiment of the present application;

[0044] Figure 4 A schematic diagram of a flow chart of a method for verifying slice topology according to an embodiment of the present application;

[0045] Figure 5 Another schematic diagram of the process of verifying the slice topology of an embodiment of the present application;

[0046] Figure 6 A schematic diagram of a physical topology structure of an embodiment of the present application;

[0047] Figure 7A schematic diagram of a slicing topology structure of an embodiment of the present application;

[0048] Figure 8 A schematic diagram of another slicing topology according to an embodiment of the present application;

[0049] Fig. 9 A schematic diagram of a flow chart of a slice topology verification method according to another embodiment of the present application;

[0050] Fig.10 This is a schematic diagram of the structure of another slice topology according to an embodiment of the present application;

[0051] Fig.11 This is a schematic diagram of the distribution of historical traffic size of slice links;

[0052] Fig.12 is another structural diagram of the slice topology after being updated according to the suggestion of the network controller;

[0053] Fig.13 A schematic diagram of another physical topology structure of an embodiment of the present application;

[0054] Fig.14 A schematic diagram of the structure of another slice topology according to an embodiment of the present application;

[0055] Fig.15 A schematic diagram of another physical topology structure of an embodiment of the present application;

[0056] Fig.16 A schematic diagram of the structure of another slice topology according to an embodiment of the present application;

[0057] Fig.17 A schematic diagram of the structure of another slice topology according to an embodiment of the present application;

[0058] Fig.18 A schematic diagram of another physical topology structure of an embodiment of the present application;

[0059] Fig.19 Based on Fig.18 A schematic diagram of the structure of the slice topology generated by the physical topology shown;

[0060] Fig. 20 Based on Figure 6 A schematic diagram of the structure of another slice topology generated by the physical topology shown;

[0061] Fig.21 A schematic diagram of the structure of a slice topology verification device provided in an embodiment of the present application;

[0062] Fig. 22 A schematic diagram of a chip system provided in an embodiment of the present application. DETAILED DESCRIPTION

[0063] The terms "first" and "second" in the specification and drawings of this application are used to distinguish objects, or to distinguish the processing of the same object. The words "first" and "second" can distinguish the same or similar items with basically the same functions and effects. For example, the first device and the second device are only used to distinguish different devices, and their order is not limited. Those skilled in the art can understand that the words "first" and "second" do not limit the quantity and execution order, and the words "first" and "second" do not necessarily limit them.

[0064] "At least one" means one or more, and "plurality" means two or more.

[0065] "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, c can be single or plural.

[0066] In addition, the terms "including" and "having" and any variations thereof mentioned in the description of the present application are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device comprising a series of steps or units is not limited to the listed steps or units, but may optionally include other steps or units that are not listed, or may optionally include other steps or units that are inherent to these processes, methods, products or devices.

[0067] It should be noted that, in the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0068] First, some of the terms and related technologies involved in the embodiments of the present application are explained to facilitate understanding by those skilled in the art.

[0069] The physical topology network, referred to as the physical topology, is a topology composed of physical network elements. The links between physical nodes in the physical topology are called physical links. The various information in the physical topology can be called physical topology information. The physical network element can also be called a physical node or a physical device. The embodiments of the present application do not limit the name of the physical network element. The following embodiments mainly take the physical node as an example, which is uniformly explained here and will not be repeated below.

[0070] Slice topology network, referred to as slice topology. The network controller (also known as the slice deployment system) can slice the physical topology to obtain the slice topology. Slice topology can be understood as a logical sub-network formed by slicing from the physical topology. For example, the physical nodes and physical links in the physical topology can be sliced ​​into the slice topology. For another example, the link bandwidth in the physical topology is sliced, and a certain bandwidth is sliced ​​on a physical link. The sliced ​​bandwidth can be used as the bandwidth of the corresponding slice link in the slice topology.

[0071] The slice topology includes slice nodes. Each piece of information in the slice topology may be referred to as slice topology information.

[0072] During the deployment of the slice topology, the slice topology can be configured through the network controller to obtain various parameters of the slice topology, and the various parameters of the slice topology can be sent to the physical node through automatic configuration or manual configuration. The slice topology may be incorrectly configured due to the possible errors in the slice topology configuration of the network controller, automatic configuration sending errors, or manual configuration sending errors. Incorrectly configured slice topology may cause link abnormalities, incomplete configuration, missing links, unreasonable bandwidth planning, etc., resulting in the inability to transmit service data in the slice topology and affecting service usage.

[0073] The current network controller cannot automatically discover incorrect configurations of slice topology and provide effective repair suggestions for incorrect configurations. A slice topology may contain tens of thousands of slice nodes and tens of thousands of slice links. Without the help of automated verification tools, manual verification of slice topology is difficult and labor-intensive, and it is impossible to quickly repair incorrect configurations of slice topology.

[0074] Based on the above problems, the related technology provides the following solutions. Figure 1 As shown, Figure 1 The figure is a flow chart of the network controller verifying the slice topology in the related art. The network controller verifies the slice topology using the following steps.

[0075] S2000, the network controller collects slice node data, slice link data, slice port data and tunnel data in the slice topology network.

[0076] Among them, tunnel data is optional input.

[0077] S2001, data association is performed on the collected slice node data, slice link data and slice port data, and all tunnels interconnected between slice nodes are associated to generate a complete grouped slice topology.

[0078] S2002, according to the configured slice node data, slice link data and slice port data, the operation information of the service is input through the command line instruction before the service is opened, and the operation information of the service is simulated and verified to determine whether the service can be correctly delivered in the current slice topology network, that is, whether the service can run in the current slice topology network.

[0079] For example, the slice topology network includes slice node 1 to slice node 2, and the slice link bandwidth of slice link 1 between slice node 1 and slice node 2 is configured as 100 Mbps. During verification, a command line instruction is issued to transmit a service of 100 Mbps from slice node 1 to slice node 2 to verify whether the actual bandwidth of slice link 1 is 100 Mbps.

[0080] For another example, the slice topology network also includes slice node 3. The slice topology network is configured so that the service can pass through slice node 1, slice node 2, and slice node 3 in sequence. During verification, a command line instruction is issued to allow the service to pass through slice node 1, slice node 2, and slice node 3 in sequence, and whether the service can pass through slice node 1, slice node 2, and slice node 3 in sequence is verified.

[0081] S2003, output a verification report on the business running in the slice topology network.

[0082] The above-mentioned related technologies verify the slice topology through the network controller before the service is delivered, so as to obtain the result of whether the service can be run on the system before the service is delivered, thereby reducing the situation where the service cannot be run due to incorrect configuration.

[0083] However, the above-mentioned related technologies still have the following problems: the above-mentioned technologies can only verify whether the service can run in the slice network before the slice network starts running. When the configuration of the slice topology network is issued after verification and runs smoothly for a period of time, the slice information of the original slice topology may change. At this time, the original slice topology may no longer guarantee the smooth transmission of the service, and the slice topology needs to be corrected. The embodiment of the present application can verify the slice topology according to the slice policy (network slice policy) when the slice topology is initially established and during the operation of the slice topology, and output the verification information, so that the user can understand the running slice topology and ensure the normal transmission of the service.

[0084] The slice topology verification method of the embodiment of the present application can be applied to a network controller. Figure 2 and Figure 3 , Figure 2 A schematic diagram of a flow chart of a network controller executing a method for verifying slice topology according to an embodiment of the present application, Figure 3 Another flowchart of a network controller executing a slice topology verification method of an embodiment of the present application. As a possible implementation, the network controller may include the following modules: a physical topology reading module, a slice topology reading module, a slice strategy reading module, a traffic collection module, a slice verification module, and a verification result confirmation and delivery module.

[0085] Physical topology reading module: used to collect physical topology information such as physical node identity information (identifier, ID), physical link information, and generate physical topology based on the above physical topology information. The physical topology information may include initial physical topology information and running physical topology information.

[0086] Slice topology reading module: used to obtain slice node ID, slice link information, tunnel information and other slice topology information from the physical nodes of the physical topology, and generate slice topology based on this information. Alternatively, it is used to obtain the slice node IDs of the remaining slice nodes from the link relationship of the known slice nodes. It can be considered that slice node 1 is connected to slice node 2, and the slice node ID of the slice node connected to slice node 1 is known, then the slice node ID of slice node 2 can be obtained.

[0087] Among them, the configured slice topology information may include initial slice topology information and running slice topology information.

[0088] Slice strategy reading module: used to obtain the slice strategy, which includes the slice function to be verified and the parameters to be verified. The slice strategy can be the slice strategy set by the system default or the slice strategy input by the user. The slice strategy includes the initial slice strategy and the running slice strategy.

[0089] Traffic collection module: used to collect the inflow or outflow traffic of the slice node and the flow traffic of the slice link.

[0090] Slice validation module: used to verify the slice topology according to the slice strategy, physical topology information, slice topology information and historical traffic information, and notify the verification result confirmation and delivery module to output the verification information according to the verification result (also called verification information). The verification information includes whether the slice topology verification passes or fails. Among them, the verification passes, which means that the slice topology meets the slice strategy, and the verification fails, which means that the slice topology does not meet the slice strategy.

[0091] If the slice topology verification fails, the verification information also includes the reason why the slice topology does not meet the slice strategy.

[0092] Optionally, the slice verification module can also calculate the parameters of the corresponding slice topology information according to the physical topology information and the slice strategy, and configure the slice topology according to the calculated parameters of the slice topology information, so that the configuration of the slice topology satisfies the slice strategy. The slice verification module can also be used to obtain the corresponding configuration reason according to the calculated configuration.

[0093] Verification of the slice topology includes but is not limited to verifying whether the slice link is connected, whether the primary slice path and the backup slice path between two nodes have the same slice link, and whether the slice link bandwidth meets the bandwidth requirements of the business flowing through the slice link.

[0094] Optionally, the slice topology may be verified by verifying whether the slice nodes selected for the slice topology, the slice links between the slice nodes, or the bandwidth reserved for the slice links satisfy the slice strategy.

[0095] For example, the slice check module is also used to adjust the bandwidth of the slice link according to the actual traffic flowing through the slice link.

[0096] Verification result confirmation and delivery module: used to output the verification result. Optionally, the slice verification result confirmation and delivery module can also be used to deliver the verification result to the physical node. The verification result includes the configuration of various parameters of the physical node.

[0097] Exemplarily, the configuration of physical nodes includes: adding or deleting slice nodes or slice links, increasing or decreasing slice link bandwidth, and network configuration of slice topology. The network configuration of slice topology includes but is not limited to configuring the IP address and IGP protocol of slice topology.

[0098] The above only illustrates the modules of the network controller. In other embodiments, the above modules can also be combined into one module or split into more functional modules. For example, the physical topology reading module, the slice topology reading module, and the traffic collection module can be combined into a data collection module.

[0099] The slice topology verification method of the embodiment of the present application can be applied to Figure 3 In the network controller or other devices shown, the embodiments of the present application do not limit the devices for running the method.

[0100] The following describes the embodiment of the present application in detail by taking the slice topology verification method of the embodiment of the present application applied in a network controller as an example.

[0101] like Figure 4 , Figure 4 The flowchart of the slice topology verification method of the embodiment of the present application is as follows. The slice topology verification method of the embodiment of the present application may include the following steps:

[0102] S401, the network controller obtains slice topology information of the slice topology, historical traffic information of the slice topology, physical topology information of the physical topology associated with the slice topology, and a slice strategy.

[0103] The physical topology associated with the slice topology may refer to the physical topology for generating the slice topology.

[0104] The historical traffic information of the slice topology may represent the traffic flowing through the slice link. Optionally, the historical traffic information of the slice topology may include the slice link ID and the historical traffic value of the slice link (the traffic value may also be referred to as the traffic size).

[0105] In some embodiments, the network controller collects the outflow traffic of the node once at the same interval, sorts the traffic of the link collected multiple times in sequence according to the size of the traffic value, and obtains the distribution data of the traffic size of the link traffic collected multiple times.

[0106] In other embodiments, the network controller collects node traffic at different time intervals.

[0107] Exemplarily, the historical flow value of a slice link may be obtained by calculating the flow values ​​of the slice link collected multiple times in history, for example, calculating the average value or quantile of the flow values ​​collected multiple times on the slice link. Alternatively, the flow value of a slice link collected once may be used as the historical flow value of the slice link, such as using the flow value collected most recently on the slice link as the historical flow value. For another example, the maximum flow value collected historically on the slice link may be used as the historical flow value.

[0108] As a possible implementation method, the quantile operation can be to collect traffic values ​​once every certain period (such as 5 minutes) for a specified slice link, and calculate the threshold of traffic values ​​greater than or equal to 95% within a certain period (such as week / month).

[0109] Reference Fig.11 , Fig.11 The following is a schematic diagram of the distribution of historical traffic size of slice links. When the slice topology is running, traffic data will be generated when services are transmitted between nodes. The traffic collection module can collect traffic information flowing out or in from the slice nodes.

[0110] For example, refer to Figure 5 , Figure 5 Another flow chart of the slice topology verification method of the embodiment of the present application. The network controller includes a data acquisition module. As a possible implementation method, the data acquisition module obtains physical topology information such as physical node ID and physical link information in the physical topology; obtains slice topology information such as slice node ID and slice link information; and obtains historical traffic information of the slice topology.

[0111] The network controller may also include a slice check module, such as Figure 5 , S401 may include: S401a, the data acquisition module sends the slice topology information, the historical traffic information of the slice topology and the physical topology information to the slice verification module.

[0112] The network controller may further include a slicing strategy reading module, which obtains the slicing strategy, such as Figure 5 , S401 may include: S401b, the slicing strategy reading module sends the slicing strategy to the slicing verification module.

[0113] Exemplarily, the slicing strategy reading module can obtain the slicing strategy through an application programming interface (API) interface, or obtain the slicing strategy input by the user through a user interface (UI) interface.

[0114] In some embodiments, the data acquisition module in the network controller can also obtain site information, and the site information can also be used to verify the slice topology.

[0115] In a physical topology, a physical node in the physical topology can be connected to a physical node outside the physical topology, and a node outside the physical topology connected to a physical node in the physical topology can be called a site. Figure 6 , Figure 6 The schematic diagram of the structure of a physical topology of an embodiment of the present application is shown in FIG. Figure 6 Three sites are shown in the figure, and each site has 200Mbps of service data flowing into the physical topology through physical nodes (physical nodes 0, 3, and 7). The access bandwidth of a site refers to the bandwidth of the site flowing into the slice topology network, which can also be understood as the subscribed bandwidth of the physical link between the site and the corresponding physical node. For example, for a site directly connected to physical node 7, the subscribed bandwidth of the physical link between the site and physical node 7 can be regarded as the access bandwidth of the site. The physical nodes described below all refer to the physical nodes in the example physical topology.

[0116] Similarly, in a slice topology, a slice node in the slice topology can be connected to a slice node outside the slice topology, and the node outside the slice topology connected to the slice node in the slice topology can be called a site.

[0117] Taking into account the changes in the physical topology, the physical nodes connected to the site, or the site access bandwidth, the traffic path of the service will change, that is, the change of the site accessing the physical topology will affect the tunnel through which the service is transmitted. For example, changes in the site access bandwidth will affect the traffic engineering of the service (traffic engineer, TE is the process of selecting the transmission path of the service according to the characteristics of various service flows), resulting in the existing slice topology being unable to meet the needs of the service. In an embodiment of the present application, the network controller can calculate the size of the service data based on the information of the site, and match the size of the service data with the slice strategy to verify the slice topology. Among them, if the reserved bandwidth of the slice link is less than the size of the service data, it means that the reserved bandwidth is insufficient to transmit the service data and the verification fails. Conversely, if the reserved bandwidth of the slice link is greater than the size of the service data, it means that the reserved bandwidth is sufficient to transmit the service data and the verification passes.

[0118] In some embodiments, the physical topology information includes at least one of the following data: a physical node ID, and physical link information. The physical link information includes a source physical port ID of the physical link, a sink physical port ID of the physical link, a total bandwidth of the physical link, a sliceable bandwidth of the physical link, a slice type supported by the physical link, and an affinity attribute of the physical link, wherein the sliceable bandwidth is a bandwidth that allows the physical link to be allocated to a slice link.

[0119] The following is an example and introduction to physical topology information:

[0120] For example, Figure 6The physical topology in includes physical node 0 to physical node 7 (physical node 0, physical node 1, physical node 2, etc. represent physical node IDs), wherein physical node 0, physical node 1, physical node 2, physical node 3, physical node 7, physical node 6, physical node 5, physical node 4 and physical node 0 are connected in sequence, physical node 1 is connected to physical node 5, physical node 2 is connected to physical node 6, and the physical link bandwidth between every two physical nodes is 1 Gbps.

[0121] Exemplarily, the link between physical node 0 and physical node 1 can be referred to as physical link 1. The physical port ID of physical node 1 includes physical port 1-1 and physical port 1-2. The physical port ID of physical node 0 includes physical port 0-1 and physical port 0-2. The physical port 0-1 of physical node 0 is connected to the physical port 1-1 of physical node 1 to form physical link 1.

[0122] When traffic flows from physical port 0-1 to physical port 1-1, physical port 0-1 may be the source port ID of physical link 1, and physical port 1-1 may be the sink port ID of physical link 1. Conversely, when traffic flows from physical port 1-1 to physical port 0-1, physical port 1-1 may be the source port ID of physical link 1, and physical port 0-1 may be the sink port ID of physical link 1.

[0123] The slice types supported by the physical link include but are not limited to at least one of the following types: FlexAlgo, FlexE sub-interface, channelized sub-interface. Optionally, the basis for dividing the slice types may include: the starting bandwidth that the physical link can be sliced, the bandwidth granularity that the physical link can be sliced, the soft isolation and hard isolation of the physical link, etc. The starting bandwidth of the physical link can also be understood as the minimum bandwidth that the physical link can be sliced, and the bandwidth granularity that the physical link can be sliced ​​can also be understood as the step size of the bandwidth of the physical link slice increased on the basis of the minimum bandwidth. As a possible implementation method, the network controller can slice the physical link according to the slice type supported by the physical link to obtain a sliced ​​link.

[0124] For example, the starting bandwidth that the physical link can be divided into can be 50Mbps, 100Mbps, 200Mbps, 5Gbps, etc., and the bandwidth granularity that the physical link can be divided into can be 100Mbps, 200Mbps, etc. Figure 6In the physical topology diagram shown, the starting bandwidth of the link between physical node 0 and physical node 4 is 100Mbps, and the bandwidth granularity of the physical link is 50Mbps. The network controller can configure the minimum bandwidth of the slice link of the physical link between physical node 0 and physical node 4 to be 100Mbps, and can configure a larger bandwidth for the slice link based on 100Mbps with a step of 50Mbps, such as 150Mbps, 200Mbps, etc. The slice link bandwidth of the link between physical node 0 and physical node 4 cannot be configured to be 50Mbps, 130Mbps, 170Mbps, etc.

[0125] The total bandwidth of a physical link is the maximum bandwidth that can be used by the physical link. When the network controller slices a physical link, it can allocate bandwidth to the slice links in the generated slice topology. The bandwidth that is allowed to be allocated to the slice link by the physical link can be called the sliceable bandwidth (or the remaining bandwidth). The sliceable bandwidth can also be understood as the bandwidth of the physical link that is not allocated to the slice link. Figure 6 and Figure 7 , Figure 7 FIG. 1 is a schematic diagram of a slicing topology structure of an embodiment of the present application. Figure 6 The physical topology shown in Figure 7 As shown in the slice topology. Figure 6 The physical link 1 between physical node 0 and physical node 1 is sliced ​​to form Figure 7 Slice link 1 between slice node 0 and slice node 1. Assuming that the total bandwidth of physical link 1 is 1 Gbps, and the bandwidth of the physical link allocated to slice link 1 is 200 Mbps, the sliceable bandwidth of physical link 1 is 800 Mbps (1 Gbps-200 Mbps=800 Mbps), and the 800 Mbps sliceable bandwidth of physical link 1 can be allocated to other slice links.

[0126] The affinity attribute of a link is a link attribute used to distinguish whether a service can be transmitted on a physical link. The network controller can determine whether service data can be transmitted on the corresponding physical link based on the affinity attribute of the physical link, thereby determining the transmission path of the service data in the physical topology network. Exemplarily, the network controller can mark the affinity attributes of the physical link with different colors in the physical topology map. If physical link 1 is marked red and yellow, and service 0 is configured not to be transmitted through the physical link marked yellow, it can be determined that service 0 cannot be transmitted through physical link 1.

[0127] In some embodiments, the slice topology information includes at least one of the following information: slice ID, slice node ID, mapping relationship between slice node ID and physical node ID (i.e., corresponding relationship between slice node and physical node to which it belongs), mapping relationship between slice link and physical link (i.e., corresponding relationship between slice link and physical link to which it belongs), slice link information. The slice link information includes the source slice port ID of the slice link, the sink slice port ID of the slice link, the slice link bandwidth, the affinity attribute of the slice link, and the shared risk link group (SRLG) of the slice link.

[0128] Slice topology information is not limited to the information listed above. For example, an affinity attribute can be added to the slice node to indicate the power supply combination / computer room / building where the slice node is located, so as to avoid multiple slice nodes being unusable in the selected slice topology due to power supply problems, air conditioning problems, or accidents such as building damage and burning.

[0129] The following is an example and introduction to slice topology information:

[0130] The transmission path of service data in the slice topology can also be called a tunnel, or simply a path. For example, a physical path can also be called a physical tunnel, and a slice path can also be called a slice tunnel. A path can contain at least one link. For example, refer to Figure 7 , business data goes from slice node 1 to slice node 3 through slice link 1 (the slice link between slice nodes 1 and 2) and slice link 2 (the slice link between slice node 2 and slice node 3).

[0131] Exemplarily, the physical topology can be divided into one or more slice topologies, each slice topology has a corresponding slice ID, and the slice ID is used to distinguish different slice topologies.

[0132] The slice ID can be obtained according to one or more of the following information: Slice ID, affinity attribute of the slice link. For example, physical topology 1 is divided into 4 slice topologies, namely slice topology 1 to slice topology 4. Assuming that the affinity attribute of slice topology 1 is yellow, the affinity attribute of slice topology 2 is red and blue, the affinity attribute of slice topology 3 is green, and the affinity attribute of slice topology 4 is purple, different slice IDs can be distinguished by the different colors corresponding to the affinity attributes of slice topologies 1-4.

[0133] Each slice node in the slice topology is correspondingly provided with a slice node ID. Exemplarily, after slicing the physical topology, physical node 1 in the physical topology is mapped to slice node 1.2 and slice node 1.1 in the slice topology, and slice node 1.2 and slice node 1.1 may also be referred to as slice nodes corresponding to physical node 1. As another example, physical node 2 is mapped to slice node 2, physical node 1 is connected to physical node 2, slice node 1.2 and slice node 1.1 are respectively connected to slice node 2, and the physical link connecting physical node 1 and physical node 2 is mapped to a slice link connecting slice node 1.2 and slice node 1.1 to slice node 2 respectively, and the slice link corresponding to the physical link connecting physical node 1 and physical node 2 may also be referred to as a slice link connecting slice node 1.2 and slice node 1.1 to slice node 2 respectively.

[0134] Exemplarily, the slice node 1.2 may be in a slice topology whose slice ID is slice topology 1 (referred to as slice 1), and the slice node 1.1 may be in a slice topology whose slice ID is slice topology 2 (referred to as slice 2). In slice 1, the slice node corresponding to physical node 1 is slice node 1.2, and in slice topology 2, the slice node corresponding to physical node 1 is slice node 1.1.

[0135] For example, refer to Figure 7 The slice topology includes: slice node 0 to slice node 7, slice node 0, slice node 1, slice node 2, slice node 3, slice node 7, slice node 6, slice node 5, slice node 4, and slice node 0 are connected in sequence, the link bandwidth between slice node 0, slice node 1, slice node 2, slice node 3, slice node 7, slice node 6, slice node 5, and slice node 4 is 200Mbps, and the link bandwidth from slice node 0 to slice node 4 is 100Mbps.

[0136] The SRLG attribute of a slice link is used to characterize whether the slice link shares the same optical cable with other slice links. When selecting a slice path, slice links that do not share optical cables with other slice links are preferred to minimize the mutual impact caused by sharing optical cables between slice links.

[0137] In some embodiments, the network controller obtains the full slice topology information required for verification, and the full slice topology information includes topology information (such as slice nodes and topology IDs, slice links and slice link IDs) and link attributes (such as slice link bandwidth, slice link affinity attributes, etc.).

[0138] For example, the network controller can use the slice ID to check all the information of the slice to obtain the full slice topology information. For another example, the network controller can use the full slice link ID (a collection of slice link IDs) to check the corresponding source and sink ports, slice nodes, link attributes, and the mapping relationship between slice links and physical links to construct the entire slice topology.

[0139] In some embodiments, the slicing strategy includes one or more of the following strategies: there is a connected primary and backup slicing path between the slice nodes selected by the slicing topology; the bandwidth reserved for the slicing link meets the slice reserved bandwidth requirement; the bandwidth reserved for the slicing link meets the historical traffic value requirement corresponding to the slicing link in the historical traffic information; the combined score of the first score of the bandwidth reserved for the slicing link and the second score of the separation of the primary and backup slicing paths meets the first condition.

[0140] Among them, the first score is determined according to the difference between the bandwidth reserved for the slice link and the reserved bandwidth requirement of the slice; the separation degree is used to characterize the number of overlaps of slice nodes or slice links passed by the primary and backup slice paths. The higher the separation degree of the primary and backup slice paths, the less overlaps of slice nodes or slice links passed by the primary and backup slice paths, and the lower the impact of switching the business data to the backup slice path on business transmission after the primary slice path where the business data is currently located fails.

[0141] Optionally, the smaller the difference between the bandwidth reserved for the slice link and the slice reserved bandwidth requirement, the more accurately the bandwidth reserved for the slice link can meet the slice reserved bandwidth requirement, and the higher the score of the bandwidth reserved for the slice link. Conversely, the larger the difference between the bandwidth reserved for the slice link and the slice reserved bandwidth requirement, the lower the score of the bandwidth reserved for the slice link. For example, if the actual bandwidth to be reserved is 350Mbps and the slice bandwidth granularity is 100Mbps, then reserving 400Mbps and 500Mbps can both meet the bandwidth reservation requirements, but reserving 500Mbps may result in unnecessary bandwidth waste of 100Mbps.

[0142] Optionally, the higher the separation of the primary and backup slicing paths, the lower the possibility of the primary and backup slicing paths failing at the same time, and the higher the score of the primary and backup slicing paths. Conversely, the lower the separation of the primary and backup slicing paths, the higher the degree of overlap between the primary and backup slicing paths, and the lower the score of the primary and backup slicing paths.

[0143] The following describes various possible slicing strategies according to different situations:

[0144] Case 1: The slicing strategy is: there are connected primary and backup slicing paths between the slicing nodes selected in the slicing topology. There are connected primary and backup slicing paths between the slicing nodes selected in the slicing path, which can mean that there are no overlapping slicing links between the primary slicing path and the backup slicing path connected between the slicing nodes, which can be understood as the primary slicing path and the backup slicing path are independent of each other, or it can be understood as the primary slicing path and the backup slicing path are completely separated paths.

[0145] for example, Figure 7 In the example, the slice nodes passed by one slice path between slice node 0 and slice node 7 include: slice nodes 0-4-5-6-7, and the slice nodes passed by another slice path include: slice nodes 0-1-2-3-7. If there are no overlapping slice nodes or slice links in these two slice paths, one of the two slice paths can be used as the main slice path, and the other can be used as the backup slice path. In this way, since there are no overlapping slice nodes or slice links between the main slice path and the backup slice path between slice node 0 and slice node 7, when the slicing strategy is met, the two paths will not affect each other. For example, when the main slice path fails, the business data can be switched to the backup slice path so that the business data can continue to be transmitted through the backup slice path, reducing the probability of interruption of business data transmission.

[0146] For example, Fig. 20 In the figure, one of the slice paths between slice node 0 and slice node 7 passes through slice nodes including slice nodes 0-4-5-1-2-6-7, and the other slice path passes through slice nodes including slice nodes 0-1-2-3-7. There are overlapping slice paths (slice paths between slice nodes 1 and 2) and overlapping slice nodes (slice nodes 1 and 2) between the two slice paths. Fig. 20 There is no completely separated slice path between slice node 0 and slice node 7.

[0147] Among them, the selected slice node can be any node in the slice topology, and the embodiment of the present application does not limit this.

[0148] As a possible implementation method, it is also possible to determine whether some slice nodes or slice links are missing to determine whether the primary and backup slice paths between the slice nodes are connected. If some slice nodes or slice links are missing, the slice topology may be disconnected.

[0149] Case 2, the slicing strategy is: the bandwidth reserved for the slice link meets the slice reserved bandwidth requirement. Optionally, the slice reserved bandwidth requirement is determined according to the transmission requirement of the business data. Exemplarily, the slicing strategy is: the bandwidth reserved for the slice link is greater than the business data rate. For example, if the business data rate transmitted in the current slice topology is 200Mbps (the required bandwidth of the business), then the slicing strategy is: the bandwidth reserved for the slice link is greater than the maximum business flow / more than 30% greater than the 95% percentile flow value. In this way, when the slicing strategy is met, the transmission requirements of the business data can be met, the normal transmission of the business data can be guaranteed as much as possible, and the probability of business data interruption can be reduced. Of course, there are other ways to determine the slice reserved bandwidth requirement, and the embodiments of the present application do not limit this.

[0150] In some examples, the service data transmitted on the slice link can be data of the same service or different services. When the slice link transmits data of multiple services at the same time, the required bandwidth of the service data is the total required bandwidth of the multiple services. For example, the slice link transmits data of service 1 and service 2, the required bandwidth of service 1 is 1.3Gbps, and the required bandwidth of service 2 is 2.7Gbps. Then the slice strategy can be: the bandwidth reserved for the slice link is greater than 4Gbps.

[0151] Case 3, the slicing strategy is: the bandwidth reserved for the slice link meets the historical traffic value requirements corresponding to the slice link in the historical traffic information. For example, the slicing strategy is: the bandwidth reserved for the slice link is less than the historical traffic value of the slice link. For another example, the bandwidth reserved for the slice link is greater than the preset proportion of the historical traffic value (such as 99%). For another example, the bandwidth reserved for the slice link is greater than the sum of the historical traffic value and the redundant bandwidth. According to the historical traffic value of slice link 1 is 100Mbps, the reserved redundant bandwidth is 50% of the historical traffic value, then the slicing strategy is: the bandwidth reserved for slice link 1 is less than or equal to the sum of the historical traffic value and the redundant bandwidth.

[0152] For another example, based on the historical traffic value of slice link 1 being 100 Mbps, it can be predicted that the future service traffic transmitted on slice link 1 will be approximately 100 Mbps, and the slice strategy is: the bandwidth reserved for slice link 1 is less than or equal to 100 Mbps. In this way, when the slice strategy is met, the normal transmission of service data on the slice link can be met, and the bandwidth overhead can be reduced to avoid wasting idle bandwidth.

[0153] For another example, based on the historical maximum traffic of the slice link being 200 Mbps, it can be predicted that the service traffic transmitted by the slice link in the future will not exceed 200 Mbps. Then the slicing strategy is: the bandwidth reserved for the slice link is less than or equal to 200 Mbps.

[0154] In some embodiments, at least two strategies in situations 1-3 can also be used as slicing strategies, such as a slicing strategy that: there is a connected primary-backup slicing path between the selected slicing nodes, and the bandwidth reserved for the slicing link between the slicing nodes is greater than the business data size.

[0155] Case 4, the slicing strategy is: the comprehensive score of the first score of the bandwidth reserved for the slice link and the second score of the separation between the primary and backup slice paths meets the first condition.

[0156] In this case, the network controller can score the bandwidth reserved for the slice link between the slice nodes to obtain a first score, and score the separation of the primary and backup slice paths between the slice nodes to obtain a second score. Afterwards, the network controller can calculate a comprehensive score of the first score and the second score based on the first score and the second score.

[0157] For example, the required bandwidth of service 1 is 1.3 Gbps, the required bandwidth of service 2 is 1.8 Gbps, the required bandwidth of service 3 is 2.7 Gbps, and the required bandwidth of service 4 is 1.2 Gbps. Figure 8 In the slice topology of (a), the reserved bandwidths of slice link 1 (slice link between slice node 1 and slice node 2) and slice link 2 (slice between slice node 1 and slice node 3) are both 4 Gbps, and the reserved bandwidths of slice link 3 (slice link between slice node 2 and slice node 4) and slice link 4 (slice link between slice node 3 and slice node 4) are both 3 Gbps. When transmitting data of service 1 and service 3, the 4 Gbps bandwidth reserved by slice link 1 is consistent with the total required bandwidth of service 1 and service 3. Therefore, the reserved bandwidth of slice link 1 is scored higher (e.g., 10 points). Similarly, the reserved bandwidth scores of slice links 2-4 are all high (e.g., 10 points).

[0158] For example, Figure 8 In the slice topology shown in (b), the reserved bandwidth of slice links 1-4 is 4 Gbps. When transmitting data of service 1 and service 2, the difference between the 4 Gbps bandwidth reserved by slice link 1 and the total required bandwidth (3.1 Gbps) of service 1 and service 2 is large. Therefore, the reserved bandwidth score of slice link 1 is low (e.g., 7 points). Similarly, the reserved bandwidth scores of slice links 2-4 are all low.

[0159] The network controller can also calculate the separation degree of the primary and backup slice paths. Figure 8Taking the primary and backup slice paths between slice nodes 1 and 2 in (b) as an example, the primary slice path between slice nodes 1 and 2 is: the direct slice link 1 between slice nodes 1 and 2, and the backup slice path between slice nodes 1 and 2 is: the slice path composed of slice link 2, slice link 4 and slice link 3. There are no overlapping slice links between the primary and backup slice paths, which means that the probability of mutual influence between the primary and backup slice paths is small. Therefore, the primary and backup slice paths between slice nodes 1 and 2 are scored higher (such as 10 points).

[0160] Still Figure 8 (b), after calculating the score A of the reserved bandwidth of slice link 1 between slice node 1 and slice node 2, and the score B of the primary and backup slice paths between slice node 1 and slice node 2, the network controller can calculate the comprehensive score based on score A and score B.

[0161] As a possible implementation, the network device may set weights for score A and score B, and calculate the weighted results of score A and score B, and use the weighted results as the comprehensive score. Alternatively, the comprehensive score may be calculated in other ways (such as summing), which is not limited in the embodiments of the present application.

[0162] As a possible implementation method, if the comprehensive score meets the first condition, it means that the overall performance of the slice link between the slice nodes is good, such as the reserved bandwidth of the slice link between the slice nodes can meet the bandwidth requirements of the business to a large extent, and the primary and backup slice paths between the slice nodes can meet the switching requirements of the business to a large extent.

[0163] Optionally, the first condition includes: the comprehensive score is higher than a threshold. For example, the slicing strategy is: the comprehensive score is higher than the threshold. When the slicing strategy is met, the comprehensive score is high, which means that the comprehensive performance of the slice link between the slice nodes is good and can meet the service transmission requirements of the slice topology as much as possible.

[0164] Optionally, the comprehensive score is the highest comprehensive score of the primary and backup slice paths between the slice nodes. In other words, the primary and backup slice path scheme with the highest comprehensive score between the slice nodes is selected. For example, the primary and backup slice paths between slice node 1 and slice node 3 have the following schemes: Scheme 1: primary slice path 1, backup slice path 2; Scheme 2: primary slice path 2, backup slice path 3; primary slice path 2, backup slice path 4.

[0165] Among them, score 1 is calculated according to the score of the separation degree between the main slice path 1 and the backup slice path 2, the score of the reserved bandwidth of the slice link passed by the main slice path 1, and the score of the reserved bandwidth of the slice link passed by the backup slice path 2; score 2 is calculated according to the score of the separation degree between the main slice path 2 and the backup slice path 3, the score of the reserved bandwidth of the slice link passed by the main slice path 2, and the score of the reserved bandwidth of the slice link passed by the backup slice path 3; score 3 is calculated according to the score of the separation degree between the main slice path 2 and the backup slice path 4, the score of the reserved bandwidth of the slice link passed by the main slice path 2, and the score of the reserved bandwidth of the slice link passed by the backup slice path 4. If score 3 is the highest, it means that the first condition of comprehensive scoring is met.

[0166] If in the current slice topology, the primary and backup slice paths between slice node 1 and slice node 3 are primary slice path 1 and backup slice path 2, and primary slice path 1 and backup slice path 2 do not meet the highest comprehensive score, the network controller can output verification information that the verification failed. Optionally, the network controller can also include in the verification information: it is recommended to update the primary and backup slice paths between slice node 1 and slice node 3 to primary slice path 2 and backup slice path 4. Among them, the highest comprehensive score corresponding to primary slice path 2 and backup slice path 4 is selected, and the higher the comprehensive performance.

[0167] Optionally, there may be one or more backup slice paths between slice nodes.

[0168] As a possible implementation method, when there are multiple backup slice paths, the network controller can calculate the degree of separation between the main slice path and each backup slice path, and calculate the comprehensive score based on each degree of separation and the reserved bandwidth of the corresponding slice link. For example, there are backup slice path 1, backup slice path 2 and main slice path between slice node 1 and slice node 2. The network controller calculates the degree of separation 1 between the main slice path and the backup slice path 1, and the degree of separation 2 between the main slice path and the backup slice path 2. The network controller calculates the comprehensive score based on the score of separation 2, the score of the reserved bandwidth of the backup slice path 2, the score of separation 1, the score of the reserved bandwidth of the slice link through which the backup slice path 1 passes, and the score of the reserved bandwidth of the slice link through which the main slice path passes. Of course, the calculation method of the comprehensive score can also be other, and the embodiment of the present application does not limit this, as long as the main and backup slice paths with better or best comprehensive performance can be calculated to better meet the slice strategy.

[0169] Optionally, the slice nodes may be directly connected or indirectly connected. Figure 8(a), slice node 2 is not directly connected to slice node 3. Assume that the primary slice path between the two slice nodes is a path composed of slice link 1 and slice link 2, and the backup slice path is a path composed of slice link 3 and slice link 4. The network controller can calculate the score of the reserved bandwidth of slice links 1-4 and the score of the separation of the primary and backup slice paths, and calculate the comprehensive score of the slice link between slice node 2 and slice node 3 based on the score of the reserved bandwidth of slice links 1-4 and the score of the separation of the primary and backup slice paths.

[0170] Of course, the method of calculating the comprehensive score is not limited to the above-mentioned examples. Due to space limitations, the embodiments of the present application do not list all possible situations.

[0171] It should be noted that the above is only an enumeration of slicing strategies, and slicing strategies are not limited to the above-listed situations. For example, the slicing strategy can also be: the difference between the reserved bandwidth of the slicing link between the slicing nodes and the slicing reserved bandwidth requirement meets the second condition (the second condition is, for example, but not limited to: the difference is less than a certain threshold). For another example, the slicing strategy can also be: the separation degree of the primary and backup slicing paths meets the third condition (the third condition is, for example, but not limited to: the separation degree is less than a certain threshold).

[0172] S402, the network controller verifies the slice topology according to the slice topology information, the historical traffic information of the slice topology, the physical topology information and the slice strategy to obtain verification information.

[0173] Reference Figure 5 In an embodiment of the present application, when the network controller obtains the information of the site, as a possible implementation method, S402 can be implemented as: S402a, the slice verification module verifies the slice topology according to the slice topology information, the historical traffic information of the slice topology, the physical topology information, the site information and the slice strategy to obtain the verification information.

[0174] Among them, the verification information includes verification passed or verification failed. Verification passed indicates that the slice topology information meets the slice strategy, and verification failed indicates that the slice topology information does not meet the slice strategy.

[0175] Take the example of a slice strategy where there is a connected primary and backup slice path between slice nodes selected for slice topology. Figure 7According to the slice topology information, the main slice path between slice node 0 and slice node 3 passes through slice node 0, slice node 1, slice node 2 and slice node 3 in sequence, and the backup slice path passes through slice node 0, slice node 4, slice node 5, slice node 6, slice node 7 and slice node 3 in sequence. There is no overlapping link between the main slice path and the backup slice path. After matching the above slice topology information with the slice strategy, it is determined that the main and backup slice paths meet the slice strategy and the verification passes. On the contrary, if there are overlapping links or overlapping nodes between the main and backup slice paths, it is determined that the main and backup slice paths do not meet the slice strategy and the verification fails.

[0176] Take the slice strategy as follows: the bandwidth reserved for the slice link meets the slice reserved bandwidth requirement. When the size of the transmitted service data is 200Mbps, Figure 7 In the slice topology shown, the slice link bandwidth between slice node 0 and slice node 4 needs to reserve 200Mbps, but the reserved bandwidth of the slice link is only 100Mbps, indicating that the bandwidth reservation of the slice link is insufficient to support the business data transmission this time, for example, it is likely to cause data packet loss. In this case, the reserved bandwidth of the slice link does not meet the slice strategy and the verification fails. On the contrary, if the reserved bandwidth of the slice link is 200Mbps (or a larger bandwidth), it is determined that the reserved bandwidth of the slice link meets the slice strategy and the verification passes.

[0177] Take the slicing strategy as follows: the bandwidth reserved for the slice link meets the historical traffic value requirements of the slice link in the historical traffic information. Figure 7 The historical traffic value of the slice link between slice node 0 and slice node 4 in the slice topology shown is 200Mbps, but the reserved bandwidth of the slice link is 300Mbps, which means that the bandwidth reservation of the slice link exceeds the value of the traffic that the slice link may transmit, resulting in bandwidth waste. In this case, the reserved bandwidth of the slice link does not meet the slice strategy and the verification fails. On the contrary, if the reserved bandwidth of the slice link is 200Mbps (or a smaller value), the reserved bandwidth of the slice link meets the slice strategy and the verification passes.

[0178] S403, the network controller outputs verification information.

[0179] For example, refer to Figure 5 , S403 can be implemented as follows: S403a, the slice verification module sends verification information to the verification result confirmation and delivery module. S403b, the verification result confirmation and delivery module outputs the verification information.

[0180] Optionally, the report includes the primary and backup slice paths recommended for update or the bandwidth reserved for the slice link. Or, optionally, the report includes the primary and backup slice paths recommended for update and / or the bandwidth reserved for the slice link.

[0181] In an exemplary embodiment, refer to the above slicing strategy. The network controller verifies the slicing strategy in Figure 7 Whether the slice topology shown can be verified, if the slice strategy verification is passed, the network controller outputs the verification information of the slice strategy verification passing. Conversely, if the slice strategy verification fails, the network controller outputs the verification information of the slice strategy verification failing.

[0182] In some embodiments, when the verification of the slice topology fails, the verification information also includes the reason why the verification failed (or the reason why the verification failed). Exemplarily, the network controller also outputs information about the reason why the slice topology does not meet the slice strategy. For example, the verification information is output: the verification of the slice link between slice node 0 and slice node 4 fails, and the reason is: the bandwidth of the slice link is not reserved enough. For another example, the verification information is output, and the verification of the primary and backup slice paths between slice node 0 and slice node 7 fails, and the reason is: the separation degree between the primary and backup slice paths is too low. For another example, the verification information is output, and the verification of the primary and backup slice paths between slice node 0 and slice node 7 fails, and the reason is: the comprehensive score of the primary and backup slice paths (used to characterize the comprehensive performance of the slice path) is too low.

[0183] As a possible implementation, the network controller displays the verification information in a report. Optionally, the report includes but is not limited to a test report.

[0184] Reference Fig. 9 , Fig. 9 A flowchart of a method for verifying slice topology according to another embodiment of the present application is shown in FIG.

[0185] S404: The network controller determines an update strategy.

[0186] As a possible implementation, when the verification fails, the verification information also includes an update strategy (or repair suggestion). Exemplarily, the update strategy is slice topology information that satisfies the slice strategy, and the update strategy is used to update the slice topology information.

[0187] As a possible implementation method, S404 can be implemented as: S404a, the slice verification module obtains slice topology information that meets the slice strategy based on the slice topology information, historical traffic information of the slice topology, physical topology information, site information and slice strategy.

[0188] Taking the slicing strategy as: the bandwidth reserved for the slice link meets the slice reserved bandwidth requirement as an example, as a possible implementation method, illustratively, the slice verification module determines whether the slice link bandwidth of the slice link is greater than or equal to the historical traffic value of the slice link. If the slice link bandwidth of the slice link is greater than or equal to the historical traffic value of the slice link, then according to the historical traffic value of the slice link, the recommended slice link bandwidth of the slice link is obtained, and the slice link bandwidth of the slice link is adjusted to the recommended slice link bandwidth of the slice link. In some embodiments, the recommended slice link bandwidth of the slice link is the bandwidth corresponding to the historical traffic size.

[0189] For example, Figure 7 , the slice link between slice node 0 and slice node 4 needs to transmit 200Mbps service data, but the bandwidth reservation of the slice link (100Mbps) does not meet the bandwidth requirement of the service, then the network controller determines that the verification of the slice link fails. The verification information output by the network controller may include: the reserved bandwidth of the slice link between slice node 0 and slice node 4 is too small, and it is recommended to set the bandwidth of the slice link to 200Mbps (or a higher value).

[0190] For example, refer to Fig.13 , Fig.13 A schematic diagram of another physical topology structure of an embodiment of the present application. Fig.13 The physical topology shown in Figure 6 The physical topology shown here adds physical node 8 and physical node 9. Physical node 8 is connected to physical node 1 and physical node 9, and physical node 9 is connected to physical node 2 and physical node 8. Physical node 9 has an access traffic of 200 Mbps.

[0191] If the network controller obtains a physical topology that is different from the physical topology shown in the above physical topology 1, the network controller verifies the slice topology according to the slice strategy and the parameter values ​​of the changed physical topology information. Fig.10 The slice topology shown generates new verification tasks 6-7. Verification task 6: transmitted from slice node 0 to slice node 3, verification task 7: transmitted from slice node 3 to slice node 9. After verification, Fig.10 The slice topology shown does not satisfy verification task 7. The network controller Fig.13 The physical topology shown, Fig.10 The slice topology and slice strategy shown in the figure calculate the update strategy of the slice topology and obtain Fig.14 The network controller can display the detected error configuration and update strategy to the user through the UI interface or API. For example, the original slice topology does not include the newly connected site (the site connected to slice node 7), and it is recommended to update it to Fig.14 The slice topology shown.

[0192] For example, Figure 7 , the historical traffic average of the slice link between slice node 0 and slice node 4 is 50Mbps, but the bandwidth reservation (100Mbps) of the slice link exceeds the historical traffic average, which means that bandwidth is likely to be wasted. Therefore, the network controller determines that the verification of the slice link fails. The verification information output by the network controller may include: the verification of the slice link between slice node 0 and slice node 4 fails because the reserved bandwidth is too large. It is recommended to set the bandwidth of the slice link to 50Mbps.

[0193] In another exemplary embodiment, the network controller obtains traffic data of the link between sites. Fig.11 As shown, the network controller collects the traffic of each link in the inter-site tunnel for multiple times, and obtains that 99% of the historical traffic values ​​flowing through each link in the tunnel is assumed to be 180 Mbps.

[0194] Reference Fig.12 , Fig.12 FIG. 1 is another structural diagram of the slice topology after being updated according to the suggestion of the network controller. The network controller can suggest that Fig.10 The link bandwidth shown is adjusted from 200 Mbps to 180 Mbps, thereby saving link bandwidth and reducing the waste of bandwidth resources.

[0195] Taking the example of a primary and backup slice path that is connected between slice nodes selected by the slice strategy for slice topology, illustratively, if the separation between the primary slice path and the backup slice path (slice path 1) between the two selected slice nodes is low (such as lower than a threshold), the network controller determines that the verification of the primary and backup slice paths fails. The verification information output by the network controller may include: the verification of the primary and backup slice paths between the slice nodes fails because the separation is too small, and it is recommended to update the backup slice path between the slice nodes to slice link 2. Among them, the separation between the new backup slice path (slice path 2) and the primary slice path satisfies the slicing strategy (such as higher than a threshold).

[0196] For example, refer to Figure 6 and Fig. 20 , Fig. 20 Based on Figure 6 A schematic diagram of another slicing topology generated from the physical topology shown in FIG. The network controller obtains a slicing strategy that there are primary and backup paths between nodes connected to the site, and the primary and backup paths are separated.

[0197] The network controller manages the slices based on the physical topology, slice topology, and slice strategy. Fig. 20The slice topology network shown in the figure is detected, and it is found that the main slice path and the backup slice path of the slice link between slice node 0-slice node 3 and the link between slice node 0-slice node 7 cannot be completely separated. In addition, the network controller detects that for the link between slice node 0-slice node 3, the main slice path can be implemented through slice nodes 0-1-2-3 in sequence, and the backup slice path can be implemented through path nodes 0-slice node 4 slice node-5-slice node 6-slice node 7-slice node 3 in sequence. For the link between slice node 0-slice node 7, the main slice path can be implemented through slice node 0-slice node 1-slice node 2-slice node 3-slice node 7 in sequence, and the backup slice path can be implemented through slice node 0-slice node 4-slice node 5-slice node 6-slice node 7 in sequence. The network controller obtains Fig. 20 The slice link between slice node 5 and slice node 6 is missing in the slice topology shown.

[0198] The network controller can output the verification results to the user: there are overlapping links in the slice path between slice node 0-slice node 3 and the slice path between slice node 0-slice node 7 in the slice topology, and the primary and backup paths cannot be completely separated. The update strategy is: connect the link between slice node 5-slice node 6.

[0199] Taking the slicing strategy as an example, the comprehensive score of the slice link between the slice nodes is higher than the threshold. For example, if the comprehensive score of the main slice path and the backup slice path (slice link 1) between the two selected slice nodes is low. For example, according to the score of the reserved bandwidth of the main slice path, the score of the reserved bandwidth of the backup slice path 1, and the score of the separation degree of the main and backup slice paths, the calculated comprehensive score is low (such as lower than the threshold). In this case, it means that the comprehensive performance of the selected main slice path and the backup slice path 1 is poor, and the network controller determines that the verification of the main and backup slice paths fails. The verification information output by the network controller may include: the verification of the main and backup slice paths between the slice nodes fails because the comprehensive score is too small, and it is recommended to update the backup slice path between the slice nodes to slice link 2. Among them, the comprehensive score of the new backup slice path (slice link 2) and the main slice path meets the slicing strategy. In other words, the comprehensive performance of the main slice path and the backup slice path 2 is better.

[0200] Another example, Fig.15 is a schematic diagram of another physical topology structure of an embodiment of the present application, Fig.16 FIG. 1 is a schematic diagram of another slicing topology structure of an embodiment of the present application. Fig.15 As shown in the physical topology, the network controller forms the following Fig.16The slice topology shown. The slice strategy obtained by the network controller is to connect each node connecting the user access site in pairs. The network controller generates verification task 1-verification task 3 (the same as verification task 1-verification task 3 in the above example) according to the physical topology, slice topology and slice strategy. After verification, verification task 1 and verification task 2 cannot be transmitted normally, that is, node 0 is not connected to other nodes. The network controller can obtain the slice topology where node 0 is located (the slice topology composed of nodes 0-0-5-4) and the slice topology where nodes 3 and 7 are located (the network composed of nodes 2-3-7-6) based on the physical topology. The physical link connecting physical node 5-physical node 6 or the physical link connecting node 1-2 can be connected. The network controller compares the bandwidth of the physical link between physical node 5 and physical node 6 and the physical link between node 1 and node 2 with the site access bandwidth, and finds that the available bandwidth between physical node 5 and physical node 6 is 0, which does not meet the bandwidth requirement. The available bandwidth of the link between physical node 1 and physical node 2 is 1Gbps, which meets the bandwidth requirement. The link between physical node 1 and physical node 2 is added to the slice topology, and the physical link bandwidth of the physical link between physical node 1 and physical node 2 is configured to 100Mbps, and a new slice topology is obtained. Fig.17 As shown, Fig.17 A structural schematic diagram of another slice topology of an embodiment of the present application.

[0201] The network controller can output the verification result to the user: the verification fails, node 0 in the slice topology is not connected to other nodes, and the link is missing. The update strategy is: connect link 1-2 to connect the subnets between nodes 0, 3, and 7. The updated slice topology corresponding to the update strategy is as follows: Fig.17 shown.

[0202] In another exemplary embodiment, if the network controller obtains a physical topology that is different from the physical topology shown in the above physical topology 1, the network controller verifies the slice topology according to the changed slice strategy and the parameter value of the changed physical topology information. Fig.18 and Fig.19 , Fig.18 is a schematic diagram of another physical topology structure of an embodiment of the present application, Fig.19 Based on Fig.18 Schematic diagram of the structure of the slice topology generated by the physical topology shown. Fig.18 The physical topology shown does not specify the nodes connected to the user access site. The slice topology includes a slice topology network consisting of slice node 1-slice node 0-slice node 4-slice node 5 and a slice topology network consisting of slice node 2-slice node 3-slice node 7-slice node 6. The slicing strategy is to detect the connectivity of the above two slice topology networks.

[0203] The network controller manages the slices based on the physical topology, slice topology, and slice strategy. Fig.19 The slice topology network shown is detected, and it is found that the above two slice topology networks are not connected. In addition, the network controller detects that the two slice topologies are connected by connecting the physical link between nodes 1-2.

[0204] The network controller can output the verification result to the user: the slice topology formed by slice nodes 1-0-4-5 is not connected to the slice topology formed by slice nodes 2-3-7-6. The update strategy is: connect the slice link between slice node 1 and slice node 2 to connect the slice topology network formed by slice nodes 1-0-4-5 and the slice topology network formed by slice nodes 2-3-7-6.

[0205] In some embodiments, the network controller can send the update policy to the corresponding physical node. Accordingly, the physical node receives the update policy sent by the network controller. The physical node can modify the slice topology information according to the update policy and configure the slice topology. In this way, the slice topology can be adjusted according to the verification information (such as adjusting the bandwidth of the corresponding slice link and / or the primary and backup slice paths), so that the adjusted slice topology can meet the service transmission requirements as much as possible. Fig.10 , Fig.10 The figure is a schematic diagram of the slice topology after the physical node is updated according to the update strategy of the network controller. In the updated slice topology, the slice link bandwidth of the slice link between slice node 0 to slice node 4 is updated from 100 Mbps to 200 Mbps.

[0206] In the above method, the network controller can point out the reason why the slice topology does not meet the slice strategy, as well as the location of the slice nodes or slice links that do not meet the slice strategy through the verification results (also called verification information) (such as if slice nodes 1 and 2 are not connected, then the location of slice nodes 1 and 2 is output).

[0207] Optionally, the network controller outputs an update strategy (also called modification suggestion) based on the verification result. For example, if the reserved bandwidth satisfies the slicing strategy and the bandwidth in the physical topology is exhausted and no better modification suggestion can be given, then the verification result may only have the above-mentioned location and reason, but no modification suggestion, because it cannot be modified based on the given physical topology.

[0208] For another example, for the primary-backup path separation strategy, if the performance of the current slice topology is judged to be not good enough, a slice topology with better separation needs to be given. In this case, the verification result includes the location of the slice node or slice link that does not meet the slice strategy (such as the location of the source-destination pair with insufficient separation), the reason (such as calculating the best separation path for all source-destination pairs, indicating that the separation based on the current slice topology is not high enough, and the best separation can be calculated), and modification suggestions (such as calculating the separation paths of all source-destination pairs based on the new slice topology, comparing them with the original slice topology, and improving the separation).

[0209] When a slice is first generated, in order to ensure that each task can be executed, each link in the slice may reserve a large bandwidth. However, in the actual operation of the slice, the actual transmission bandwidth of some links may be much smaller than the reserved bandwidth, resulting in a lot of bandwidth waste. The above embodiment can verify the slice topology information according to the slice strategy during the initial configuration stage of the slice topology and the operation stage of the slice topology. If the slice topology has an erroneous configuration that does not meet the slice strategy, the erroneous configuration information can be output and configuration suggestions for the erroneous configuration can be generated. This makes it easier for operation and maintenance personnel to appropriately adjust the reserved link bandwidth in the slice topology according to the historical traffic transmission in the slice topology, thereby reducing the waste of slice resources.

[0210] During the slice topology operation phase, the physical topology, slice topology, site, slice strategy and other parameters that the slice topology depends on may change. At this time, it is necessary to re-verify the slice topology network and output the verification information of the slice topology.

[0211] In some embodiments, the slice topology verification method also includes: obtaining the cross-link and the cross-link bandwidth coefficient, and the network controller can set the link bandwidth of the cross-link according to the cross-link bandwidth coefficient.

[0212] Each physical topology has its own autonomous system. The routing protocol used by the autonomous system of the physical topology is called the interior gateway protocol (IGP). The autonomous system of the physical topology can use the IGP to determine whether the links between the physical nodes in the physical topology are connected (also known as the network reachability between the physical nodes). Figure 6 , Figure 6 The physical topology network shown includes physical nodes 0 to 7. The autonomous system of the physical topology can determine through IGP that the link between physical node 0 and physical node 1 is connected, that is, physical node 0 and physical node 1 are network reachable. Similarly, the autonomous system of the physical topology can determine through IGP whether the links between the physical nodes in the physical topology are connected. Nodes belonging to multiple physical topology networks are called boundary nodes, and the links between boundary nodes can be called cross-links.

[0213] For example, Fig.13 The physical topology shown is composed of two physical topologies. Physical node 0, physical node 1, physical node 2, physical node 3, physical node 7, physical node 6, physical node 5, physical node 4, physical node 0 and the links connecting the above nodes constitute the first physical topology, and physical node 1, physical node 2, physical node 9, physical node 8 and the links connecting the above nodes constitute the second physical topology. Through IGP, it is obtained that physical node 1 and physical node 2 belong to the first physical topology and the second physical topology. Physical node 1 and physical node 2 are boundary nodes of the physical topology network, and the link between physical node 1 and physical node 2 is a horizontal link.

[0214] For example, Figure 6 The physical topology has not changed, but the slicing strategy has changed. The network controller can Figure 6 The parameter values ​​of the physical topology and the changed slicing strategy are used to verify the slicing topology. For example, the slicing strategy is: the slicing link bandwidth of the cross-link is greater than the product of the size of the service data and the bandwidth coefficient of the cross-link.

[0215] The network controller obtains the bandwidth factor of the cross-link as 2. In the above example, we get Fig.14 After the slice topology shown, the bandwidth of the link between slice node 1 and slice node 2 is multiplied by 2, and the slice link bandwidth is 800Mbps, thereby obtaining a slice topology including the bandwidth coefficient of the cross-link, ensuring the stable operation of the task on the cross-link.

[0216] In summary, based on the slice topology verification method provided in the embodiment of the present application, the slice topology in the initial state and the slice topology in operation can be verified, and verification information can be output, so that the user can obtain the status of the slice topology in operation, which is beneficial for the user to maintain the slice topology.

[0217] The above mainly introduces the solution provided in the embodiment of the present application from the perspective of method.

[0218] In order to achieve the above functions, Fig.21 As shown, Fig.21 The structure diagram of a slice topology verification device 90 provided in an embodiment of the present application is shown. The slice topology verification device 90 is applied to a network system including multiple network elements. The slice topology verification device 90 is used to execute the slice topology verification method described above, for example, to execute Figure 4 The method shown in the figure. The slice topology verification device 90 includes an acquisition unit 91, a verification unit 92 and an output unit 93.

[0219] The acquisition unit 91 is used to obtain slice topology information of the slice topology, historical traffic information of the slice topology, physical topology information of the physical topology associated with the slice topology, and a slice strategy. The verification unit 92 is used to verify the slice topology according to the slice topology information, historical traffic information, physical topology information, and slice strategy to obtain verification information. The output unit 93 is used to output the verification information; wherein the verification information includes whether the slice topology verification passes or fails; if the verification passes, it means that the slice topology meets the slice strategy, and if the verification fails, it means that the slice topology does not meet the slice strategy.

[0220] As an example, combining Figure 4 The acquisition unit 91 may be used to execute S401. The verification unit 92 may be used to execute S402. The output unit 93 may be used to execute S403.

[0221] Optionally, if the slice topology verification fails, the verification information also includes the reason why the slice topology does not meet the slice policy.

[0222] Optionally, if the slice topology check fails, the check information also includes an update strategy, which is used to update the slice topology information.

[0223] Optionally, the physical topology information is as described above and will not be repeated here.

[0224] Optionally, the slice topology information is as described above and will not be repeated here.

[0225] Optionally, the slice topology satisfies the slice policy, including: the slice nodes selected by the slice topology, the slice links between the slice nodes, or the bandwidth reserved for the slice links satisfy the slice policy; the slice topology does not satisfy the slice policy, including: the slice nodes selected by the slice topology, the slice links between the slice nodes, or the bandwidth reserved for the slice links do not satisfy the slice policy.

[0226] Optionally, the slicing strategy includes at least one of the following: there is a connected primary and backup slicing path between the slice nodes selected by the slice topology; the bandwidth reserved for the slice link meets the slice reserved bandwidth requirement; the bandwidth reserved for the slice link meets the historical traffic value requirement corresponding to the slice link in the historical traffic information; the comprehensive score of the first score of the bandwidth reserved for the slice link and the second score of the separation of the primary and backup slicing paths meets the first condition; the first score is: determined according to the difference between the bandwidth reserved for the slice link and the slice reserved bandwidth requirement; the separation is used to characterize the number of overlapping slice nodes or slice links passed by the primary and backup slicing paths.

[0227] Optionally, the first condition includes: the comprehensive score is higher than a threshold.

[0228] Optionally, the slicing strategy also includes: the difference between the bandwidth reserved for the slice link and the slice reserved bandwidth requirement satisfies the second condition, the second condition includes that the difference value is higher than the first threshold; the first score of the separation of the primary and backup slice paths satisfies the third condition; the third condition includes that the separation of the primary and backup paths is less than the second threshold.

[0229] As an example, the acquisition unit 91 can also be used to obtain information about a new access site, the site information including: the access bandwidth of the site, the number of sites, and the location of the site; verifying the slice topology according to the slice topology information, historical traffic information, physical topology information, and slicing strategy, and obtaining verification information including: verifying the slice topology according to the slice topology information, historical traffic information, physical topology information, information about the new access site, and slicing strategy, and obtaining verification information.

[0230] Optionally, output verification information, including: displaying the verification information in a report.

[0231] Optionally, the report includes recommended updated primary and backup slice paths or bandwidth reserved for slice links; the report includes recommended updated primary and backup slice paths and / or bandwidth reserved for slice links.

[0232] For the specific description of the above optional methods, please refer to the above method embodiments, which will not be repeated here. In addition, the explanation of the verification device 90 of any slice topology provided above and the description of the beneficial effects can refer to the above corresponding method embodiments, which will not be repeated here.

[0233] As an example, combining Figure 5 The function implemented by the acquisition unit 91 in the slice topology verification device 90 can be achieved by Figure 5 The functions implemented by the verification unit 92 can be realized by Figure 5 The function implemented by the output unit 93 can be realized by Figure 5 The verification result confirmation and delivery module is implemented in .

[0234] Those skilled in the art should easily realize that, in combination with the units and algorithm steps of each example described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0235] It should be noted that Fig.21The division of modules in the example is schematic and is only a logical function division. There may be other division methods in actual implementation. For example, two or more functions may be integrated into one processing module. The above integrated modules may be implemented in the form of hardware or software function modules.

[0236] An embodiment of the present application also provides a network controller, which includes: a memory, a network interface, and one or more processors, which receive or send data through the network interface, and the one or more processors are configured to read program instructions stored in the memory to execute the slice topology verification method described in the above embodiment.

[0237] An embodiment of the present application also provides a slice topology verification system, the analysis system includes: multiple network elements and a network controller, the multiple network elements communicate with the network controller respectively, and the network controller is used to execute the slice topology verification method described in the above embodiment.

[0238] The present application also provides a chip system 100, such as Fig. 22 As shown, the chip system 100 includes at least one processor and at least one interface circuit. As an example, when the chip system 100 includes a processor and an interface circuit, the processor may be Fig. 22 The processor 101 shown in the solid line frame (or the processor 101 shown in the dotted line frame) may be Fig. 22 The interface circuit 102 shown in the solid line frame (or the interface circuit 102 shown in the dotted line frame). When the chip system 100 includes two processors and two interface circuits, the two processors include Fig. 22 The processor 101 shown in the solid line frame and the processor 101 shown in the dotted line frame, the two interface circuits include Fig. 22 The interface circuit 102 shown in the solid line frame and the interface circuit 102 shown in the dotted line frame are not limited to this.

[0239] The processor 101 and the interface circuit 102 can be interconnected via a line. For example, the interface circuit 102 can be used to receive signals (for example, receiving the slice topology information of the slice topology above, the historical traffic information of the slice topology, etc.). For another example, the interface circuit 102 can be used to send signals to other modules (such as the processor 101). Exemplarily, the interface circuit 102 can read the instructions stored in the memory and send the instructions to the processor 101. When the instruction is executed by the processor 101, the slice topology verification device can perform the various steps in the above embodiments. Of course, the chip system 100 may also include other discrete devices, which are not specifically limited in the embodiments of the present application.

[0240] The present application also provides a computer program product and a computer-readable storage medium for storing the computer program product. The computer program product may include one or more program instructions, which, when executed by one or more processors, can provide the above Figure 4 Thus, for example, reference Figure 4 One or more features of S401 - S403 may be undertaken by one or more instructions in the computer program product.

[0241] In some examples, such as for Figure 4 The described slice topology verification device can be configured to provide various operations, functions, or actions in response to one or more program instructions stored in a computer-readable storage medium.

[0242] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using a software program, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When executing instructions on a computer and executing a computer, a process or function according to an embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. Computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, computer instructions can be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server, data center, etc. that contains one or more servers that can be integrated with a medium. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (eg, a solid state disk (SSD)).

[0243] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

Claims

1. A method for verifying slice topology, characterized in that: include: Obtain slice topology information of a slice topology, historical traffic information of the slice topology, physical topology information of a physical topology associated with the slice topology, and a slice strategy; Verify the slice topology according to the slice topology information, the historical traffic information, the physical topology information and the slice strategy to obtain verification information; Output the verification information; wherein, the verification information includes whether the slice topology verification passes or fails; if the verification passes, it means that the slice topology satisfies the slice strategy, and if the verification fails, it means that the slice topology does not satisfy the slice strategy.

2. The method according to claim 1, characterized in that If the slice topology check fails, the check information also includes the reason why the slice topology does not satisfy the slice strategy, and the location of the slice node or slice link that does not satisfy the slice topology.

3. The method according to claim 1 or 2, characterized in that: If the slice topology check fails, the check information also includes an update strategy, and the update strategy is used to update the slice topology information.

4. The method according to any one of claims 1 to 3, characterized in that: The physical topology information includes at least one of the following information: a physical node identification ID, a source physical port ID of a physical link, a destination physical port ID of the physical link, a total bandwidth of the physical link, a sliceable bandwidth of the physical link, a slice type supported by the physical link, or an affinity attribute of the physical link, wherein the sliceable bandwidth is a bandwidth that allows the physical link to be allocated to a slice link.

5. The method according to any one of claims 1 to 4, characterized in that: The slice topology information includes at least one of the following information: slice ID, slice node ID, mapping relationship between slice node ID and physical node ID, mapping relationship between slice link and physical link, slice link bandwidth, source slice port ID of slice link, or destination slice port ID of slice link, affinity attribute of slice link.

6. The method according to any one of claims 1 to 5, characterized in that: The slicing topology satisfies the slicing strategy, including: the slicing nodes selected by the slicing topology, the slicing links between the slicing nodes, or the bandwidth reserved for the slicing links satisfy the slicing strategy; The slicing topology not satisfying the slicing strategy includes: the slicing nodes selected by the slicing topology, the slicing links between the slicing nodes, or the bandwidth reserved for the slicing links not satisfying the slicing strategy.

7. The method according to claim 6, characterized in that The slicing strategy includes at least one of the following: There are connected primary and backup slice paths between the slice nodes selected by the slice topology; The bandwidth reserved for the slice link between the slice nodes meets the slice reserved bandwidth requirement; The bandwidth reserved for the slice link meets the historical traffic value requirement corresponding to the slice link in the historical traffic information; A comprehensive score of a first score for the bandwidth reserved for the slice link and a second score for the separation of the primary and backup slice paths between the slice nodes satisfies a first condition; The first score is determined based on the difference between the bandwidth reserved for the slice link and the reserved bandwidth requirement of the slice; the separation degree is used to characterize the number of overlapping slice nodes or slice links passed by the primary and backup slice paths.

8. The method according to claim 7, characterized in that The first condition includes: the comprehensive score is higher than a threshold, and the comprehensive score is the highest comprehensive score of the primary and backup slice paths between the slice nodes.

9. The method for verifying slice topology according to claim 1, characterized in that: The method further comprises: Acquire information of a new access site, the site information including: access bandwidth of the site, the number of the sites, and the location of the site; The verifying the slice topology according to the slice topology information, the historical traffic information, the physical topology information and the slice strategy to obtain the verification information includes: verifying the slice topology according to the slice topology information, the historical traffic information, the physical topology information, the information of the new access site and the slice strategy to obtain the verification information.

10. The method for verifying slice topology according to any one of claims 1 to 9, characterized in that: Output the verification information, including: The verification information is presented in a report.

11. The method for verifying slice topology according to any one of claims 1 to 10, characterized in that: If the slice topology check fails, the check information also includes the recommended updated primary and backup slice paths or the bandwidth reserved for the slice link; the check information includes the recommended updated primary and backup slice paths and / or the bandwidth reserved for the slice link.

12. A network controller, characterized in that: include: A memory, a network interface, and one or more processors, which receive or send data through the network interface, and the one or more processors are configured to read program instructions stored in the memory to execute the slice topology verification method as described in any one of claims 1 to 11.

13. A slice topology verification system, characterized in that: include: A plurality of network elements and a network controller, wherein the plurality of network elements communicate with the network controller, and the network controller executes the method according to any one of claims 1 to 11.

14. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes program instructions. When the program instructions are executed on a computer or a processor, the computer or the processor executes the method according to any one of claims 1 to 11.

15. A chip system, characterized in that: include: A processor, wherein the processor is used to call from a memory and run a computer program stored in the memory to execute the slice topology verification method as described in any one of claims 1 to 11.

Images