Ant colony optimization quasi real-time pool key-based survivability virtual network mapping method

Abstract

The invention relates to a survivability virtual network mapping method based on an ant colony optimization quasi real-time pool key, and belongs to the technical field of optical fiber transmission and optical communication. According to the method provided by the invention, the quantum key distribution network is deployed to the elastic optical network, so that the survivability secure transmission of the virtual network is ensured. Designing a physical node importance degree evaluation method by evaluating the potential fault probability of an optical fiber link in the elastic optical network; virtual link mapping of a virtual network is divided into two stages: in a ciphertext data transmission path mapping stage, a ciphertext data secure transmission path mapping method based on ant colony optimization is adopted; in the quantum key distribution path mapping stage, a quantum key distribution path mapping method based on a quasi real-time key pool is adopted; and finally, when the elastic optical network has a disaster, evaluating the disaster conditions of different physical components, and remapping the affected physical components by adopting a fault recovery method based on physical component sorting perception. According to the method, the virtual network mapping performance and the elastic optical network service quality can be improved.

Description

Technical Field

[0001] The invention belongs to the technical field of optical fiber communication and reliable transmission of optical signals, and relates to a survivable virtual network mapping method based on ant colony optimization of quasi-real-time pool keys. Background Art

[0002] In the digital age, with the popularization of various intelligent applications, people's demand for network bandwidth has increased exponentially, making limited network resources even more scarce. How to improve the utilization of network resources has become urgent. Elastic Optical Networks (EONs) can dynamically allocate spectrum resources according to the bandwidth requirements of different services, thereby improving the flexibility and utilization of resource allocation, and are considered to be an effective solution to improve network resource utilization. In addition, since the resources in the communication network use different devices and protocols, it is difficult to achieve unified scheduling and management, which makes the communication network fall into a rigid state. Network virtualization technology can solve the problem of network rigidity by abstracting and isolating the underlying elastic optical network resources. Virtual network mapping is one of the key issues of network virtualization technology. Its core lies in how to efficiently allocate the underlying elastic optical network resources to the virtual network under the condition of satisfying the virtual network resource constraints.

[0003] With the rapid development of network virtualization technology, the security of data transmission in virtual networks deployed on optical networks cannot be ignored. Traditionally, one of the effective methods to ensure the security of data transmission is data encryption. Currently, the famous encryption methods rely on the computational complexity of mathematical functions, such as factoring large integers or discrete logarithms, but this encryption method that relies on mathematical functions can be cracked by quantum computers in a very short time, and the security of data transmission cannot be guaranteed. Quantum Key Distribution (QKD) can theoretically guarantee the security of data transmission by providing secure quantum keys to both communicating parties. Therefore, the QKD network is combined with EONs as the underlying elastic optical network of the virtual network to ensure the security of data transmission in the virtual network.

[0004] With the aging of optical fiber links and the occurrence of natural disasters and other failure events, nodes and links in the underlying elastic optical network are prone to failure, resulting in the loss of data being transmitted. Therefore, the survivability of virtual networks also needs further research. Unlike traditional survivability virtual network mapping, the survivability of virtual networks with encryption requests not only needs to consider the serious economic losses caused by the interruption or loss of data transmission, but also needs to consider the effective generation of quantum keys in the event of failure to ensure the sustainability of quantum key supply capabilities. Therefore, it is of great significance to ensure the survivability transmission of virtual networks with encryption requests and to reasonably allocate resources. Summary of the invention

[0005] In view of this, an object of the present invention is to provide a survivable virtual network mapping method based on ant colony optimization quasi-real-time pool key, so as to improve the success rate of virtual network mapping.

[0006] In order to achieve the above object, the present invention provides the following technical solutions:

[0007] A survivable virtual network mapping method based on ant colony optimization quasi-real-time pool key, in which the multi-dimensional resource attributes of virtual nodes and physical nodes are comprehensively evaluated according to the potential failure probability of the underlying physical link, and the virtual node importance evaluation formula and the physical node importance evaluation formula are used to map the virtual node with a large importance value to the physical node with a large importance value; in the virtual link mapping process, in the ciphertext data transmission path mapping stage, ant agents are used to globally search for the optimal path by updating the transition probability, and the ciphertext data transmission path mapping method based on ant colony optimization is adopted; in the quantum key distribution path mapping stage, a quantum key distribution path mapping method based on a quasi-real-time key pool is adopted; when a disaster occurs in the underlying elastic optical network, the disaster situation of different physical components is evaluated, and the affected physical components are remapped by a fault recovery method based on physical component ranking perception; the method specifically includes the following steps:

[0008] Input: Input virtual network request, bottom layer elastic optical network topology and resource status, input computing resource requirements of each virtual node in the virtual network, bandwidth resource requirements of virtual links and key resource requirements, remaining computing resource capacity of physical nodes in the bottom layer elastic optical network, remaining bandwidth resource capacity of physical links and remaining key resource capacity in each quasi-real-time key pool, key storage time t=0, key available time threshold T k =30u, fault detection time T = 100s, pheromone concentration value, heuristic function value, transition probability value, total number of ants |A| = 100, ant e = 0, maximum number of iterations N = 50, iteration variable i = 0, random constant r = 0, set constant r0 = 0.5;

[0009] Output: virtual network mapping results;

[0010] S1: Design a virtual node importance evaluation formula based on factors such as the computing resource requirements of virtual nodes, virtual node degrees, bandwidth resource requirements of adjacent links, and key resource requirements. Calculate the importance values ​​of all unmapped virtual nodes and arrange the unmapped virtual nodes in non-ascending order according to their importance values ​​into a set N. v , and the virtual node with the largest importance value is recorded as

[0011] Among them, the virtual node is not mapped The importance value of is calculated as follows:

[0012]

[0013] In the above formula, Represents a virtual node The computing resources required, Represents the total computing resource requirements of all virtual nodes in the virtual network. Representation and Virtual Nodes Adjacent Virtual Links The bandwidth resource requirements Representation and Virtual Nodes Adjacent Virtual Links The key resource requirements, B(l v ) indicates virtual link l v The bandwidth requirement of k(l v ) indicates virtual link l v The key requirement, Represents the total bandwidth requirements of all virtual links in the virtual network.

[0014] represents the sum of all virtual link key resource requirements in the virtual network, Represents a virtual node The node degree of , α1, β1, and γ1 are weight coefficients. The larger the virtual node importance value, the higher the priority of the virtual node mapping;

[0015] S2: Design a physical node importance evaluation formula based on the physical node computing resource capacity, physical node degree, bandwidth resource capacity on adjacent physical links, key resource capacity, and available spectrum occupancy, calculate the importance values ​​of all physical nodes, and arrange the physical nodes into a set N in non-ascending order according to the importance values ​​of the physical nodes. s , and the physical node with the largest importance value is recorded as

[0016] Among them, the physical node The importance value of is calculated as follows:

[0017]

[0018] In the above formula, Represents a physical node in the underlying elastic optical network Available computing resources, Represents a physical node The node degree of Representation and physical nodes Adjacent physical link, AM(n v ) indicates that the virtual node n vThe set of physical nodes mapped to adjacent virtual nodes, hop(m',m) is the distance from candidate physical node m to AM(n v ) is the number of hops of the minimum hop physical optical path of each physical node m' in the set, and the number of hops in formula (3) is For physical link The potential failure probability of a physical node; the higher the importance value of a physical node, the more likely the physical node is to be used as a mapping physical node for a virtual node;

[0019] S3: Set N v The virtual nodes in the set are mapped to N in turn. s On the physical node;

[0020] The specific steps of the method described in S3 are:

[0021] S301: If there is a virtual node in the elastic optical network that satisfies The computing resource requirements of the physical nodes Right now The virtual node Mapping to physical nodes If yes, go to step S302; otherwise, the virtual network mapping fails;

[0022] S302: From the set N v Delete the mapped virtual node And from the set N s Delete the physical node that hosts the virtual node If the set N v If it is empty, go to S4; otherwise, go to S303;

[0023] S303: Select the next unmapped virtual node requested by the virtual network in order and mark it as Set N s The physical node with the largest weight value in is marked as Go to S301;

[0024] S4: Calculate the importance value of each virtual link in the virtual network, and arrange the virtual links in descending order according to the importance value of the virtual link into a set L v middle;

[0025] Among them, the connection is in the virtual node and Virtual Link The importance value of is calculated as follows:

[0026]

[0027] In the above formula, Represents the virtual node with the largest virtual node importance value in the virtual network, as well as Represents virtual nodes Virtual Node With virtual nodes The number of hops;

[0028] S5: From the set L v The virtual links to be mapped requested by the virtual network are selected in order, and for each virtual link, a ciphertext data transmission path mapping method based on ant colony optimization is adopted to map the bandwidth resource requirements of the virtual link to the physical optical path, so as to realize ciphertext data transmission path mapping;

[0029] S6: For the virtual link that has realized the path mapping of ciphertext data transmission, a quantum key distribution path mapping method based on a quasi-real-time key pool is used to map the key resource requirements of the virtual link to the physical optical path to realize quantum key distribution path mapping;

[0030] S7: If a component of the elastic optical network is detected to have failed, the service data or ciphertext data carried by the affected physical component is remapped based on a physical component order-aware fault recovery method;

[0031] The ciphertext data transmission path mapping method based on ant colony optimization in S5 specifically includes the following steps:

[0032] S501: Order DL v =L v ;

[0033] S502: DL the collection v The virtual link with the largest virtual link importance value is marked as And find out the virtual link l1 v The mapped physical nodes of the virtual nodes at both ends are marked as n s and n d , let m = n s ;

[0034] S503: Release |A| ants from the physical node m, where A is the ant set, and randomly generate the ant pheromone concentration on each physical link;

[0035] S504: randomly generate a constant r, and calculate the probability of the physical node m of the elastic optical network transferring to each neighboring node according to the size of r and r0;

[0036] The calculation method of the transfer probability of the kth ant from the physical node m to the neighboring node n at time t is:

[0037]

[0038] In the above formula, τ mn (t) represents the number of ants passing through the physical link at time t The residual pheromone concentration, the greater the pheromone concentration, the greater the probability of ant migration, τ mq (t) represents the number of ants passing through the physical link at time t The residual pheromone concentration; η mn (t) and η mq (t) represents the heuristic function, Nei m Represents the set of neighboring nodes to which node m can be transferred, n∈Nei m , α2 and β2 are adjustment factors that control the relative weights of pheromone and heuristic function;

[0039] Heuristic function η mn (t) is calculated as follows:

[0040]

[0041] In the above formula, Indicates the physical link The potential failure risk level, P s,n From physical node n s The physical optical path to the physical node n, ω1 and ω2 are adjustment factors, SF(P s,n ) is the physical optical path P s,n The fragmentation change value;

[0042] Among them, the physical optical path P s,n The fragmentation change value on is calculated as follows:

[0043]

[0044]

[0045] Where SR represents the physical optical path P s,n The smaller the value, the smaller the spectrum fragmentation of the physical optical path P s,n The more severe the spectrum fragmentation is, the i is a binary variable. If the ith frequency slot is idle, its value is 1; otherwise, its value is 0. s,n ) represents the physical optical path P s,n The number of idle spectrum blocks on SR bef With SR after Respectively represent the physical optical path P s,n Spectrum fragmentation measurement on the physical optical path before and after allocating spectrum resources required for virtual links;

[0046] S505: From the collectionm Select the neighbor node n with large transition probability i As a physical node m transfer node, update the physical link The pheromone concentration on the surface is used to determine n i Whether it is a virtual link The destination node n d , if n i =n d , then go to S506; otherwise, set m=n i , go to S503;

[0047] Among them, the physical link The updated calculation formula for the pheromone concentration is:

[0048]

[0049] Among them, ρ represents the pheromone concentration factor, |A| is the total number of ants, P s,i From physical node n s To physical node n i The physical optical path P s,i The number of hops, Represents the physical optical path P s,i From physical node m to physical node n i The physical link, SF(P s,i ) indicates that in the physical optical path P s,i The fragmentation metric change value before and after allocating the spectrum resources required for virtual link mapping;

[0050] S506: If the physical node n s Physical Node n d The physical optical path P s,d There is a virtual link on The spectrum resources required for the ciphertext data transmission go to S507; otherwise, the virtual network mapping fails;

[0051] S507: Use the head-end matching method to allocate spectrum resources, from the set DL v Delete the mapped virtual link If the set DL v If it is empty, go to S508; otherwise, go to S502;

[0052] S508: All encrypted data transmission paths of the virtual network are mapped successfully;

[0053] In S6, the quantum key distribution path mapping method based on the quasi-real-time key pool specifically includes the following steps:

[0054] S601: randomly generating key generation rates in each quasi-real-time key pool, and storing quantum key resources generated by the quantum key distribution system into the quasi-real-time key pool;

[0055] S602: Update the key capacity in the quasi-real-time key pool. If the storage time of the key resources in the quasi-real-time key pool exceeds the available time threshold T k , then the k Destroy the used key resources;

[0056] Among them, update the physical link The calculation formula for the key capacity in the quasi-real-time key pool at time t is:

[0057]

[0058]

[0059] In the above formula, Indicates the physical link within the key storage time t The remaining capacity of key resources in the quasi-real-time key pool. Indicates the physical link within the key storage time t The amount of key resources generated in the quasi-real-time key pool. Indicates the physical link within the key storage time t The key resource consumption in the quasi-real-time key pool is ξ, which is a Boolean variable indicating the physical link Whether the encryption request of the virtual link can be met, T k is the time threshold of the quantum key, represents the key requirement of the virtual link, K(P s,d ) represents physical node n s Physical Node n d The physical optical path P s,d The remaining key resource capacity set of each link, minK(P s,d ) represents the physical optical path P s,d The minimum remaining key resource capacity in each physical link;

[0060] S603: Set L v The virtual link with the largest virtual link importance value is marked as set up The key resource requirement is

[0061] S604: According to Finding Virtual Links in Elastic Optical Networks Using K-Shortest Path Algorithm The candidate quantum key distribution paths are selected, and the weight value of each candidate quantum key distribution path is calculated according to the weight value calculation formula of the quantum key distribution path, and the candidate quantum key distribution paths are arranged in descending order into the set QL;

[0062] Among them, the quantum key distribution path The weight value calculation method is:

[0063]

[0064] in, Virtual Link Candidate quantum key distribution paths for for The link set, For the optical path A physical link between physical nodes m and v on Represents the physical optical path The number of hops, is a Boolean variable. If the physical link The remaining capacity of the quasi-real-time key pool is the physical optical path The link with the least remaining capacity of the key resource has a value of 1; otherwise, the value is 0;

[0065] S605: Select the quantum key distribution path with the largest weight value from the set QL, mark it as optical path P1, and count the maximum available key resources on optical path P1 if Then distribute the virtual link on optical path P1 The quantum key is obtained and the process goes to S607; otherwise, the process goes to S606;

[0066] S606: Select the next quantum key distribution path from the set QL, mark it as light path P2, and count the maximum available key resources on light path P2 if Then the optical path P1 does not meet The remaining key resource requirements Map to optical path P2, and go to S607; otherwise, the quantum key distribution path mapping requested by the virtual network fails, and go to S608;

[0067] S607: From L v Delete Let QL be an empty set. If L v is a non-empty set, go to S602; otherwise, the quantum key distribution path mapping of the virtual network is successful, go to S608;

[0068] S608: If the quantum key distribution path mapping of the virtual network is successful, output the quantum key distribution path information of each virtual link of the virtual network; otherwise, output the information that the quantum key distribution mapping path of the virtual network fails;

[0069] In S7, the fault recovery method based on physical component ordering awareness specifically includes the following steps:

[0070] S701: Calculate the importance values ​​of virtual nodes corresponding to the physical nodes affected by the disaster in the elastic optical network, and arrange the virtual nodes corresponding to the physical nodes affected by the disaster in descending order into a set AN;

[0071] S702: Mark the virtual node with the largest importance value in the set AN as And calculate the importance values ​​of the remaining physical nodes that are not affected by the disaster in the underlying elastic optical network, and arrange the remaining physical nodes that are not affected by the disaster in descending order into the set SN;

[0072] S703: Record the physical node with the largest importance value in the set SN as If the physical node Available computing resources satisfy the virtual node The computing resource requirements of the virtual node Remap to physical nodes If yes, go to S705; otherwise, go to S704;

[0073] S704: Delete the physical node from the set SN Determine whether the set SN is empty. If it is empty, the virtual network recovery fails; otherwise, go to S703;

[0074] S705: Delete the successfully remapped virtual nodes from the set AN, and determine whether the set AN is empty. If it is empty, go to S706; otherwise, go to S702;

[0075] S706: Calculate virtual nodes affected by the disaster The importance of adjacent virtual links is calculated, and the virtual links adjacent to the virtual nodes affected by the disaster are arranged in descending order into the set AL;

[0076] S707: Order L v = AL, calling the ciphertext data transmission path mapping method based on ant colony optimization described in S5, for L v The virtual links in the set find the ciphertext data transmission path; if all ciphertext data transmission paths are successfully mapped, go to S708; otherwise, the path recovery failure is marked, go to S711;

[0077] S708: calling a quantum key distribution path mapping method based on a quasi-real-time key pool, and searching for quantum key distribution paths for each virtual link in the virtual link set in turn. If all quantum key distribution paths are successfully mapped, go to S709; otherwise, mark path recovery failure, and go to S711;

[0078] S709: Calculate the recovery order values ​​of the remaining physical links affected by the disaster and not rerouted, and arrange them in descending order into the set SL according to the recovery order values ​​of the affected physical links;

[0079] Among them, the affected physical links The recovery order value of is calculated as follows:

[0080]

[0081] In the above formula, Indicates the physical links affected by the disaster The set of virtual links carried on Indicates the physical links affected by the disaster The number of virtual links carried on Indicates the physical links affected by the disaster The virtual link l carried by v The sum of bandwidth requirements and key requirements;

[0082] S710: In the elastic optical network, select the physical links in the SL set in turn, and find the shortest hop path that does not pass through the affected physical link according to the starting point and end point of the selected physical link. If the rerouting of the physical links in the SL set is successful, go to S711; otherwise, mark the path recovery failure and go to S711;

[0083] S711: If the path recovery fails, the damaged virtual network remapping fails; if denied, the ciphertext data transmission path, quantum key distribution path and damaged recovery rerouting information of the damaged virtual network remapping success are output, and the algorithm ends. BRIEF DESCRIPTION OF THE DRAWINGS

[0084] In order to make the purpose, technical solution and beneficial effects of the present invention clearer, the present invention provides the following drawings for illustration:

[0085] Figure 1 It is a schematic diagram of virtual node mapping;

[0086] Figure 2 Schematic diagram for building a quasi-real-time quantum key pool;

[0087] Figure 3 A flow chart of a survivable virtual network mapping method based on ant colony optimization of quasi-real-time pool keys;

[0088] Figure 4 It is a flow chart of the ciphertext data transmission path mapping method based on ant colony optimization;

[0089] Figure 5 The flowchart of the quantum key distribution path mapping method based on the quasi-real-time key pool is shown;

[0090] Figure 6 A flow chart of a fault recovery method based on physical component ordering awareness; DETAILED DESCRIPTION

[0091] The preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

[0092] The survivability virtual network mapping method based on ant colony optimization quasi-real-time pool key provided by the present invention aims to better improve the success rate of virtual network mapping. The present invention can also be implemented or applied through other different specific implementation methods, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that the illustrations provided in the following embodiments only illustrate the basic concept of the present invention in a schematic manner, and the following embodiments and the features in the embodiments can be combined with each other without conflict.

[0093] Among them, the figures are only used for illustrative explanations, and they only represent schematic diagrams rather than actual pictures, and should not be understood as limitations on the present invention. In order to better illustrate the embodiments of the present invention, some parts in the figures may be omitted, enlarged or reduced, and do not represent the size of the actual product. For those skilled in the art, it is understandable that some well-known structures in the figures and their descriptions may be omitted.

[0094] As attached Figure 1 The schematic diagram of the virtual link mapping order sorting method shown in FIG. Figure 1 (a) contains a virtual network request of 5 virtual nodes and 5 virtual links. The numbers in the boxes next to the virtual nodes represent the computing resources required by the virtual nodes, that is, virtual nodes a, b, c, d, and e require 5, 6, 4, 5, and 4 units of computing resources respectively. The numbers in brackets on the virtual links represent the bandwidth resources and key resources required by the virtual links, that is, virtual links ab, ac, be, cd, and de require 50Gbps, 100Gbps, 50Gbps, 50Gbps, and 100Gbps of bandwidth resources and 6, 10, 4, 4, and 6 units of key resources respectively. According to formula (1), the importance value of each virtual node can be calculated as follows:

[0095] According to the virtual node importance values, the mapping order of the virtual nodes is arranged in descending order, and the virtual node mapping order can be obtained as: acdbe.

[0096] Figure 1 (b) is an underlying elastic optical network with 7 physical nodes and 9 physical links. The numbers in the boxes next to the physical nodes represent the amount of computing resources that the physical nodes can provide, and the numbers in the brackets on the physical links represent the amount of bandwidth resources and key resources that the physical links can provide. Assuming that virtual nodes a and c have been mapped to physical nodes D and C, virtual node d will be mapped next. The virtual nodes adjacent to virtual node d are c and e. Since virtual node c has been mapped to physical node C, and virtual node e has not yet been mapped to a physical node, the node included in AM(d) is physical node C. According to formula (2), the importance values ​​of the remaining physical nodes in the underlying elastic optical network that do not carry virtual nodes are calculated, which are: PIN(A) = (2·30) / {(1+2)·(0.696+0.712)}≈14.2. Similarly, it can be calculated that: PIN(B)≈21.62, PIN(E)≈13.58, PIN(F)≈8.34, PIN(G≈9.23. By comparison, it is found that physical node B has the maximum importance value, and the remaining computing resources that physical node B can provide meet the computing requirements of virtual node d. Therefore, virtual node d is mapped to physical node B. Next, virtual node b is mapped, and the virtual node adjacent to virtual node b and mapped is virtual node a, then the node included in AM(b) is physical node D. According to formula (2), the importance values ​​of the remaining physical nodes that do not carry virtual nodes are calculated, PIN(A) = (2·30) / {(1+3)·(0.696+0.712)}≈10.65. Similarly, we can calculate: PIN(E)≈20.37, PIN(F)≈11.13, PIN(G≈13.83. By comparison, physical node E has the maximum importance value and the remaining resources meet the needs of virtual node b. Therefore, virtual node b is mapped to physical node E. Finally, when mapping virtual node e, the virtual nodes adjacent to virtual node e and mapped are virtual nodes b and d, then the nodes included in AM(e) are physical nodes E and B. According to formula (2), the importance values ​​of the remaining physical nodes that do not carry virtual nodes in the underlying elastic optical network are calculated as follows: PIN(A) = (2·30) / {(1+1+2)·(0.696+0.712)}≈10.65, PIN(F)≈8.34, PIN(G≈6.92. By comparison, it is found that physical node A has the maximum importance value at this time and the remaining resources meet the needs of virtual node e. Therefore, virtual node e is mapped to physical node A.

[0097] As attached Figure 2Schematic diagram of quasi-real-time key pool construction shown. Quasi-real-time key resources are between real-time key resources and non-real-time key resources, that is, the generated quantum key resources will not be used immediately, but will be stored in the key pool within a certain time threshold. This method not only reduces the waste of quantum keys, but also maximizes the security of quantum keys. The quasi-real-time key pool, that is, the QKP that stores quasi-real-time key resources, is different from the traditional QKP construction method. The QKP of this application divides the storage space of the key management device more finely, and the key resources of each KS (Key Storage) are generated within the same time period. Figure 2 In the key management, indexes + key sequences of levels I, II, and III are generated and stored in different KSs. The larger the index + key sequence, the lower the security level of the quantum key. Through the key control server, according to the time threshold of the quantum key resource and the key resource information in the elastic optical network, control signaling is sent to the quantum node to provide quantum key resources and quantum key resource distribution paths for virtual link requests with confidential transmission requirements.

[0098] The following will be combined with the attached Figure 3 The survivable virtual network mapping method based on ant colony optimization quasi-real-time pool key of the present invention is introduced in more detail. The specific overall process can be divided into the following steps:

[0099] Input: computing resource requirements of each virtual node in the virtual network, bandwidth resource requirements of the virtual link, and key resource requirements; input the underlying elastic optical network topology and the remaining computing resource capacity of each physical node, the remaining bandwidth resource capacity of the physical link, and the remaining key resource capacity in each quasi-real-time key pool, key storage time t, and key available time threshold T k =30u, fault detection time T = 100s, pheromone concentration value, heuristic function value, transition probability value, total number of ants

[0100] |A|=100, ant e=0, maximum number of iterations N=50, iteration variable i=0, random constant r=0, constant r0=0.5, K=3, set α1=0.3, β1=0.3, γ1=0.4, α2=0.5, β2=0.5, ω1=0.5, ω2=0.5;

[0101] Output: virtual node mapping results, virtual link mapping results, spectrum allocation results in ciphertext data transmission path mapping, key consumption in quantum key distribution path mapping

[0102] S1: According to formula (1), calculate the importance values ​​of all unmapped virtual nodes, sort the unmapped virtual nodes in non-ascending order according to their importance values, and put them into set N v, and the virtual node with the largest importance value is recorded as Go to S2;

[0103] S2: According to formula (2), calculate the importance values ​​of all physical nodes, sort the physical nodes in non-ascending order according to the importance values, and put them into set N s , and the physical node with the largest importance value is recorded as Go to S3;

[0104] S3: If the physical node The computing resource capacity of the virtual node The computing resource requirements of the virtual node Mapping physical nodes On, go to S4; otherwise, virtual network mapping fails;

[0105] S4: In set N v Delete the mapped virtual nodes and map N in order v The next unmapped virtual node in Go to S5;

[0106] S5: In order from the set N s Select the physical node mapping that meets the computing resource constraints If the set N s The computing resources of all physical nodes in the If the computing resource requirements are met, the virtual network mapping fails; otherwise, go to S6;

[0107] S6: If N v All virtual nodes in the set N are mapped. v If it is empty, go to S7; otherwise, go to S4;

[0108] S7: According to formula (4), calculate the importance value of each virtual link of the virtual network request, determine the mapping order of the virtual links, and put them into the set L in descending order. v In the middle, let DL v =L v , go to S8;

[0109] S8: From the collection DL v Select the virtual links to be mapped in order and mark them as Go to S9;

[0110] S9: Virtual Link The mapped physical nodes of the virtual nodes at both ends are marked as n s , n d , go to S10;

[0111] S10: In the elastic optical network, from the physical node ns Release the ants, randomly generate the pheromone concentration on each physical link, and go to S11;

[0112] S11: Randomly generate a constant r, and calculate the physical node n according to the size of r and r0 using formula (5). s The probability of transferring to each of its neighboring nodes, select the neighboring node n with the largest transfer probability i As physical node n s The transfer node goes to S12;

[0113] S12: Update the physical link according to formula (9) The pheromone concentration on the surface is used to determine n i Is it the destination node n? d , if n i =n d , then go to S13; otherwise, n s Update to n i , go to S10;

[0114] S13: If there are sufficient spectrum resources on the physical path to meet the bandwidth resource requirements for ciphertext data transmission, go to S14; otherwise, mark the virtual network mapping as failed and go to S34;

[0115] S14: Use the head-end matching method to allocate spectrum resources for the physical path mapped by the virtual link, from the set DL v Delete the mapped virtual link in the v If it is empty, go to S15; otherwise, go to S8;

[0116] S15: randomly generate the key generation rate in each quasi-real-time key pool, store the quantum key resources generated by the quantum key distribution system into the quasi-real-time key pool, and go to S16;

[0117] S16: According to formula (10), the key capacity in the quasi-real-time key pool is updated in real time. If the storage time of the key resources in the quasi-real-time key pool exceeds the available time threshold T k , then the k The key resources used in the process are destroyed, and the process goes to S17;

[0118] S17: From the set L v Select the virtual links to be mapped in order and mark them as Go to S18;

[0119] S18: Use the K shortest path algorithm to calculate K virtual links The candidate quantum key distribution paths are selected, and the weight values ​​of the candidate quantum key distribution paths are calculated according to the weight value formula (12) of the quantum key path, and are put into the set QL in descending order, and then go to S19;

[0120] S19: Select the physical lightpath with the largest weight from the set QL, mark it as P1, and count the maximum available key resources on P1 if Then perform quantum key distribution on P1 and go to S21; otherwise, go to S20;

[0121] S20: Select the next quantum key distribution physical optical path from the set QL, mark it as P2, and count the maximum available key resources on P2 if Then the remaining unsatisfied key resource requirements of P1 are mapped to the physical optical path P2, and the process goes to S21; otherwise, the mapping of the virtual network is marked as failed, and the process goes to S34;

[0122] S21: From L v Delete Let QL be the empty set. If the set L v If it is an empty set, go to S22; otherwise, go to S17;

[0123] S22: If the fault is detected that a disaster or failure occurs in the underlying elastic optical network, go to S23; otherwise, go to S34;

[0124] S23: According to formula (1), calculate the importance values ​​of the virtual nodes corresponding to the physical nodes affected by the disaster, and arrange the virtual nodes affected by the disaster in descending order into the set AN, and go to S24;

[0125] S24: Mark the virtual node with the largest importance value in the set AN as According to formula (2), the importance values ​​of the remaining physical nodes in the underlying elastic optical network that are not affected by the disaster are calculated, and they are put into the set SN in descending order, and then go to S25;

[0126] S25: Mark the physical node with the largest importance value in the set SN as If the physical node Available computing resources satisfy the virtual node The computing resource requirements of the virtual node Remap to physical nodes If yes, go to S27; otherwise, go to S26;

[0127] S26: Delete the physical node from the set SN Determine whether the set SN is empty. If it is empty, mark the virtual network mapping as failed and go to S34; otherwise, go to S25;

[0128] S27: Delete the successfully remapped virtual nodes from the set AN, and determine whether the set AN is empty. If it is empty, go to S28; otherwise, go to S24;

[0129] S28: Calculate the importance of the virtual links adjacent to the virtual node affected by the disaster according to formula (4), and arrange the virtual links adjacent to the virtual node affected by the disaster in descending order into the set AL, and go to S29;

[0130] S29: Select virtual links to be mapped from the set AL in order and mark them as Call Attach Figure 4 The ciphertext data transmission path mapping method based on ant colony optimization is shown as a virtual link Find the optimal ciphertext data transmission path. If successful, go to S30. Otherwise, mark the virtual network mapping as failed and go to S34.

[0131] S30: Call the attached Figure 5 The quantum key distribution path mapping method based on quasi-real-time key pool is shown as a virtual link Find the quantum key distribution path. If successful, go to S31. Otherwise, mark the virtual network mapping as failed and go to S34.

[0132] S31: Delete the restored virtual link from the set AL, and determine whether the set AL is empty. If it is empty, go to S32; otherwise, go to S29;

[0133] S32: According to formula (13), the recovery order values ​​of the remaining physical links affected by the disaster and not rerouted are evaluated, and according to the size of the recovery order values ​​of the affected physical links, the damaged physical links are arranged in descending order into the set SL, and then go to S33;

[0134] S33: In the elastic optical network, select the physical links in the SL set in turn, and find the shortest hop path that does not pass through the affected physical link according to the starting point and end point of the selected physical link. If the rerouting of the physical links in the SL set is successful, mark the virtual network mapping as successful, and go to S34. Otherwise, mark the path recovery failure, the virtual network mapping failure, and go to S34.

[0135] S34: If the virtual network mapping fails, output the information that the virtual network mapping fails; otherwise, output the ciphertext data transmission path, quantum key distribution path and damaged recovery rerouting information of the successful virtual network mapping, and the algorithm ends.

[0136] As attached Figure 4 The flowchart of the ciphertext data transmission path mapping method based on ant colony optimization is shown in the figure. The specific process can be divided into the following steps:

[0137] Input: Virtual link set L v and the bandwidth resource requirements of each virtual link, the remaining bandwidth resource capacity of the physical link in the underlying elastic optical network, the pheromone concentration value, the heuristic function value, the transition probability value, the total number of ants |A| = 100, the ant e = 0, the maximum number of iterations N = 50, the iteration variable i = 1, and the constant r0 = 0.5, K = 3;

[0138] Output: ciphertext data transmission path mapping results, ciphertext data transmission path mapping spectrum allocation results.

[0139] S1: Order DL v =L v ;

[0140] S2: Set DL v The virtual link with the largest importance value is marked as And find the virtual link The physical nodes mapped by the virtual nodes at both ends are marked as n s and n d , go to S3;

[0141] S3: From physical node n s Release e ants, e = D (n s ), D(n s ) is the physical node n s Node degree, go to S4;

[0142] S5: Randomly generate a value r and calculate the physical node n according to formula (5). s The probability of transferring to each of its neighboring nodes, select the neighboring node n with the largest transfer probability i As physical node n s The transfer node is transferred to S5;

[0143] S5: Update the physical link according to equations (6) and (7) The pheromone concentration value and the heuristic function value on it are used to determine n i Is it the destination node n? d , if n i =n d , then go to S6; otherwise, n s Update to n i , go to S3;

[0144] S6: If e≥|A|, go to S7; otherwise, update e=e+D(n s ), go to S3;

[0145] S7: If i≥N, go to S8; otherwise, update i=i+1, set e=D(n s ), go to S6;

[0146] S8: Compute Virtual Link The required number of frequency slots. If there are sufficient spectrum resources on the physical optical path to meet the spectrum resources required by the virtual link, go to S9; otherwise, the mapping of the encrypted data transmission path fails, go to S10;

[0147] S9: On some physical optical paths, the head-end matching method is used to create a virtual link To allocate spectrum resources, from the set DL v Delete the mapped virtual link If the set DL v If it is empty, the encrypted data transmission path mapping is successful, and go to S10; otherwise, go to S2;

[0148] S10: Output set L v The encrypted data transmission path and spectrum allocation results of each virtual link mapping.

[0149] As attached Figure 5 The flowchart of the quantum key distribution path mapping method based on the quasi-real-time key pool is shown in the figure. The specific process can be divided into the following steps:

[0150] Input: key resource requirements of virtual network request, virtual link set L v , the remaining key resource capacity in each quasi-real-time key pool on the underlying elastic optical network topology and physical link, key storage time t, key available time threshold T k =30u, u is a unit time, K=3;

[0151] Output: Quantum key distribution path and key consumption mapped by virtual network request.

[0152] S1: randomly generate the key generation rate in each quasi-real-time key pool of the underlying elastic optical network topology, store the quantum key resources generated by the quantum key distribution system into the quasi-real-time key pool, and transfer to S2;

[0153] S2: According to formula (10), update the key capacity in each quasi-real-time key pool. If the storage time of the key resources in the quasi-real-time key pool exceeds the available time threshold T k , then the k The used key resources are destroyed and transferred to S3;

[0154] S3: From the set L v Select the virtual links to be mapped in order and mark them as Go to S4;

[0155] S4: Use the K shortest path algorithm to calculate K virtual links The candidate quantum key distribution paths are selected, and the weight values ​​of the candidate quantum key distribution paths are calculated according to the weight value formula (12) of the quantum key path, and are put into the set QL in descending order, and then go to S5;

[0156] S5: Select the candidate quantum key distribution path with the largest weight value from the set QL, mark it as optical path P1, and count the maximum available key resources on optical path P1 if Then, quantum key distribution is performed on optical path P1, and if the quantum key distribution mapping path is successfully mapped, the key consumption is recorded, and the process goes to S7; otherwise, the process goes to S6;

[0157] S6: Select the next candidate quantum key distribution path from the set QL, mark it as light path P2, and calculate the maximum available key resource capacity on light path P2 if Then the remaining unsatisfied key resource requirements on optical path P1 are mapped to optical path P2, the dual-path mapping of quantum key distribution mapping is successful, the key consumption is recorded, and the process goes to S7; otherwise, the quantum key distribution path mapping of the virtual network fails, and the process goes to S8;

[0158] S7: From the set L v Deleting a virtual link Let QL be the empty set. If the set L v If it is not empty, go to S3, otherwise, go to S8;

[0159] S8: If the quantum key distribution path mapping of the virtual network fails, output the virtual network mapping failure information; otherwise, output the quantum key distribution mapping path mapping results and key consumption information of each virtual link of the virtual network.

[0160] As attached Figure 6 The flowchart of the sorting fault recovery method based on different physical components is shown in the figure. The specific process can be divided into the following steps:

[0161] Input: key resource requirements requested by the virtual network, the underlying elastic optical network topology and the resource status of each node and link, input the physical nodes affected by the disaster, the physical links affected by the disaster, set the fault detection time T = 100s, set AN = 0, SN = 0, AL = 0, SL = 0;

[0162] Output: ciphertext data transmission path, quantum key distribution path and resource allocation results remapped by the virtual network.

[0163] S1: According to formula (1), calculate the importance values ​​of the virtual nodes corresponding to the physical nodes affected by the disaster, and arrange the virtual nodes affected by the disaster in descending order into the set AN, and then go to S2;

[0164] S2: The virtual node with the largest importance value in the set AN is recorded as According to formula (2), calculate the importance values ​​of the remaining physical nodes in the underlying elastic optical network that are not affected by the disaster, and put them into the set SN in descending order, and transfer to S3;

[0165] S3: The physical node with the largest importance value in the set SN is recorded as If the physical node Available computing resources satisfy the virtual node The computing resource requirements of the virtual node Remap to physical nodes If yes, go to S5; otherwise, go to S4;

[0166] S4: Delete the physical node from the set SN Determine whether the set SN is empty. If it is empty, the recovery of the virtual network fails, and go to S13; otherwise, go to S3;

[0167] S5: Delete the successfully remapped virtual nodes from the set AN, and determine whether the set AN is empty. If it is empty, go to S6; otherwise, go to S2;

[0168] S6: According to formula (4), calculate the importance values ​​of the virtual links adjacent to the virtual nodes affected by the disaster, and arrange the virtual links adjacent to the virtual nodes affected by the disaster in descending order into the set AL, and go to S7;

[0169] S7: Select virtual links to be mapped from the set AL in order and mark them as Call Attach Figure 4 The ciphertext data transmission path mapping method based on ant colony optimization is shown as follows: Find the encrypted data transmission path, if successful, go to S8, otherwise, go to S13;

[0170] S8: Call the attached Figure 5 The quantum key distribution path mapping method based on quasi-real-time key pool is shown as a virtual link Find the quantum key distribution path. If successful, go to S9. Otherwise, mark the virtual network recovery as failed and go to S13.

[0171] S9: Delete the remapped virtual link from the set AL, and determine whether the set AL is empty. If it is empty, go to S10; otherwise, go to S7;

[0172] S10: According to formula (13), evaluate the recovery order values ​​of the remaining physical links affected by the disaster and not rerouted, and arrange the affected physical links in descending order into the set SL according to the size of the recovery order value, and go to S11;

[0173] S11: Mark the physical link with the largest weight in the set SL as In elastic optical networks, based on the physical link The starting point and end point of the affected physical link are re-searched for the shortest hop path that does not pass through the affected physical link. If the rerouting is successful, go to S12; otherwise, mark the virtual network mapping as failed and go to S13;

[0174] S12: Remove the damaged physical link that has been rerouted from the set SL If the set SL is empty, marking the mapping of the virtual network is successful, then go to S13; otherwise, go to S11;

[0175] S13: If the virtual network mapping fails, output the information that the virtual network mapping fails; otherwise, output the ciphertext data transmission path, quantum key distribution path information and resource allocation result of the virtual network successfully remapped, and the algorithm ends.

[0176] Finally, it should be noted that the above preferred embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail through the above preferred embodiments, those skilled in the art should understand that various changes can be made in form and details without departing from the scope defined by the claims of the present invention.

Claims

1. A survivable virtual network mapping method based on ant colony optimization quasi-real-time pool key, characterized by: The method specifically comprises the following steps: S1: Input the virtual network request and the elastic optical network topology and resource status, calculate the importance values ​​of all unmapped virtual nodes according to the computing resource requirements of the virtual nodes of the virtual network, the virtual node degree, the bandwidth resource requirements of the adjacent links, and the key resource requirements, and sort the unmapped virtual nodes in descending order of importance into a set N v And the virtual node with the largest importance value is recorded as Among them, the virtual node is not mapped The importance value of is calculated as follows: In the above formula, Represents a virtual node The computing resources required, Represents the total computing resource requirements of all virtual nodes in the virtual network. Representation and Virtual Nodes Adjacent Virtual Links The bandwidth resource requirements Representation and Virtual Nodes Adjacent Virtual Links The key resource requirements, B(l v ) indicates virtual link l v The bandwidth requirement of k(l v ) indicates virtual link l v The key requirement, Represents the total bandwidth requirements of all virtual links in the virtual network. represents the sum of all virtual link key resource requirements in the virtual network, Represents a virtual node The node degree of , α1, β1, γ1 are weight coefficients; S2: According to the physical node resource attributes and the minimum potential failure probability of the adjacent physical links, the importance values ​​of all physical nodes in all underlying elastic optical networks are calculated, and the importance values ​​of the physical nodes are arranged in descending order into a set N. s The physical node with the largest importance value is recorded as Among them, the physical node The importance value of is calculated as follows: In the above formula, Represents a physical node in the underlying elastic optical network Available computing resources, Represents a physical node The node degree of Representation and physical nodes Adjacent physical link, AM(n v ) represents the virtual node n v The set of physical nodes mapped to adjacent virtual nodes, hop(m',m) is the distance from candidate physical node m to AM(n v ) The number of hops of the minimum hop physical lightpath of each physical node m' in the set, For physical link Potential failure probability; S3: Set N v The virtual nodes in the set are mapped to N s On the physical node; The specific steps of the method described in S3 are: S301: If there is a virtual node in the elastic optical network that satisfies The computing resource requirements of the physical nodes Right now The virtual node Mapping to physical nodes If yes, go to step S302; otherwise, the virtual network mapping fails; S302: From the set N v Delete the mapped virtual node And from the set N s Delete the physical node that hosts the virtual node If the set N v If it is empty, go to S4; otherwise, go to S303; S303: Select the next unmapped virtual node requested by the virtual network in order and mark it as Set N s The physical node with the largest weight value in is marked as Go to S301; S4: Calculate the importance value of each virtual link in the virtual network, and arrange the virtual links in descending order according to the importance value of the virtual link into a set L v middle; Among them, the connection is in the virtual node and Virtual Link The importance value of is calculated as follows: In the above formula, Represents the virtual node with the largest virtual node importance value in the virtual network, as well as Represents virtual nodes Virtual Node With virtual nodes The number of hops; S5: From the set L v The virtual links to be mapped requested by the virtual network are selected in order, and for each virtual link, the ciphertext data transmission path mapping method based on ant colony optimization described in claim 2 is adopted to map the bandwidth resource requirements of the virtual link to the physical optical path, so as to realize ciphertext data transmission path mapping; S6: For the virtual link that has realized the ciphertext data transmission path mapping, the quantum key distribution path mapping method based on the quasi-real-time key pool described in claim 3 is adopted to map the key resource requirements of the virtual link to the physical optical path to realize the quantum key distribution path mapping; S7: If a component of the elastic optical network is detected to have failed, the fault recovery method based on physical component ordering awareness as described in claim 4 is used to remap the business data or ciphertext data carried by the affected physical component.

2. The survivable virtual network mapping method based on ant colony optimization quasi-real-time pool key according to claim 1 is characterized in that: The ciphertext data transmission path mapping method based on ant colony optimization in S5 specifically includes the following steps: S501: Order DL v =L v ; S502: DL the collection v The virtual link with the largest virtual link importance value is marked as And find out the virtual link l1 v The mapped physical nodes of the virtual nodes at both ends are marked as n s and n d , let m = n s ; S503: Release |A| ants from the physical node m, where A is the ant set, randomly generate the ant pheromone concentration on each physical link, and input the ant set r0 value; S504: randomly generate a constant r, and calculate the probability of the physical node m of the elastic optical network transferring to each neighboring node according to the size of r and r0; The calculation method of the transfer probability of the kth ant from the physical node m to the neighboring node n at time t is: In the above formula, τ mn (t) represents the number of ants passing through the physical link at time t The residual pheromone concentration, the greater the pheromone concentration, the greater the probability of ant migration, τ mq (t) represents the number of ants passing through the physical link at time t The residual pheromone concentration, η mn (t) and η mq (t) represents the heuristic function, Nei m Represents the set of neighboring nodes to which node m can be transferred, n∈Nei m , α2 and β2 are adjustment factors that control the relative weights of pheromone and heuristic function; Heuristic function η mn (t) is calculated as follows: In the above formula, Indicates the physical link The potential failure risk level, P s,n From physical node n s The physical optical path to the physical node n, ω1 and ω2 are adjustment factors, SF(P s,n ) is the physical optical path P s,n The fragmentation change value; Among them, the physical optical path P s,n The fragmentation change value on is calculated as follows: Where SR represents the physical optical path P s,n The smaller the value, the smaller the spectrum fragmentation of the physical optical path P s,n The more severe the spectrum fragmentation is, the i is a binary variable. If the ith frequency slot is idle, its value is 1; otherwise, its value is 0. s,n ) represents the physical optical path P s,n The number of idle spectrum blocks on SR bef With SR after Respectively represent the physical optical path P s,n Spectrum fragmentation measurement on the physical optical path before and after allocating spectrum resources required for virtual links; S505: From the collection m Select the neighbor node n with large transition probability i As a physical node m transfer node, update the physical link The pheromone concentration on the surface is used to determine n i Whether it is a virtual link The destination node n d , if n i =n d , then go to S506; otherwise, set m=n i , go to S503; Among them, the physical link The updated calculation formula for the pheromone concentration is: Among them, ρ represents the pheromone concentration factor, |A| is the total number of ants, P s,i From physical node n s To physical node n i The physical optical path P s,i The number of hops, Represents the physical optical path P s,i From physical node m to physical node n i The physical link, SF(P s,i ) indicates that in the physical optical path P s,i The fragmentation metric change value before and after allocating the spectrum resources required for virtual link mapping; S506: If the physical node n s Physical Node n d The physical optical path P s,d There is a virtual link on The spectrum resources required for the ciphertext data transmission go to S507; otherwise, the virtual network mapping fails; S507: Use the head-end matching method to allocate spectrum resources, from the set DL v Delete the mapped virtual link If the set DL v If it is empty, go to S508; otherwise, go to S502; S508: All encrypted data transmission paths of the virtual network are mapped successfully.

3. The survivable virtual network mapping method based on ant colony optimization quasi-real-time pool key according to claim 1 is characterized in that: The quantum key distribution path mapping method based on the quasi-real-time key pool in S6 specifically includes the following steps: S601: randomly generating key generation rates in each quasi-real-time key pool, and storing quantum key resources generated by the quantum key distribution system into the quasi-real-time key pool; S602: Update the key capacity in the quasi-real-time key pool. If the storage time of the key resources in the quasi-real-time key pool exceeds the available time threshold T k , then the k Destroy the used key resources; Among them, update the physical link The calculation formula for the key capacity in the quasi-real-time key pool at time t is: In the above formula, Indicates the physical link within the key storage time t The remaining capacity of key resources in the quasi-real-time key pool. Indicates the physical link within the key storage time t The amount of key resources generated in the quasi-real-time key pool. Indicates the physical link within the key storage time t The key resource consumption in the quasi-real-time key pool is ξ, which is a Boolean variable indicating the physical link Whether the encryption request of the virtual link can be met, T k is the time threshold of the quantum key, represents the key requirement of the virtual link, K(P s,d ) represents physical node n s Physical Node n d The physical optical path P s,d The remaining key resource capacity set of each link, minK(P s,d ) represents the physical optical path P s,d The minimum remaining key resource capacity in each physical link; S603: Set L v The virtual link with the largest virtual link importance value is marked as set up The key resource requirement is S604: According to Finding Virtual Links in Elastic Optical Networks Using K-Shortest Path Algorithm The candidate quantum key distribution paths are selected, and the weight value of each candidate quantum key distribution path is calculated according to the weight value calculation formula of the quantum key distribution path, and the candidate quantum key distribution paths are arranged in descending order into the set QL; Among them, the quantum key distribution path The weight value calculation method is: in, Virtual Link Candidate quantum key distribution paths for for The link set, For the optical path A physical link between physical nodes m and v on Represents the physical optical path The number of hops, is a Boolean variable. If the physical link The remaining capacity of the quasi-real-time key pool is the physical optical path The link with the least remaining capacity of the key resource has a value of 1; otherwise, the value is 0; S605: Select the quantum key distribution path with the largest weight value from the set QL, mark it as optical path P1, and count the maximum available key resources on optical path P1 if Then distribute the virtual link on optical path P1 The quantum key is obtained and the process goes to S607; otherwise, the process goes to S606; S606: Select the next quantum key distribution path from the set QL, mark it as light path P2, and count the maximum available key resources on light path P2 if Then the optical path P1 does not meet The remaining key resource requirements Map to optical path P2, and go to S607; otherwise, the quantum key distribution path mapping requested by the virtual network fails, and go to S608; S607: From L v Delete Let QL be an empty set. If L v is a non-empty set, go to S602; otherwise, the quantum key distribution path mapping of the virtual network is successful, go to S608; S608: If the quantum key distribution path mapping of the virtual network is successful, output the quantum key distribution path information of each virtual link of the virtual network; otherwise, output the information that the quantum key distribution mapping path of the virtual network fails.

4. The survivable virtual network mapping method based on ant colony optimization quasi-real-time pool key according to claim 1, characterized in that: The fault recovery method based on physical component ordering awareness in S7 specifically includes the following steps: S701: Calculate the importance values ​​of virtual nodes corresponding to the physical nodes affected by the disaster in the elastic optical network, and arrange the virtual nodes corresponding to the physical nodes affected by the disaster in descending order into a set AN; S702: Mark the virtual node with the largest importance value in the set AN as And calculate the importance values ​​of the remaining physical nodes that are not affected by the disaster in the underlying elastic optical network, and arrange the remaining physical nodes that are not affected by the disaster in descending order into the set SN; S703: Record the physical node with the largest importance value in the set SN as If the physical node Available computing resources satisfy the virtual node The computing resource requirements of the virtual node Remap to physical nodes If yes, go to S705; otherwise, go to S704; S704: Delete the physical node from the set SN Determine whether the set SN is empty. If it is empty, the virtual network recovery fails; otherwise, go to S703; S705: Delete the successfully remapped virtual nodes from the set AN, and determine whether the set AN is empty. If it is empty, go to S706; otherwise, go to S702; S706: Calculate virtual nodes affected by the disaster The importance of adjacent virtual links is calculated, and the virtual links adjacent to the virtual nodes affected by the disaster are arranged in descending order into the set AL; S707: Order L v = AL, calling the ciphertext data transmission path mapping method based on ant colony optimization described in S5, for L v The virtual links in the set find the ciphertext data transmission path; if all ciphertext data transmission paths are successfully mapped, go to S708; otherwise, the path recovery failure is marked, go to S711; S708: calling a quantum key distribution path mapping method based on a quasi-real-time key pool, and searching for quantum key distribution paths for each virtual link in the virtual link set in turn. If all quantum key distribution paths are successfully mapped, go to S709; otherwise, mark path recovery failure, and go to S711; S709: Calculate the recovery order values ​​of the remaining physical links affected by the disaster and not rerouted, and arrange them in descending order into the set SL according to the recovery order values ​​of the affected physical links; Among them, the affected physical links The recovery order value of is calculated as follows: In the above formula, Indicates the physical links affected by the disaster The set of virtual links carried on Indicates the physical links affected by the disaster The number of virtual links carried on Indicates the physical links affected by the disaster The virtual link l carried by v The sum of bandwidth requirements and key requirements; S710: In the elastic optical network, select the physical links in the SL set in turn, and find the shortest hop path that does not pass through the affected physical link according to the starting point and end point of the selected physical link. If the rerouting of the physical links in the SL set is successful, go to S711; otherwise, mark the path recovery failure and go to S711; S711: If the path recovery fails, the damaged virtual network remapping fails; if denied, the ciphertext data transmission path, quantum key distribution path and damaged recovery rerouting information of the damaged virtual network remapping success are output, and the algorithm ends.

Images