A method for network slicing deployment and reconstruction

Abstract

A network slice deployment and reconfiguration method includes: deploying virtual nodes in each network slice sequentially; if the deployment of the current virtual node in the current network slice fails, identifying the congested physical node causing the failure, and selecting the congested physical node with the highest congestion as the current congested physical node; selecting the network slice with the lowest importance that was successfully deployed as the current successfully deployed network slice; for the current congested physical node, if the currently successfully deployed network slice is reconfigurable, reconfiguring the currently successfully deployed network slice and redeploying the current virtual node of the current network slice; otherwise, selecting the next successfully deployed network slice as the current successfully deployed network slice and returning to the reconfigurability determination step; if there is no next successfully deployed network slice, selecting the next congested physical node as the current congested physical node and returning to the reconfigurability determination step; if there is no reconfigurable successfully deployed network slice for each congested physical node, rejecting the deployment of the current network slice.

Description

Technical Field

[0001] This invention relates to the field of network slicing technology, and in particular to a method for deploying and reconstructing network slices. Background Technology

[0002] Ultra-high-definition video data transmission not only needs to address the diversity of heterogeneous service demands and broadcast / multicast transmission architectures, but also the diversity and dynamism of the underlying infrastructure network, manifesting both temporal dynamism and volatility, as well as spatial multi-network, multi-domain characteristics. Network slicing is a key technology for supporting video transmission and distribution by slicing the physical network infrastructure into dedicated virtual subnets. However, with the increasing dimensions of physical network resources and the number of users / services, how to efficiently and balancedly deploy network slices under the condition of sharing limited physical resources has become a major problem in multi-domain networks.

[0003] When existing technologies reconstruct network slices after deployment rejection, the reconstruction process is usually unrelated to the deployment process and the two are relatively independent. This results in the loss of some important information, such as the reason for the network slice rejection, which leads to a low acceptance rate of the reconstructed network slices. Summary of the Invention

[0004] Based on the above analysis, the embodiments of the present invention aim to provide a network slice deployment and reconstruction method to solve the problem of low acceptance rate of existing network slice deployment and reconstruction methods.

[0005] On one hand, embodiments of the present invention provide a method for network slice deployment and reconstruction, including the following steps:

[0006] The network slices in the network slice set are sorted in descending order of importance, and each virtual node in each network slice is deployed in order.

[0007] If the current virtual node of the current network slice fails to deploy, the congested physical node that caused the deployment failure is identified, and the congested physical nodes are sorted in descending order of congestion, with the first congested physical node in the sorted list being the current congested physical node; the successfully deployed network slices are sorted in ascending order of importance, with the first successfully deployed network slice in the sorted list being the current successfully deployed network slice.

[0008] Reconfigurability determination: For the current congested physical node, if the currently deployed successful network slice is reconfigurable, then the currently deployed successful network slice is reconfigured and the current virtual node of the current network slice is redeployed; otherwise, the next successfully deployed network slice is used as the current successfully deployed network slice, and the reconfigurability determination step is returned; if there is no next successfully deployed network slice, the next congested physical node is used as the current congested physical node, and the reconfigurability determination step is returned.

[0009] If no reconfigurable network slice can be successfully deployed for each congested physical node, then the deployment of the current network slice is rejected.

[0010] Based on further improvements to the above technical solution, the following method is used to identify the congested physical nodes that cause deployment failure:

[0011] If the current virtual node is the root node of the search tree corresponding to the current network slice, then the congested physical node is a physical node that conforms to the mapping rules of the current virtual node but does not meet the resource requirements of the current virtual node.

[0012] If the current virtual node is a non-root node of the search tree corresponding to the current network slice, then the physical node mapped by the parent virtual node of the current virtual node is taken as the parent physical node, and the congested physical node is the physical node among the neighbor nodes of the parent physical node that meets the mapping rules of the current virtual node but does not meet the resource requirements of the current virtual node.

[0013] Furthermore, the following method is used to determine whether the currently deployed network slice can be reconfigured for the currently congested physical node:

[0014] A set of virtual nodes to be migrated is constructed using the virtual nodes deployed on the currently congested physical node in the currently successfully deployed network slice as the nodes to be migrated, and a set of candidate physical nodes to be migrated is constructed using the neighbor nodes of the currently congested physical node as the candidate physical nodes to be migrated.

[0015] Determine whether the resource slack generated by the virtual nodes to be migrated in the set of virtual nodes to be migrated is greater than or equal to the resource deficit generated after the current congested physical node is added to the current virtual node. If not, the currently deployed network slice cannot be reconfigured; otherwise:

[0016] Determine whether each virtual node to be migrated in the set of virtual nodes to be migrated can be migrated to a physical node in the set of candidate physical nodes to be migrated. If the resource slack generated by all the virtual nodes to be migrated that can be migrated to the physical nodes in the set of candidate physical nodes to be migrated is less than the resource deficit, then the currently deployed network slice is not reconfigurable; otherwise, the currently deployed network slice is reconfigurable.

[0017] Furthermore, the following method is used to determine whether each virtual node in the set of virtual nodes to be migrated can be migrated to a physical node in the set of candidate physical nodes to be migrated:

[0018] Sort the virtual nodes to be migrated in the set of virtual nodes to be migrated in ascending order of migration cost;

[0019] For each node to be migrated, the physical node mapped by the parent virtual node of the current node to be migrated is the parent physical node, and the virtual link between the current node to be migrated and its parent virtual node is the virtual link to be migrated. The physical nodes in the candidate migration physical node set that meet the resource requirements of the current node to be migrated constitute the target candidate migration physical node set.

[0020] If there is a physical node in the target candidate migration physical node set whose path to the parent physical node meets the resource requirements of the virtual link to be migrated, then the current node to be migrated can be migrated to a physical node in the candidate migration physical node set; otherwise, the current node to be migrated cannot be migrated to a physical node in the candidate migration physical node set.

[0021] Furthermore, the following method is used to determine whether there exists a physical node in the target candidate migration physical node set whose path to the parent physical node satisfies the resource requirements of the virtual link to be migrated:

[0022] S3331. Sort the physical nodes in the target candidate migration physical node set in ascending order of node load; take the first physical node in the sorted target candidate migration physical node set as the current target physical node;

[0023] S3332. Determine whether there is a path in the physical path from the parent physical node to the current target physical node that meets the resource requirements of the virtual link to be migrated. If there is, then there is a physical node in the target candidate migration physical node set whose path with the parent physical node meets the resource requirements of the virtual link to be migrated. Otherwise, take the next physical node in the target candidate migration physical node set as the current target physical node and return to step S3332.

[0024] S3333. If there is no physical path from the parent physical node to each physical node in the target candidate migration physical node set that satisfies the resource requirements of the virtual link to be migrated, then there is no physical node in the target candidate migration physical node set whose path to the parent physical node satisfies the resource requirements of the virtual link to be migrated.

[0025] Furthermore, the following method is used to determine whether there exists a path in the physical path from the parent physical node to the current target physical node that satisfies the resource requirements of the virtual link to be migrated:

[0026] Based on Dijkstra's algorithm, K shortest paths from the parent physical node to the current target physical node are obtained;

[0027] The system iterates through the K shortest paths in ascending order of path cost. If the current shortest path satisfies the SLA constraint, then the current shortest path is the shortest path that satisfies the resource requirements of the virtual link to be migrated, and the traversal ends; otherwise, it continues to traverse the next shortest path.

[0028] If none of the K shortest paths satisfy the SLA constraint, then there is no physical path from the parent physical node to the current target physical node that meets the resource requirements of the virtual link to be migrated.

[0029] Furthermore, each virtual node in each network slice is deployed sequentially, including:

[0030] For each network slice in the network slice set, the importance of each physical node in the physical network and each virtual node in the network slice is calculated based on the multi-attribute decision method. Based on the importance of each node, each virtual node in the network slice is pre-deployed.

[0031] The mapping parameters in the pre-deployment are optimized with the goal of maximizing the resource efficiency of the network slice set, so as to obtain the optimal mapping parameters;

[0032] For each network slice in the network slice set, based on the optimal mapping parameters, the importance of each physical node in the physical network and each virtual node in the network slice is recalculated using a multi-attribute decision method. Based on the importance of each node, each virtual node in the network slice is deployed.

[0033] Furthermore, the optimization objective function is:

[0034]

[0035]

[0036] in, Represents physical nodes The current remaining resources, R T This represents the total resources of the nodes in the underlying physical network. Indicates physical link The current remaining resources, B T This represents the total link bandwidth resources of the underlying physical network. This represents the i-th node in the V-th network slice of the network slice set. resource requirements, Indicates virtual link Resource requirements, N V Let E represent the set of virtual nodes in the V-th network slice. V The adjacency matrix represents the connection relationships between virtual nodes in the V-th network slice. Represents the virtual node in the Vth network slice. and n j v Virtual links between N P E represents the set of physical nodes. P The adjacency matrix, h, represents the connection relationships between physical nodes. (z) Let f represent the set of mapping parameter variables fitted in the z-th search, M represent the number of mapping parameters, and f PSO (h (z) ) represents the network slice deployment resource efficiency measured by the z-th search fit, N NSR This represents the number of network slices in the network slice set; m V This represents a pre-deployed mapping variable. Its value is 1 if the Vth network slice is successfully deployed, and 0 otherwise.

[0037] Furthermore, based on the importance of each virtual node, each virtual node in the network slice is pre-deployed, including:

[0038] Using the virtual node with the highest importance in the network slice as the root node, construct the search tree of the network slice based on the breadth-first search algorithm;

[0039] For each virtual node in the search tree, construct the final set of candidate physical nodes for the current virtual node based on its autonomous system type and resource requirements;

[0040] If the current virtual node is the root node of the search tree, then select the physical node with the highest importance from the final candidate physical node set of the current virtual node as the mapping node of the current virtual node.

[0041] If the current virtual node is a non-root node of the search tree, then the physical node mapped by the parent virtual node of the current virtual node is taken as the parent physical node, and the virtual link between the current virtual node and the parent virtual node of the current virtual node is taken as the target virtual link. From the final set of candidate physical nodes, candidate physical nodes whose paths with the parent physical nodes meet the resource requirements of the target virtual link are selected as the mapping nodes of the current virtual node.

[0042] Compared to existing technologies, the network slice deployment and reconstruction method provided in this embodiment designs a dynamic deployment process for network slice mapping and reconstruction. When a network slice is rejected, a slice reconstruction mechanism is triggered. The slice reconstruction process is based on the slice deployment process, utilizing it to find congested physical nodes causing the network slice rejection, thereby clearing the congested physical nodes and reconstructing successfully deployed network slices. This allows currently failed network slices to be redeployed, thus improving the network slice acceptance rate. Furthermore, to ensure stability within slices and isolation between slices, virtual nodes on congested physical nodes are migrated, along with the virtual links associated with these virtual nodes, on a slice-by-slice basis for slice reconfiguration.

[0043] In this invention, the above-described technical solutions can be combined with each other to achieve more preferred combinations. Other features and advantages of this invention will be set forth in the following description, and some advantages may become apparent from the description or be learned by practicing the invention. The objects and other advantages of this invention can be realized and obtained from the description and drawings, which are particularly pointed out. Attached Figure Description

[0044] The accompanying drawings are for illustrative purposes only and are not intended to limit the invention. Throughout the drawings, the same reference numerals denote the same parts.

[0045] Figure 1 This is a flowchart of the network slicing deployment and reconstruction method according to an embodiment of the present invention;

[0046] Figure 2 This is a schematic diagram of the search tree in an embodiment of the present invention;

[0047] Figure 3 This is a schematic diagram of the mapping rules for the initial candidate physical node set in an embodiment of the present invention. Detailed Implementation

[0048] Preferred embodiments of the present invention will now be described in detail with reference to the accompanying drawings, which form part of this application and are used together with the embodiments of the present invention to illustrate the principles of the present invention, but are not intended to limit the scope of the present invention.

[0049] A specific embodiment of the present invention discloses a method for network slice deployment and reconstruction, such as... Figure 1 As shown, it includes:

[0050] S1. Sort each network slice in the network slice set in descending order of importance, and deploy each virtual node in each network slice in order.

[0051] S2. If the current virtual node of the current network slice fails to deploy, determine the congested physical node that caused the deployment failure, sort the congested physical nodes in descending order of congestion, and take the first congested physical node after sorting as the current congested physical node; sort the successfully deployed network slices in ascending order of importance, and take the first successfully deployed network slice after sorting as the current successfully deployed network slice.

[0052] S3. For the currently congested physical node, if the currently deployed network slice can be reconstructed, then the currently deployed network slice is reconstructed and the current virtual node of the current network slice is redeployed; otherwise, the next successfully deployed network slice is used as the current successfully deployed network slice, and the process returns to step S3; if there is no next successfully deployed network slice, then the next congested physical node is used as the current congested physical node, and the process returns to step S3.

[0053] S4. If there is no successfully deployed network slice that can be reconfigured for each congested physical node, then the deployment of the current network slice is rejected.

[0054] Compared to existing technologies, the network slice deployment and reconstruction method provided in this embodiment designs a dynamic deployment process for network slice mapping and reconstruction. When a network slice is rejected, a slice reconstruction mechanism is triggered. The slice reconstruction process is based on the slice deployment process, utilizing it to find congested physical nodes causing the network slice rejection, thereby clearing the congested physical nodes and reconstructing successfully deployed network slices. This allows currently failed network slices to be redeployed, thus improving the network slice acceptance rate. Furthermore, to ensure stability within slices and isolation between slices, virtual nodes on congested physical nodes are migrated, along with the virtual links associated with these virtual nodes, on a slice-by-slice basis for slice reconfiguration.

[0055] During implementation, the physical infrastructure network (physical network) is first transformed into an undirected weighted graph based on the distribution of physical network resources and the network topology information of the physical infrastructure network.

[0056] G P =(N P E P ,R T B T D P )

[0057] Where, N P This represents a set of physical nodes. In practice, physical nodes include base stations, edge data centers that house virtual mobile edge computing servers, and other access network nodes. Transmission network nodes such as optical switches and routers Core network nodes such as core data centers that support core network decoupling E P R represents the adjacency matrix that represents the connection relationships between physical nodes in a physical network. T This refers to the resources of physical nodes, such as the channel capacity of base stations on the access network side and the computing power capacity of core nodes; B T Indicates the bandwidth information of the physical link; D P This indicates the latency information of the physical link.

[0058] In practice, the network slice set includes uRLLC type slices for live video streaming and eMBB type slices for rebroadcast scenarios.

[0059] Based on the resource information and network topology information of the Vth network slice requirement, the virtual network of the Vth network slice requirement is converted into an undirected weighted graph:

[0060] G V =(N V E V ,R V B V D V ),V≤N NSR

[0061] Where, N V This represents the set of Virtual Network Function (VNF) nodes for the Vth network slice, i.e., the set of virtual nodes, which includes access network nodes. Transmission network node Core network nodes E V R represents the adjacency matrix corresponding to the network topology graph of the Vth network slice; V Indicates the resource requirements of the virtual node; B V Represents the resource requirements of the virtual link; represents the latency constraint of the Vth network slice; N NSR This indicates the number of network slices in the network slice set.

[0062] During implementation, the importance of network slices IN is calculated using the following formula in step S10:

[0063]

[0064] Where, N V This represents the set of virtual nodes for the V-th network slice. Represents virtual nodes resource requirements, Indicates virtual link resource requirements, Indicates virtual link The maximum allowable delay.

[0065] Specifically, in step S1, each virtual node in each network slice is deployed sequentially, including:

[0066] S11. For each network slice in the network slice set, calculate the importance of each physical node in the physical network and each virtual node in the network slice based on the multi-attribute decision method, and pre-deploy each virtual node in the network slice based on the importance of each node.

[0067] S12. Optimize the mapping parameters in the pre-deployment with the goal of maximizing the resource efficiency of the network slice set to obtain the optimal mapping parameters;

[0068] S13. For each network slice in the network slice set, based on the optimal mapping parameters, recalculate the importance of each physical node in the physical network and each virtual node in the network slice using a multi-attribute decision method, and deploy each virtual node of the network slice based on the importance of each node.

[0069] Specifically, the multiple attributes include node resource importance, node degree centrality, betweenness centrality, proximity centrality, and eigenvector centrality.

[0070] In step S11, the importance of each physical node in the physical network and each virtual node in the network slice is calculated using a multi-attribute decision method as follows:

[0071] S1111. Based on the node resource importance, node degree centrality, betweenness centrality, proximity centrality and eigenvector centrality of each physical node in the physical network and each virtual node in the network slice, construct the decision matrix of the physical network and the decision matrix of the network slice respectively.

[0072] The following uses virtual nodes in network slices as an example to illustrate how to calculate the importance of virtual nodes. The calculation process for the importance of physical nodes is the same.

[0073] Specifically, the node resource importance of each virtual node is calculated using the following formula.

[0074] in, Indicates virtual node A collection of connected virtual links. Represents virtual nodes resource requirements, express Virtual links in resource requirements, Indicates virtual link The maximum allowable delay.

[0075] Specifically, the degree centrality of each virtual node is calculated using the following formula.

[0076] in, It is a node The degree, N V Let N represent the set of virtual nodes in the V-th network slice, where N is the current network slice, i.e., the number of virtual nodes in the V-th network slice. If the nodes and nodes Direct connection, δ ij =1, otherwise δ ij =0.

[0077] Specifically, the betweenness centrality of each virtual node is calculated using the following formula.

[0078] in, It is a node and Between nodes The shortest path, It is a node and The shortest path between them, where N is the number of virtual nodes in the Vth network slice.

[0079] Specifically, the proximity centrality of each virtual node is calculated using the following formula.

[0080] in, It is a node and The shortest path between them, Shortest path The number of hops, where N is the number of virtual nodes in the Vth network slice.

[0081] Specifically, the eigenvector centrality of each virtual node is calculated using the following method.

[0082] Calculate the adjacency matrix E V The largest eigenvalue λ and the corresponding eigenvector of the largest eigenvalue λ are given, and each element of the eigenvector represents the eigenvector centrality of the corresponding virtual node.

[0083] Based on the node resource importance, degree centrality, betweenness centrality, proximity centrality, and eigenvector centrality of each virtual node in the V-th network slice, the decision matrix of the network slice is constructed as follows:

[0084]

[0085] Among them, a ij Represents a node The value of the j-th attribute, N represents the number of virtual nodes in the V-th network slice, and L represents the number of attributes. For example, L = 5, which are node resource importance, node degree centrality, betweenness centrality, proximity centrality, and eigenvector centrality in that order.

[0086] S1112. Normalize the decision matrix of the physical network and the decision matrix of the network slice respectively. Calculate the group benefit value and individual regret value of each virtual node based on the normalized decision matrix of the network slice. Calculate the group benefit value and individual regret value of each physical node based on the normalized decision matrix of the physical network.

[0087] Specifically, the normalized decision matrix is ​​as follows:

[0088] in,

[0089] Determine B N×L positive ideal solution and negative ideal solution

[0090]

[0091] Compute virtual nodes The group benefit value S i And individual regret value R i .

[0092]

[0093] Where Ω1={ω1,…,ω L} represents the attribute weight coefficient, which is the mapping parameter to be optimized. The value range of the element is [0,1], and the sum of all elements is 1.

[0094] S1113. Calculate the compromise decision index value of each virtual node based on the group benefit value and individual regret value of each virtual node; calculate the compromise decision index value of each physical node based on the group benefit value and individual regret value of each physical node; the smaller the compromise decision index value, the greater the importance of the node.

[0095] Specifically, the compromise decision index value for each virtual node is calculated using the following formula.

[0096]

[0097] Wherein, ψ1∈[0,1] is the compromise coefficient, which is also the mapping parameter that needs to be optimized. When ψ1≥0.5, the current multi-attribute decision-making mechanism takes the maximization of group utility as the decision basis. When ψ1<0.5, the current multi-attribute decision-making mechanism takes the minimization of individual regret value as the decision mechanism. When ψ1=0.5, the compromise considers both group utility and individual regret.

[0098] The same method as steps S1111-S1113 is used to calculate the trade-off decision index value for each physical node in the physical network. Calculate the trade-off decision index value of physical nodes During the process, the attribute weight coefficients are represented as Ω2={ω'1,…,ω' L The tradeoff coefficient is denoted as ψ2. During pre-deployment, these mapping parameters Ω1, Ω2, ψ1, and ψ2 are preset values. It should be noted that the smaller the tradeoff decision index value of a node, the greater its importance, and the more important the node.

[0099] After calculating the importance of each virtual node in the Vth network slice, pre-deployment is performed for each virtual node in the network slice based on the importance of each virtual node, specifically including:

[0100] S112. Using the virtual node with the highest importance in the network slice as the root node, construct the search tree of the network slice based on the breadth-first search algorithm;

[0101] like Figure 2 As shown, the virtual node with the highest importance in this network slice is node [node name missing]. Using this node as the root node of the search tree, and based on the topology of the virtual nodes, construct a BFS search tree using the breadth-first search algorithm as follows: Figure 2 As shown in the tree structure.

[0102] It should be noted that in the search tree, nodes at the same level are arranged in descending order of importance. For example, node... and nodes They are on the same floor. greater than Therefore, the node Ranked Before.

[0103] After constructing the search tree, starting from the root node of the search tree, each virtual node is traversed and mapped sequentially from top to bottom and from left to right.

[0104] S113. For each virtual node in the search tree, construct the final candidate physical node set for the current virtual node based on its autonomous system type and resource requirements. Specifically, this includes:

[0105] S1131. Determine the initial set of candidate physical nodes for the current virtual node based on the autonomous system type of the current virtual node;

[0106] Specifically, such as Figure 3 As shown, virtual nodes are divided into access network nodes. Transmission network node Core network nodes Managed as independent autonomous domains, respectively in physical resource G P Access network nodes in Transmission network node Core network nodes The system maps node resources within the autonomous system (AS) of the virtual nodes, determining the initial set of candidate physical nodes based on the AS of the virtual nodes. Specifically, in a network slice, access virtual nodes are mapped to the access side of the physical infrastructure network, transmission virtual nodes are mapped to the transmission network, and core virtual nodes are mapped to the core network. It should be noted that, due to the high latency requirements of uRLLC type slices, the user plane function (UPF) and control plane in the core network are decoupled and preferentially mapped to the access network side to reduce user-end latency.

[0107] After obtaining the initial set of candidate physical nodes for the current virtual node, the final set of candidate physical nodes for the current virtual node is further determined based on the position of the current virtual node in the search tree.

[0108] If the current virtual node is the root node of the search tree, then the physical nodes in the initial candidate physical node set that meet the resource requirements of the current virtual node constitute the final candidate physical node set of the current virtual node.

[0109] If the current virtual node is a non-root node of the search tree, then the physical node mapped by the parent virtual node of the current virtual node is taken as the parent physical node. The physical nodes in the initial candidate physical node set that meet the resource requirements of the current virtual node and are neighbors of the parent physical node constitute the final candidate physical node set of the current virtual node.

[0110] Specifically, the current virtual node The non-root node of the BFS search tree has the following parent node (parent virtual node) in the search tree: Parent virtual node The physical node mapped The parent physical node of the current virtual node. The initial set of candidate physical nodes must meet the resource requirements of the current virtual node, and be... The candidate physical nodes of the current physical node are formed from the candidate physical nodes of its neighboring nodes. During implementation, The neighbor node is the k-hop neighbor node. For example, if k=2, then the neighbor node is the parent physical node. Physical nodes with a path hop count of 2 or less are considered 2-hop neighbors of their parent physical node.

[0111] It should be noted that if the candidate physical node set of the current virtual node is empty, the current virtual node deployment fails, the current network slice deployment fails, that is, the current network slice request is rejected, and the deployment of the next network slice continues; otherwise, the next step continues.

[0112] S114. If the current virtual node is the root node of the search tree, then select the physical node with the highest importance from the final candidate physical node set of the current virtual node as the mapping node of the current virtual node.

[0113] If the current virtual node is a non-root node of the search tree, then the physical node mapped by the parent virtual node of the current virtual node is taken as the parent physical node, and the virtual link between the current virtual node and the parent virtual node of the current virtual node is taken as the target virtual link. From the final set of candidate physical nodes, candidate physical nodes whose paths with the parent physical nodes meet the resource requirements of the target virtual link are selected as the mapping nodes of the current virtual node.

[0114] If there is no candidate physical node in the final candidate physical node set whose path to the parent physical node satisfies the resource requirements of the target virtual link, then the current virtual node deployment fails and the current network slice deployment fails.

[0115] For the root node, the physical node with the highest importance is directly selected from the final set of candidate physical nodes as its mapping node.

[0116] For non-root nodes, the physical node mapped to the parent virtual node of the current virtual node is taken as the parent physical node, and the virtual link between the current virtual node and its parent virtual node is taken as the target virtual link. For example, the current virtual node... The parent virtual node is Parent virtual node The mapped physical node is The virtual link between the current virtual node and its parent virtual node is Then the parent physical node is The target virtual link is

[0117] Specifically, candidate physical nodes whose paths to the parent physical node satisfy the resource requirements of the target virtual link are selected from the final candidate physical node set as the mapping nodes for the current virtual node, using the following method:

[0118] S1141. Sort the candidate physical nodes in the final candidate physical node set in ascending order of node load; take the first candidate physical node in the sorted final candidate physical node set as the current candidate physical node.

[0119] Specifically, the load of candidate physical nodes is calculated using the following formula:

[0120]

[0121] in, Physical nodes The current remaining resources, Physical nodes The initial total resources.

[0122] S1142. Determine whether there is a path in the physical path from the parent physical node to the current candidate physical node that meets the resource requirements of the target virtual link. If there is, map the current virtual node to the current candidate physical node and map the target virtual link to the shortest path that meets the resource requirements of the target virtual link. Otherwise, take the next candidate physical node in the final candidate physical node set as the current candidate physical node and return to step S1142.

[0123] S1143. If there is no physical path from the parent physical node to each candidate physical node in the final candidate physical node set that satisfies the resource requirements of the target virtual link, then there is no candidate physical node in the final candidate physical node set whose path to the parent physical node satisfies the resource requirements of the target virtual link.

[0124] During implementation, the first candidate physical node in the final candidate physical node set is taken as the current candidate physical node. If starting from a physical node... There exists a virtual link that satisfies the target at the current candidate physical node. The path for resource requirements will then map the current virtual node to the current candidate physical node, and the target virtual link will be established. Mapping to physical nodes Virtual links are satisfied between the current candidate physical nodes. On the shortest path of resource demand, if the current virtual node is mapped, proceed to the mapping of the next virtual node; otherwise, set the second candidate physical node as the current candidate physical node, and determine whether to proceed from the physical node... Does the current candidate physical node satisfy the target virtual link? The path of resource demand follows the same pattern.

[0125] If from the physical node There is no virtual link that satisfies the target for each candidate physical node in the final candidate physical node set. If the path for resource requirements fails, the current virtual node mapping fails, the current network slice deployment fails, and the deployment of the next network slice continues.

[0126] By combining node mapping and link mapping, the efficiency of network slicing deployment is improved.

[0127] Specifically, in step S1142, the following method is used to determine whether there exists a path in the physical path from the parent physical node to the current candidate physical node that meets the resource requirements of the target virtual link:

[0128] S11421. Based on Dijkstra's algorithm, search for K shortest paths from the parent physical node to the current candidate physical node;

[0129] It should be noted that the shortest path search is performed using an adjacency matrix C constructed based on the current physical network link resources. E The search is performed on the adjacency matrix C. E The following method is used to obtain: If the nodes in the physical network and nodes The links between them satisfy the target virtual link The resource requirements are then determined by the adjacency matrix C. E Middle node and nodes The corresponding value is the load value of the link between the two nodes; otherwise, it is infinity. Physical link load The following formula is used to calculate:

[0130]

[0131] in, Indicates physical link The current remaining resources, Indicates physical link The initial total resources.

[0132] The Dijkstra algorithm is used to search for the K shortest paths from the parent physical node to the current candidate physical node, which is an existing algorithm and will not be described in detail in this application.

[0133] S11422. Traverse each of the K shortest paths in ascending order of path cost. If the current shortest path satisfies the SLA constraint, then the current shortest path is the shortest path that satisfies the resource requirements of the target virtual link, and the traversal ends; otherwise, continue traversing the next shortest path.

[0134] The following function is used to calculate the path cost of the shortest path.

[0135]

[0136]

[0137] in, Represents the parent physical node and current candidate physical nodes The shortest path between them, yes Path hop count, It is a physical link The current workload, It is in the basic physical network The set of physical links along the path; Indicates the link resource allocation coefficient. Indicates physical link The current remaining resources, Indicates physical link Initial total resources. Link resource allocation coefficient. These are also mapping parameters that need optimization, especially during pre-deployment. This is the default value.

[0138] SLA constraints, or Service Level Agreement (SLA) constraints, include link latency constraints and link resource constraints, where link resources can be link bandwidth.

[0139] Specifically, the SLA constraints are:

[0140]

[0141] in, Indicates physical link Link latency, Indicates the target virtual link Maximum allowable delay Indicates physical link Current remaining resources, Indicates virtual link resource requirements, E represents the current shortest path. V The adjacency matrix represents the connection relationships of virtual nodes in the V-th network slice. Represents the virtual node in the Vth network slice. and Virtual links between N V This represents the set of virtual nodes in the V-th network slice. This represents a link mapping variable, if the virtual link... Mapped to physical link Above, then otherwise,

[0142] That is, the sum of the physical path delays of the selected shortest path must be less than the maximum allowable delay of the virtual link in the network slice, and the bandwidth must be greater than the virtual link requirement.

[0143] S11423. If none of the K shortest paths satisfy the SLA constraint, then there is no physical path from the parent physical node to the current candidate physical node that satisfies the resource requirements of the target virtual link.

[0144] After each network slice in the network slice set is pre-deployed, the mapping parameters are optimized based on the pre-deployment situation to improve slice acceptance rate and resource efficiency.

[0145] Specifically, the objective function optimized in step S12 is:

[0146]

[0147]

[0148] in, Represents physical nodes The current remaining resources, R T This represents the total resources of the nodes in the underlying physical network. Indicates physical link The current remaining resources, B T This represents the total link bandwidth resources of the underlying physical network. This represents the i-th node in the V-th network slice of the network slice set. resource requirements, Indicates virtual link Resource requirements, N V Let E represent the set of virtual nodes in the V-th network slice. V The adjacency matrix represents the connection relationships between virtual nodes in the V-th network slice. Represents the virtual node in the Vth network slice. and Virtual links between N P E represents the set of physical nodes. P The adjacency matrix, h, represents the connection relationships between physical nodes. (z) Let f represent the set of mapping parameter variables fitted in the z-th search, M represent the number of mapping parameters, and f PSO (h (z) ) represents the network slice deployment resource efficiency measured by the z-th search fit, N NSR This represents the number of network slices in the network slice set; mV This represents a pre-deployed mapping variable. Its value is 1 if the Vth network slice is successfully deployed, and 0 otherwise.

[0149] In implementation, particle swarm optimization (PSO) can be used to optimize the mapping parameters, where the x-th particle in the PSO is denoted as h. x =[h x,1 ,h x,2 ,..,h x,M After the algorithm finishes, the parameter values ​​corresponding to the optimal particle are the optimal mapping parameters.

[0150] By jointly optimizing the mapping parameters of node mapping and link mapping, the efficient scheduling and configuration of resources can be improved, thereby enhancing resource efficiency and maximizing support for more network slicing needs.

[0151] Based on the optimal mapping parameters, for each network slice in the network slice set, the importance of each physical node in the physical network and each virtual node in the network slice is recalculated based on the multi-attribute decision method, and each virtual node in the network slice is deployed based on the importance of each virtual node.

[0152] Specifically, in step S13, the importance of each physical node is recalculated based on the optimal mapping parameters using the same process as steps S111-S113. For each network slice in the network slice set, the importance of each virtual node is recalculated based on the optimal mapping parameters using the same process as steps S1111-S1113. Then, each virtual node of each network slice is redeployed according to the process of steps S112-S114. Since the mapping parameters at this time are the optimal mapping parameters obtained with the optimization objective of maximizing the resource efficiency of the network slice set, resource efficiency can be maximized, and the slice acceptance rate can be increased.

[0153] When deploying each network slice in the network slice set in descending order of importance based on the optimal mapping parameters, there may still be slices that fail to deploy. Successfully deployed network slices need to be reconstructed, and congested physical nodes need to be cleared to improve the acceptance rate of network slices.

[0154] In step S2, the congested physical nodes causing deployment failure are identified using the following method:

[0155] S21. If the current virtual node is the root node of the search tree corresponding to the current network slice, then the congested physical node is a physical node that conforms to the mapping rules of the current virtual node but does not meet the resource requirements of the current virtual node.

[0156] S22. If the current virtual node is a non-root node of the search tree corresponding to the current network slice, then the physical node mapped by the parent virtual node of the current virtual node is taken as the parent physical node, and the congested physical node is the physical node among the neighbor nodes of the parent physical node that conforms to the mapping rules of the current virtual node but does not meet the resource requirements of the current virtual node.

[0157] The search tree corresponding to the current network slice is the search tree constructed in step S13 according to the same process as in step S112, based on the recalculated node importance.

[0158] Specifically, the mapping rules for virtual nodes are the same as those in step S1131, namely: access virtual nodes in network slices are mapped to the access side of the physical infrastructure network, transmission virtual nodes are mapped to the transmission network, core virtual nodes are mapped to the core network, and user plane functions (UPF) and control planes in the core network of uRLLC type network slices are decoupled and mapped to edge data center nodes on the access network side.

[0159] If the current virtual node is the root node in the search tree, then the congested physical node is a physical node that conforms to the mapping rules of the current virtual node but does not meet the resource requirements of the current virtual node.

[0160] Current virtual node If a node is a non-root node in the search tree, its parent node (parent virtual node) in the search tree is: Parent virtual node The physical node mapped The parent physical node of the current virtual node. The congested physical node is... Among the neighboring nodes, physical nodes that conform to the mapping rules of the current virtual node but do not meet the resource requirements of the current virtual node. During implementation, The neighboring node is the k-hop neighbor node, for example, k=2.

[0161] After obtaining the congested physical nodes, they are sorted in descending order of congestion severity, with the first congested node in the sorted list designated as the current congested physical node. The congestion severity of each node is calculated by considering both its overload and the load of its connected physical links. Specifically, the congestion severity C of each physical node is calculated using the following formula. degree :

[0162]

[0163] in, This represents the i-th node in the V-th network slice. The resource requirements, the Vth network slice is the currently failed network slice, and the i-th node For the current virtual node that failed to deploy, This represents the i'-th node in the V'-th network slice. resource requirements, Represents physical nodes The initial total resources, N V Let N represent the set of virtual nodes in the V-th network slice. V' Let V' represent the set of virtual nodes in the V'-th network slice. Indicates physical link Current remaining resources, Indicates physical link The initial total resources, Indicates the current congested physical node A set of connected physical links. If the virtual nodes in the V'-th virtual slice... Successfully deployed to physical nodes Above, then Otherwise

[0164] For network slices that have been successfully deployed, sort them in order of importance from low to high, and take the first successfully deployed network slice after sorting as the currently successfully deployed network slice.

[0165] Specifically, the importance of network slices can be determined by referring to the calculation process in step S10.

[0166] Specifically, in step S3, the following method is used to determine whether the currently deployed network slice can be reconfigured for the currently congested physical node:

[0167] S31. Construct a set of virtual nodes to be migrated using the virtual nodes deployed on the currently congested physical node in the currently successfully deployed network slice as the nodes to be migrated, and construct a set of candidate physical nodes to be migrated using the neighbor nodes of the currently congested physical node as the candidate physical nodes to be migrated.

[0168] Specifically, assuming the current congested physical node is If the currently successfully deployed network slice is the "V"th network slice, then the network slice deployed (i.e. mapped to) the currently congested physical node is located in the "V"th network slice. The virtual nodes on the network are the nodes to be migrated, and a set of virtual nodes to be migrated τ is constructed. v .

[0169] Current congested physical nodes To construct a set τ of candidate physical nodes for migration from the neighboring nodes of the node. p In practice, neighboring nodes are k-hop neighbors, for example, k=2.

[0170] If the set of virtual nodes to be migrated is τv The virtual nodes in the currently successfully deployed network slice do not affect the currently congested physical nodes. For the currently congested physical nodes, the currently successfully deployed network slice cannot be reconfigured.

[0171] S32. Determine whether the resource slack generated by the virtual nodes to be migrated in the set of virtual nodes to be migrated is greater than or equal to the resource deficit generated after the current congested physical node is added to the current virtual node. If not, the network slice that has been successfully deployed cannot be reconfigured; otherwise, proceed to step S33.

[0172] Specifically, determine whether the slack amount is greater than or equal to the resource deficit using the following formula.

[0173]

[0174] The left side of the formula represents the resource deficit generated after the current congested physical node is added to the current virtual node, and the right side of the formula represents the resource slack generated by moving the nodes to be migrated in the set of virtual nodes to be migrated.

[0175] in, This represents the i-th node in the V-th network slice. The resource requirements, the Vth network slice is the currently failed network slice, and the i-th node For the current virtual node that failed to deploy, This represents the i'-th node in the V'-th network slice. resource requirements, Represents physical nodes The initial total resources, N V Let N represent the set of virtual nodes in the V-th network slice. V' Let V' represent the set of virtual nodes in the V'-th network slice. Indicates the current congested physical nodes The initial total resources, This represents the j-th node in the V-th network slice. The resource requirements are defined, and the V”th network slice is the currently successfully deployed network slice. If the virtual nodes in the V’th virtual slice... Successfully deployed to physical nodes Above, then otherwise

[0176] If the slack is less than the resource deficit, meaning that even after clearing the current physical nodes, the resource requirements of the current virtual nodes still cannot be met, then the currently deployed network slice cannot be reconstructed; otherwise, further judgment is made according to step S33.

[0177] S33. Determine whether each virtual node to be migrated in the set of virtual nodes to be migrated can be migrated to a physical node in the set of candidate physical nodes to be migrated. If the resource slack generated by all the virtual nodes to be migrated that can be migrated to the physical nodes in the set of candidate physical nodes to be migrated is less than the resource deficit, then the currently deployed network slice is not reconfigurable; otherwise, the currently deployed network slice is reconfigurable.

[0178] Specifically, the following method is used to determine whether each virtual node in the set of virtual nodes to be migrated can be migrated to a physical node in the set of candidate physical nodes to be migrated:

[0179] S331. Sort the virtual nodes to be migrated in the set of virtual nodes to be migrated in order of increasing migration cost;

[0180] Specifically, the migration cost for each node to be migrated is calculated using the following formula.

[0181] in, Indicates the node to be migrated The migration cost for a given node type is related to the degree of node sharing and the node's position in the network topology. Indicates the node to be migrated Resource requirements. Indicates the node to be migrated A collection of connected virtual links. Indicates virtual link Resource requirements.

[0182] S332. For each node to be migrated, the physical node mapped by the parent virtual node of the current node to be migrated is the parent physical node, and the virtual link between the current node to be migrated and the parent virtual node of the current node to be migrated is the virtual link to be migrated. The physical nodes in the candidate migration physical node set that meet the resource requirements of the current node to be migrated constitute the target candidate migration physical node set.

[0183] S333. If there is a physical node in the target candidate migration physical node set whose path to the parent physical node satisfies the resource requirements of the virtual link to be migrated, then the current node to be migrated can be migrated to a physical node in the candidate migration physical node set; otherwise, the current node to be migrated cannot be migrated to a physical node in the candidate migration physical node set.

[0184] Specifically, in step S333, the following method is used to determine whether there exists a physical node in the target candidate migration physical node set whose path to the parent physical node satisfies the resource requirements of the virtual link to be migrated:

[0185] S3331. Sort the physical nodes in the target candidate migration physical node set in ascending order of node load; take the first physical node in the sorted target candidate migration physical node set as the current target physical node.

[0186] Specifically, the calculation of node load can be referred to step S1141.

[0187] S3332. Determine whether there is a path in the physical path from the parent physical node to the current target physical node that meets the resource requirements of the virtual link to be migrated. If there is, then there is a physical node in the target candidate migration physical node set whose path with the parent physical node meets the resource requirements of the virtual link to be migrated. Otherwise, take the next physical node in the target candidate migration physical node set as the current target physical node and return to step S3332.

[0188] S3333. If there is no physical path from the parent physical node to each target physical node in the target candidate migration physical node set that satisfies the resource requirements of the virtual link to be migrated, then there is no physical node in the target candidate migration physical node set whose path to the parent physical node satisfies the resource requirements of the virtual link to be migrated.

[0189] Specifically, in step S3332, determining whether there is a path in the physical path from the parent physical node to the current target physical node that meets the resource requirements of the virtual link to be migrated can be done using the same process as in steps S1421-S1423, which will not be repeated here.

[0190] For the currently congested physical node, if the currently deployed network slice is reconfigurable, then the currently deployed network slice is reconfigured. Following the process in step S33, the target physical node corresponding to each node to be migrated is found, and the node is mapped to the corresponding physical node. The virtual links to be migrated are also mapped to physical links that meet their resource requirements. At this time, the resource slack generated by all the nodes to be migrated to the physical nodes in the candidate migration physical node set is greater than or equal to the resource deficit. Therefore, the current virtual node of the current network slice, i.e., the virtual node that failed to deploy, can be deployed to the currently congested physical node. Then, the current virtual node is redeployed. After the current virtual node is deployed, the next virtual node of the current network slice is deployed. If the next virtual node deployment fails, the process returns to step S2 for reconfiguration.

[0191] If the currently deployed network slice is not reconfigurable, then the next successfully deployed network slice is taken as the current successfully deployed network slice, and the process returns to step S3; if there is no next successfully deployed network slice in the network slice set, then the next congested physical node is taken as the current congested physical node, and the process returns to step S3.

[0192] For all congested physical nodes, if all successfully deployed network slices are unreconstructable, then the current network slice deployment has completely failed, and the deployment of the current network slice is rejected.

[0193] Those skilled in the art will understand that all or part of the processes of the methods described in the above embodiments can be implemented by a computer program instructing related hardware, and the program can be stored in a computer-readable storage medium. The computer-readable storage medium may be a disk, optical disk, read-only memory, or random access memory, etc.

[0194] The above description is only a preferred embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any changes or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for deploying and reconstructing network slices, characterized in that, Includes the following steps: The network slices in the network slice set are sorted in descending order of importance, and each virtual node in each network slice is deployed in order. If the current virtual node of the current network slice fails to deploy, the congested physical node that caused the deployment failure is identified, and the congested physical nodes are sorted in descending order of congestion, with the first congested physical node in the sorted list being the current congested physical node; the successfully deployed network slices are sorted in ascending order of importance, with the first successfully deployed network slice in the sorted list being the current successfully deployed network slice. Reconfigurability determination: For the currently congested physical node, if the currently deployed network slice is reconfigurable, then the currently deployed network slice is reconfigured and the current virtual node of the current network slice is redeployed; Otherwise, the next successfully deployed network slice is taken as the current successfully deployed network slice, and the reconfigurability judgment step is returned; if there is no next successfully deployed network slice, the next congested physical node is taken as the current congested physical node, and the reconfigurability judgment step is returned. If there is no successfully deployed network slice that can be reconfigured for each congested physical node, then the deployment of the current network slice is rejected. The following method is used to determine whether a currently deployed network slice can be reconfigured for a currently congested physical node: A set of virtual nodes to be migrated is constructed using the virtual nodes deployed on the currently congested physical node in the currently successfully deployed network slice as the nodes to be migrated, and a set of candidate physical nodes to be migrated is constructed using the neighbor nodes of the currently congested physical node as the candidate physical nodes to be migrated. Determine whether the resource slack generated by the virtual nodes to be migrated in the set of virtual nodes to be migrated is greater than or equal to the resource deficit generated after the current congested physical node is added to the current virtual node. If not, the network slice that was successfully deployed cannot be reconfigured. otherwise: Determine whether each virtual node to be migrated in the set of virtual nodes to be migrated can be migrated to a physical node in the set of candidate physical nodes to be migrated. If the resource slack generated by all the virtual nodes to be migrated that can be migrated to the physical nodes in the set of candidate physical nodes to be migrated is less than the resource deficit, then the currently deployed network slice is not reconfigurable; otherwise, the currently deployed network slice is reconfigurable.

2. The network slice deployment and reconstruction method according to claim 1, characterized in that, The following methods are used to identify congested physical nodes that are causing deployment failures: If the current virtual node is the root node of the search tree corresponding to the current network slice, then the congested physical node is a physical node that conforms to the mapping rules of the current virtual node but does not meet the resource requirements of the current virtual node. If the current virtual node is a non-root node of the search tree corresponding to the current network slice, then the physical node mapped by the parent virtual node of the current virtual node is taken as the parent physical node, and the congested physical node is taken as the physical node among the neighbor nodes of the parent physical node that meets the mapping rules of the current virtual node but does not meet the resource requirements of the current virtual node.

3. The network slice deployment and reconstruction method according to claim 1, characterized in that, The following method is used to determine whether each virtual node in the set of virtual nodes to be migrated can be migrated to a physical node in the set of candidate physical nodes to be migrated: Sort the virtual nodes to be migrated in the set of virtual nodes to be migrated in ascending order of migration cost; For each node to be migrated, the physical node mapped by the parent virtual node of the current node to be migrated is the parent physical node, and the virtual link between the current node to be migrated and its parent virtual node is the virtual link to be migrated. The physical nodes in the candidate migration physical node set that meet the resource requirements of the current node to be migrated constitute the target candidate migration physical node set. If there is a physical node in the target candidate migration physical node set whose path to the parent physical node satisfies the resource requirements of the virtual link to be migrated, then the current node to be migrated can be migrated to a physical node in the candidate migration physical node set; otherwise, the current node to be migrated cannot be migrated to a physical node in the candidate migration physical node set.

4. The network slice deployment and reconstruction method according to claim 3, characterized in that, The migration cost for each node to be migrated is calculated using the following formula. : in, Indicates the node to be migrated Resource requirements; Indicates the node to be migrated The migration cost for the corresponding node type; Indicates the node to be migrated A collection of connected virtual links; Indicates virtual link Resource requirements.

5. The network slice deployment and reconstruction method according to claim 3, characterized in that, The following method is used to determine whether there exists a physical node in the target candidate migration physical node set whose path to the parent physical node satisfies the resource requirements of the virtual link to be migrated: S3331. Sort the physical nodes in the target candidate migration physical node set in ascending order of node load; take the first physical node in the sorted target candidate migration physical node set as the current target physical node; S3332. Determine whether there is a path in the physical path from the parent physical node to the current target physical node that meets the resource requirements of the virtual link to be migrated. If there is, then there is a physical node in the target candidate migration physical node set whose path with the parent physical node meets the resource requirements of the virtual link to be migrated. Otherwise, take the next physical node in the target candidate migration physical node set as the current target physical node and return to step S3332. S3333. If there is no physical path from the parent physical node to each physical node in the target candidate migration physical node set that satisfies the resource requirements of the virtual link to be migrated, then there is no physical node in the target candidate migration physical node set whose path to the parent physical node satisfies the resource requirements of the virtual link to be migrated.

6. The network slice deployment and reconstruction method according to claim 5, characterized in that, The following method is used to determine whether there exists a path in the physical path from the parent physical node to the current target physical node that meets the resource requirements of the virtual link to be migrated: The search based on Dijkstra's algorithm yields the path from the parent physical node to the current target physical node. K The shortest path; Traverse sequentially according to path cost from smallest to largest. K For each shortest path in the shortest path, if the current shortest path satisfies the SLA constraint, then the current shortest path is the shortest path that satisfies the resource requirements of the virtual link to be migrated, and the traversal ends; otherwise, continue traversing the next shortest path. like K If none of the shortest paths satisfy the SLA constraint, then there is no physical path from the parent physical node to the current target physical node that satisfies the resource requirements of the virtual link to be migrated.

7. The network slice deployment and reconstruction method according to claim 1, characterized in that, Deploy each virtual node in each network slice sequentially, including: For each network slice in the network slice set, the importance of each physical node in the physical network and each virtual node in the network slice is calculated based on the multi-attribute decision method. Based on the importance of each node, each virtual node in the network slice is pre-deployed. The mapping parameters in the pre-deployment are optimized with the goal of maximizing the resource efficiency of the network slice set, so as to obtain the optimal mapping parameters; For each network slice in the network slice set, based on the optimal mapping parameters, the importance of each physical node in the physical network and each virtual node in the network slice is recalculated using a multi-attribute decision method. Based on the importance of each node, each virtual node in the network slice is deployed.

8. The network slice deployment and reconstruction method according to claim 7, characterized in that, The objective function to be optimized is: in, Represents physical nodes The current remaining resources, This represents the total resources of the nodes in the underlying physical network. Indicates physical link The current remaining resources, This represents the total link bandwidth resources of the underlying physical network. Represents the first segment in the set of network slices. V In the network slice, the first i Nodes resource requirements, Indicates virtual link resource requirements, Indicates the first V A set of virtual nodes in a network slice. Indicates the first V The adjacency matrix of virtual nodes in a network slice. Indicates the first V Virtual nodes in a network slice and Virtual links between them Represents a set of physical nodes. An adjacency matrix representing the connection relationships between physical nodes. Indicates the first z The set of mapping parameter variables for the second search fit. M Indicates the number of mapping parameters. Indicates the first z The resource efficiency of network slice deployment is measured by the second search fit. This indicates the number of network slices in the network slice set; Represents the pre-deployed mapping variable, if the first V The value is 1 if a network slice is successfully deployed, otherwise the value is 0.

9. The network slice deployment and reconstruction method according to claim 6, characterized in that, Pre-deployment of each virtual node in the network slice based on the importance of each virtual node, including: Using the virtual node with the highest importance in the network slice as the root node, construct the search tree of the network slice based on the breadth-first search algorithm; For each virtual node in the search tree, construct the final set of candidate physical nodes for the current virtual node based on its autonomous system type and resource requirements; If the current virtual node is the root node of the search tree, then select the physical node with the highest importance from the final candidate physical node set of the current virtual node as the mapping node of the current virtual node. If the current virtual node is a non-root node of the search tree, then the physical node mapped by the parent virtual node of the current virtual node is taken as the parent physical node, and the virtual link between the current virtual node and the parent virtual node of the current virtual node is taken as the target virtual link. From the final set of candidate physical nodes, candidate physical nodes whose paths with the parent physical nodes meet the resource requirements of the target virtual link are selected as the mapping nodes of the current virtual node.

Images