A service function chain backup management method, device, storage medium and system

Abstract

The application discloses a service function chain backup management method and device, a storage medium and a system. The service function chain backup management method and device, the storage medium and the system improve the efficiency and reliability of the service function chain by filtering and obtaining key resources from a service function chain to be managed through a preset vector expansion theory, further filtering out resources to be backed up by calculating the relative generation value of the key resources, and backing up the resources to be backed up according to current backup resources.

Description

Technical Field

[0001] This invention relates to the field of performance management technology for power communication networks, and in particular to a backup management method, apparatus, computer-readable storage medium, and system for service function chains. Background Technology

[0002] With the rapid development of smart grid technology, the demand for communication network resources from power services is increasing rapidly. However, traditional networks tie hardware resources to power services, severely reducing the efficiency of service deployment and resource utilization. To address this issue, Network Function Virtualization (NFV) technology has been proposed. In an NFV environment, service functions and the hardware environment are separated through virtualization technology, improving the efficiency of service deployment and the utilization of underlying resources. In this context, power services are created and deployed in the form of Service Function Chains (SFCs), greatly improving the deployment efficiency of power services. However, because SFCs are carried on common underlying network resources, they are susceptible to the influence of other resources on the underlying network and the reliability of the underlying network itself. Therefore, improving the reliability of underlying network resources has become a critical issue that urgently needs to be addressed.

[0003] In existing technologies, joint backup algorithms are typically used to analyze the service function chain from multiple dimensions, including deployment and backup resource selection, thereby improving the reliability of the service function chain; or resource reservation strategies are used to ensure the reliability of the service function chain.

[0004] However, existing technologies still have the following drawbacks: they ignore the topological characteristics of the underlying network, resulting in low efficiency in resource backup.

[0005] Therefore, there is a current need for a backup management method, apparatus, computer-readable storage medium, and system for service function chains to overcome the aforementioned deficiencies in the prior art. Summary of the Invention

[0006] This invention provides a backup management method, apparatus, computer-readable storage medium, and system for service function chains, thereby improving the efficiency and reliability of service function chains.

[0007] An embodiment of the present invention provides a backup management method for a service function chain. The backup management method includes: obtaining a set of underlying paths corresponding to the service function chain to be managed; constructing a path matrix based on the set of underlying paths; obtaining a set of key resources corresponding to the service function chain to be managed based on the set of underlying paths, the path matrix, and a preset vector expansion theory; selecting resources to be backed up from the set of key resources according to a preset cost filtering method, and backing up the resources to be backed up.

[0008] As an improvement to the above scheme, according to a preset cost screening method, resources to be backed up are selected from the set of critical resources, and the resources to be backed up are backed up. Specifically, this includes: obtaining the current backup resources; calculating the relative cost value of each critical node and the relative cost value of each critical path in the set of critical resources according to a preset cost calculation formula; selecting the resources to be backed up based on the current backup resources, the relative cost value of the critical nodes, and the relative cost value of the critical paths, and backing up the resources to be backed up using the current backup resources.

[0009] As an improvement to the above scheme, a path matrix is ​​constructed based on the underlying path set, and the key resource set corresponding to the service function chain to be managed is obtained based on the underlying path set, the path matrix, and a preset vector expansion theory. Specifically, this includes: constructing a path matrix based on a preset path identification method and the underlying path set; calculating the minimum subspace of the underlying paths in the underlying path set based on the path matrix; calculating the basis of the minimum subspace based on a preset underlying path selection method and the minimum subspace, and using the basis as the key resource set corresponding to the service function chain to be managed.

[0010] As an improvement to the above scheme, obtaining the underlying path set corresponding to the service function chain to be managed specifically includes: according to the mapping association between the service function chain to be managed and the underlying network resources, obtaining the underlying nodes of each virtual node of the service function chain to be managed and the underlying links corresponding to the virtual links, and storing the underlying nodes and the underlying links into the underlying path set.

[0011] As an improvement to the above scheme, the cost calculation formula set includes a critical path cost calculation formula and a critical node cost calculation formula, wherein the critical node cost calculation formula is as follows: In the formula, n is the total number of physical nodes in the critical resources; For physical nodes The cost of critical nodes in resource utilization; Represents physical nodes Available resource rate Indicates the current physical node Total computational load.

[0012] As an improvement to the above scheme, the formula for calculating the critical path cost is as follows: In the formula, m represents the total number of physical links in the critical resources. For physical links Critical path cost; For physical links Resource utilization rate For the current physical link Total bandwidth.

[0013] As an improvement to the above solution, resources to be backed up are selected based on the current backup resources, the relative cost of the critical nodes, and the relative cost of the critical paths. Specifically, this includes: sorting the critical nodes and critical paths according to a preset sorting order, the relative cost of the critical nodes, and the relative cost of the critical paths to obtain a backup priority sequence; the sorting order is from largest to smallest relative cost; and selecting resources to be backed up from the backup priority sequence based on the current backup resources.

[0014] Another embodiment of the present invention provides a backup management device for a service function chain. The backup management device includes a bottom-level path acquisition unit, a key resource identification unit, and a resource management backup unit. The bottom-level path acquisition unit is used to acquire a set of bottom-level paths corresponding to the service function chain to be managed. The key resource identification unit is used to construct a path matrix based on the bottom-level path set, and acquire a set of key resources corresponding to the service function chain to be managed based on the bottom-level path set, the path matrix, and a preset vector expansion theory. The resource management backup unit is used to select resources to be backed up from the set of key resources according to a preset cost filtering method, and back up the resources to be backed up.

[0015] As an improvement to the above solution, the resource management backup unit is further configured to: construct a path matrix according to a preset path identification method and the underlying path set; calculate the minimum subspace of the underlying paths in the underlying path set according to the path matrix; calculate the basis of the minimum subspace according to a preset underlying path selection method and the minimum subspace, and use the basis as the key resource set corresponding to the service function chain to be managed.

[0016] As an improvement to the above scheme, the key resource identification unit is further configured to: construct a path matrix according to a preset path identification method and the underlying path set; calculate the minimum subspace of the underlying paths in the underlying path set according to the path matrix; calculate the basis of the minimum subspace according to a preset underlying path selection method and the minimum subspace, and use the basis as the key resource set corresponding to the service function chain to be managed.

[0017] As an improvement to the above scheme, the underlying path acquisition unit is further configured to: obtain the underlying nodes of each virtual node of the service function chain to be managed and the underlying links corresponding to the virtual links according to the mapping association between the service function chain to be managed and the underlying network resources, and store the underlying nodes and the underlying links in the underlying path set.

[0018] As an improvement to the above solution, the resource management backup unit is further configured to: sort the critical nodes and the critical paths according to a preset sorting order, the relative cost of the critical nodes, and the relative cost of the critical paths to obtain a backup priority sequence; the sorting order is from largest to smallest relative cost; and select resources to be backed up from the backup priority sequence according to the current backup resources.

[0019] Another embodiment of the present invention provides a computer-readable storage medium including a stored computer program, wherein, when the computer program is executed, it controls the device where the computer-readable storage medium is located to perform the backup management method of the service function chain as described above.

[0020] Another embodiment of the present invention provides a backup management system for a service function chain, the backup management system including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor executes the computer program to implement the backup management method for the service function chain as described above.

[0021] Compared with existing technologies, this technical solution has the following beneficial effects:

[0022] This invention provides a backup management method, apparatus, computer-readable storage medium, and system for service function chains. By using a preset vector expansion theory, key resources are selected from the service function chains to be managed. The relative cost of the key resources is calculated to further select resources to be backed up. The backup of the resources to be backed up is performed based on the current backup resources. This backup management method, apparatus, computer-readable storage medium, and system for service function chains improves the efficiency and reliability of the service function chains. Attached Figure Description

[0023] Figure 1This is a flowchart illustrating a backup management method for a service function chain according to an embodiment of the present invention;

[0024] Figure 2 This is a schematic diagram of the structure of a backup management device for a service function chain provided in an embodiment of the present invention. Detailed Implementation

[0025] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention. Specific Implementation Example 1

[0027] The present invention first describes a backup management method for a service function chain. Figure 1 This is a flowchart illustrating a backup management method for a service function chain according to an embodiment of the present invention.

[0028] like Figure 1 As shown, the backup management method includes:

[0029] S1: Obtain the set of underlying paths corresponding to the functional chain of the service to be managed.

[0030] In a Network Functions Virtualization (NFV) environment, a traditional network is divided into a physical network and a service function chain. The physical network service provider (PNF) is responsible for building the physical network and providing physical resources for the service function chain. The service function chain service provider (SFC) is responsible for leasing resources from the physical network service provider to construct the service function chain to support various services. For ease of study, the network environment is formally described below.

[0031] Physical networks, also known as underlying networks, use weighted undirected graphs G. s =(N s E s ) indicates that G s Represents the physical network, N s E represents the set of physical nodes. s This represents a set of physical links. For physical links, use... Indicates the link between switches. N s =N f ∪N c ; N f N represents the set of switch nodes. c This represents a set of server nodes.

[0032] An SFC request represents a service flow that flows in from one switch node, passes through virtual network elements in a given order, and then flows out from another switch node, using a weighted undirected graph G. v =(S, T, V, E) v The expression ) represents the set of virtual network elements. Here, S represents the inflow to the switch node, T represents the outflow to the switch node, and V represents the set of virtual network elements, V = {v1, v2, ..., v...}. p}. E v Represents a set of virtual links. This represents a virtual link. When an SFC request arrives, the service provider allocates resources to each virtual network element within the SFC.

[0033] Improving the reliability of SFC requires ensuring that the underlying network resources used by SFC are highly reliable. Based on the mapping relationship between SFC and underlying network resources, the corresponding underlying nodes and links for each virtual node and virtual link are identified. These underlying nodes and links are connected together to form the underlying path corresponding to the SFC.

[0034] In one embodiment, obtaining the underlying path set corresponding to the service function chain to be managed specifically includes: according to the mapping association between the service function chain to be managed and the underlying network resources, obtaining the underlying nodes of each virtual node of the service function chain to be managed and the underlying links corresponding to the virtual links, and storing the underlying nodes and the underlying links into the underlying path set.

[0035] S2: Construct a path matrix based on the underlying path set, and obtain the key resource set corresponding to the service function chain to be managed based on the underlying path set, the path matrix, and the preset vector expansion theory.

[0036] After obtaining the set of underlying paths, a path matrix needs to be constructed based on this set. The column vectors of the matrix represent all underlying links, and the row vectors represent all underlying paths carrying SFCs. When an underlying path passes through a certain underlying link, the value of the matrix element is 1; otherwise, it is 0.

[0037] After constructing the path matrix, the critical link resources (described in this paper as the "critical resource set") can be obtained based on vector expansion theory. Using vector expansion theory, the minimum subspace of the vectors can be calculated. Let I = {1, ..., h} represent the index of the underlying path corresponding to all SFCs. Here, h represents the total number of h SFCs. Therefore, once the critical resources in the physical resources are found, the reliability of the network can be guaranteed as long as the reliability of these critical resources is ensured.

[0038] For a vector set D, the vector set S is represented as its vector extension, and calculated using the following formula. Where, Let represent the vector formed by the i-th SFC, and D represent the set of all SFCs. i ∈{0,1} represents the set of 0s and 1s. "∨" represents the operation of finding the maximum value between binary vectors. In this case, all vectors in the set D corresponding to the underlying paths of the optional SFC are independent. At this time, the vectors in set D cannot be linearly represented by each other.

[0039]

[0040] In the formula, the basis of a space refers to the set of independent subsets in S. All SFCs in set D can be represented by the smallest subspace of vectors. To quickly solve for the basis of the space using an algorithm and use the basis of the space as a key resource set, this invention adopts an iterative weight judgment strategy for calculation. That is: first, the sum of each row vector in the matrix is ​​used as the weight of each vector. The smaller the weight, the fewer the elements with a value of 1 in the current row vector. This indicates that the vector passes through fewer underlying nodes. If the current vector is linearly uncorrelated with existing vectors, it means that the current vector cannot be linearly represented by existing vectors and needs to be a vector in the basis. Otherwise, it means that the current vector can be represented by existing vectors and cannot be used as a basis.

[0041] The underlying path selection algorithm based on the vector expansion basis property includes generating a underlying path matrix model, simplifying the underlying path matrix model, summing the matrix elements and sorting them in ascending order, and traversing row by row to find the key resource set T. * Four steps. In the step of simplifying the underlying path matrix model, resources with redundant backups in D* are deleted because resources with redundant backups have higher reliability and are not within the scope of this invention.

[0042] Specifically, the preset underlying path selection method includes four steps, of which step 1: use the underlying path set P* to generate the underlying path matrix model D*;

[0043] Step 2: Delete resources with redundant backups in D* to obtain a new matrix.

[0044] Step 3: [Regarding...] Summing the elements of each row vector in the matrix, sorting them in ascending order, and converting them into a matrix

[0045] Step 4: Traverse the matrix row by row For each row vector: (1) Extract The first row vector is placed into the candidate T. * ; (2) Judgment (3) Retrieve the current row vector. If the current row vector is empty, the algorithm ends. (4) Determine T * Can the median vector be... Linear representation. When it cannot be represented, it will be... Put T * Proceed to step 2.

[0046] In one embodiment, a path matrix is ​​constructed based on the underlying path set, and a key resource set corresponding to the service function chain to be managed is obtained based on the underlying path set, the path matrix, and a preset vector expansion theory. Specifically, this includes: constructing a path matrix based on a preset path identification method and the underlying path set; calculating the minimum subspace of the underlying paths in the underlying path set based on the path matrix; calculating the basis of the minimum subspace based on a preset underlying path selection method and the minimum subspace, and using the basis as the key resource set corresponding to the service function chain to be managed.

[0047] S3: Based on the preset cost filtering method, select the resources to be backed up from the set of key resources, and back up the resources to be backed up.

[0048] After identifying the critical set of physical paths (described in this paper as the "critical resource set"), it is necessary to back up the low-reliability resources within this set. Based on network operation experience, it is known that in a network function virtualization environment, the utilization rate of physical resources is closely related to their reliability. When the utilization rate of physical resources is high, their reliability drops rapidly. Furthermore, to more accurately assess resource availability, the relative cost of physical resources is determined by comparing their utilization rate with the available resources of other resources in the network. The availability of other resources is then assessed using the average value of all resources.

[0049] In one embodiment, according to a preset cost screening method, resources to be backed up are selected from the set of critical resources, and the resources to be backed up are backed up. Specifically, this includes: obtaining the current backup resources; calculating the relative cost value of each critical node and the relative cost value of each critical path in the set of critical resources according to a preset cost calculation formula; selecting the resources to be backed up based on the current backup resources, the relative cost value of the critical nodes, and the relative cost value of the critical paths, and backing up the resources to be backed up using the current backup resources.

[0050] In one embodiment, the cost calculation formula set includes a critical path cost calculation formula and a critical node cost calculation formula, wherein the critical node cost calculation formula is:

[0051]

[0052] In the formula, n is the total number of physical nodes in the critical resources; For physical nodes The cost of critical nodes in resource utilization; Represents physical nodes Available resource rate Show current physical node Total computational load.

[0053] In one embodiment, the formula for calculating the critical path cost is:

[0054]

[0055] In the formula, m represents the total number of physical links in the critical resources. For physical links Critical path cost; For physical links Resource utilization rate For the current physical link Total bandwidth.

[0056] Analysis of the relative cost calculation process reveals that when the critical path cost or critical node cost is high, it indicates that the available resources for that resource are fewer than other physical resources, thus requiring faster backup. In the actual backup process, resources with high cost are prioritized for backup until all backup resources are used. In one embodiment, resources to be backed up are selected based on the current backup resources, the relative cost of the critical node, and the relative cost of the critical path. This specifically includes: sorting the critical nodes and critical paths according to a preset sorting order, the relative cost of the critical node, and the relative cost of the critical path to obtain a backup priority sequence; and selecting resources to be backed up from the backup priority sequence based on the current backup resources. In one embodiment, the sorting order is from highest to lowest relative cost.

[0057] This invention describes a backup management method for service function chains. By using a preset vector expansion theory, key resources are selected from the service function chains to be managed. The relative cost of the key resources is calculated to further select the resources to be backed up. The backup of the resources to be backed up is performed based on the current backup resources. This backup management method for service function chains improves the efficiency and reliability of the service function chains. Specific Implementation Example 2

[0059] In addition to the methods described above, embodiments of the present invention also disclose a backup management device for a service function chain. Figure 2 This is a schematic diagram of the structure of a backup management device for a service function chain provided in an embodiment of the present invention.

[0060] like Figure 2 As shown, the backup management device includes a low-level path acquisition unit 11, a critical resource identification unit 12, and a resource management backup unit 13.

[0061] The underlying path acquisition unit 11 is used to acquire the set of underlying paths corresponding to the functional chain of the service to be managed.

[0062] In one embodiment, the underlying path acquisition unit 11 is further configured to: obtain the underlying nodes of each virtual node of the service function chain to be managed and the underlying links corresponding to the virtual links according to the mapping association between the service function chain to be managed and the underlying network resources, and store the underlying nodes and the underlying links in the underlying path set.

[0063] The key resource identification unit 12 is used to construct a path matrix based on the underlying path set, and to obtain the key resource set corresponding to the service function chain to be managed based on the underlying path set, the path matrix and the preset vector expansion theory.

[0064] In one embodiment, the key resource identification unit 12 is further configured to: construct a path matrix according to a preset path identification method and the underlying path set; calculate the minimum subspace of the underlying paths in the underlying path set according to the path matrix; calculate the basis of the minimum subspace according to a preset underlying path selection method and the minimum subspace, and use the basis as the key resource set corresponding to the service function chain to be managed.

[0065] The resource management backup unit 13 is used to select resources to be backed up from the set of key resources according to a preset cost screening method, and to back up the resources to be backed up.

[0066] In one embodiment, the resource management backup unit 13 is further configured to: construct a path matrix according to a preset path identification method and the underlying path set; calculate the minimum subspace of the underlying paths in the underlying path set according to the path matrix; calculate the basis of the minimum subspace according to a preset underlying path selection method and the minimum subspace, and use the basis as the key resource set corresponding to the service function chain to be managed.

[0067] In one embodiment, the resource management backup unit 13 is further configured to: sort the critical nodes and the critical paths according to a preset sorting order, the relative cost of the critical nodes, and the relative cost of the critical paths to obtain a backup priority sequence; the sorting order is from largest to smallest relative cost; and select resources to be backed up from the backup priority sequence according to the current backup resources.

[0068] If the units integrated into the backup management device are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, all or part of the processes in the methods of the above embodiments of the present invention can also be implemented by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium, and when executed by a processor, it can implement the steps of the various method embodiments described above. Another embodiment of the present invention provides a computer-readable storage medium including a stored computer program, wherein, when the computer program is executed, it controls the device where the computer-readable storage medium is located to execute the backup management method of the service function chain as described above.

[0069] The computer program includes computer program code, which can be in the form of source code, object code, executable file, or some intermediate form. The computer-readable medium can include any entity or device capable of carrying the computer program code, recording media, USB flash drive, portable hard drive, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media, etc. It should be noted that the content included in the computer-readable medium can be appropriately added or removed according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media do not include electrical carrier signals and telecommunication signals.

[0070] It should be noted that the device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Furthermore, in the accompanying drawings of the device embodiments provided by this invention, the connection relationships between units indicate that they have communication connections, which can be specifically implemented as one or more communication buses or signal lines. Those skilled in the art can understand and implement this without any creative effort.

[0071] This invention describes a backup management device and computer-readable storage medium for a service function chain. By using a preset vector expansion theory, key resources are selected from the service function chain to be managed. The relative cost of the key resources is calculated to further select the resources to be backed up. The backup management device and computer-readable storage medium for the service function chain improve the efficiency and reliability of the service function chain. Specific Implementation Example 3

[0073] In addition to the methods and apparatus described above, embodiments of the present invention also describe a backup management system for service function chains.

[0074] The backup management system includes a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor. When the processor executes the computer program, it implements the backup management method of the service function chain as described above.

[0075] The processor can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor can be a microprocessor or any conventional processor. The processor is the control center of the device, connecting various parts of the device via various interfaces and lines.

[0076] The memory can be used to store the computer programs and / or modules. The processor implements various functions of the device by running or executing the computer programs and / or modules stored in the memory and by calling data stored in the memory. The memory may mainly include a program storage area and a data storage area. The program storage area may store the operating system, at least one application program required for a function (such as sound playback function, image playback function, etc.), etc.; the data storage area may store data created according to the use of the mobile phone (such as audio data, phonebook, etc.). In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as hard disk, memory, plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, at least one disk storage device, flash memory device, or other volatile solid-state storage device.

[0077] To analyze algorithm performance, the network topology generation tool GT-ITM was used to generate physical networks and service function chains. The number of physical nodes in the physical network determines its size. The number of physical network nodes was increased from 50 to 100. To generate physical links, any two physical nodes were connected with a certain probability. The connection probability was set to 0.2.

[0078] Regarding the generation of service function chains, the probability of [5%, 10%] of the number of physical network nodes is used as the number of nodes in the service function chain. In each physical network environment, 30 SFC requests are generated, and resources are allocated to them by the physical network.

[0079] To analyze the performance of the service function chain reliability improvement algorithm SFCRIAoVET proposed in this invention based on vector expansion theory, it is compared with traditional algorithms. Analysis of existing research shows that the low-level network resource backup algorithm based on greedy search (LNRBAoGS) is a fundamental method for resource backup. This invention uses the LNRBAoGS algorithm as the comparison algorithm. This algorithm uses backup resources to back up the resource with the highest cost. In the performance analysis, the performance of the two algorithms in terms of service function chain availability and service function chain resource allocation success rate when physical nodes fail is discussed. In simulating physical network link failures, [2%, 3%] of physical links in the bottom layer are randomly selected as failed links. Regarding resource backup capacity, the backup resources for bottom layer nodes and bottom layer links are each set to 15% of the total resources. In comparing the availability of service function chains, the performance of the two algorithms is compared under different network scale environments.

[0080] As the number of underlying network nodes increases, the availability of the service function chain in both algorithms increases slightly. This is because the increase in network size leads to an increase in available resources in the underlying network, thereby improving the availability of the service function chain. On the other hand, the comparison results of the two algorithms show that the service function chain availability is higher under the algorithm of this invention. This is because the algorithm of this invention adopts a strategy of backing up resources on the critical path, covering more critical resources, thereby improving the availability of the service function chain.

[0081] This invention describes a backup management system for service function chains. By using a preset vector expansion theory, key resources are selected from the service function chains to be managed. The relative cost of the key resources is calculated to further select the resources to be backed up. The backup management system backs up the resources to be backed up based on the current backup resources. This backup management system for service function chains improves the efficiency and reliability of the service function chains.

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

Claims

1. A backup management method for a service function chain, characterized in that, The backup management method includes: Obtain the set of underlying paths corresponding to the functional chain of the service to be managed; A path matrix is ​​constructed based on the underlying path set, and the key resource set corresponding to the service function chain to be managed is obtained based on the underlying path set, the path matrix, and the preset vector expansion theory. According to the preset cost screening method, the resources to be backed up are selected from the set of key resources, and the resources to be backed up are backed up. Specifically, the process of selecting resources to be backed up from the set of critical resources and backing up those resources includes: obtaining the current backup resources; calculating the relative cost of each critical node and the relative cost of each critical path in the set of critical resources according to a preset cost calculation formula; selecting the resources to be backed up based on the current backup resources, the relative cost of the critical nodes, and the relative cost of the critical paths, and backing up the resources to be backed up using the current backup resources; The cost calculation formula set includes a critical path cost calculation formula and a critical node cost calculation formula, wherein the critical node cost calculation formula is as follows: In the formula, n is the total number of physical nodes in the critical resources; For physical nodes The cost of critical nodes in resource utilization; Represents physical nodes Available resource rate Indicates the current physical node Total computational load.

2. The backup management method for the service function chain according to claim 1, characterized in that, A path matrix is ​​constructed based on the underlying path set, and the key resource set corresponding to the service function chain to be managed is obtained based on the underlying path set, the path matrix, and a preset vector expansion theory, specifically including: A path matrix is ​​constructed based on the preset path identification method and the underlying path set; Based on the path matrix, calculate the minimum subspace of the bottom-level paths in the bottom-level path set; Based on the preset underlying path selection method and the minimum subspace, the basis of the minimum subspace is calculated, and the basis is used as the key resource set corresponding to the service function chain to be managed.

3. The backup management method for the service function chain according to claim 2, characterized in that, Obtain the set of underlying paths corresponding to the service function chain to be managed, specifically including: Based on the mapping association between the service function chain to be managed and the underlying network resources, the underlying nodes of each virtual node in the service function chain to be managed and the underlying links corresponding to the virtual links are obtained, and the underlying nodes and the underlying links are stored in the underlying path set.

4. The backup management method for the service function chain according to claim 1, characterized in that, The formula for calculating the critical path cost is as follows: In the formula, m represents the total number of physical links in the critical resources. For physical links Critical path cost; For physical links Resource utilization rate For the current physical link Total bandwidth.

5. The backup management method for the service function chain according to claim 4, characterized in that, Based on the current backup resources, the relative cost of the critical nodes, and the relative cost of the critical paths, resources to be backed up are selected, specifically including: The critical nodes and critical paths are sorted according to a preset sorting order, the relative cost value of the critical nodes, and the relative cost value of the critical paths to obtain a backup priority sequence; the sorting order is from largest to smallest relative cost value. Based on the current backup resources, select the resources to be backed up from the backup priority sequence.

6. A backup management device for a service function chain, characterized in that, The backup management device includes a low-level path acquisition unit, a critical resource identification unit, and a resource management backup unit, wherein... The underlying path acquisition unit is used to acquire the set of underlying paths corresponding to the functional chain of the service to be managed. The key resource identification unit is used to construct a path matrix based on the underlying path set, and to obtain the key resource set corresponding to the service function chain to be managed based on the underlying path set, the path matrix, and the preset vector expansion theory. The resource management backup unit is used to select resources to be backed up from the set of key resources according to a preset cost filtering method, and to back up the resources to be backed up. Specifically, the process of selecting resources to be backed up from the set of critical resources and backing up those resources includes: obtaining the current backup resources; calculating the relative cost of each critical node and the relative cost of each critical path in the set of critical resources according to a preset cost calculation formula; selecting the resources to be backed up based on the current backup resources, the relative cost of the critical nodes, and the relative cost of the critical paths, and backing up the resources to be backed up using the current backup resources; The cost calculation formula set includes a critical path cost calculation formula and a critical node cost calculation formula, wherein the critical node cost calculation formula is as follows: In the formula, n is the total number of physical nodes in the critical resources; For physical nodes The cost of critical nodes in resource utilization; Represents physical nodes Available resource rate Indicates the current physical node Total computational load.

7. A computer-readable storage medium, characterized in that, The computer-readable storage medium includes a stored computer program, wherein, when the computer program is executed, it controls the device where the computer-readable storage medium is located to perform the backup management method of the service function chain as described in any one of claims 1 to 5.

8. A backup management system for a service function chain, characterized in that, The backup management system includes a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor. When the processor executes the computer program, it implements the backup management method of the service function chain as described in any one of claims 1 to 5.

Images