CN113316039B - Virtual network survival mapping method based on reliability and time-frequency resource perception - Google Patents
Virtual network survival mapping method based on reliability and time-frequency resource perception Download PDFInfo
- Publication number
- CN113316039B CN113316039B CN202110616105.XA CN202110616105A CN113316039B CN 113316039 B CN113316039 B CN 113316039B CN 202110616105 A CN202110616105 A CN 202110616105A CN 113316039 B CN113316039 B CN 113316039B
- Authority
- CN
- China
- Prior art keywords
- virtual
- physical
- spectrum
- reliability
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0079—Operation or maintenance aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0086—Network resource allocation, dimensioning or optimisation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a virtual network survival mapping method based on reliability and time-frequency resource perception, and belongs to the technical field of optical fiber communication. The method determines the mapping sequence of the virtual nodes by considering the computing resource requirement of the virtual nodes, the bandwidth requirement of adjacent links, the reliability requirement of adjacent links and the number of adjacent mapped virtual nodes in the mapping stage of the virtual nodes, and designs a physical node weight computing method considering the consumption of the available computing resources, the available bandwidth resources and the frequency spectrum resources of the physical nodes; in the routing stage, the reliability of a physical link is considered, and a physical component reliability measurement formula is designed to determine a transmission light path mapped by a virtual link; in the spectrum allocation stage, a spectrum block matching degree formula considering the number of occupied spectrum blocks, the number of unoccupied frequency slots and the residual occupied time of the spectrum blocks is designed, and spectrum fragments of a transmission light path are reduced. The method can improve the request acceptance rate and the spectrum utilization rate of the virtual network survival mapping.
Description
Technical Field
The invention belongs to the technical field of optical communication, and relates to a virtual network survival mapping method based on reliability and time-frequency resource perception.
Background
With the rapid development of network communication technology, a large number of new services with high bandwidth requirements are emerging continuously, such as video calls, virtual reality, unmanned driving and the like. Although the application of these innovative networks greatly improves the quality of life of people, the transmission pressure of the networks is increased virtually, so that the spectrum resources in the current communication backbone network are increasingly in short supply. Because the traditional Wavelength Division Multiplexing (WDM) network adopts a coarse-grained spectrum resource Division mode and a fixed and unchangeable modulation format, a large amount of spectrum resources in the network cannot be normally used, and the high bandwidth requirements of the innovative network applications cannot be met. Compared with a WDM network, an Elastic Optical Networks (EONs) based on Orthogonal Frequency Division Multiplexing (OFDM) technology has a finer granularity spectrum resource partitioning mode, and can adaptively meet spectrum resource requirements of different services, thereby greatly reducing the spectrum resource waste degree in the network. In addition, a regenerator is arranged in the EONs, the long optical path can be cut into different short sections to relax the transmission distance limit of the optical path, so that a modulation format with a higher level can be used on the short sections, and the purpose of improving the utilization rate of frequency spectrum resources is achieved.
Meanwhile, since the communication network is established by different network operators, the communication configuration and communication protocol used by each operator in the process of constructing the network are different, which results in that the network resources cannot be scheduled and managed in a uniform manner. In order to solve the structural rigidity problem of the current network, researchers have proposed network virtualization technologies. Network virtualization allows a plurality of mutually separated and heterogeneous Virtual Networks (VNs) to share underlying physical Network (SN) resources, thereby greatly improving the flexibility of Network resource allocation and the utilization efficiency of spectrum resources. However, in the implementation of Network virtualization, there are many problems to be solved, and the most troublesome one is Virtual Network mapping (VNE). Virtual network mapping essentially seeks a physical topology similar to the virtual network topology on the underlying physical network and efficiently allocates spectrum resources to it. In addition, as the natural environment deteriorates and various unforeseen natural disasters occur, the optical fiber links are prone to failure, which will bring huge economic loss to virtual network tenants and infrastructure providers. Therefore, how to ensure the survivability of the virtual network and maximize the use efficiency of network resources has very important research significance.
Disclosure of Invention
In view of this, the present invention provides a virtual network survival mapping method based on reliability and time-frequency resource perception, which is used to improve the request acceptance rate and spectrum utilization rate of virtual network survival mapping.
In order to achieve the purpose, the invention provides the following technical scheme:
a virtual network survival mapping method based on reliability and time-frequency resource perception is characterized in that: the method comprises the following steps:
1. a virtual network survival mapping method based on reliability and time-frequency resource perception is characterized in that: the method comprises the following steps:
s1, setting the maximum iteration number T =50 and the maximum number E = | N of virtual network mapping schemes v |，|N v L represents the number of virtual nodes, the iteration counter t =0, and the virtual network mapping scheme counter e =1; for all unmapped virtual nodes requested by the virtual network, calculating the weight ranking values of all the unmapped virtual nodes according to the computing resource requirements of the virtual nodes, the bandwidth requirements of adjacent links, the reliability requirements of the adjacent links and the number of adjacent mapped virtual nodes, and sequencing all the unmapped virtual nodes in a descending order according to the weight ranking values of the virtual nodes;
the method for calculating the weight ranking value of the unmapped virtual node comprises the following steps:
in the above formula, nei (n) v ) Representing a virtual node n v Is connected to the virtual link, | N (N) v ) I represents a virtual node n v The number of adjacent mapped virtual nodes of (c),
virtual node n v The computing resource requirements of (a) of (b),
virtual link v The demand for spectrum resources of the mobile station,
virtual link v The reliability requirements of (2);
s2, selecting the unmapped virtual node with the largest weight sorting value, and storing all the physical nodes of which the remaining available computing resources are larger than the computing resource requirements into a set R; secondly, judging whether the set R is empty, if so, determining that the virtual network requests mapping failure, and if not, sequentially passing all candidate physical nodes of the unmapped virtual nodes with the maximum weight ranking value through a cooperative survival mapping method based on reliability and time-frequency resource perception, and storing mapping results of all unmapped virtual links into a set V;
s3, calculating the weight ranking value of the candidate physical node according to the set V; calculating the transfer probability value of the candidate physical node according to the weight sorting value of the candidate physical node; according to the transition probability value of the candidate physical node and the roulette selection method, the pre-mapping of the virtual link and the virtual node is completed, and the mapping scheme is stored in the set Z t Making T = T +1, updating the pheromone concentration value, and returning to S3 until T iterations are completed; finally, finding out a mapping scheme with the least consumed spectrum resources in the set Z to complete virtual network mapping;
the candidate physical node weight ranking value calculation formula is as follows:
in the above formula, the first and second carbon atoms are,
representing a physical node n s The available computing resources of (a) are,
representing a physical link l s Available bandwidth resource of n s Is a virtual node n v One candidate physical node of, nei (n) s ) Representing a physical node n s Of adjacent links, adj (n) v ) Representing a virtual node n v Of the set of adjacent mapped virtual links of (c),
is a binary systemVariables if virtual link l uv The mapped lightpath passes through the physical link l ij The value is 1, whereas the value is 0,
representing a virtual link l uv On a physical link l ij The number of occupied idle frequency slots;
wherein, the pheromone concentration value updating formula is as the following formula (3):
in the above formula, rho is pheromone concentration volatilization factor, equal to 0.8, E represents the total number of ants in each iteration, and E = | N v I, here | N v I represents the number of virtual nodes, Q is a constant value and is equal to 5, and the initial value of the concentration of the pheromone is equal to 1;
the candidate physical node transfer probability value calculation formula is as follows:
in the above formula, α and β are two parameters of the control pheromone concentration and the heuristic information, respectively, α =2, β =5,a (n) v ) For a virtual node n v The set of candidate physical nodes of (1).
Further, the implementation of the collaborative survival mapping method based on reliability and time-frequency resource perception in S2 specifically includes the following steps:
s201, adopting shortest path algorithm as virtual link
Calculating K 1 A candidate working light path, here K 1 Averaging the node direction for the networkLower integer, n t Representing a virtual node n v While letting k represent the kth candidate working optical path, the initial value of k is 1, go to S102;
s202, calculating the reliability of the kth candidate working optical path, determining the maximum available spectrum block of the kth candidate working optical path, and judging whether the kth working optical path meets the virtual link
If yes, determining the virtual link
The spectrum allocation mode adopts head end matching, wherein the head end matching refers to searching from a low frequency slot index value to a high frequency slot index value on a transmission light path, and takes the first available spectrum block meeting the bandwidth required by the service request as a transmission spectrum block, and uses a virtual link
Storing the mapping result into a set V, otherwise, turning to S103;
the reliability of the working optical path is calculated by equation (6):
in the above formula, L p A link set representing a physical light path P,
virtual link l s The reliability of (2).
S203, calculating the number of links of the kth candidate working optical path, recording the number of links as M, and meanwhile, enabling M to represent the number of links which are not protected by the section protection optical path in the kth working optical path, wherein the sub optical path of the working optical path is called as the section working optical path, the protection optical path of the section working optical path is a section protection optical path, the initial value of M is 0, and S104 is switched;
s204, adopting a shortest path algorithm meterCalculating machine
Storing a physical optical path different from the kth candidate working optical path into a set B, and turning to S105;
s205, judging whether M is less than or equal to M-1, if so, turning to S104 when M = M +1, otherwise, turning to S106;
s206, calculating the reliability of the physical component formed by combining each physical light path in the set B with the kth candidate working light path, and enabling all the physical components to meet the virtual link
Physical component deposit set Q of reliability requirements 1 Go to step S107;
virtual link
The physical component reliability of (c) is calculated by equation (7):
in the above formula, the first and second carbon atoms are,
virtual link l s Reliability requirement P t Representing a physical component consisting of a working beam path and all-section protection beam paths, WP int Indicating sets of links in working lightpaths not protected by segment protection lightpaths, WP ass Parallel physical component set consisting of a presentation segment working optical path and a segment protection optical path thereof, R k The reliability of the parallel physical component k is shown, and the expansion is shown in the following formula (8)
In the above formula, W k Set of links, P, representing segment working lightpaths k A set of links representing a segment protection lightpath,N k representing the number of virtual links in the network competing for the protection resources with the virtual link;
s207, judging the set Q 1 If the signal is null, if so, k = k +1 and S108 is switched, otherwise, S109 is switched;
s208, judging that K is less than or equal to K 1 If true, if yes, go to S103, otherwise, the virtual link
The mapping fails;
s209, the set Q 1 The physical components consuming the least idle frequency slots are stored in the set Q 2 Go to step S110;
s210, judging the set Q 2 If the number of the physical components in the virtual link is unique, determining the virtual link according to the physical components
The spectrum allocation mode of the physical component adopts head end matching and virtual link is used
Storing the mapping result into a set V, otherwise, turning to S111;
s211, calculating a set Q 2 The matching degree of the spectrum block of the first available spectrum block in each physical component is determined according to the physical component with the minimum matching degree of the spectrum block
And (3) routing the spectrum allocation result and assigning the virtual link
Storing the mapping result into a set V;
the spectrum block matching degree of the first available spectrum block in the physical component is calculated by the formula (9):
in the above equation, W represents a certain physical component, b represents available spectrum blocks pre-allocated for the physical component W, | L | represents the number of adjacent links of the physical component W, | L | represents the total number of spectrum blocks in the adjacent links of the physical component W that have the same frequency slot index value as the pre-allocated spectrum block b and are fully occupied, | b | represents the number of frequency slots contained in the pre-allocated spectrum block b, S represents the total number of spectrum blocks in the adjacent links of the physical component W that have the same frequency slot index value as the pre-allocated spectrum block b and are not fully occupied,
indicates the total number of remaining free frequency slots, DF, of the s-th incompletely occupied spectral block W (b) The variance of the remaining occupied time between different spectrum blocks is shown in the following formula (10)
In the above-mentioned formula, the compound has the following structure,
representing the remaining occupied time of the h-th spectral block,
the mean value of the remaining occupied time between different blocks of the spectrum is expressed by the following equation (11)
Drawings
In order to make the purpose, technical scheme and beneficial effect of the invention more clear, the invention provides the following drawings for illustration:
FIG. 1 is a schematic diagram of a physical component reliability calculation;
FIG. 2 is a flowchart of a virtual network survival mapping method based on reliability and time-frequency resource perception;
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention in a schematic way, and the features in the following embodiments and examples may be combined with each other without conflict.
Wherein the showings are for the purpose of illustrating the invention only and not for the purpose of limiting the same, and in which there is shown by way of illustration only and not in any way limiting the scope of the invention; to better illustrate the embodiments of the present invention, some components of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
Fig. 1 is a schematic diagram illustrating reliability calculation of physical components in a flexible optical network. In fig. 1, a virtual link l with a reliability requirement of 99.25% v The mapped working optical path is P 1 : A-B-C-D. Calling formula (6) to know P 1 The reliability of (2) is 98.90%. Because of P 1 Does not satisfy the virtual link l v So that the working optical path P is required at this time 1 Or P 1 The section working optical path of the optical fiber seeks a protection optical path. Assume that the working optical path P2 is a segment of the working optical path P1: B-C-D finds a section of protection light path P3: B-E-D. P 1 And P 3 Form a physical component P t . Because the working light path P 1 The links in which there is no segment protection lightpath protection are A-B, so the set WP int ＝{A-B}。P 2 And P 3 Form a parallel physical component, set as k 1 As shown by the solid red line in the figure, the available WP ass ＝{k 1 }. Suppose N k =2, and call formula (7) to calculate the available R Pt =99.39%, which satisfies the virtualLink l v The reliability requirements of.
The virtual network survival mapping method based on reliability and time-frequency resource perception of the present invention will be described in more detail with reference to fig. 2, and the specific process can be divided into the following steps:
inputting: underlying physical network G s Virtual network G v
And (3) outputting: and (5) mapping the virtual network.
Step 1: setting the maximum iteration number T =50 and the maximum virtual network mapping scheme number E = | N v |，|N v I represents the number of virtual nodes, an iteration counter t =0, a virtual network mapping scheme counter e =1, and step 2 is carried out;
step 2: sorting the adjacent unmapped virtual nodes of the mapped virtual nodes of the virtual network in a descending order according to a formula (1), storing the sorted virtual nodes to a set VR, and turning to the step 3; note that: when the virtual network is initially mapped, mapped virtual nodes do not exist, and all unmapped virtual nodes are sequenced at the moment;
and step 3: fetching n with maximum sorting value in set VR v Finding out all candidate physical nodes, calling a cooperative survival mapping method based on reliability and time-frequency resource perception, calculating the weight ranking value of the candidate physical nodes in combination with a formula (2), calculating the transfer probability value of the candidate physical nodes in combination with a formula (5) according to the weight ranking value and the pheromone concentration value of the candidate physical nodes, and finishing the virtual node n according to the transfer probability value of the candidate physical nodes and a roulette selection method v Pre-mapping the adjacent virtual link to be mapped, and turning to the step 4;
and 4, step 4: judging n v If the pre-mapping is successful, marking the virtual node n v If the mapping is carried out, the step 5 is carried out, otherwise, the step 6 is carried out;
and 5: judging whether all virtual nodes of the virtual network are mapped, if so, storing a mapping scheme into a set Z and turning to the step 6, otherwise, turning to the step 2;
step 6: judging whether E is more than or equal to E, if so, turning to a step 7, otherwise, updating E = E +1 and marking all virtual nodes of the virtual network as unmapped, and turning to a step 2;
and 7: judging whether T is greater than or equal to T-1, if so, turning to a step 8, otherwise, updating T = T +1 and marking all virtual nodes of the virtual network as unmapped, combining a formula (3), updating the pheromone concentration value, and turning to a step 2;
and 8: and judging whether feasible solutions exist in the set Z, if so, outputting the optimal solution in the set Z, and successfully mapping the virtual network, otherwise, failing to map the virtual network.
The following describes the cooperative survival mapping method based on reliability and time-frequency resource perception in more detail, and the specific process can be divided into the following steps:
inputting: virtual node n v And n t ，n t Representing a virtual node n v A neighboring mapped virtual node of
And (3) outputting: virtual link
Result of pre-mapping
Step 1: in physical network topology, K shortest path algorithm is adopted as virtual link
Calculating K 1 B, candidate working light paths are obtained, meanwhile, k is made to represent the kth candidate working light path, the initial value of k is 1, and the step 2 is carried out;
step 2: calling a formula (6) to calculate the reliability of the kth candidate working optical path and determine the maximum available frequency spectrum block of the kth candidate working optical path, and judging whether the kth working optical path meets the virtual link
If yes, determining the virtual link
The route spectrum distribution result adopts the head end matching and the virtual link
The pre-mapping is successful, otherwise, turning to the step 3;
and 3, step 3: calculating the number of links of the kth candidate working optical path, recording the number as M, and meanwhile, enabling M to represent the number of links which are not protected by the section protection optical path in the kth working optical path, wherein the initial value of M is 0, and turning to the step 4;
and 4, step 4: calculation using K shortest path algorithm
Storing the physical optical paths different from the kth candidate working optical path into a set B, and turning to the step 5;
and 5: judging whether M is equal to or smaller than M-1, if so, turning to the step 4 if M = M +1, and otherwise, turning to the step 6;
and 6: calling a formula (7) to calculate the reliability of the physical component formed by combining each physical optical path in the set B with the kth candidate working optical path, and storing all physical components meeting the reliability requirement of the virtual link into a set Q 1 Turning to step 7;
and 7: judgment set Q 1 If the result is empty, if so, k = k +1 and goes to step 8, otherwise, goes to step 9;
and 8: judging that K is less than or equal to K 1 If yes, go to step 3, otherwise, make the virtual link
Failure of pre-mapping;
and step 9: storing the physical component consuming the least idle frequency slots in the set into the set Q 2 Turning to step 10;
step 10: judgment set Q 2 If the number of the physical components in the virtual link is unique, determining the routing frequency spectrum distribution result of the virtual link according to the physical components and the virtual link
The pre-mapping is successful, otherwise, the step 11 is carried out;
step 11: calling maleThe formula (9) calculates the frequency spectrum block matching degree of each physical component in the set, and determines the routing frequency spectrum distribution result of the virtual link according to the physical component with the minimum frequency spectrum block matching degree value, wherein the virtual link is
The pre-mapping was successful.
Finally, the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the present invention, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions, and all of them should be covered by the claims of the present invention.
Claims (1)
1. A virtual network survival mapping method based on reliability and time-frequency resource perception is characterized in that: the method comprises the following steps:
s1, setting a maximum iteration number T, a maximum virtual network mapping scheme number E, an iteration counter T =0, and a virtual network mapping scheme counter E =1; for all unmapped virtual nodes requested by the virtual network, calculating the weight ranking values of all the unmapped virtual nodes according to the computing resource requirements of the virtual nodes, the bandwidth requirements of adjacent links, the reliability requirements of the adjacent links and the number of adjacent mapped virtual nodes, and sequencing all the unmapped virtual nodes in a descending order according to the weight ranking values of the virtual nodes; selecting an unmapped virtual node with the largest weight ranking value, and storing all the physical nodes of which the remaining available computing resources are larger than the computing resource requirements into a set R; secondly, judging whether the set R is empty, if so, the virtual network requests mapping failure, otherwise, sequentially passing all candidate physical nodes of the unmapped virtual nodes with the maximum weight ranking value through a collaborative survival mapping method based on reliability and time-frequency resource perception, and storing mapping results of all unmapped virtual links into a set V;
the method for calculating the weight ranking value of the unmapped virtual node comprises the following steps:
in the above formula, nei (n) v ) Representing a virtual node n v Is connected to the virtual link, | N (N) v ) | represents a virtual node n v The number of adjacent mapped virtual nodes of (c),
virtual node n v Computing resource requirement of, W lv Virtual link l v The demand for spectrum resources of the mobile station,
virtual link l v The reliability requirements of (2);
the cooperative survival mapping method based on reliability and time-frequency resource perception specifically comprises the following steps:
s101, calculating K for an unmapped virtual link by adopting a shortest path algorithm 1 A candidate working light path, if K 1 If no working light path satisfying the reliability and spectrum resource requirements exists in the candidate working light path, K is calculated for the unmapped virtual link by adopting a shortest path algorithm 1 ·(2 M -1) storing the physical components in a set B, where M denotes the number of physical links of the candidate working lightpaths, K 1 Rounding the average node degree of the network downwards;
s102, calculating the reliability of each physical component in the set B, and storing all the physical components meeting the reliability requirement of the virtual link into a set Q 1 ；
Wherein the physical component reliability of the virtual link is calculated by the following formula:
in the above formula, the first and second carbon atoms are,
virtual link l s Reliability requirement P t Representing a physical component consisting of a working beam path and all-section protection beam paths, WP int Indicating sets of links in working lightpaths that are not protected by segment protection lightpaths, WP ass Parallel physical component set consisting of presentation segment working optical path and segment protection optical path thereof, R k Representing the reliability, W, of the parallel physical component k k Set of links, P, representing a segment of the working lightpath k Set of links representing segment protection lightpaths, N k The number of virtual links competing for the protection resources with the virtual link in the network is represented;
s103, the set Q 1 The physical components consuming the least idle frequency slots are stored in the set Q 2 (ii) a Determine set Q 2 If yes, determining route frequency spectrum distribution result of virtual link according to the physical component, wherein the frequency spectrum distribution mode of the physical component adopts head end matching, and storing the virtual link mapping result into set V, otherwise, calculating set Q 2 Determining the physical component with the minimum frequency spectrum block matching degree according to the frequency spectrum block matching degree of the first available frequency spectrum block in each physical component, determining a route frequency spectrum distribution result of a virtual link according to the physical component, wherein the frequency spectrum distribution mode of the physical component adopts head end matching, and finally storing a virtual link mapping result into a set V;
the spectrum block matching degree of the first available spectrum block in the physical component is calculated by the following formula:
in the above formula, W represents a certain physical component, b represents available spectrum blocks pre-allocated for the physical component W, | L | represents the number of adjacent links of the physical component W, | b | represents the total number of spectrum blocks in the adjacent links of the physical component W that have the same frequency slot index value as the pre-allocated spectrum block b and are fully occupied, | b | represents the number of frequency slots contained in the pre-allocated spectrum block b, S represents the total number of spectrum blocks in the adjacent links of the physical component W that have the same frequency slot index value as the pre-allocated spectrum block b and are not fully occupied,
indicates the total number of remaining free frequency slots, DF, of the s-th incompletely occupied spectral block W (b) Representing the variance of the remaining occupied time between different spectral blocks,
representing the remaining occupied time of the h-th spectral block,
means representing the remaining occupied time between different blocks of the spectrum;
s2, calculating the weight ranking value of the candidate physical node according to the set V; calculating the transfer probability value of the candidate physical node according to the weight ranking value of the candidate physical node; according to the transfer probability value of the candidate physical node and the roulette selection method, the pre-mapping of the virtual link and the virtual node is completed, and the mapping scheme is stored into a set Z t Let t = t +1, update the pheromone concentration value, if t<T, returning to S2 until T iterations are completed; finally, finding out a mapping scheme with the least consumed spectrum resources in the set Z to complete virtual network mapping;
the candidate physical node weight ranking value calculation formula is as follows:
in the above formula, the first and second carbon atoms are,
representing a physical node n s The available computing resources of (a) are,
represents a physical link l s Available bandwidth resource of n s Is a virtual node n v One candidate physical node of, nei (n) s ) Representing a physical node n s Of adjacent links, adj (n) v ) Representing a virtual node n v Of the set of adjacent mapped virtual links of the virtual network,
is a binary variable, if the virtual link l uv The mapped lightpath passes through the physical link l ij The value is 1, otherwise, the value is 0,
representing a virtual link l uv On a physical link l ij The number of occupied idle frequency slots;
wherein, the pheromone concentration value updating formula is as follows:
in the above formula, rho is pheromone concentration volatilization factor, equal to 0.8, E represents the total number of ants in each iteration, and E = | N v I, here | N v I represents the number of virtual nodes, Q is a constant value, and the initial value of the pheromone concentration is equal to 1;
the candidate physical node transfer probability value calculation formula is as follows:
in the above formula, α and β are two parameters of the control pheromone concentration and the heuristic information, respectively, α =2, β =5,a (n) v ) For a virtual node n v The set of candidate physical nodes of (1).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110616105.XA CN113316039B (en) | 2021-06-02 | 2021-06-02 | Virtual network survival mapping method based on reliability and time-frequency resource perception |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110616105.XA CN113316039B (en) | 2021-06-02 | 2021-06-02 | Virtual network survival mapping method based on reliability and time-frequency resource perception |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113316039A CN113316039A (en) | 2021-08-27 |
| CN113316039B true CN113316039B (en) | 2023-03-14 |
Family
ID=77377081
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110616105.XA Active CN113316039B (en) | 2021-06-02 | 2021-06-02 | Virtual network survival mapping method based on reliability and time-frequency resource perception |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113316039B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115209249A (en) * | 2022-07-07 | 2022-10-18 | 重庆邮电大学 | Virtual network cooperative mapping method based on fragment sensing of adjacent links of optical path |
| CN116887079B (en) * | 2023-07-20 | 2024-08-02 | 苏州大学 | Optical network mapping method and system for hierarchical analysis resource balance virtual data center |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108270684A (en) * | 2018-01-25 | 2018-07-10 | 重庆邮电大学 | The resources balance virtual optical network mapping method that a kind of time-frequency combination fragment perceives |
| WO2018134911A1 (en) * | 2017-01-18 | 2018-07-26 | Nec Corporation | Resource allocation system, method, and program |
| CN108347380A (en) * | 2018-02-27 | 2018-07-31 | 重庆邮电大学 | A kind of virtual optical network collaboration mapping method based on the perception of frequency spectrum dispersion |
| CN109150627A (en) * | 2018-10-09 | 2019-01-04 | 南京邮电大学 | The construction method mapped based on dynamic resource demand and the virtual network of topology ambiguity |
| CN109995435A (en) * | 2019-01-31 | 2019-07-09 | 全球能源互联网研究院有限公司 | A kind of mapping method of virtual network and system based on multi-fiber core optical-fiber network |
| CN111866623A (en) * | 2020-06-04 | 2020-10-30 | 重庆邮电大学 | High-efficiency virtual optical network survivability mapping method for service reliability |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075429B (en) * | 2011-01-21 | 2014-12-17 | 北京邮电大学 | Virtual network mapping method based on principle of proximity |
| WO2018029913A1 (en) * | 2016-08-09 | 2018-02-15 | 日本電信電話株式会社 | Resource allocation device and resource allocation method |
| CN111162865A (en) * | 2019-12-17 | 2020-05-15 | 重庆邮电大学 | Virtual optical network mapping method for sensing fragments in space division multiplexing elastic optical network |
-
2021
- 2021-06-02 CN CN202110616105.XA patent/CN113316039B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018134911A1 (en) * | 2017-01-18 | 2018-07-26 | Nec Corporation | Resource allocation system, method, and program |
| CN108270684A (en) * | 2018-01-25 | 2018-07-10 | 重庆邮电大学 | The resources balance virtual optical network mapping method that a kind of time-frequency combination fragment perceives |
| CN108347380A (en) * | 2018-02-27 | 2018-07-31 | 重庆邮电大学 | A kind of virtual optical network collaboration mapping method based on the perception of frequency spectrum dispersion |
| CN109150627A (en) * | 2018-10-09 | 2019-01-04 | 南京邮电大学 | The construction method mapped based on dynamic resource demand and the virtual network of topology ambiguity |
| CN109995435A (en) * | 2019-01-31 | 2019-07-09 | 全球能源互联网研究院有限公司 | A kind of mapping method of virtual network and system based on multi-fiber core optical-fiber network |
| CN111866623A (en) * | 2020-06-04 | 2020-10-30 | 重庆邮电大学 | High-efficiency virtual optical network survivability mapping method for service reliability |
Non-Patent Citations (2)
| Title |
|---|
| 链路可靠性感知的差异保护虚拟光网络映射;刘焕淋等;《电子学报》;20200515(第05期);全文 * |
| 面向可靠性的5G网络切片重构及映射算法;赵国繁等;《电子与信息学报》;20200615(第06期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113316039A (en) | 2021-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113316039B (en) | Virtual network survival mapping method based on reliability and time-frequency resource perception | |
| CN108834004B (en) | Routing calculation, fiber core selection and frequency spectrum allocation method and system based on cross crosstalk perception | |
| CN108111411B (en) | Backbone network and dynamic path planning system and planning method thereof | |
| US20140147120A1 (en) | Grooming Multicast Traffic in Flexible Optical Wavelength Division Multiplexing WDM Networks | |
| CN111866623A (en) | High-efficiency virtual optical network survivability mapping method for service reliability | |
| CN111162865A (en) | Virtual optical network mapping method for sensing fragments in space division multiplexing elastic optical network | |
| CN108471358B (en) | Virtual network protective mapping method based on minimum spanning tree | |
| Leesutthipornchai et al. | Solving multi-objective routing and wavelength assignment in WDM network using hybrid evolutionary computation approach | |
| CN111800352B (en) | Service function chain deployment method and storage medium based on load balancing | |
| CN113489617A (en) | Minimum network energy consumption optimization method and system based on traffic grooming | |
| CN114760202A (en) | Reliable construction and deployment method of service function chain in network slice scene | |
| CN103581006A (en) | System architecture for global optimization of flexible grid optical networks and global optimization method thereof | |
| CN112383477A (en) | Routing and spectrum allocation method and device for data center optical network | |
| CN115767325A (en) | Service function chain profit maximization mapping method and system | |
| CN106506362B (en) | A kind of elastic optical network multilink fault probability guard method of minimum failure risk loss | |
| CN108833142A (en) | A kind of network plan method of multi-core optical fiber planning business | |
| Ravipudi et al. | Impairment-and fragmentation-aware dynamic routing, modulation and spectrum allocation in C+ L band elastic optical networks using Q-learning | |
| CN113132827B (en) | Modulation adaptive route calculation method and device under elastic optical network | |
| CN108184175B (en) | MC node limitation-based elastic optical network multicast routing and spectrum allocation method | |
| CN113078942B (en) | Survivability virtual network mapping method based on related light path resource awareness | |
| CN107204935B (en) | Fault probability and load balancing compromise method and system for spectrum flexible optical network | |
| Liu et al. | Selective resource offloading in cloud-edge elastic optical networks | |
| Li et al. | A crosstalk-and fragmentation-aware RMSCA strategy in SDM-EONs based on aligned prime-partition of spectrum resources | |
| US20170339049A1 (en) | Methods and systems for failure recovery in a virtual network environment | |
| CN114614899B (en) | Data center virtual optical network mapping method and device and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |