Cross-domain network slice reconstruction method and device, equipment, medium and program product

Abstract

The invention relates to the technical field of communication, in particular to a cross-domain network slice reconstruction method and device, equipment, a medium and a program product, and the method comprises the steps: calculating the importance value of each node in a current network slice demand according to a pre-constructed network slice demand model, and generating a node mapping sequence between the nodes; in combination with the network slice demand model and the node mapping sequence, searching nodes which simultaneously meet virtual node mapping conditions and cross-domain network domain constraint conditions in the physical node set to obtain an initial candidate physical node set; performing node mapping, and when the node mapping fails, activating a slice reconstruction mechanism to generate a candidate migration node set; and utilizing the candidate migration node set to obtain a complete migration physical node set required by the current network slice, and realizing slice reconstruction. Therefore, the problems that in the related technology, the success rate of the network slices is low, and along with increase of the number of the slices, the computing efficiency of network slice deployment is low, and consumed time is long are solved.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a method, device, equipment, medium and program product for reconstructing a cross-domain network slice. Background Art

[0002] The deployment or maintenance of network slices involves the scheduling of network virtual resources, and the successful deployment of network slices is a prerequisite for network slice service providers to gain revenue. However, during the deployment or maintenance of network slices, network slice deployment may sometimes fail due to changes in business requirements or network resource congestion. In addition, if the scheduling of network virtual resources remains unchanged, subsequent network slices may fail to be deployed due to insufficient resources.

[0003] In related technologies, in order to cope with changes in slice service requirements, in addition to adjusting the deployment strategy of network slices, slice reconstruction can also be performed after network slice mapping fails. It is understandable that in the network slice collaborative deployment scenario, network slice deployment failure often occurs in the node mapping stage of slice deployment. Therefore, slice reconstruction needs to dredge the physical nodes that cause resource congestion and re-migrate the virtual nodes carried on the congested nodes to physical nodes with lower loads to facilitate the carrying of subsequent virtual nodes.

[0004] However, in the related technology, only the virtual node migration cost of the slice is considered, and the load balancing of the physical basic network cannot be achieved, resulting in a low success rate of network slicing. In addition, as the number of slices increases, the computational efficiency of network slicing deployment is low and time-consuming, and the robustness of the slice deployment system is poor, which urgently needs to be improved. Summary of the invention

[0005] The present application provides a method, device, equipment, medium and program product for reconstructing a cross-domain network slice to solve the problem in the related art that only the virtual node migration cost of the slice is considered, the load balancing of the physical basic network cannot be achieved, and the success rate of network slicing is low. In addition, as the number of slices increases, the computational efficiency of network slice deployment is low, the time consumption is long, and the robustness of the slice deployment system is poor.

[0006] In a first aspect, an embodiment of the present application provides a method for reconstructing a cross-domain network slice, the method comprising the following steps: obtaining all network slicing requirements in the cross-domain network, and calculating the virtual importance value of each virtual node and the physical importance value of each physical node in the current network slicing requirement according to a pre-built network slicing requirement model, so as to obtain a node mapping sequence between the virtual node and the physical node according to the virtual importance value and the physical importance value; combining the network slicing requirement model and the node mapping sequence, searching for at least one initial candidate physical node in a physical node set that satisfies both the virtual node mapping condition and the cross-domain network domain constraint condition, so as to obtain an initial candidate physical node set corresponding to the current network slicing requirement based on the at least one initial candidate physical node; performing a node mapping operation on the virtual node and the physical node set based on the initial candidate physical node set. The node mapping between the initial candidate physical nodes is performed, and in the case of node mapping failure, the congested physical node set and the overloaded physical node set in the current network slicing requirement are obtained, and the node mapping is re-performed using the slice reconstruction mechanism to obtain the candidate migration physical node set and the candidate migration virtual node set, wherein the slice reconstruction mechanism includes using the congested physical node set and the overloaded physical node set to generate a reconstructed physical node set for the current network slicing requirement, and determining the candidate migration physical node set and the candidate migration virtual node set based on the reconstructed physical node set; using the candidate migration physical node set and the candidate migration virtual node set to obtain the complete migration physical node set for the current network slicing requirement, so as to redeploy the current network slicing requirement according to the complete migration physical node set to achieve the reconstruction of the current network slicing requirement.

[0007] Optionally, in one embodiment of the present application, the network slicing requirement model and the node mapping sequence are combined to search for at least one initial candidate physical node in the physical node set that satisfies both the virtual node mapping conditions and the cross-domain network domain constraint conditions, so as to obtain the initial candidate physical node set corresponding to the current network slicing requirement based on the at least one initial candidate physical node, including: combining the network slicing requirement model and the node mapping sequence to screen out the set of candidate physical nodes that meet the virtual node mapping conditions from the physical node set; combining the virtual node and the cross-domain network domain constraint conditions to obtain the at least one initial candidate physical node using the set of candidate physical nodes, and using the at least one initial candidate physical node as the root node to generate the initial candidate physical node set.

[0008] Optionally, in one embodiment of the present application, determining the candidate migration physical node set and the candidate migration virtual node set of the current network slicing requirement based on the reconstructed physical node set includes: calculating the resource congestion degree of each reconstructed physical node in the reconstructed physical node set using the node resource difference and the physical link utilization; sorting all the reconstructed physical nodes in the reconstructed physical node set according to the resource congestion degree to obtain a candidate migration physical node set whose reconstructed physical nodes meet a preset order; judging whether the mapped virtual nodes corresponding to the candidate migration physical nodes in the candidate migration physical node set meet preset migration conditions; if the mapped virtual nodes meet the preset migration conditions, using the mapped virtual nodes to form an initial candidate migration virtual node set to obtain the candidate migration virtual node set, and obtaining a candidate migration virtual link set and a candidate migration physical link set based on the preset link requirement.

[0009] Optionally, in one embodiment of the present application, the method of using the candidate migration physical node set and the candidate migration virtual node set to obtain the complete set of incoming physical nodes required by the current network slice includes: using the candidate migration virtual nodes in the candidate migration virtual node set to obtain the bearer physical node to which the candidate migration virtual node is mapped; determining the neighborhood physical node set corresponding to the candidate migration virtual node based on the bearer physical node and the candidate migration physical node set; constructing a destruction operator based on the neighborhood physical node set, and calculating the destruction node set and the initial neighborhood candidate physical node set corresponding to the neighborhood physical node set through the destruction operator; constructing a repair operator based on the destruction node set, and repairing the initial neighborhood candidate physical node set through the repair operator to obtain the neighborhood candidate physical node set; calculating the migration burden of each neighborhood candidate physical node in the neighborhood candidate physical node set to generate the complete set of incoming physical nodes based on the migration burden, wherein the migration burden may include but is not limited to consumed computing resources, increased link latency, and temporary memory requirements and bandwidth consumption.

[0010] Optionally, in one embodiment of the present application, the calculation formula for the complete migrated physical node set may be, but is not limited to,:

[0011]

[0012] in, is the set of damaged nodes after k rounds of neighborhood iterative search, is the set of physical nodes in the selected neighborhood after k rounds of neighborhood iterative search. After k rounds of neighborhood iterative search, the set of physical nodes in the repaired neighborhood is: It is the set of candidate physical nodes in the neighborhood after k rounds of neighborhood iterative search.

[0013] According to a second aspect of the present application, an embodiment provides a device for reconstructing a cross-domain network slice, the device comprising: an acquisition module, used to acquire all network slicing requirements in the cross-domain network, and calculate the virtual importance value of each virtual node and the physical importance value of each physical node in the current network slicing requirement according to a pre-built network slicing requirement model, so as to obtain a node mapping sequence between the virtual node and the physical node according to the virtual importance value and the physical importance value; a generation module, used to combine the network slicing requirement model and the node mapping sequence, search for at least one initial candidate physical node in a physical node set that satisfies both the virtual node mapping condition and the cross-domain network domain constraint condition, so as to obtain an initial candidate physical node set corresponding to the current network slicing requirement based on the at least one initial candidate physical node; a determination module, used to perform the virtual node mapping based on the initial candidate physical node set. Node mapping between the virtual node and the initial candidate physical node, and in the case of node mapping failure, obtaining the congested physical node set and the overloaded physical node set in the current network slicing requirement, and re-mapping the nodes using a slice reconstruction mechanism to obtain a candidate migration physical node set and a candidate migration virtual node set, wherein the slice reconstruction mechanism includes using the congested physical node set and the overloaded physical node set to generate a reconstructed physical node set for the current network slicing requirement, and determining the candidate migration physical node set and the candidate migration virtual node set based on the reconstructed physical node set; a reconstruction module is used to obtain a complete migration physical node set for the current network slicing requirement using the candidate migration physical node set and the candidate migration virtual node set, so as to redeploy the current network slicing requirement according to the complete migration physical node set to achieve the reconstruction of the current network slicing requirement.

[0014] Optionally, in one embodiment of the present application, the generation module includes: a screening unit, used to combine the network slicing requirement model and the node mapping sequence to screen out a set of candidate physical nodes that meet the virtual node mapping conditions from the physical node set; a first generation unit, used to combine the virtual node and the cross-domain network domain constraint conditions, use the candidate physical node set to obtain the at least one initial candidate physical node, and use the at least one initial candidate physical node as the root node to generate the initial candidate physical node set.

[0015] Optionally, in one embodiment of the present application, the determination module includes: a first calculation unit, used to calculate the resource congestion level of each reconstructed physical node in the reconstructed physical node set by using the node resource difference and the physical link utilization; a sorting unit, used to sort all the reconstructed physical nodes in the reconstructed physical node set according to the resource congestion level to obtain a set of candidate migration physical nodes whose reconstructed physical nodes meet a preset order; a judgment unit, used to judge whether the mapped virtual nodes corresponding to the candidate migration physical nodes in the candidate migration physical node set meet the preset migration conditions; a determination unit, used to form an initial candidate migration virtual node set using the mapped virtual nodes when the mapped virtual nodes meet the preset migration conditions to obtain the candidate migration virtual node set, and obtain a candidate migration virtual link set and a candidate migration physical link set based on the preset link requirements.

[0016] Optionally, in one embodiment of the present application, the reconstruction module includes: a second generation unit, used to obtain the bearing physical node to which the candidate migration virtual node is mapped using the candidate migration virtual node in the candidate migration virtual node set; a third generation unit, used to determine the neighborhood physical node set corresponding to the candidate migration virtual node based on the bearing physical node and the candidate migration physical node set; a first construction unit, used to construct a destruction operator based on the neighborhood physical node set, and calculate the destruction node set and the initial neighborhood candidate physical node set corresponding to the neighborhood physical node set through the destruction operator; a second construction unit, used to construct a repair operator based on the destruction node set, and repair the initial neighborhood candidate physical node set through the repair operator to obtain the neighborhood candidate physical node set; a second calculation unit, used to calculate the migration burden of each neighborhood candidate physical node in the neighborhood candidate physical node set, so as to generate the complete migration physical node set based on the migration burden, wherein the migration burden may include but is not limited to consumed computing resources, increased link latency, and temporary memory requirements and bandwidth consumption.

[0017] Optionally, in one embodiment of the present application, the calculation formula for the complete migrated physical node set may be, but is not limited to,:

[0018]

[0019] in, is the set of damaged nodes after k rounds of neighborhood iterative search, is the set of physical nodes in the selected neighborhood after k rounds of neighborhood iterative search. After k rounds of neighborhood iterative search, the set of physical nodes in the repaired neighborhood is: It is the set of candidate physical nodes in the neighborhood after k rounds of neighborhood iterative search.

[0020] The third aspect of the present application provides an electronic device, comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor executes the program to implement the cross-domain network slice reconstruction method as described in the above embodiment.

[0021] The fourth aspect embodiment of the present application provides a computer-readable storage medium, which stores a computer program, and when the program is executed by a processor, it implements the above-mentioned cross-domain network slice reconstruction method.

[0022] The fifth aspect embodiment of the present application provides a computer program product, including a computer program, which, when executed, implements the above-mentioned cross-domain network slice reconstruction method.

[0023] The embodiment of the present application evaluates the importance of nodes required by network slicing, obtains a node mapping sequence between nodes, and triggers a network slice reconstruction mechanism when node mapping fails, determines the candidate migration node set required by the current network slice, and then obtains a complete set of physical nodes required to migrate to the current network slice, thereby realizing the reconstruction of the network slice. It can not only balance the network load and reduce the migration cost in the cross-domain network slice deployment scenario, but also effectively improve the efficiency of neighborhood search and slice reconstruction. Thus, it solves the problem that only the migration cost of the virtual node of the slice is considered in the related technology, and the load balancing of the physical basic network cannot be achieved, resulting in a low success rate of network slicing. In addition, as the number of slices increases, the computational efficiency of network slice deployment is low, the time consumption is long, and the robustness of the slice deployment system is poor.

[0024] Additional aspects and advantages of the present application will be given in part in the description below, and in part will become apparent from the description below, or will be learned through the practice of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] The above and / or additional aspects and advantages of the present application will become apparent and easily understood from the following description of the embodiments in conjunction with the accompanying drawings, in which:

[0026] Figure 1 A block diagram of a cross-domain network slice reconstruction system is provided according to an embodiment of the present application;

[0027] Figure 2 A flowchart of a method for reconstructing a cross-domain network slice according to an embodiment of the present application;

[0028] Figure 3A flowchart of node importance evaluation of an AEC (Adversarial Extract Champion Method)-VIKOR (VlseKriterijumska Optimizacija I KompromisnoResenje) mechanism according to an embodiment of the present application;

[0029] Figure 4 A flowchart of a breadth-first algorithm provided according to an embodiment of the present application;

[0030] Figure 5 A flowchart of determining a candidate migration node set according to a reconstructed physical node set provided according to an embodiment of the present application;

[0031] Figure 6 A flowchart of generating a complete set of migrated physical nodes based on an ALNS (Adaptive Large Neighborhood Search) algorithm according to an embodiment of the present application;

[0032] Figure 7 A flowchart of the working principle of a method for reconstructing a cross-domain network slice according to an embodiment of the present application;

[0033] Figure 8 A block diagram of a device for reconstructing a cross-domain network slice according to an embodiment of the present application;

[0034] Fig. 9 It is a schematic diagram of the structure of an electronic device provided according to an embodiment of the present application. DETAILED DESCRIPTION

[0035] Embodiments of the present application are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to be used to explain the present application, and should not be construed as limiting the present application.

[0036] The following describes the reconstruction method, device, equipment, medium and program product of the cross-domain network slice of the embodiment of the present application with reference to the accompanying drawings. In view of the fact that only the virtual node migration cost of the slice is considered in the above background technology, the load balancing of the physical basic network cannot be achieved, resulting in a low success rate of network slicing. In addition, as the number of slices increases, the computational efficiency of network slice deployment is low, the time consumption is long, and the robustness of the slice deployment system is poor. The present application provides a cross-domain network slice reconstruction method. In this method, by evaluating the importance of the nodes required by the network slice, a node mapping sequence between nodes is obtained, and when the node mapping fails, the network slice reconstruction mechanism is triggered to determine the candidate migration node set required by the current network slice, and then obtain the complete set of physical nodes required to migrate to the current network slice, so as to achieve the reconstruction of the network slice, which can not only balance the network load and reduce the migration cost in the cross-domain network slice deployment scenario, but also effectively improve the efficiency of neighborhood search and slice reconstruction. This solves the problem in the related technology that only the virtual node migration cost of the slice is considered, and the load balancing of the physical basic network cannot be achieved, resulting in a low success rate of network slicing. In addition, as the number of slices increases, the computational efficiency of network slicing deployment is low, the time consumption is long, and the robustness of the slice deployment system is poor.

[0037] Before explaining the cross-domain network slice reconstruction method proposed in the embodiment of the present application, the cross-domain network slice reconstruction system involved in the embodiment of the present application is first introduced.

[0038] Specifically, Figure 1 A block diagram of a cross-domain network slice reconstruction system is provided according to an embodiment of the present application.

[0039] like Figure 1 As shown, in the cross-domain network slicing deployment and reconstruction system of the embodiment of the present application, the network slicing user submits a network slicing service request, and the network slicing demand model is instantiated according to the network slicing configuration file information. The instantiated network slicing demand is sorted according to the greedy priority to form a network slicing demand sequence, and then the network slicing demand is reordered using the slice configuration information and slice resource information in the sequence, and the slice deployment priority is divided to deploy the network slices according to the priority. If the slice deployment fails, the slice reconstruction mechanism will be triggered, and the node neighborhood search module will be called for the slice that failed to be deployed to complete the coordinated migration and reconstruction of the slice nodes and links, and the comprehensive slice priority evaluation strategy will realize the optimized sorting of the network slicing demand sequence, and complete the instantiation, orchestration and deployment of the slices on the physical infrastructure network.

[0040] It can be understood that the network slice of the embodiment of the present application is a logically isolated network deployed on a physical infrastructure network. The process of network slice deployment involves the allocation of slice resources, and it is necessary to obtain the abstracted physical network topology information of each network domain. Therefore, the embodiment of the present application is based on graph theory, and converts the basic network resources and physical network topology information into an undirected weighted graph, which can be represented by but not limited to: G P =(N P ,E P ,R T ,B T ,D P ), where N P Represents a collection of physical nodes, representing network functional units such as switches and routers in the physical infrastructure network. A single physical network node in the physical node collection is represented by express, In the cross-domain network infrastructure, the embodiment of the present application also considers the network domain constraints of the physical network. In the embodiment of the present application, the physical network includes two network domains, so the corresponding physical node sets also belong to two physical network domains A and physical network domain B, that is, They are managed by different slice agents and introduce the adjacency matrix E P , to represent the connection relationship of nodes in the physical network and the connection status of physical links. Each physical link is represented by That is, connecting physical network nodes and physical network nodes The physical link R T Indicates the computing resources that a physical node can provide. The total computing resources that can be provided are expressed as B T Indicates the bandwidth resources that a physical link can provide. The total bandwidth resources that can be provided are expressed as D P Indicates the delay of the physical link. The total transmission delay is expressed as It should be noted that the physical network infrastructure of the embodiment of the present application may include but is not limited to node computing resources, link bandwidth resources, link transmission delay, etc., and the present application does not impose any specific restrictions.

[0041] In addition, the network slicing requirement of the embodiment of the present application is a virtual network topology instantiated by the slice service provider according to the service profile provided by the slice service user, which is similar to the modeling of the basic physical network facility topology. Therefore, the embodiment of the present application can use an undirected weighted graph to represent the virtual network topology, which can be represented by but not limited to: G v =(Nv ,E v ,R v ,B v ,D v ),v≤K, where N v Represents a set of virtual topological nodes. A virtual node represents a virtual network functional unit of a network slice. A single virtual node i in each virtual node set is represented by express, Introduce the adjacency matrix E v Represents the connection relationship between virtual nodes in the virtual network topology. and virtual nodes The virtual link is represented as R v is the amount of computing resources required by the virtual node, Represents a virtual node The required computing resources, B v is the bandwidth resource required by the virtual link, represents the bandwidth resources required by the virtual link between virtual node i and virtual node j, D v Indicates the maximum end-to-end link transmission delay allowed by the network slice. Indicates link The maximum transmission delay allowed is N NSR Indicates the number of network topology requirements.

[0042] Exemplarily, the network slicing demand sequence that reaches the slicing service provider in the embodiment of the present application will execute the AEC-VIKOR mechanism to evaluate the topology of the virtual node set, and then perform node mapping according to the multi-dimensional cross-domain network slicing deployment algorithm based on load balancing. If the node mapping process fails, the slice node reconstruction mechanism is triggered to screen the migrated virtual node set, and then the node neighborhood search module calls the node neighborhood search algorithm based on the ALNS method to search for the target migrated physical node set. Finally, the collaborative deployment module calls the CLBC (Completed Local Binary Count) algorithm to collaboratively map the virtual nodes and links required by the network topology to complete the network slicing reconstruction process.

[0043] Specifically, Figure 2 This is a flowchart of a method for reconstructing a cross-domain network slice according to an embodiment of the present application.

[0044] like Figure 2 As shown, the reconstruction method of the cross-domain network slice includes the following steps:

[0045] In step S201, all network slicing requirements in the cross-domain network are obtained, and the virtual importance value of each virtual node and the physical importance value of each physical node in the current network slicing requirement are calculated according to a pre-built network slicing requirement model, so as to obtain a node mapping sequence between virtual nodes and physical nodes according to the virtual importance value and the physical importance value.

[0046] It is understandable that the embodiments of the present application can obtain network slicing requirements of different domains (which can be but not limited to: different geographical locations, operator networks or technical platforms, etc., and this application does not make specific restrictions). Among them, the network slicing requirements can include but are not limited to: virtual network functions, lists and their interconnection relationships, QoS (Quality of Service) indicators, etc., and this application does not make specific restrictions.

[0047] In addition, the embodiments of the present application can represent the acquired network slicing requirements by pre-building a network slicing requirement model.

[0048] As a possible implementation method, the embodiment of the present application can use the AEC-VIKOR mechanism to respectively evaluate all virtual nodes and physical nodes in the current network slice demand subnet to obtain the virtual importance value of each virtual node and the physical importance value of each physical node, and use the breadth-first search algorithm to traverse and sort the virtual nodes in the current network slice demand topology according to the virtual importance value and the physical importance, and generate a node mapping sequence between virtual nodes and physical nodes.

[0049] For example, the embodiment of the present application comprehensively considers the topological attributes and resource attributes of the nodes, and evaluates and ranks the importance of the nodes in the node mapping stage. It should be noted that the embodiment of the present application can use the AEC-VIKOR mechanism to evaluate the importance of the nodes, and its process is as follows: Figure 3 The specific contents are as follows:

[0050] Step S301: Greedily sort all network slice demand subnets based on QoS indicators.

[0051] It can be understood that the distribution of queues in the network controller of the embodiment of the present application is determined by the service mode and the QoS indicator. Assuming that the set of network slice requirements arriving is K={1,2,...,K},v∈K, the QoS indicator of its resource requirements is calculated, which can be but not limited to expressed as:

[0052]

[0053] Among them, R t Indicates the total computing resources of nodes required by the network slice, B trepresents the total bandwidth required by the network slice demand link, β represents the weighted parameter of the relative weight of link bandwidth and node resources, Indicates connecting two virtual nodes and If and If there is a link requirement between on the contrary,

[0054] Furthermore, the embodiment of the present application can greedily sort all network slicing requirements from large to small based on the NQ value to strengthen the priority and QoS requirements of the slice and improve the slicing success rate.

[0055] Step S302: Generate a normalized decision matrix.

[0056] Among them, the embodiment of the present application executes the network slicing demand slicing process one by one according to the QoS greedy sorting result, setting G v The resource view of the slice requirement of the vth network slice requirement is obtained by using the importance attribute value of the virtual node, and the virtual normalized decision matrix D is obtained, which can be but not limited to be expressed as:

[0057]

[0058] b ij =w j ·a ij ,i=1,2,L,N;j=1,2,L,L,

[0059] Among them, N represents the number of nodes in the network topology, L represents the number of evaluation indicators of the node, and a ij Represents the i-th virtual node The value of the relative evaluation index standard j, w j Represents the standard weight coefficient, the value range of the weight coefficient is [0,1], and the sum of all weight coefficients is 1. Among them, standard j includes the resource importance and topological importance of the node, and sets L node attribute features, which can include but are not limited to the resource importance value R of the node. I , the degree centrality value D of the node C , the closeness centrality value C of the node C , betweenness centrality B C , eigenvector centrality E C et al., Graph Element Analysis G A Etc., this application does not make specific limitations.

[0060] Step S303: Calculate the expected value and defect value of the node.

[0061] Among them, the embodiment of the present application calculates the virtual nodes respectively The expected value S i and the defect value R i , the calculation formula of the expected value and the defect value of the virtual node can be expressed as but not limited to:

[0062]

[0063] in, and are the positive and negative ideal solutions of D respectively.

[0064] Step S304: using the intercept method to fit and calculate the compromise coefficient value.

[0065] Among them, in the embodiment of the present application, it is possible to but The compromise coefficient The value of can be expressed as but not limited to:

[0066]

[0067] Step S305: Calculate the importance value of the node.

[0068] It is understandable that the embodiment of the present application can calculate each virtual node according to the obtained expected value, defect value and compromise coefficient value. The corresponding importance value T i , which can be expressed as but not limited to:

[0069]

[0070] in, is the compromise coefficient.

[0071] Step S306: Sort the importance of the nodes to obtain a final node sequence.

[0072] Among them, the embodiment of the present application can divide the decision interval according to the calculated compromise coefficient value, list the importance value of each decision interval, and sort them from small to large, perform clustering feature analysis, and in each decision interval, select the node with the highest probability as the characteristic node of each interval, and list the final node ranking of the virtual nodes.

[0073] Step S307: Repeat the above steps to generate a final node sequence of physical nodes.

[0074] It is understandable that the embodiment of the present application can obtain the topology information of the physical network topology for each physical node in the basic physical network topology. Repeat steps S302 to 306 to calculate each physical node in the physical network topology The importance value Ts , which can be expressed as but not limited to:

[0075]

[0076] Furthermore, after obtaining the virtual importance value and the physical importance value, the embodiment of the present application can use a breadth-first algorithm to arrange the virtual network topology nodes of the network demand model to obtain a node mapping sequence in the node mapping stage.

[0077] The flowchart of the breadth-first algorithm in the embodiment of the present application is as follows: Figure 4 As shown, the specific description is: find the sequence with the minimum importance value Virtual Node As the root node of the breadth-first algorithm search tree, put the root node at the top of the queue; use the breadth-first algorithm to traverse G v Topology, search for each layer of the current network slicing requirements, call the AEC-VIKOR mechanism, and select the appropriate layer based on the importance value. The sizes are arranged in ascending order, and the sorting result is returned to the virtual topology node set. Each node in the queue is taken out to determine whether the node is an unchecked child node. If so, the child node is added to the queue until all layers are executed and the final queue result is output.

[0078] In step S102, in combination with the network slicing requirement model and the node mapping sequence, at least one initial candidate physical node in the physical node set that satisfies both the virtual node mapping conditions and the cross-domain network domain constraint conditions is searched to obtain an initial candidate physical node set corresponding to the current network slicing requirement based on at least one initial candidate physical node.

[0079] As a possible implementation method, the embodiment of the present application searches for a set of candidate physical nodes in the physical node set that meet the virtual node mapping conditions of the current network slicing requirements based on the node mapping sequence according to the network configuration information of the current network slicing requirements in the network slicing requirement model. If the candidate physical node in the candidate physical node set meets the cross-domain network domain constraint condition, the candidate physical node is used as the initial candidate physical node in the initial candidate physical node set, thereby obtaining the initial candidate physical node set.

[0080] Among them, in the embodiment of the present application, according to the current virtual node type, a physical node that meets the virtual node mapping conditions (for example, node computing resource requirements, which are not specifically limited in the present application) can be selected from the set of candidate physical nodes for mapping. Specifically, in the embodiment of the present application, if the current virtual node is the root node of the breadth-first algorithm search tree, the virtual node is mapped to the physical node with the smallest node; if the current virtual node is not the root node, the virtual node is mapped to the node of the cross neighbor node set of the physical node set of the virtual parent node and the directly connected node, and the selected node load calculation of the mapping node selects the physical node with the smallest node load in the set of candidate physical nodes.

[0081] Furthermore, the embodiments of the present application can use the initial candidate physical node set to perform node mapping between virtual nodes and the initial candidate physical nodes, and when the node mapping is successful, use the KSP (K-Shortest Paths) algorithm to collaboratively map virtual links, where the link constraints consider link bandwidth and link delay, and the path selection strategy considers physical link load balancing.

[0082] Optionally, in one embodiment of the present application, in combination with the network slicing requirement model and the node mapping sequence, at least one initial candidate physical node in the physical node set that satisfies both the virtual node mapping conditions and the cross-domain network domain constraint conditions is searched to obtain an initial candidate physical node set corresponding to the current network slicing requirement based on the at least one initial candidate physical node, including: in combination with the network slicing requirement model and the node mapping sequence, a set of candidate physical nodes that meet the virtual node mapping conditions are screened out from the physical node set; in combination with the virtual node and the cross-domain network domain constraint conditions, at least one initial candidate physical node is obtained using the set of candidate physical nodes, and the initial candidate physical node set is generated using the at least one initial candidate physical node as the root node.

[0083] In some embodiments, the embodiments of the present application combine the network slicing requirement model and the node mapping sequence to search for an initial set of candidate physical nodes in the physical node set that simultaneously meets the virtual node mapping conditions and the cross-domain network domain constraint conditions.

[0084] Exemplarily, in the embodiment of the present application, according to the network configuration information of the current network slice requirement of the network slice requirement model, from the physical node set G P Filter virtual nodes that meet the current network configuration information The set of physical nodes to be selected for the mapping condition

[0085] In this embodiment of the present application, for each virtual node The initial candidate physical node must first meet the cross-domain network domain constraint condition, which can be expressed as but not limited to:

[0086]

[0087] in, is a binary variable. When the physical node Satisfy virtual nodes The value is 1 when the geographic network domain constraint is met, otherwise the value is 0.

[0088] If the virtual node is the root node of the breadth-first algorithm search tree, and maps it to the mappable node with the minimum importance value. On the physical node, the computing resource constraints that the node can map to can be expressed as, but not limited to:

[0089]

[0090] in, It is a binary variable. A virtual node can only be mapped to one physical node, but a physical node can support multiple virtual nodes if the remaining resources meet the resource requirements.

[0091] If the virtual node It is not the root node. Find the virtual node breadth-first algorithm to search the virtual parent node in the tree that carries the virtual node, as well as all the mapped nodes that are related to the current virtual node. Directly connected virtual nodes, define each virtual parent node as Find each physical node it maps to, and find all neighboring physical node sets directly connected to these physical nodes, the set of physical nodes to be selected It is the set of physical nodes in the intersection of these neighbor node sets that satisfy the node mapping resource constraints.

[0092] Furthermore, in the embodiment of the present application, the set of physical nodes to be selected is Each physical node in According to the load value Sort from small to large to generate an initial candidate physical node set ¥. The calculation formula for the node load in the embodiment of the present application can be, but is not limited to, expressed as:

[0093]

[0094] in, Is a node The remaining computing resources of the current physical resources reflect the resource occupancy of the node in the current state.

[0095] Furthermore, in the embodiment of the present application, for each initial candidate physical node in the initial candidate physical node set ￥ First, obtain the virtual node that satisfies and virtual parent node Virtual Link Find the virtual parent node Mapped to physical node On physical nodes Physical node mapped to virtual parent node Find a satisfying virtual link between The set of candidate physical links required by the system, the bandwidth resource conditions and delay conditions of the link constraints can be but are not limited to:

[0096]

[0097] in, is a binary variable. When the virtual link Mapping to physical links The value is 1 when it is, otherwise it is 0. It is the end-to-end delay requirement.

[0098] In step S103, node mapping is performed between virtual nodes and the initial candidate physical nodes based on the initial candidate physical node set, and in the event of node mapping failure, the congested physical node set and the overloaded physical node set in the current network slicing requirement are obtained, and the slice reconstruction mechanism is used to re-map the nodes to obtain the candidate migration physical node set and the candidate migration virtual node set, wherein the slice reconstruction mechanism includes using the congested physical node set and the overloaded physical node set to generate a reconstructed physical node set required by the current network slicing, and determining the candidate migration physical node set and the candidate migration virtual node set based on the reconstructed physical node set.

[0099] From the above analysis, it can be seen that the embodiment of the present application can perform node mapping between virtual nodes and initial candidate physical nodes based on the initial candidate physical node set. If the node mapping between the virtual node and the initial candidate physical node fails, the slice reconstruction mechanism will be triggered, and the node migration search is a key step in the slice reconstruction mechanism. Determining the candidate migration physical node set and the candidate migration virtual node set is the primary link in node migration. The embodiment of the present application comprehensively considers the node migration cost and the resource congestion level of the physical network nodes to determine the candidate migration physical node set and the candidate migration virtual node set.

[0100] It can be understood that the embodiment of the present application triggers the slice reconstruction mechanism, re-evaluates and updates the status of the congested physical node set and the overloaded physical node set, searches for the congested physical node set G1 that causes resource congestion in the current physical infrastructure network, and the virtual nodes of the network slice requirement topology have been traversed and sorted according to the breadth-first search algorithm. If the node mapping failure occurs in the root virtual node of the current network slice requirement, the congested physical node set G1 is the set of physical nodes in the current physical infrastructure network that do not meet the computing resource requirements of the virtual node. If the node mapping failure occurs in the non-root virtual node of the current network slice requirement, the congested physical node set G1 is a set of physical nodes consisting of the intersection of the virtual parent node that carries the virtual node and the k-hop adjacent nodes of each physical node that is directly connected to the mapped virtual node.

[0101] Furthermore, the embodiment of the present application can search for an overloaded physical node set G2 in the current physical infrastructure network where resources are overloaded, calculate the node load of each physical node carrying a virtual node in the current physical infrastructure network, and if the load exceeds the node workload threshold value ξ mean , then the physical node is included in the overloaded physical node set, wherein, in the embodiment of the present application, the calculation formula of the node workload threshold value can be but is not limited to expressed as:

[0102]

[0103] in, Is a physical node The current remaining computing resources.

[0104] Furthermore, in the embodiment of the present application, the congested physical node set and the overloaded physical node set are merged into a reconstructed physical node set G3.

[0105] Optionally, in one embodiment of the present application, a candidate migration physical node set and a candidate migration virtual node set for the current network slicing requirement are determined based on the reconstructed physical node set, including: using the node resource difference and the physical link utilization to calculate the resource congestion level of each reconstructed physical node in the reconstructed physical node set; sorting all the reconstructed physical nodes in the reconstructed physical node set according to the resource congestion level to obtain a candidate migration physical node set whose reconstructed physical nodes meet a preset order; judging whether the mapped virtual nodes corresponding to the candidate migration physical nodes in the candidate migration physical node set meet preset migration conditions; if the mapped virtual nodes meet the preset migration conditions, using the mapped virtual nodes to form an initial candidate migration virtual node set to obtain a candidate migration virtual node set, and obtaining a candidate migration virtual link set and a candidate migration physical link set based on the preset link requirements.

[0106] In some embodiments, the process of determining the candidate migration physical node set and the candidate migration virtual node set required by the current network slice according to the reconstructed physical node set in the embodiment of the present application is as follows: Figure 5 As shown, these mapping virtual nodes can be directly added to the candidate migration physical node set. This process includes evaluating the performance and resource matching of each mapping virtual node to ensure that all selected mapping virtual nodes can effectively support the required network service quality and resource requirements. The specific contents are as follows:

[0107] Step S501: Calculate the resource congestion level of each reconstructed physical node in the reconstructed physical node set.

[0108] In this embodiment of the present application, the resource congestion degree of each reconstructed physical node in the reconstructed physical node set is calculated. There are two main factors to consider, specifically:

[0109] (1) Node resource difference, which can be understood as the virtual node currently deployed in the embodiment of the present application The difference between the required node computing resources and the allocated computing resources of the target physical node and the total node resources that the physical node can provide The larger the node resource difference is, the more difficult it is for the remaining resources of the physical node to meet the resource requirements of the virtual node. The calculation formula of the node resource difference in the embodiment of the present application can be, but is not limited to, expressed as:

[0110]

[0111] (2) Physical link workload: It can be understood that the embodiment of the present application also considers the workload of the physical link connected to the current physical node when evaluating the congestion level of the physical node.

[0112] At this time, the embodiment of the present application can calculate the resource congestion degree of each reconstructed physical node in the reconstructed physical node set, and the calculation formula can be but is not limited to expressed as:

[0113]

[0114] Where M is the physical node The total number of connected physical links, is the physical link load.

[0115] Step S502: Generate a set of candidate migration physical nodes that meet a certain order.

[0116] In this embodiment of the present application, each reconstructed physical node in the reconstructed physical node set is sorted from large to small according to the resource congestion degree, and the order of the reconstructed physical nodes in the reconstructed physical node set is updated, thereby obtaining a candidate migration physical node set that meets a certain order. The certain order can be set by a person skilled in the art according to actual conditions, and this application does not impose any specific restrictions.

[0117] Step S503: Determine whether the mapped virtual node corresponding to the candidate migration physical node in the candidate migration physical node set meets certain migration conditions.

[0118] It can be understood that the embodiment of the present application retrieves the virtual nodes carried by each candidate migration physical node in the candidate migration physical node set. The candidate migration virtual nodes in the candidate migration virtual node set should meet certain migration conditions, which may include migration conditions and migration cost conditions. The specific conditions can be set by technical personnel in this field according to actual conditions, and the present application does not impose any specific restrictions.

[0119] In this embodiment of the present application, the migration condition can be understood as the computing resource requirements that can meet the deployment needs of the currently failed virtual node after migration. The calculation formula of its migration condition can be expressed as but not limited to:

[0120]

[0121] When the computing resource demand of a virtual node is greater than the difference between the required node computing resources and the allocated computing resources of the target physical node and the total node resources that the physical node can provide, it means that migrating the current virtual node can at least guarantee the resource demand for the successful deployment of the virtual node that failed to be deployed, so as to obtain the initial set of candidate migration virtual nodes that meet the migration conditions.

[0122] The migration cost can be understood as the cost of resource scheduling, which may include but is not limited to the computing resources spent on deploying the virtual node and the bandwidth resources occupied by the virtual link directly connected to the virtual node. This application does not make specific restrictions. In this embodiment of the application, the virtual node The migration cost calculation formula can be expressed as, but not limited to:

[0123]

[0124] Step S504: Determine a candidate migration virtual node set.

[0125] Furthermore, the embodiment of the present application utilizes the initial candidate migration virtual node set, reorders the initial candidate migration virtual nodes in the initial candidate migration virtual node set in the order of migration cost from small to large, obtains the candidate migration virtual node set, and screens the direct links of all nodes as the candidate migration virtual link set based on certain link requirements, and then generates the candidate migration physical link set. Among them, the certain link requirements are set by technicians in this field according to actual conditions, and this application does not make specific restrictions.

[0126] In step S104, the candidate migration physical node set and the candidate migration virtual node set are used to obtain a complete set of incoming physical nodes for the current network slicing requirements, so as to redeploy the current network slicing requirements according to the complete set of incoming physical nodes and realize the reconstruction of the current network slicing requirements.

[0127] As a possible implementation method, after obtaining the candidate migration physical node set and the candidate migration virtual node set, the embodiment of the present application can obtain a complete migration physical node set after a certain number of iterative searches by executing the ALNS algorithm to complete the reconstruction of the current network slicing requirements. Among them, the certain number can be set by technicians in this field according to actual conditions, and this application does not make specific restrictions.

[0128] Optionally, in one embodiment of the present application, a complete set of incoming physical nodes required by the current network slice is obtained using a candidate migration physical node set and a candidate migration virtual node set, including: obtaining the bearer physical node to which the candidate migration virtual node is mapped using the candidate migration virtual node in the candidate migration virtual node set; determining the neighborhood physical node set corresponding to the candidate migration virtual node based on the bearer physical node and the candidate migration physical node set; constructing a destruction operator based on the neighborhood physical node set, and calculating the destroyed node set and the initial neighborhood candidate physical node set corresponding to the neighborhood physical node set through the destruction operator; constructing a repair operator based on the destroyed node set, and repairing the initial neighborhood candidate physical node set through the repair operator to obtain the neighborhood candidate physical node set; calculating the migration burden of each neighborhood candidate physical node in the neighborhood candidate physical node set to generate a complete incoming physical node set based on the migration burden, wherein the migration burden may include, but is not limited to, consumed computing resources, increased link latency, and temporary memory requirements and bandwidth consumption. The calculation formula for the complete incoming physical node set may be, but is not limited to, as follows:

[0129]

[0130] in, is the set of damaged nodes after k rounds of neighborhood iterative search, is the set of physical nodes in the selected neighborhood after k rounds of neighborhood iterative search. After k rounds of neighborhood iterative search, the set of physical nodes in the repaired neighborhood is: It is the set of candidate physical nodes in the neighborhood after k rounds of neighborhood iterative search.

[0131] As a possible implementation method, the process of generating a complete set of migrated physical nodes based on the ALNS algorithm in the embodiment of the present application is as follows: Figure 6 As shown, the process can be:

[0132] Step S601: Acquire the bearer physical node.

[0133] It can be understood that, in the embodiment of the present application, for each virtual node in the candidate migration virtual node set The current candidate migration virtual node can be determined Mapped to the host physical node

[0134] Step S602: Determine a neighborhood physical node set.

[0135] It can be understood that the embodiment of the present application searches for a neighboring physical node set K1 that carries an adjacent hop of a physical node. Each physical node in the neighboring physical node set must meet the node mapping condition, that is, meet the computing resource requirements of the virtual node, and the cross-domain network domain constraint condition, which can be but is not limited to expressed as:

[0136]

[0137] st hop=1,

[0138] Step S603: construct a destruction operator to obtain a destruction node set and an initial neighborhood candidate physical node set.

[0139] It can be understood that the embodiment of the present application can construct the destruction operator des(·) of the ALNS algorithm, wherein the destruction operator includes three destruction principles: the first destruction principle is to adopt a greedy strategy to remove the physical node with the largest load in the neighborhood physical node set K1, and the number of removed nodes is The second destruction principle is to consider the importance of physical nodes and remove the nodes with the greatest physical importance in the neighborhood node set K1. The number of nodes to be removed is The importance of physical nodes takes into account the degree centrality value, proximity centrality, and link resource robustness of the nodes. The calculation formula can be but is not limited to:

[0140]

[0141] Among them, the calculation formulas of the node's degree centrality value, proximity centrality, and the node's link resource robustness can be, but are not limited to, as follows:

[0142]

[0143] in, represents the degree centrality value of the node, represents the proximity centrality of the node, Indicates the link resource robustness of the node, Is a node and The number of hops of the shortest path between nodes, where the link resource robustness of the node is related to the physical node The combined physical link resources can reflect the physical nodes The adjacent link resource situation.

[0144] The third destruction principle is to randomly remove physical nodes in the neighborhood physical node set K1, the number of which is This is to avoid the search algorithm falling into the local optimal solution.

[0145] Furthermore, after using the above three destruction operators, the embodiment of the present application sorts out the removed nodes and the screened nodes to obtain a destruction node set: and the initial neighborhood candidate physical node set

[0146] Step S604: construct a repair operator to obtain a neighborhood candidate physical node set.

[0147] It can be understood that the embodiment of the present application destroys the node set Construct the repair operator rep(·). The first repair principle considers the node load. The physical nodes are sorted in order from small to large load, and the node with the smallest load is selected. Nodes are “repaired” and added to the repair neighborhood physical node set The second repair principle considers the importance of nodes and calculates the set of damaged nodes. The importance of the physical nodes is sorted from large to small according to the importance of the nodes, and the top ranked nodes are selected. Physical nodes are “repaired” and added to the set of physical nodes in the repair neighborhood The third repair principle is to randomly restore the damaged node set. physical nodes are added to the repair neighborhood physical node set. After a complete round of damage repair iterations, the neighborhood candidate physical node set with the neighborhood search times k = 1 is obtained. It can be expressed as, but not limited to:

[0148]

[0149] In addition, after destroying the operator identifier, the embodiment of the present application can selectively apply the repair operator according to the real-time status and priority strategy of the network, and only repair or reconfigure these nodes under the premise of ensuring that the overall performance of the network will not be affected, so as to optimize the overall network configuration and performance.

[0150] Step S605: Calculate the migration burden of each neighborhood candidate physical node in the neighborhood candidate physical node set.

[0151] Among them, in the embodiment of the present application, for the neighborhood candidate physical node set Each candidate physical node in the neighborhood The migration burden of each node is calculated according to the migration evaluation burden formula, wherein the migration burden may include but is not limited to the consumed computing resources, increased link delay, temporary memory requirements and bandwidth consumption, etc., and this application does not make specific restrictions. In addition, the migration evaluation burden formula may be but is not limited to be expressed as:

[0152]

[0153] in, is the migration cost, is the node workload of the candidate physical node, Migrate virtual nodes The distance between the physical node and the candidate physical node (expressed in hop count). is the weight coefficient of the destruction operator and the repair operator.

[0154] Step S606: Filter out the target migration-in physical node set according to the migration evaluation burden formula, update the operator weight of each iteration, and obtain a complete migration-in physical node set.

[0155] It can be understood that the embodiment of the present application assigns the neighborhood candidate physical node set according to the calculated migration burden The physical nodes in are sorted from small to large. For each node If it is in the first half of the sort sequence, it is included in the target migration physical node set And assign a positive weight χ(χ∈[0,1]) to its corresponding destruction operator and repair operator, and vice versa, assign a negative weight -χ to its corresponding destruction operator and repair operator. The update formula of the operator can be, but is not limited to, expressed as:

[0156]

[0157] s k = χ,

[0158] Among them, ρ k is the initial weight, λ is the weight update coefficient, which controls the speed of weight update, sk is the weight assignment obtained by the operator after one iteration, u k is the number of times the operator has been used.

[0159] Repeat steps S603 to S605 to continue searching for each virtual node in the candidate migration virtual node set S1. The physical node that hosts The adjacent two-hop physical set K2, when executing the ALNS algorithm, uses the roulette algorithm to select the destruction operator and the repair operator according to the probability according to the updated operator weight until the iteration is completed and the complete migration physical node set K is obtained, which can be expressed as but not limited to:

[0160]

[0161] In addition, it should be noted that when the embodiment of the present application traverses the remaining virtual nodes of the current network slice requirement of the network slice requirement model, the node link collaborative mapping and reconstruction deployment of the cross-domain network slice can be completed. In the current network slice requirement collaborative mapping stage, if any virtual node or virtual link cannot be mapped, the current network slice requirement cannot be successfully deployed.

[0162] The following is an introduction to the working principle of the cross-domain network slicing reconstruction method proposed in the embodiment of the present application in conjunction with a specific embodiment.

[0163] in, Figure 7 A flowchart of the working principle of a cross-domain network slice reconstruction method provided according to an embodiment of the present application.

[0164] Step S701: Obtain network slicing requirements.

[0165] Step S702: Execute cross-domain network collaborative slicing.

[0166] Step S703: Execute the AEC-VIKOR mechanism evaluation node.

[0167] Step S704: Perform virtual node mapping.

[0168] Step S705: Determine whether the node is mapped successfully.

[0169] Step S706: Execute the node migration mechanism of slice reconstruction.

[0170] Step S707: Execute node reconstruction based on adaptive large neighborhood search.

[0171] Step S708: collaboratively map virtual links.

[0172] Step S709: Complete slice mapping.

[0173] It can be understood that the embodiment of the present application utilizes the AEC-VIKOR mechanism to traverse and sort the virtual nodes in the current network slicing requirement topology using a breadth-first search algorithm to obtain a node mapping sequence.

[0174] Furthermore, the embodiment of the present application searches for the physical node set G according to the network configuration information of the current network slice requirement of the network slice requirement model. P Virtual nodes that meet current network slicing requirements The set of physical nodes to be selected Specifically, the embodiment of the present application selects a physical node from the set of physical nodes to be selected according to the current virtual node type. Select a physical node that meets the computing resource constraints for mapping: (1) If the current virtual node is the root node of the breadth-first algorithm search tree, map the virtual node to the node with the smallest importance value. (2) If it is not a root node, the virtual node is mapped to a node in the cross-neighbor node set of the physical node set that carries the virtual parent node and the directly connected node, and the selected node load calculation of the mapped node selects the physical node with the smallest node load in the selected physical node set.

[0175] Furthermore, in the embodiment of the present application, if the node mapping fails, the slice reconstruction mechanism is triggered, and the cost of node migration and the resource congestion level of the physical network nodes are comprehensively considered to determine the candidate migration physical node set and the candidate migration virtual node set.

[0176] (1) Search for the overloaded physical node set G2 in the current physical infrastructure network, calculate the node load of each physical node that carries the virtual node in the current physical infrastructure network, and if the load exceeds the node workload threshold value ξ mean , then the physical node is included in the overloaded physical node set, and the congested physical node set and the overloaded physical node set are merged into the reconstructed physical node set G3.

[0177] The physical nodes in the reconstructed physical node set are sorted from large to small according to the resource congestion degree, and the order of the physical nodes in the reconstructed physical node set G3 is updated.

[0178] (2) Determine the candidate migration virtual node set S1, retrieve the virtual nodes carried by each reconstructed physical node in the reconstructed physical node set, and the candidate migration virtual nodes should meet certain migration conditions, which may include but are not limited to migration conditions and migration cost conditions. Among them, the migration condition can be understood as the computing resource demand that can meet the deployment needs of the currently failed virtual node after migration. When the computing resource demand of the virtual node is greater than the difference between the required node computing resources and the allocated computing resources of the target physical node and the total node resources that the physical node can provide, it means that migrating the current virtual node can at least guarantee the resource demand for the successful deployment of the virtual node that failed to deploy, and then obtain the candidate migration virtual node set that meets the cost migration condition, which is denoted as S1.

[0179] Furthermore, the embodiment of the present application executes the ALNS algorithm to obtain a complete set of physical nodes K after k rounds of iterative search: the target physical node set is selected according to the migration evaluation burden formula Update the operator weights of each iteration to obtain the complete set of migrated physical nodes K.

[0180] Traverse the remaining virtual nodes in the current network slice demand model to complete the node link collaborative mapping and reconstruction deployment of cross-domain network slices. In the node and link collaborative mapping stage of the current network slice demand, if any virtual node or virtual link cannot be mapped, the current network slice demand cannot be successfully deployed; if the node mapping is successful, the KSP algorithm is used to collaboratively map the virtual link.

[0181] According to the cross-domain network slice reconstruction method proposed in the embodiment of the present application, by evaluating the importance of the nodes required by the network slice, a node mapping sequence between nodes is obtained, and when the node mapping fails, the network slice reconstruction mechanism is triggered to determine the candidate migration node set required by the current network slice, and then obtain the complete set of physical nodes required to migrate to achieve the reconstruction of the network slice. It can not only balance the network load and reduce the migration cost in the cross-domain network slice deployment scenario, but also effectively improve the efficiency of neighborhood search and slice reconstruction. Therefore, it solves the problem that only the virtual node migration cost of the slice is considered in the related technology, and the load balancing of the physical basic network cannot be achieved, resulting in a low success rate of network slicing. In addition, as the number of slices increases, the computational efficiency of network slice deployment is low, the time consumption is long, and the robustness of the slice deployment system is poor.

[0182] Secondly, the cross-domain network slice reconstruction device proposed according to the embodiment of the present application is described with reference to the accompanying drawings.

[0183] Figure 8 A block diagram of a cross-domain network slice reconstruction device provided according to an embodiment of the present application.

[0184] like Figure 8 As shown, the cross-domain network slicing reconstruction device 10 includes: an acquisition module 100, a generation module 200, a determination module 300 and a reconstruction module 400.

[0185] Among them, the acquisition module 100 is used to obtain all network slicing requirements in the cross-domain network, and calculate the virtual importance value of each virtual node and the physical importance value of each physical node in the current network slicing requirement according to a pre-built network slicing requirement model, so as to obtain a node mapping sequence between virtual nodes and physical nodes according to the virtual importance value and the physical importance value.

[0186] Generation module 200 is used to combine the network slicing requirement model and the node mapping sequence to search for at least one initial candidate physical node in the physical node set that satisfies both the virtual node mapping conditions and the cross-domain network domain constraint conditions, so as to obtain an initial candidate physical node set corresponding to the current network slicing requirement based on at least one initial candidate physical node.

[0187] Determine module 300, which is used to perform node mapping between virtual nodes and initial candidate physical nodes based on the initial candidate physical node set, and in the case of node mapping failure, obtain the congested physical node set and overloaded physical node set in the current network slicing requirement, and use the slice reconstruction mechanism to re-map the nodes to obtain the candidate migration physical node set and the candidate migration virtual node set, wherein the slice reconstruction mechanism includes using the congested physical node set and the overloaded physical node set to generate a reconstructed physical node set required by the current network slicing, and determining the candidate migration physical node set and the candidate migration virtual node set based on the reconstructed physical node set.

[0188] The reconstruction module 400 is used to use the candidate migration physical node set and the candidate migration virtual node set to obtain a complete set of migration-in physical nodes required by the current network slicing, so as to redeploy the current network slicing requirements according to the complete set of migration-in physical nodes and realize the reconstruction of the current network slicing requirements.

[0189] Optionally, in one embodiment of the present application, the generation module 200 includes: a screening unit and a first generation unit.

[0190] Among them, the screening unit is used to combine the network slicing demand model and the node mapping sequence to screen out the candidate physical node set that meets the virtual node mapping conditions from the physical node set.

[0191] The first generation unit is used to combine the virtual node and the cross-domain network domain constraint conditions, use the candidate physical node set to obtain at least one initial candidate physical node, and use the at least one initial candidate physical node as a root node to generate an initial candidate physical node set.

[0192] Optionally, in one embodiment of the present application, the determination module 300 includes: a first calculation unit, a sorting unit, a judgment unit and a determination unit.

[0193] The first calculation unit is used to calculate the resource congestion degree of each reconstructed physical node in the reconstructed physical node set by using the node resource difference and the physical link utilization rate.

[0194] The sorting unit is used to sort all the reconstructed physical nodes in the reconstructed physical node set according to the resource congestion degree, so as to obtain a candidate migration physical node set whose reconstructed physical nodes meet the preset order.

[0195] The judgment unit is used to judge whether the mapped virtual node corresponding to the candidate migration physical node in the candidate migration physical node set meets the preset migration condition.

[0196] The determination unit is used to use the mapped virtual nodes to form an initial candidate migration virtual node set when the mapped virtual nodes meet the preset migration conditions to obtain a candidate migration virtual node set, and obtain a candidate migration virtual link set and a candidate migration physical link set based on preset link requirements.

[0197] Optionally, in one embodiment of the present application, the reconstruction module 400 includes: a second generation unit, a third generation unit, a first construction unit, a second construction unit and a second calculation unit.

[0198] The second generation unit is used to obtain the bearing physical node to which the candidate migration virtual node is mapped by using the candidate migration virtual node in the candidate migration virtual node set.

[0199] The third generating unit is used to determine a neighborhood physical node set corresponding to the candidate migration virtual node based on the hosting physical node and the candidate migration physical node set.

[0200] The first construction unit is used to construct a destruction operator based on the neighborhood physical node set, and calculate the destruction node set and the initial neighborhood candidate physical node set corresponding to the neighborhood physical node set through the destruction operator.

[0201] The second construction unit is used to construct a repair operator based on the damaged node set, and repair the initial neighborhood candidate physical node set through the repair operator to obtain the neighborhood candidate physical node set.

[0202] The second computing unit is used to calculate the migration burden of each neighborhood candidate physical node in the neighborhood candidate physical node set to generate a complete set of migrated physical nodes based on the migration burden, wherein the migration burden may include but is not limited to consumed computing resources, increased link latency, and temporary memory requirements and bandwidth consumption.

[0203] Optionally, in one embodiment of the present application, the calculation formula for the complete migration physical node set may be, but is not limited to,:

[0204]

[0205] in, is the set of damaged nodes after k rounds of neighborhood iterative search, is the set of physical nodes in the selected neighborhood after k rounds of neighborhood iterative search. After k rounds of neighborhood iterative search, the set of physical nodes in the repaired neighborhood is: It is the set of candidate physical nodes in the neighborhood after k rounds of neighborhood iterative search.

[0206] It should be noted that the aforementioned explanation of the embodiment of the cross-domain network slice reconstruction method is also applicable to the cross-domain network slice reconstruction device of this embodiment, and will not be repeated here.

[0207] According to the cross-domain network slice reconstruction device proposed in the embodiment of the present application, by evaluating the importance of the nodes required by the network slice, a node mapping sequence between nodes is obtained, and when the node mapping fails, the network slice reconstruction mechanism is triggered to determine the candidate migration node set required by the current network slice, and then obtain the complete set of physical nodes required to migrate to achieve the reconstruction of the network slice. It can not only balance the network load and reduce the migration cost in the cross-domain network slice deployment scenario, but also effectively improve the efficiency of neighborhood search and slice reconstruction. Therefore, it solves the problem that only the virtual node migration cost of the slice is considered in the related technology, and the load balancing of the physical basic network cannot be achieved, resulting in a low success rate of network slicing. In addition, as the number of slices increases, the computational efficiency of network slice deployment is low, the time consumption is long, and the robustness of the slice deployment system is poor.

[0208] Fig. 9 This is a schematic diagram of the structure of an electronic device provided according to an embodiment of the present application. The electronic device may include:

[0209] A memory 901 , a processor 902 , and a computer program stored in the memory 901 and executable on the processor 902 .

[0210] When the processor 902 executes the program, the cross-domain network slice reconstruction method provided in the above embodiment is implemented.

[0211] Furthermore, the electronic device further comprises:

[0212] The communication interface 903 is used for communication between the memory 901 and the processor 902 .

[0213] The memory 901 is used to store computer programs that can be executed on the processor 902 .

[0214] The memory 901 may include a high-speed RAM memory, and may also include a non-volatile memory (non-volatile memory), such as at least one disk memory.

[0215] If the memory 901, the processor 902 and the communication interface 903 are implemented independently, the communication interface 903, the memory 901 and the processor 902 can be connected to each other through a bus and communicate with each other. The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig. 9 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0216] Optionally, in a specific implementation, if the memory 901, the processor 902 and the communication interface 903 are integrated on a chip, the memory 901, the processor 902 and the communication interface 903 can communicate with each other through an internal interface.

[0217] The processor 902 may be a central processing unit (CPU), or an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present application.

[0218] An embodiment of the present application also provides a computer-readable storage medium on which a computer program is stored, which, when executed by a processor, implements the above-mentioned cross-domain network slicing reconstruction method.

[0219] An embodiment of the present application also provides a computer program product, including a computer program, which, when executed, implements the above-mentioned cross-domain network slice reconstruction method.

[0220] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or N embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, without contradiction.

[0221] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include at least one of the features. In the description of this application, "N" means at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0222] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, fragment or portion of code comprising one or N executable instructions for implementing the steps of a custom logical function or process, and the scope of the preferred embodiments of the present application includes alternative implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in reverse order depending on the functions involved, which should be understood by technicians in the technical field to which the embodiments of the present application belong.

[0223] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as an ordered list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or in combination with these instruction execution systems, devices or apparatuses. For the purpose of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in combination with these instruction execution systems, devices or apparatuses. More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or N wirings (electronic devices), a portable computer disk box (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), a fiber optic device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program is printed, since the program may be obtained electronically by optically scanning the paper or other medium and then editing, interpreting or processing in other suitable ways as necessary and then storing it in a computer memory.

[0224] It should be understood that the various parts of the present application can be implemented by hardware, software, firmware or a combination thereof. In the above embodiment, the N steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. If implemented by hardware, as in another embodiment, it can be implemented by any one or a combination of multiple of the following technologies known in the art: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0225] A person skilled in the art may understand that all or part of the steps in the method for implementing the above-mentioned embodiment may be completed by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, which, when executed, includes one or a combination of the steps of the method embodiment.

[0226] In addition, each functional unit in each embodiment of the present application may be integrated into a processing module, or each unit may exist physically separately, or two or more units may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of a software functional module. If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may also be stored in a computer-readable storage medium.

[0227] The storage medium mentioned above may be a read-only memory, a magnetic disk or an optical disk, etc. Although the embodiments of the present application have been shown and described above, it can be understood that the above embodiments are exemplary and cannot be understood as limiting the present application. A person of ordinary skill in the art may change, modify, replace and modify the above embodiments within the scope of the present application.

Claims

1. A method for reconstructing a cross-domain network slice, characterized in that: The following steps are involved: Obtain all network slicing requirements in the cross-domain network, and calculate the virtual importance value of each virtual node and the physical importance value of each physical node in the current network slicing requirement according to a pre-built network slicing requirement model, so as to obtain a node mapping sequence between the virtual node and the physical node according to the virtual importance value and the physical importance value; In combination with the network slicing requirement model and the node mapping sequence, searching for at least one initial candidate physical node in the physical node set that satisfies both the virtual node mapping condition and the cross-domain network domain constraint condition, so as to obtain an initial candidate physical node set corresponding to the current network slicing requirement based on the at least one initial candidate physical node; Based on the initial candidate physical node set, node mapping is performed between the virtual node and the initial candidate physical node, and in the case of node mapping failure, a congested physical node set and an overloaded physical node set in the current network slicing requirement are obtained, and a slice reconstruction mechanism is used to re-map the nodes to obtain a candidate migration physical node set and a candidate migration virtual node set, wherein the slice reconstruction mechanism includes using the congested physical node set and the overloaded physical node set to generate a reconstructed physical node set of the current network slicing requirement, and determining the candidate migration physical node set and the candidate migration virtual node set according to the reconstructed physical node set; The candidate migration physical node set and the candidate migration virtual node set are used to obtain a complete set of migration-in physical nodes required for the current network slicing, so as to redeploy the current network slicing requirements according to the complete set of migration-in physical nodes and realize the reconstruction of the current network slicing requirements.

2. The method according to claim 1, characterized in that The combining the network slicing requirement model and the node mapping sequence, searching for at least one initial candidate physical node in a physical node set that satisfies both a virtual node mapping condition and a cross-domain network domain constraint condition, so as to obtain an initial candidate physical node set corresponding to the current network slicing requirement based on the at least one initial candidate physical node, includes: In combination with the network slicing requirement model and the node mapping sequence, a set of candidate physical nodes satisfying a virtual node mapping condition is screened out from the physical node set; In combination with the virtual node and the cross-domain network domain constraint condition, the at least one initial candidate physical node is obtained using the candidate physical node set, and the at least one initial candidate physical node is used as a root node to generate the initial candidate physical node set.

3. The method according to claim 1, characterized in that The determining, according to the reconstructed physical node set, a candidate migration physical node set and a candidate migration virtual node set required by the current network slicing comprises: Calculating the resource congestion degree of each reconstructed physical node in the reconstructed physical node set by using the node resource difference and the physical link utilization rate; Sorting all the reconstructed physical nodes in the reconstructed physical node set according to the resource congestion degree to obtain a candidate migration physical node set whose reconstructed physical nodes meet a preset order; Determine whether the mapped virtual node corresponding to the candidate migration physical node in the candidate migration physical node set meets the preset migration condition; If the mapping virtual node meets the preset migration condition, the mapping virtual node is used to form an initial candidate migration virtual node set to obtain the candidate migration virtual node set, and a candidate migration virtual link set and a candidate migration physical link set are obtained based on preset link requirements.

4. The method according to claim 1, characterized in that The obtaining a complete set of incoming physical nodes required by the current network slice by using the candidate migration physical node set and the candidate migration virtual node set includes: Obtaining the bearing physical node to which the candidate migration virtual node is mapped using the candidate migration virtual node in the candidate migration virtual node set; Determine a neighboring physical node set corresponding to the candidate migration virtual node based on the hosting physical node and the candidate migration physical node set; Constructing a destruction operator based on the neighborhood physical node set, and calculating a destruction node set and an initial neighborhood candidate physical node set corresponding to the neighborhood physical node set through the destruction operator; Constructing a repair operator based on the damaged node set, and repairing the initial neighborhood candidate physical node set by the repair operator to obtain a neighborhood candidate physical node set; The migration burden of each neighborhood candidate physical node in the neighborhood candidate physical node set is calculated to generate the complete migration-in physical node set based on the migration burden, wherein the migration burden includes consumed computing resources, increased link latency, and temporary memory requirements and bandwidth consumption.

5. The method according to claim 1, characterized in that The calculation formula for the complete migration physical node set is: in, is the set of damaged nodes after k rounds of neighborhood iterative search, is the set of physical nodes in the selected neighborhood after k rounds of neighborhood iterative search. After k rounds of neighborhood iterative search, the set of physical nodes in the repaired neighborhood is: It is the set of candidate physical nodes in the neighborhood after k rounds of neighborhood iterative search.

6. A cross-domain network slice reconstruction device, characterized in that: include: An acquisition module, used to acquire all network slicing requirements in the cross-domain network, and calculate the virtual importance value of each virtual node and the physical importance value of each physical node in the current network slicing requirement according to a pre-built network slicing requirement model, so as to obtain a node mapping sequence between the virtual node and the physical node according to the virtual importance value and the physical importance value; A generation module, used to search for at least one initial candidate physical node in a physical node set that satisfies both a virtual node mapping condition and a cross-domain network domain constraint condition in combination with the network slicing requirement model and the node mapping sequence, so as to obtain an initial candidate physical node set corresponding to the current network slicing requirement based on the at least one initial candidate physical node; a determination module, configured to perform node mapping between the virtual node and the initial candidate physical node based on the initial candidate physical node set, and in case of node mapping failure, obtain a congested physical node set and an overloaded physical node set in the current network slicing requirement, and re-map the nodes using a slice reconstruction mechanism to obtain a candidate migration physical node set and a candidate migration virtual node set, wherein the slice reconstruction mechanism includes generating a reconstructed physical node set of the current network slicing requirement using the congested physical node set and the overloaded physical node set, and determining the candidate migration physical node set and the candidate migration virtual node set based on the reconstructed physical node set; A reconstruction module is used to use the candidate migration physical node set and the candidate migration virtual node set to obtain a complete set of migration-in physical nodes for the current network slicing requirements, so as to redeploy the current network slicing requirements according to the complete set of migration-in physical nodes to achieve the reconstruction of the current network slicing requirements.

7. The device according to claim 6, characterized in that The generating module comprises: A screening unit, configured to screen out a set of candidate physical nodes that meet a virtual node mapping condition from the physical node set in combination with the network slicing requirement model and the node mapping sequence; The first generating unit is used to combine the virtual node and the cross-domain network domain constraint condition, use the candidate physical node set to obtain the at least one initial candidate physical node, and use the at least one initial candidate physical node as a root node to generate the initial candidate physical node set.

8. The device according to claim 6, characterized in that The determining module comprises: A first calculation unit, configured to calculate the resource congestion degree of each reconstructed physical node in the reconstructed physical node set by using the node resource difference and the physical link utilization rate; A sorting unit, used for sorting all the reconstructed physical nodes in the reconstructed physical node set according to the resource congestion degree, so as to obtain a candidate migration physical node set whose reconstructed physical nodes meet a preset order; A judging unit, configured to judge whether a mapped virtual node corresponding to a candidate migration physical node in the candidate migration physical node set satisfies a preset migration condition; The determination unit is used to use the mapping virtual node to form an initial candidate migration virtual node set when the mapping virtual node meets the preset migration condition to obtain the candidate migration virtual node set, and obtain a candidate migration virtual link set and a candidate migration physical link set based on the preset link requirement.

9. The device according to claim 6, characterized in that The reconstruction module comprises: A second generating unit is used to obtain the bearing physical node to which the candidate migration virtual node is mapped by using the candidate migration virtual node in the candidate migration virtual node set; A third generating unit, configured to determine a neighboring physical node set corresponding to the candidate migration virtual node based on the bearer physical node and the candidate migration physical node set; A first construction unit is configured to construct a destruction operator based on the neighborhood physical node set, and calculate a destruction node set and an initial neighborhood candidate physical node set corresponding to the neighborhood physical node set through the destruction operator; A second construction unit is configured to construct a repair operator based on the damaged node set, and repair the initial neighborhood candidate physical node set by using the repair operator to obtain a neighborhood candidate physical node set; The second computing unit is used to calculate the migration burden of each neighborhood candidate physical node in the neighborhood candidate physical node set, so as to generate the complete migration-in physical node set based on the migration burden, wherein the migration burden includes consumed computing resources, increased link latency, and temporary memory requirements and bandwidth consumption.

10. The device according to claim 6, characterized in that The calculation formula for the complete migration physical node set is: in, is the set of damaged nodes after k rounds of neighborhood iterative search, is the set of physical nodes in the selected neighborhood after k rounds of neighborhood iterative search. After k rounds of neighborhood iterative search, the set of physical nodes in the repaired neighborhood is: It is the set of candidate physical nodes in the neighborhood after k rounds of neighborhood iterative search.

11. An electronic device, characterized in that: include: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the cross-domain network slice reconstruction method as described in any one of claims 1 to 5.

12. A computer-readable storage medium having a computer program stored thereon, characterized in that: The program is executed by a processor to implement the cross-domain network slice reconstruction method as described in any one of claims 1-5.

13. A computer program product, characterized in that It includes a computer program which, when executed, is used to implement the cross-domain network slice reconstruction method as described in any one of claims 1 to 5.

Images