A method and device for backing up a network infrastructure based on urgency

Abstract

The application discloses a bottom-layer network structure backup method and device based on urgency, and the method comprises the following steps: calculating the importance, historical failure rate and independence of each bottom-layer node and the importance, historical failure rate and independence of each bottom-layer link according to the bottom-layer network structure; calculating the urgency of each bottom-layer node and the urgency of each bottom-layer link according to the importance, historical failure rate and independence of each bottom-layer node and the importance, historical failure rate and independence of each bottom-layer link, and sorting the urgency; and performing bottom-layer node backup and bottom-layer link backup on the bottom-layer network structure by using reserved backup resources according to the sorting result of the urgency. The application can sort the urgency of each bottom-layer node or bottom-layer link, ensure the rationality of the allocation of backup resources, and perform fast and effective backup on unreliable bottom-layer resources.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of power communication network operation and maintenance, and in particular to a bottom-layer network structure backup method and device based on urgency. BACKGROUND

[0002] With the rapid increase of the number and type of power services, the resource demand of power services for power communication networks is rapidly increasing. In order to solve the problem of insufficient resources of power communication networks, network function virtualization (NFV) technology is proposed. In the NFV environment, the traditional network is divided into a bottom-layer network and a service function chain (SFC). The bottom-layer network can use virtualization technology to virtually divide a single physical network device into multiple virtual network elements. The service function chain can be quickly constructed according to the service demand. Since each SFC needs to share the bottom-layer network resources with other SFCs, the SFCs are more likely to fail or have performance degradation. Therefore, although the NFV technology improves the utilization rate of the bottom-layer network resources, the reliability of the SFCs is reduced. SUMMARY

[0003] Embodiments of the present application provide a bottom-layer network structure backup method and device based on urgency, which can quickly and effectively backup resources with higher urgency.

[0004] To achieve the above object, a first aspect of the embodiments of the present application provides a bottom-layer network structure backup method based on urgency, comprising:

[0005] network virtualization is performed on a target power communication network to obtain a bottom-layer network structure and a virtual network structure;

[0006] According to the mapping relationship between the bottom-layer network structure and the virtual network structure, a bottom-layer network structure serving the virtual network structure is confirmed; the bottom-layer network structure comprises a plurality of bottom-layer nodes and a plurality of bottom-layer links; the virtual network structure comprises a plurality of virtual nodes and a plurality of virtual links;

[0007] According to the bottom-layer network structure, the importance, historical failure rate and independence of each bottom-layer node and the importance, historical failure rate and independence of each bottom-layer link are calculated respectively;

[0008] According to the importance, historical failure rate and independence of each bottom-layer node and the importance, historical failure rate and independence of each bottom-layer link, the urgency of each bottom-layer node and the urgency of each bottom-layer link are calculated and sorted according to the size of the urgency;

[0009] According to the ranking result of the urgency, the reserved backup resource is used to perform bottom-layer node backup and bottom-layer link backup on the bottom-layer network structure.

[0010] In a possible implementation manner of the first aspect, the mapping relationship between the bottom-layer network structure and the virtual network structure is specifically:

[0011] The virtual nodes of the virtual network structure are carried on the bottom-layer nodes of the bottom-layer network structure, and the virtual links of the virtual network structure are carried on the bottom-layer paths of the bottom-layer network structure.

[0012] In a possible implementation manner of the first aspect, the importance, the historical failure rate, and the independence of each bottom-layer node and the importance, the historical failure rate, and the independence of each bottom-layer link are calculated according to the bottom-layer network structure, and the calculation is specifically:

[0013] The importance of each bottom-layer node and the importance of each bottom-layer link are calculated according to the historical allocation record of the bottom-layer network structure.

[0014] The historical failure rate of each bottom-layer node and the historical failure rate of each bottom-layer link are calculated according to the historical operation and maintenance record of the bottom-layer network structure.

[0015] The independence of each bottom-layer node and the independence of each bottom-layer link are calculated according to the node connection density of the bottom-layer network structure.

[0016] In a possible implementation manner of the first aspect, the importance of each bottom-layer node and the importance of each bottom-layer link are calculated according to the historical allocation record of the bottom-layer network structure, and the calculation specifically includes:

[0017] A node resource matrix corresponding to each bottom-layer node carrying each virtual node is calculated, and a matrix element in each node resource matrix is a resource amount of each virtual node.

[0018] A link resource matrix corresponding to each bottom-layer network carrying each link is calculated, and a matrix element in each link resource matrix is a hop number of each virtual link and a degree number of a starting node.

[0019] The total node resource matrix is obtained by summing all node resource matrices, and the total link resource matrix is obtained by summing all link resource matrices.

[0020] The total node resource matrix and the total link resource matrix are normalized to obtain an importance matrix, and a diagonal element of the importance matrix represents an average importance degree of a virtual network node carried on a physical node.

[0021] In a possible implementation manner of the first aspect, the historical failure rate of each bottom-layer node and the historical failure rate of each bottom-layer link are respectively calculated according to the historical operation and maintenance records of the bottom-layer network structure, and the calculation specifically includes:

[0022] The historical failure rate of each bottom-layer node is a ratio of the number of node failures in a period of time to the maximum number of node failures;

[0023] The historical failure rate of each bottom-layer link is a ratio of the number of link failures in a period of time to the maximum number of link failures.

[0024] In a possible implementation manner of the first aspect, the independence of each bottom-layer node and the independence of each bottom-layer link are respectively calculated according to the node connection density of the bottom-layer network structure, and the calculation specifically includes:

[0025] The independence of each bottom-layer node is the reciprocal of the degree of the current node;

[0026] The independence of each bottom-layer link is the reciprocal of the sum of the degree of the first node of the link and the degree of the second node of the link; the first node of the link and the second node of the link are two endpoints of the bottom-layer link.

[0027] In a possible implementation manner of the first aspect, the urgency of each bottom-layer node and the urgency of each bottom-layer link are calculated according to the importance, the historical failure rate, and the independence of each bottom-layer node and the importance, the historical failure rate, and the independence of each bottom-layer link, and the calculation specifically includes:

[0028] The urgency of each bottom-layer node or each bottom-layer link is a linear weighted sum of the corresponding importance, the historical failure rate, and the independence, and the importance weighting factor, the historical failure rate weighting factor, and the independence weighting factor in the linear weighting need to be set according to the routing strategy of the target power communication network.

[0029] In a possible implementation manner of the first aspect, the bottom-layer node backup and the bottom-layer link backup are performed on the bottom-layer network structure using the reserved backup resources according to the sorting result of the urgency, and the backup specifically includes:

[0030] A bottom-layer node with the maximum urgency in the sorting result of the bottom-layer nodes is backed up for multiple times, and the bottom-layer node is removed from the sorting result after the backup, until the reserved backup resources reach the remaining proportion capacity;

[0031] A bottom-layer link with the maximum urgency in the sorting result of the bottom-layer links is backed up for multiple times, and the bottom-layer link is removed from the sorting result after the backup, until the reserved backup resources reach the remaining proportion capacity.

[0032] The second aspect of the embodiment of the present application provides a reliable bottom-layer network resource backup device, comprising:

[0033] a virtual module configured to perform network virtualization on a target power communication network to obtain a bottom-layer network structure and a virtual network structure;

[0034] a mapping module configured to confirm a bottom-layer network structure serving the virtual network structure according to a mapping relationship between the bottom-layer network structure and the virtual network structure; the bottom-layer network structure comprises a plurality of bottom-layer nodes and a plurality of bottom-layer links; the virtual network structure comprises a plurality of virtual nodes and a plurality of virtual links;

[0035] a metering module configured to calculate the importance, the historical failure rate and the independence of each bottom-layer node and the importance, the historical failure rate and the independence of each bottom-layer link according to the bottom-layer network structure;

[0036] a sorting module configured to calculate the urgency of each bottom-layer node and the urgency of each bottom-layer link according to the importance, the historical failure rate and the independence of each bottom-layer node and the importance, the historical failure rate and the independence of each bottom-layer link and sort the bottom-layer nodes and the bottom-layer links according to the urgency;

[0037] a backup module configured to perform bottom-layer node backup and bottom-layer link backup on the bottom-layer network structure using reserved backup resources according to the sorting result of the urgency.

[0038] In a possible implementation manner of the second aspect, the metering module is specifically configured to:

[0039] calculate the importance of each bottom-layer node and the importance of each bottom-layer link according to historical allocation records of the bottom-layer network structure;

[0040] calculate the historical failure rate of each bottom-layer node and the historical failure rate of each bottom-layer link according to historical operation and maintenance records of the bottom-layer network structure;

[0041] calculate the independence of each bottom-layer node and the independence of each bottom-layer link according to the node connection density of the bottom-layer network structure.

[0042] Compared with the prior art, the underlying network structure backup method and device based on urgency provided by the embodiment of the application firstly calculate the importance, historical failure rate and independence of each underlying node and the importance, historical failure rate and independence of each underlying link according to the historical allocation record, historical operation and maintenance record and node connection density of the underlying network structure, then analyze the urgency degree of backup demand of each underlying node or underlying link from the three dimensions of importance, historical failure rate and independence, and then call the reserved backup resources to preferentially backup the underlying nodes or underlying links with high urgency. The urgency sorting of each underlying node or underlying link ensures the rationality of subsequent allocation of backup resources, and more backup resources are concentrated for unreliable resources, especially the underlying structure with small resources is preferentially backed up, thereby effectively improving the availability of the virtual network and the resource allocation rate. BRIEF DESCRIPTION OF DRAWINGS

[0043] Figure 1 is a flowchart of a backup method for underlying network structure based on urgency provided by an embodiment of the application;

[0044] Figure 2 is a comparison chart of virtual network availability after using different backup methods provided by an embodiment of the application;

[0045] Figure 3 is a comparison chart of virtual network resource allocation success rate after using different backup methods provided by an embodiment of the application. DETAILED DESCRIPTION

[0046] The technical solutions in the embodiments of the application will be clearly and completely described below with reference to the drawings in the embodiments of the application. Obviously, the described embodiments are only part of the embodiments of the application, rather than all the embodiments of the application. Based on the embodiments in the application, all other embodiments obtained by those skilled in the art without creative labor fall within the protection scope of the application.

[0047] Please refer to Figure 1 An embodiment of the application provides a backup method for underlying network structure based on urgency, comprising:

[0048] S10, network virtualization is performed on a target power communication network to obtain an underlying network structure and a virtual network structure.

[0049] S11, according to a mapping relationship between the underlying network structure and the virtual network structure, a bottom layer network structure serving the virtual network structure is confirmed; the underlying network structure comprises a plurality of underlying nodes and a plurality of underlying links; the virtual network structure comprises a plurality of virtual nodes and a plurality of virtual links.

[0050] S12, according to the bottom-layer network structure, the importance, historical failure rate, independence of each bottom-layer node and the importance, historical failure rate, independence of each bottom-layer link are calculated respectively.

[0051] S13, according to the importance, historical failure rate, independence of each bottom-layer node and the importance, historical failure rate, independence of each bottom-layer link, the urgency of each bottom-layer node and the urgency of each bottom-layer link are calculated and sorted according to the size of the urgency.

[0052] S14, according to the sorting result of the size of the urgency, the bottom-layer node backup and bottom-layer link backup are performed on the bottom-layer network structure using the reserved backup resources.

[0053] In the network virtualization environment, the traditional network is divided into a bottom-layer network and a virtual network. c =(N c ,E c ) represents, which is built by a bottom-layer network service provider and is mainly responsible for providing bottom-layer network resources. c represents a bottom-layer node set, and E c represents a bottom-layer link set. The bottom-layer node has a computing resource attribute, which is represented by The bottom-layer link has a bandwidth resource attribute, which is represented by .

[0054] The virtual network uses G v =(N v ,E v ) to represent, which is built by a service provider and is mainly responsible for carrying specific power services. v represents a virtual node set of the virtual network, and E v represents a virtual link set of the virtual network. The virtual node has a computing resource attribute, which is represented by The virtual link has a bandwidth resource attribute, which is represented by .

[0055] Existing researches ignore the topological characteristics of the bottom-layer network when backing up the bottom-layer network resources, and there is a problem of low resource backup efficiency.

[0056] ​​According to the mapping relationship between the underlying network structure and the virtual network structure, specifically:

[0057] The virtual nodes of the virtual network structure are carried on the underlying nodes of the underlying network structure, and the virtual links of the virtual network structure are carried on the underlying paths of the underlying network structure.

[0058] To analyze the urgency of the underlying network structure, first, all underlying resources serving the virtual network structure need to be found. According to the mapping relationship, the corresponding underlying nodes and underlying links of the virtual nodes and virtual links of the virtual network structure are found.

[0059] According to the historical allocation records of the underlying network structure, the importance of each underlying node and the importance of each underlying link are calculated.

[0060] According to the historical allocation records of the underlying network structure, the importance of each underlying node and the importance of each underlying link are calculated.

[0061] According to the historical operation and maintenance records of the underlying network structure, the historical failure rate of each underlying node and the historical failure rate of each underlying link are calculated.

[0062] According to the node connection density of the underlying network structure, the independence of each underlying node and the independence of each underlying link are calculated.

[0063] According to the historical allocation records of the underlying network structure, the importance of each underlying node and the importance of each underlying link are calculated, specifically including:

[0064] Calculate the node resource matrix corresponding to each underlying node carrying each virtual node; the matrix element in each node resource matrix is the resource amount of each virtual node;

[0065] Calculate the link resource matrix corresponding to each underlying network carrying each link; the matrix element in each link resource matrix is the hop count of each virtual link and the degree of the starting node;

[0066] Sum all node resource matrices to obtain a total node resource matrix, and sum all link resource matrices to obtain a total link resource matrix;

[0067] Normalize the total node resource matrix and the total link resource matrix to obtain an importance matrix; the diagonal element of the importance matrix represents the average importance of the virtual network node carried on the physical node.

[0068] The embodiment of the present application evaluates the node importance based on the number of allocated virtual nodes, which needs to be obtained from the historical allocation records. Because the nodes that frequently allocate resources have a higher possibility of being allocated again, backup is needed to improve reliability. The embodiment of the present application represents the allocation data of resources in the form of a matrix. In terms of the node resource characteristics, the greater the amount of resources carried on each bottom node, the greater the need for backup. The amount of virtual network resources carried on each physical node is represented by a matrix element. The matrix of virtual node resources carrying the kth virtual network is shown as formula (1). The matrix element is the resource amount of each virtual node. The element value represents the importance of each node in the physical network. The value of each element is the value of the CPU allocated to the virtual node. The subscript n is the total number of physical nodes in the bottom physical network.

[0069]

[0070] In terms of the link resource characteristics, the greater the amount of resources carried on the link in the matrix, the greater the need for backup. The greater the value of the link backup in the same row of the matrix, the greater the value of the link backup. The amount of virtual network resources carried on each physical link is represented by a matrix element. The matrix of link resources carrying the kth virtual network is shown as formula (2). The matrix element is the number of hops of each virtual link and the degree of the starting node, representing the ratio of link reliability and distance, which is calculated using formula (3).

[0071]

[0072]

[0073] In formula (3), represents the degree of the current node, represents the number of links contained in the path from node to node .

[0074] At this time, after the resource allocation of the k virtual networks in a period of time, the total node resource matrix S of the virtual node resources carrying the k virtual networks is shown as formula (4). N

[0075]

[0076] The total link resource matrix S of the links carrying the k virtual networks is shown as formula (5). E

[0077] ​​​​​

[0078] S N S E The normalization is performed using formula (6). Wherein, the diagonal element M ii represents the average importance of the virtual node carrying the virtual network on the physical node. The non-diagonal element M ij represents the average importance of the virtual link carrying the virtual network on the physical link.

[0079]

[0080] Exemplarily, the historical failure rate of each bottom node and the historical failure rate of each bottom link are calculated according to the historical operation and maintenance records of the bottom network structure, specifically including:

[0081] The historical failure rate of each bottom node is the ratio of the number of node failures in a period of time to the maximum value of the number of node failures.

[0082] The historical failure rate of each bottom link is the ratio of the number of link failures in a period of time to the maximum value of the number of link failures.

[0083] The more the number of failures in a period of time, the more likely the current physical resource is to fail. The failure rate of the node and the link is represented by the number of failures in a period of time. The failure rates of the physical node and the physical link are represented by and respectively using formula (7) and formula (8). Wherein, represents the maximum value of the number of failures in a period of time. represents the number of failures of the physical node in a period of time. represents the maximum value of the number of failures in a period of time. represents the number of failures of the physical link in a period of time.

[0084]

[0085]

[0086] Exemplarily, the independence of each bottom node and the independence of each bottom link are calculated according to the node connection density of the bottom network structure, specifically including:

[0087] The independence of each bottom node is the reciprocal of the degree of the current node.

[0088] The independence of each underlying link is the reciprocal of the sum of the degree of the first node of the link and the degree of the second node of the link; the first node of the link and the second node of the link are the two endpoints of the underlying link.

[0089] physical nodes Resource independence It is the connection density of the nodes surrounding the current node, calculated using formula (9). This represents the degree of the current node. A lower degree indicates a more independent node. When the connection density of a node's surrounding nodes is low, there are no readily available resources to recover from a failed node. When the connection density is high, a dynamic migration strategy can be used to quickly migrate resources, thereby restoring resources on the failed node.

[0090]

[0091] physical link Resource independence This is the connection density between the two nodes of the current link, calculated using formula (10). Wherein, physical nodes... and physical nodes It is a physical link The two endpoints of a link. A smaller degree indicates a more independent node. When the degree of surrounding nodes on a physical link is low, there are no readily available resources to recover after a link failure. Conversely, a higher degree allows for rapid resource migration through dynamic migration strategies, thus restoring resources on the failed link.

[0092]

[0093] The urgent use of underlying node resource backup This indicates that the calculation is performed using formula (11). The importance of a node is represented by the importance matrix M. ii m corresponding to the diagonal element values ii The urgent need for backup of underlying link resources. This indicates that the calculation is performed using formula (12). The importance of the link is represented by the importance matrix M. ij m corresponding to the diagonal elements of the non-Chinese ij .

[0094]

[0095]

[0096] Through the attribute analysis of each resource, the more important the underlying resource is, the more it needs higher reliability. The more historical failure of the underlying resource is, the more it needs backup. The more independent the resource is, the more it needs backup. In order to balance the value of each attribute, generally speaking, according to experience, the weight of importance is 40%, the weight of historical failure is 30%, and the weight of resource independence is 30%.

[0097] Exemplarily, the calculation of the urgency of each underlying node and the urgency of each underlying link according to the importance, historical failure rate, independence of each underlying node and the importance, historical failure rate, independence of each underlying link specifically comprises:

[0098] The urgency of each underlying node or each underlying link is the linear weighted sum of the corresponding importance, historical failure rate and independence, and in the linear weighting, the importance weighting factor, the historical failure rate weighting factor and the independence weighting factor need to be set according to the routing strategy of the target power communication network.

[0099] Exemplarily, S14 specifically comprises:

[0100] The underlying node with the maximum urgency in the sorting result of the underlying node is backed up for multiple times, and after backup, the underlying node is removed from the sorting result until the reserved backup resource reaches the remaining proportion capacity;

[0101] The underlying link with the maximum urgency in the sorting result of the underlying link is backed up for multiple times, and after backup, the underlying link is removed from the sorting result until the reserved backup resource reaches the remaining proportion capacity.

[0102] To solve the problem of low reliability of virtual network, the embodiment of the application is a bottom-layer network structure backup method based on urgency (RIASFCoRBC). To analyze the performance of RIASFCoRBC, a network topology generation tool GT-ITM is used to generate a network environment. The network topology includes two network topologies of underlying network and virtual network. In terms of underlying network topology, different numbers of underlying network nodes are used to simulate networks of different sizes. The number of underlying network nodes increases from 50 to 100.

[0103] Through analysis of the existing research, it is known that the bottom-layer network resource reliability improvement algorithm (RIAUNRoFC) based on fault features is a common method for improving the reliability of bottom-layer network resources. The algorithm uses backup resources to backup the resource with the most fault times, thereby improving the reliability of the bottom-layer network resources. In order to compare the performance of the two algorithms, the network reliability of the virtual network in the fault environment of the bottom-layer network is used for evaluation in the experiment. The fault environment of the bottom-layer network is simulated by interrupting the bottom-layer link. When simulating the bottom-layer link interruption, [2%, 3%] of the bottom-layer basic links are randomly selected as the interrupted links. In the algorithm comparison, the availability rate of the virtual network and the resource allocation success rate of the virtual network are used for analysis. In terms of the backup resource capacity, the backup resource capacity is 15% of the total resource capacity.

[0104] In terms of the availability rate of the virtual network, the running results of the two algorithms are as shown in Figure 2 . In the figure, the X-axis represents the number of bottom-layer nodes, and the Y-axis represents the availability rate of the virtual network after some bottom-layer nodes fail. It can be known from the figure that, under different network scales, the availability rates of the virtual networks of the two algorithms are relatively stable. It is indicated that the two algorithms can converge under different bottom-layer node network environments. It can be known from the running results of the two algorithms that the availability rate of the virtual network under the algorithm of the application is higher than that of the comparison algorithm. This is because the backup resources of the algorithm of the application are considered from multiple dimensions such as importance, historical failure rate and independence, thereby guaranteeing the reliability of the bottom-layer network resources and improving the availability rate of the bottom-layer network resources.

[0105] In terms of the resource allocation success rate of the virtual network, the running results of the two algorithms are as shown in Figure 3 . In the figure, the X-axis represents the number of bottom-layer nodes, and the Y-axis represents the resource allocation success rate of the virtual network after some bottom-layer nodes fail. It can be known from the figure that, with the increase of the number of bottom-layer network nodes, the resource allocation success rates of the virtual networks of the two algorithms are increasing. This is because the increase of the size of the bottom-layer network can provide more resources for the virtual network, thereby improving the success rate of resource allocation. In terms of the comparison of the results of the two algorithms, the resource allocation success rate of the virtual network under the algorithm of the application is higher, because the bottom-layer resources are backed up from the dimensions of importance, historical failure rate and independence, thereby better improving the availability rate of the bottom-layer network resources and meeting the resource demand of more virtual networks.

[0106] An embodiment of the application provides a bottom-layer network resource backup device based on reliability, comprising a virtual module, a mapping module, a metering module, a sorting module and a backup module.

[0107] The virtual module is used for network virtualization of a target power communication network to obtain a bottom-layer network structure and a virtual network structure.

[0108] A mapping module is configured to confirm an underlying network structure serving the virtual network structure according to a mapping relationship between the underlying network structure and the virtual network structure; the underlying network structure comprises a plurality of underlying nodes and a plurality of underlying links; and the virtual network structure comprises a plurality of virtual nodes and a plurality of virtual links.

[0109] A measurement module is configured to calculate the importance, the historical failure rate, and the independence of each underlying node and the importance, the historical failure rate, and the independence of each underlying link according to the underlying network structure.

[0110] A sorting module is configured to calculate the urgency of each underlying node and the urgency of each underlying link according to the importance, the historical failure rate, and the independence of each underlying node and the importance, the historical failure rate, and the independence of each underlying link, and sort the urgency in descending order.

[0111] A backup module is configured to perform underlying node backup and underlying link backup on the underlying network structure using the reserved backup resources according to the sorting result of the urgency.

[0112] For example, the measurement module is specifically configured to:

[0113] calculate the importance of each underlying node and the importance of each underlying link according to historical allocation records of the underlying network structure;

[0114] calculate the historical failure rate of each underlying node and the historical failure rate of each underlying link according to historical operation and maintenance records of the underlying network structure;

[0115] calculate the independence of each underlying node and the independence of each underlying link according to the node connection density of the underlying network structure.

[0116] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the device described above can refer to the corresponding process in the foregoing method embodiments, which will not be repeated here.

[0117] Compared with the prior art, the bottom-layer network structure backup device based on urgency provided by the embodiment of the application calculates the importance, historical failure rate and independence of each bottom-layer node and the importance, historical failure rate and independence of each bottom-layer link according to the historical allocation record, historical operation and maintenance record and node connection density of the bottom-layer network structure in sequence, then analyzes the urgency degree of backup demand of each bottom-layer node or bottom-layer link from the three dimensions of importance, historical failure rate and independence, and then calls the reserved backup resource to preferentially backup the bottom-layer node or bottom-layer link with high urgency. The urgency sorting of each bottom-layer node or bottom-layer link ensures the rationality of subsequent allocation of backup resources, and more backup resources are concentrated for unreliable resources, especially the bottom-layer structure with small resources is preferentially backed up, thereby effectively improving the availability of the virtual network and the resource allocation rate.

[0118] The above is the preferred embodiment of the application. It should be noted that those skilled in the art can make several improvements and refinements without departing from the principles of the application, and these improvements and refinements are also considered within the protection scope of the application.

Claims

1. A method for backing up a network infrastructure based on urgency, characterized in that, Comprising network virtualization is performed on a target power communication network to obtain an underlying network structure and a virtual network structure; an underlying network structure serving the virtual network structure is determined according to a mapping relationship between the underlying network structure and the virtual network structure; the underlying network structure comprises a plurality of underlying nodes and a plurality of underlying links; the virtual network structure comprises a plurality of virtual nodes and a plurality of virtual links; importance, historical failure rate, and independence of each underlying node and importance, historical failure rate, and independence of each underlying link are calculated according to the underlying network structure; importance, historical failure rate, and independence of each underlying node and importance, historical failure rate, and independence of each underlying link are calculated according to the underlying network structure, and urgency of each underlying node and urgency of each underlying link are calculated and sorted according to the urgency; the underlying network structure is backed up in terms of underlying nodes and underlying links using reserved backup resources according to the sorting result of the urgency; the calculation of importance, historical failure rate, and independence of each underlying node and importance, historical failure rate, and independence of each underlying link according to the underlying network structure is specifically: importance of each underlying node and importance of each underlying link are calculated according to historical allocation records of the underlying network structure; historical failure rate of each underlying node and historical failure rate of each underlying link are calculated according to historical operation and maintenance records of the underlying network structure; independence of each underlying node and independence of each underlying link are calculated according to node connection density of the underlying network structure; the calculation of importance of each underlying node and importance of each underlying link according to the historical allocation records of the underlying network structure specifically includes: a node resource matrix corresponding to each underlying node is calculated when each underlying node carries each virtual node; a matrix element in each node resource matrix is a resource amount of each virtual node; a link resource matrix corresponding to each underlying network is calculated when each underlying network carries each link; a matrix element in each link resource matrix is a hop number of each virtual link and a degree number of a starting node; total node resource matrices are summed to obtain a total node resource matrix, and total link resource matrices are summed to obtain a total link resource matrix; importance matrices are obtained by normalizing the total node resource matrix and the total link resource matrix; diagonal elements of the importance matrices represent average importance degrees of virtual network nodes carried on physical nodes; the calculation of historical failure rate of each underlying node and historical failure rate of each underlying link according to the historical operation and maintenance records of the underlying network structure specifically includes: the historical failure rate of each underlying node is a ratio of a number of node failures in a period of time to a maximum value of the number of node failures; the historical failure rate of each underlying link is a ratio of a number of link failures in a period of time to a maximum value of the number of link failures; the calculation of independence of each underlying node and independence of each underlying link according to the node connection density of the underlying network structure specifically includes: The independence of each bottom-layer node is the reciprocal of the degree of the current node; The independence of each bottom-layer link is the reciprocal of the sum of the degree of the first node of the link and the degree of the second node of the link; the first node of the link and the second node of the link are two endpoints of the bottom-layer link.

2. The method of claim 1, wherein the method further comprises: The mapping relationship between the bottom-layer network structure and the virtual network structure is specifically as follows: The virtual nodes of the virtual network structure are carried on the bottom-layer nodes of the bottom-layer network structure, and the virtual links of the virtual network structure are carried on the bottom-layer paths of the bottom-layer network structure.

3. The method of claim 1, wherein the method further comprises: determining whether the network structure is in a critical state; and if the network structure is in the critical state, performing the backup of the network structure. The calculation of the urgency of each bottom-layer node and the urgency of each bottom-layer link according to the importance, historical failure rate and independence of each bottom-layer node and the importance, historical failure rate and independence of each bottom-layer link specifically includes: The urgency of each bottom-layer node or each bottom-layer link is a linear weighted sum of the corresponding importance, historical failure rate and independence, and the importance weighting factor, the historical failure rate weighting factor and the independence weighting factor in the linear weighting need to be set according to the routing strategy of the target power communication network.

4. The underlying network structure backup method based on urgency as described in claim 1, characterized in that, The bottom-layer node backup and the bottom-layer link backup of the bottom-layer network structure using the reserved backup resources according to the sorting result of the urgency specifically include: The bottom-layer node with the maximum urgency in the bottom-layer node sorting result is backed up for multiple times, and the bottom-layer node is removed from the sorting result after backup until the reserved backup resources reach the remaining proportion capacity; The bottom-layer link with the maximum urgency in the bottom-layer link sorting result is backed up for multiple times, and the bottom-layer link is removed from the sorting result after backup until the reserved backup resources reach the remaining proportion capacity.

5. A device for backing up a network infrastructure based on urgency, characterized by The method specifically includes: a virtual module configured to perform network virtualization on a target power communication network to obtain a bottom-layer network structure and a virtual network structure; a mapping module configured to confirm a bottom-layer network structure serving the virtual network structure according to a mapping relationship between the bottom-layer network structure and the virtual network structure; the bottom-layer network structure includes a plurality of bottom-layer nodes and a plurality of bottom-layer links; the virtual network structure includes a plurality of virtual nodes and a plurality of virtual links; a measurement module configured to calculate the importance, the historical failure rate and the independence of each bottom-layer node and the importance, the historical failure rate and the independence of each bottom-layer link according to the bottom-layer network structure; a sorting module configured to calculate the urgency of each bottom-layer node and the urgency of each bottom-layer link according to the importance, the historical failure rate and the independence of each bottom-layer node and the importance, the historical failure rate and the independence of each bottom-layer link and sort the urgency; a backup module configured to perform bottom-layer node backup and bottom-layer link backup of the bottom-layer network structure using reserved backup resources according to the sorting result of the urgency; The measurement module is specifically configured to: calculate the importance of each bottom-layer node and the importance of each bottom-layer link according to historical allocation records of the bottom-layer network structure; calculate the historical failure rate of each bottom-layer node and the historical failure rate of each bottom-layer link according to historical operation and maintenance records of the bottom-layer network structure; According to the node connection density of the bottom-layer network structure, the independence of each bottom-layer node and the independence of each bottom-layer link are respectively calculated; According to the historical allocation record of the bottom-layer network structure, the importance of each bottom-layer node and the importance of each bottom-layer link are respectively calculated, and the calculation specifically includes: A node resource matrix corresponding to each bottom-layer node when carrying each virtual node is calculated, and a matrix element in each node resource matrix is the resource amount of each virtual node; A link resource matrix corresponding to each bottom-layer network when carrying each link is calculated, and a matrix element in each link resource matrix is the hop number of each virtual link and the degree of the starting node; The total node resource matrix is obtained by summing all node resource matrices, and the total link resource matrix is obtained by summing all link resource matrices; The total node resource matrix and the total link resource matrix are normalized to obtain an importance matrix, and a diagonal element of the importance matrix represents the average importance of a virtual network node carried on a physical node; According to the historical operation and maintenance record of the bottom-layer network structure, the historical failure rate of each bottom-layer node and the historical failure rate of each bottom-layer link are respectively calculated, and the calculation specifically includes: The historical failure rate of each bottom-layer node is the ratio of the number of node failures in a period of time to the maximum value of the number of node failures; The historical failure rate of each bottom-layer link is the ratio of the number of link failures in a period of time to the maximum value of the number of link failures; According to the node connection density of the bottom-layer network structure, the independence of each bottom-layer node and the independence of each bottom-layer link are respectively calculated, and the calculation specifically includes: The independence of each bottom-layer node is the reciprocal of the degree of the current node; The independence of each bottom-layer link is the reciprocal of the sum of the degree of the first node of the link and the degree of the second node of the link, and the first node of the link and the second node of the link are two endpoints of the bottom-layer link.

Images