CN112242951A - Virtual network mapping method and device - Google Patents
Virtual network mapping method and device Download PDFInfo
- Publication number
- CN112242951A CN112242951A CN202011112004.0A CN202011112004A CN112242951A CN 112242951 A CN112242951 A CN 112242951A CN 202011112004 A CN202011112004 A CN 202011112004A CN 112242951 A CN112242951 A CN 112242951A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- virtual
- target
- nodes
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/46—Interconnection of networks
- H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/46—Cluster building
Abstract
The application provides a virtual network mapping method and device, relates to the technical field of communication, and solves the problem of low virtual network mapping efficiency. The method comprises the following steps: the virtual network mapping device determines that a target virtual node is abnormal and acquires target information of the target virtual node; the target information comprises a cluster identifier of a target virtual node; determining a cluster in which the target virtual node is located according to the cluster identifier; in the class cluster, determining at least one candidate physical node according to the target information; determining the candidate physical node with the shortest Euclidean distance to the target virtual node as a target physical node; and mapping the target virtual node to the target physical node. The embodiment of the application is applied to mapping abnormal virtual nodes to physical nodes.
Description
Technical Field
The embodiment of the application relates to the technical field of communication, in particular to a virtual network mapping method and device.
Background
The underlying physical infrastructure of the virtualized network is shared, and when one of the physical servers fails or is attacked, the virtual machines carried thereon fail, which affects the continuity of the network and the service. Faced with the problems of such virtualized networks, survivability virtual network mappings are often employed to address.
At present, the common mapping method for virtual networks is as follows: firstly, evaluating the trust relationship between the virtual node and the physical node to ensure the mutual trust between the virtual node and the physical node to be mapped; then, respectively sequencing the virtual nodes and the physical nodes according to the attributes of the nodes, and mapping the more important virtual nodes to the more important physical nodes; and finally, determining the physical node finally mapped by the virtual node by adopting a K shortest path algorithm, and mapping the virtual node to the physical node.
It can be seen that, when the virtual network mapping method is executed, the physical node sets meeting the conditions need to be screened in the whole network, and the mapping efficiency is low.
Disclosure of Invention
The application provides a virtual network mapping method and device, and solves the problem of low virtual network mapping efficiency.
In a first aspect, the present application provides a virtual network mapping method, which is applied to a virtual network mapping apparatus, and the method includes: the virtual network mapping device determines that the target virtual node is abnormal, acquires target information of the target virtual node, and determines a cluster where the target virtual node is located according to a cluster identifier of the target virtual node, wherein the target information comprises the cluster identifier of the target virtual node. And then, the virtual network mapping device determines at least one candidate physical node according to the target information of the target virtual node in the class cluster, and determines the candidate physical node with the shortest Euclidean distance with the target virtual node as the target physical node. And finally, the virtual network mapping device maps the target virtual node to the target physical node.
In the above scheme, the virtual network mapping device can determine the class cluster where the target virtual node is located according to the cluster identifier in the target information of the target virtual node, then select a plurality of candidate physical nodes for the target virtual node in the class cluster, and finally select the candidate physical node closest to the target virtual node in the euclidean distance from the candidate physical nodes as the target virtual node. The method avoids the virtual network mapping device from directly screening the physical node set meeting the conditions in the whole network, reduces the complexity of the algorithm in the virtual network mapping process, improves the mapping efficiency, further shortens the response time of the network, and ensures the continuity of the service.
In a second aspect, the present application provides a virtual network mapping apparatus, including: and the acquisition module is used for determining that the target virtual node is abnormal and acquiring target information of the target virtual node, wherein the target information comprises a cluster identifier of the target virtual node. And the determining module is used for determining a class cluster where the target virtual node is located according to the cluster identifier of the target virtual node, determining at least one candidate physical node in the class cluster according to the target information of the target virtual node, and then determining the candidate physical node with the shortest Euclidean distance to the target virtual node as the target physical node. And the processing module is used for mapping the target virtual node to the target physical node.
In a third aspect, the present application provides a virtual network mapping apparatus, including a processor, where when the virtual network mapping apparatus runs, the processor executes a computer to execute instructions, so as to make the virtual network mapping apparatus execute the virtual network mapping method as described above.
In a fourth aspect, the present application provides a computer-readable storage medium comprising instructions which, when executed on a computer, cause the computer to perform the virtual network mapping method as described above.
In a fifth aspect, the present application provides a computer program product comprising instruction code for performing the virtual network mapping method as described above.
It is to be understood that any one of the above-mentioned virtual network mapping apparatus, computer-readable storage medium or computer program product is used for executing the above-mentioned method, and therefore, the beneficial effects achieved by the method can refer to the beneficial effects of the above-mentioned method and the corresponding solutions in the following detailed description, which are not described herein again.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic structural diagram of a virtualization network according to an embodiment of the present application;
fig. 2 is a schematic hardware structure diagram of a virtual network mapping apparatus according to an embodiment of the present application;
fig. 3 is a schematic flowchart of a virtual network mapping method according to an embodiment of the present application;
fig. 4 is a schematic flowchart of a method for generating target information according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a virtual network mapping apparatus according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In the embodiments of the present application, words such as "exemplary" or "for example" are used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as "exemplary" or "e.g.," is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.
In the following, the terms "first", "second" are used for descriptive purposes only and are not to be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the embodiments of the present application, "a plurality" means two or more unless otherwise specified.
With the rapid development of the 5th-generation (5G) network, three application scenarios, namely enhanced mobile broadband (eMBB), ultra-reliable and low latency communications (urlllc), and massive machine type communications (mtc), are deeply integrated with the vertical industry, and the demand for the network is continuously increased. In order to better serve industries and users, a 5G network provides a virtualized network architecture with separated software and hardware.
A conventional network structure is mainly composed of network devices provided by Internet Service Providers (ISPs). In a virtualized network architecture, physical devices (physical nodes) provided by infrastructure providers (InP) and virtual devices (virtual nodes) provided by Service Providers (SP) are included. The physical equipment is connected with a manufacturer, and the virtual equipment is connected with a user; the resources of the physical device can be used by a plurality of virtual devices at the same time, different virtual devices in the plurality of virtual devices can form different virtual networks, the different virtual networks are isolated from each other, and different protocols can be used for scheduling the resources relatively freely. Thus, the flexibility, diversity, and manageability of the network are greatly improved.
It can be seen that the virtual network is composed of some virtual devices and virtual links, and there is no actual device as a support, and the mapping of the virtual network is generated in order to make the virtual network operate. Although the virtual device in the virtual network does not have a real forwarding capability, the operation can be realized by using the resource of the physical device, so that the quota and the use right of the resource of the physical device are obtained, and the data forwarding of the virtual device is completed, which is a virtual network mapping process.
Specifically, the virtual network mapping is divided into two parts, one is the mapping of a virtual node, and the mapping from the virtual node to a physical node is mapped in a corresponding virtual network architecture; the other is the mapping of virtual links, which corresponds to the mapping of virtual links to links between physical nodes in the virtualized network architecture.
For example, FIG. 1 provides a schematic diagram of a virtualized network. Referring to fig. 1, the virtualized network includes a virtual layer 11 and a physical layer 12. The virtual layer 11 includes a first virtual node 111, a second virtual node 112, a third virtual node 113, a fourth virtual node 114, and a fifth virtual node 115; the physical layer 12 includes a first physical node 121, a second physical node 122, a third physical node 123, a fourth physical node 124, a fifth physical node 125, a sixth physical node 126, and a seventh physical node 127.
The first physical node 121 is connected to both the second physical node 122 and the fourth physical node 124, the second physical node 122 is connected to both the third physical node 123 and the fourth physical node 124, the third physical node 123 is connected to both the fourth physical node 124 and the sixth physical node 126, the fourth physical node 124 is connected to the fifth physical node 125, the fifth physical node 125 is connected to both the sixth physical node 126 and the seventh physical node 127, and the sixth physical node 126 is connected to the seventh physical node 127. The first virtual node 111 is connected to both the second virtual node 112 and the third virtual node 113, the second virtual node 112 is connected to the third virtual node 113, and the fourth virtual node 114 is connected to the fifth virtual node 115.
As shown in fig. 1, when the first virtual node 111 is mapped to the first physical node 121, the second virtual node 112 is mapped to the second physical node 122, and the third virtual node 113 is mapped to the fourth physical node 124, a virtual link between the first virtual node 111 and the second virtual node 112 may be mapped to a link between the first physical node 121 and the second physical node 122, and similarly, a virtual link between the first virtual node 111 and the third virtual node 113 may be mapped to a link between the first physical node 121 and the fourth physical node 124, and similarly, a virtual link between the second virtual node 112 and the third virtual node 113 may be mapped to a link between the second physical node 122 and the fourth physical node 124.
Similarly, when the fourth virtual node 114 is mapped to the fifth physical node 125 and the fifth virtual node 115 is mapped to the seventh physical node 127, the virtual link between the fourth virtual node 114 and the fifth virtual node 115 may be mapped to the link between the fifth physical node 125 and the seventh physical node 127.
As can be seen from the above, the underlying physical infrastructure of the virtualized network is shared. Therefore, when one of the physical servers fails or is attacked, the virtual machines carried thereon fail, which affects the continuity of the network and the service. In the face of such virtualized network problems, survivable virtual network mappings may be employed to solve.
At present, the common mapping method for virtual networks is as follows: firstly, evaluating the trust relationship between the virtual node and the physical node to ensure the mutual trust between the virtual node and the physical node to be mapped; then, respectively sequencing the virtual nodes and the physical nodes according to the attributes of the nodes, and mapping the more important virtual nodes to the more important physical nodes; and finally, determining the physical node finally mapped by the virtual node by adopting a K shortest path algorithm, and mapping the virtual node to the physical node.
It can be seen that, when the virtual network mapping method is executed, the physical node sets meeting the conditions need to be screened in the whole network, and the mapping efficiency is low.
In order to solve the above problems, the present application provides a virtual network mapping method and apparatus, where the virtual network mapping method specifically includes: the method comprises the steps of firstly obtaining first information of a network node, carrying out security level division on the network node according to the first information of the network node, and writing the security level of the network node into the first information of the network node to obtain second information. And then clustering the network nodes, and writing the cluster identification of the cluster where the network nodes are after clustering into the second information of the network nodes to obtain the target information. Therefore, when the target virtual node is abnormal, the target information of the target virtual node is directly acquired, the class cluster where the target virtual node is located can be known, then the target physical node is selected for the target virtual node in the class cluster, the complexity of an algorithm in the virtual network mapping process can be reduced, the mapping efficiency is improved, and the response time of a network is further shortened.
In a specific implementation, the virtual net mapping apparatus has the components shown in fig. 2. Fig. 2 is a virtual network mapping apparatus provided in an embodiment of the present application, and the virtual network mapping apparatus may include at least one processor 202, where the processor 202 is configured to execute an application program code, so as to implement a virtual network mapping method in the present application.
The processor 202 may be a Central Processing Unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more ics for controlling the execution of programs in accordance with the present disclosure.
As shown in fig. 2, the virtual network mapping apparatus may further include a memory 203. The memory 203 is used for storing application program codes for executing the scheme of the application, and the processor 202 controls the execution.
The memory 203 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a Random Access Memory (RAM) or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disk storage, optical disk storage (including compact disc, laser disc, optical disc, digital versatile disc, blu-ray disc, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to these. The memory 203 may be self-contained and coupled to the processor 202 via the bus 204. The memory 203 may also be integrated with the processor 202.
As shown in fig. 2, the virtual network mapping apparatus may further include a communication interface 201, wherein the communication interface 201, the processor 202, and the memory 203 may be coupled to each other, for example, via a bus 204. The communication interface 201 is used for information interaction with other devices, for example, information interaction between the virtual network mapping apparatus and other devices is supported.
It is noted that the device structure shown in fig. 2 does not constitute a limitation of the virtual network mapping apparatus, which may comprise more or less components than those shown in fig. 2, or some components in combination, or a different arrangement of components, in addition to those shown in fig. 2.
The virtual network mapping method provided in the embodiment of the present application is described below with reference to the virtualized network shown in fig. 1 and the virtual network mapping apparatus shown in fig. 2 through fig. 3.
Fig. 3 is a schematic flowchart of a virtual network mapping method according to an embodiment of the present application. Referring to fig. 3, the virtual network mapping method includes the following steps.
301. And the virtual network mapping device determines that the target virtual node is abnormal and acquires the target information of the target virtual node.
And the target information comprises the cluster identification of the target virtual node.
Firstly, before determining that a target virtual node is abnormal and acquiring target information of the target virtual node, the virtual network mapping device needs to generate the target information of the network node in the virtualized network. Specifically, fig. 4 is a schematic flow chart of a method for generating target information according to an embodiment of the present application. Referring to FIG. 4, the generation method includes the following steps S1-S6.
S1, the virtual network mapping device collects first information of at least two network nodes.
Wherein the at least two network nodes comprise a virtual node and a physical node. A network node corresponds to a first message. Specifically, the virtual network mapping apparatus obtains first information of each network node in the virtualized network, where the first information includes a processor main frequency and a location of the network node, and a sum of bandwidths of links connected to the network node.
S2, the virtual network mapping device evaluates the first information of at least two network nodes to obtain the security value of each network node.
Specifically, the virtual network mapping apparatus performs a third operation on each network node to obtain a security value of each network node.
More specifically, the third operation is: firstly, quantizing the main frequency of a processor of a third network node by a virtual network mapping device to obtain a first quantized value; quantizing the position of the third network node to obtain a second quantized value; and quantizing the sum of the bandwidths of the links connected with the third network node to obtain a third quantized value. The virtual net mapping device then takes the sum of the first, second and third quantized values as the security value of the third network node. Wherein the third network node is any one of the at least two network nodes.
Because the environment of each virtualized network is not very same, when the parameter in the first information is quantitatively evaluated, the magnitude of the safety value does not have an absolute limit standard, and a proper quantitative evaluation model can be established according to the environment of the virtualized network and other practical situations.
For example, the quantitative score range for the parameter in the first information is limited to 0-1. For another example, the scoring range of the processor main frequency is set to be 0-0.3, the evaluation line is divided according to the size of the processor main frequency, the quantized value of the processor main frequency between 2GHz and 3GHz is determined to be 0.2, the quantized value of the processor main frequency greater than 3GHz is determined to be 0.3, and the quantized value of the processor main frequency less than 2GHz is determined to be 0.1. For another example, the scoring range of the location is set to 0-0.4, and the quantization value of the location in the secure domain is set to be higher than the quantization value of the location in the non-secure domain according to the division of the network domain, or alternatively, the quantization value of the location in the control plane is set to be higher than the quantization value of the location in the data plane. As another example, the score range for the sum of the bandwidths of the links connected by the network node is set to 0-0.6, etc.
Optionally, the first information may further include some other key resource information of the network node, so that when performing quantitative evaluation, the key resource information also needs to be quantitatively evaluated together, and a sum of all quantitative values is determined as the security value of the network node.
S3, the virtual network mapping device performs security level division on at least two network nodes according to the security values to obtain the security level of each network node.
Specifically, the virtual network mapping device sorts the network nodes according to the security values, and determines the security level lineation reference parameter according to the sorted network nodes. Determining the network node with the safety value equal to the safety grade marking reference parameter as a middle safety grade, and quantizing the safety grade to 2; determining the network node with the safety value smaller than the safety grade marking reference parameter as a low safety grade, and quantizing the low safety grade to 1; and determining the network node with the safety value larger than the safety level marking reference parameter as a high safety level, wherein the quantity is 3.
S4, the virtual network mapping device executes the first operation to each network node to obtain the second information of at least two network nodes.
Wherein one network node corresponds to one second information.
Specifically, the first operation is: the virtual network mapping device writes the security level of the first network node into the first information of the first network node. Wherein the first network node is any one of the at least two network nodes.
S5, the virtual network mapping device clusters the at least two network nodes according to the second information of the at least two network nodes and a preset algorithm to obtain a cluster identifier of each network node.
Optionally, the preset algorithm is a K-Means clustering (K-Means) algorithm. Specifically, the Euclidean distance is adopted to calculate the distance from each network node to k clustering centers, and through repeated iterative calculation, at least two network nodes are clustered into k clusters according to the distance between the network node and the clustering centers. Wherein the clustering center is renA network node,
k denotes the number of class clusters and n denotes the number of network nodes.
And S6, the virtual network mapping device executes a second operation on each network node to obtain the target information of at least two network nodes.
Wherein one network node corresponds to one target information.
Specifically, the second operation is: and the virtual network mapping device writes the cluster identifier of the second network node into the second information of the second network node. Wherein the second network node is any one of the at least two network nodes.
Optionally, the virtual network mapping apparatus writes the cluster identifier and the second information of the network node into a key-value pair form, so as to obtain the target information.
Optionally, the virtual network mapping device obtains the target information and then stores the target information.
Then, the virtual network mapping device determines that the target virtual node is abnormal, and acquires the target information of the target virtual node. Specifically, when a virtual node is abnormal, for example, a fault occurs, or is attacked and requests mapping, the virtual network mapping apparatus acquires target information of the virtual node.
302. And the virtual network mapping device determines the cluster type of the target virtual node according to the cluster identifier of the target virtual node.
303. And the virtual network mapping device determines at least one candidate physical node in the class cluster according to the target information of the target virtual node.
The target information further comprises the sum of the security level of the target virtual node and the bandwidth of a link connected with the target virtual node.
Specifically, each candidate physical node in the at least one candidate physical node satisfies: the security level of the candidate physical node is greater than or equal to that of the target virtual node; the sum of the bandwidths of the virtual nodes carried by the candidate physical nodes is smaller than the total bandwidth of the candidate physical nodes; the link through which the candidate physical node passes does not comprise a physical server corresponding to the target virtual node; and other virtual nodes which are not present in the candidate physical nodes and are in the same virtual network with the target virtual node.
304. And the virtual network mapping device determines the candidate physical node with the shortest Euclidean distance with the target virtual node as the target physical node.
305. The virtual network mapping device maps the target virtual node to the target physical node.
Further, after mapping is completed, the virtual network mapping device may further perform association analysis according to the clusters of the target virtual nodes, for example, when a plurality of virtual nodes initiate a mapping request at the same time, the association relationship between the virtual nodes may be found by checking the cluster where each virtual node is located, and locating an abnormal point, which provides a basis for rapid troubleshooting.
In the above scheme, the virtual network mapping device can determine the class cluster where the target virtual node is located according to the cluster identifier in the target information of the target virtual node, then select a plurality of candidate physical nodes for the target virtual node in the class cluster, and finally select the candidate physical node closest to the target virtual node in the euclidean distance from the candidate physical nodes as the target virtual node. The method avoids the virtual network mapping device from directly screening the physical node set meeting the conditions in the whole network, reduces the complexity of the algorithm in the virtual network mapping process, improves the mapping efficiency, further shortens the response time of the network, and ensures the continuity of the service.
In addition, in the application, the network nodes are firstly subjected to security level division, and then the security level is taken as a parameter during clustering when the network nodes are clustered, so that the mapping can be ensured to be performed among the network nodes with the same security level. Therefore, on one hand, the virtual node with higher security level can be prevented from being mapped to the physical node with lower security level, so that the risk of the virtual node being attacked is increased; on the other hand, the virtual node with lower security level can be prevented from being mapped to the physical node with higher security level, so that resource waste and equipment cost increase are avoided.
In the embodiment of the present application, the functional modules of the virtual network mapping apparatus may be divided according to the method embodiments described above, for example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. It should be noted that, in the embodiment of the present application, the division of the module is schematic, and is only one logic function division, and there may be another division manner in actual implementation.
The method provided by the embodiment of the present application is described in detail above with reference to fig. 3-4. Hereinafter, the virtual network mapping apparatus according to the embodiment of the present application will be described in detail with reference to fig. 5. It should be understood that the description of the apparatus embodiments corresponds to the description of the method embodiments, and therefore, for brevity, details are not repeated here, since the details that are not described in detail may be referred to the above method embodiments.
Fig. 5 shows a schematic structural diagram of a virtual network mapping apparatus. The virtual network mapping apparatus comprises an obtaining module 51, a determining module 52, a processing module 53, and an evaluating module 54.
The obtaining module 51 is configured to determine that the target virtual node is abnormal, and obtain target information of the target virtual node. The target information includes a cluster identification of the target virtual node. For example, referring to fig. 3, the obtaining module 51 is configured to execute step 301. The determining module 52 is configured to determine a cluster where the target virtual node is located according to the cluster identifier obtained by the obtaining module 51. For example, referring to FIG. 3, the determination module 52 is configured to perform step 302. The determining module 52 is further configured to determine at least one candidate physical node in the class cluster according to the target information. For example, referring to fig. 3, the determination module 52 is further configured to perform step 303. The determining module 52 is further configured to determine the candidate physical node with the shortest euclidean distance to the target virtual node as the target physical node. For example, referring to FIG. 3, the determination module 52 is further configured to perform step 304. And a processing module 53, configured to map the target virtual node to the target physical node. For example, referring to FIG. 3, the processing module 53 is configured to perform step 305.
Optionally, the target information further includes a sum of a security level of the target virtual node and a bandwidth of a link connected to the target virtual node. Each of the at least one candidate physical node satisfies: the security level of the candidate physical node is greater than or equal to the security level of the target virtual node. And the sum of the bandwidths of the virtual nodes carried by the candidate physical nodes is smaller than the total bandwidth of the candidate physical nodes. And the link passed by the candidate physical node does not comprise the physical server corresponding to the target virtual node. And other virtual nodes which are not present in the candidate physical nodes and are in the same virtual network with the target virtual node.
Optionally, the virtual network mapping apparatus further includes: the obtaining module 51 is further configured to collect first information of at least two network nodes. The at least two network nodes include a virtual node and a physical node. A network node corresponds to a first message. For example, referring to fig. 4, the obtaining module 51 is further configured to execute step S1. The evaluation module 54 is configured to evaluate the first information of at least two network nodes to obtain a security value of each network node. For example, referring to FIG. 4, the evaluation module 54 is configured to perform step S2. The processing module 53 is further configured to: and performing security level division on at least two network nodes according to the security value to obtain the security level of each network node. And executing the first operation on each network node to obtain second information of at least two network nodes. A network node corresponds to a second message. The first operation is: the security level of the first network node is written into the first information of the first network node. The first network node is any one of at least two network nodes. And clustering the at least two network nodes according to the second information of the at least two network nodes and a preset algorithm to obtain a cluster identifier of each network node. And executing a second operation on each network node to obtain the target information of at least two network nodes. One network node corresponds to one target information. The second operation is: and writing the cluster identification of the second network node into second information of the second network node. The second network node is any one of the at least two network nodes. For example, referring to FIG. 4, the processing module 53 is further configured to perform steps S3-S6.
Optionally, the first information of the third network node includes a sum of a processor dominant frequency of the third network node, a location of the third network node, and a bandwidth of a link to which the third network node is connected. The third network node is any one of the at least two network nodes.
The evaluation module 54 is specifically configured to: and executing a third operation on each network node to obtain the security value of each network node. The third operation is: and quantizing the main frequency of the processor of the third network node to obtain a first quantized value. And quantizing the position of the third network node to obtain a second quantized value. And quantizing the sum of the bandwidths of the links connected with the third network node to obtain a third quantized value. And taking the sum of the first quantized value, the second quantized value and the third quantized value as the safety value of the third network node.
Optionally, the preset algorithm is a k-means clustering algorithm.
Another embodiment of the present application further provides a computer-readable storage medium, in which instructions are stored, and when the instructions are executed on a virtual network mapping apparatus, the virtual network mapping apparatus executes the steps in the virtual network mapping method according to the embodiment shown in fig. 3 to fig. 4.
In another embodiment of the present application, there is also provided a computer program product comprising computer executable instructions stored in a computer readable storage medium; the processor of the virtual network mapping apparatus may read the computer executable instructions from the computer readable storage medium, and the processor executes the computer executable instructions to cause the virtual network mapping apparatus to perform the steps in the virtual network mapping method of the embodiments shown in fig. 3-4.
All relevant contents of each step related to the above method embodiment may be referred to the functional description of the corresponding functional module, and the function thereof is not described herein again.
It should be understood that, in the various embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.
Those of ordinary skill in the art would appreciate that the various illustrative modules, elements, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus, and method may be implemented in other ways. For example, the device embodiments described above are merely illustrative, e.g., multiple units or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (12)
1. A virtual network mapping method is characterized by comprising the following steps:
determining that a target virtual node is abnormal, and acquiring target information of the target virtual node; the target information comprises a cluster identifier of the target virtual node;
determining the cluster where the target virtual node is located according to the cluster identifier;
determining at least one candidate physical node in the class cluster according to the target information;
determining the candidate physical node with the shortest Euclidean distance to the target virtual node as a target physical node;
mapping the target virtual node to the target physical node.
2. The virtual network mapping method according to claim 1, wherein the destination information further includes a sum of a security level of the destination virtual node and a bandwidth of a link to which the destination virtual node is connected;
each of the at least one candidate physical node satisfies:
the security level of the candidate physical node is greater than or equal to the security level of the target virtual node;
the sum of the bandwidths of the virtual nodes carried by the candidate physical nodes is smaller than the total bandwidth of the candidate physical nodes;
the link passed by the candidate physical node does not comprise the physical server corresponding to the target virtual node;
and the candidate physical nodes do not exist, and are positioned at other virtual nodes of the same virtual network with the target virtual node.
3. The virtual network mapping method according to claim 1, wherein before obtaining the target information of the target virtual node, the virtual network mapping method further comprises:
collecting first information of at least two network nodes; the at least two network nodes comprise a virtual node and a physical node; a network node corresponding to a first message;
evaluating the first information of the at least two network nodes to obtain the security value of each network node;
according to the safety values, carrying out safety grade division on the at least two network nodes to obtain the safety grade of each network node;
executing a first operation on each network node to obtain second information of the at least two network nodes; a network node corresponds to a second message; the first operation is: writing a security level of a first network node into first information of the first network node; the first network node is any one of the at least two network nodes;
clustering the at least two network nodes according to the second information of the at least two network nodes and a preset algorithm to obtain a clustering identifier of each network node;
executing a second operation on each network node to obtain target information of the at least two network nodes; one network node corresponds to one target information; the second operation is: writing the cluster identifier of the second network node into second information of the second network node; the second network node is any one of the at least two network nodes.
4. The virtual network mapping method of claim 3,
the first information of the third network node comprises the sum of the processor main frequency of the third network node, the position of the third network node and the bandwidth of a link connected with the third network node; the third network node is any one of the at least two network nodes;
the evaluating the first information of the at least two network nodes to obtain the security value of each network node includes:
executing a third operation on each network node to obtain a security value of each network node; the third operation is:
quantizing the processor main frequency of the third network node to obtain a first quantized value;
quantizing the position of the third network node to obtain a second quantized value;
quantizing the sum of the bandwidths of the links connected with the third network node to obtain a third quantized value;
taking the sum of the first quantized value, the second quantized value and the third quantized value as the security value of the third network node.
5. The virtual network mapping method of claim 3,
the preset algorithm is a k-means clustering algorithm.
6. A virtual network mapping apparatus, comprising:
the acquisition module is used for determining that a target virtual node is abnormal and acquiring target information of the target virtual node; the target information comprises a cluster identifier of the target virtual node;
the determining module is used for determining the cluster where the target virtual node is located according to the cluster identifier acquired by the acquiring module;
the determining module is further configured to determine, in the class cluster, at least one selected physical node according to the target information;
the determining module is further configured to determine the candidate physical node with the shortest euclidean distance to the target virtual node as the target physical node;
a processing module to map the target virtual node to the target physical node.
7. The virtual network mapping apparatus of claim 6,
the target information also comprises the sum of the security level of the target virtual node and the bandwidth of a link connected with the target virtual node;
each of the at least one candidate physical node satisfies:
the security level of the candidate physical node is greater than or equal to the security level of the target virtual node;
the sum of the bandwidths of the virtual nodes carried by the candidate physical nodes is smaller than the total bandwidth of the candidate physical nodes;
the link passed by the candidate physical node does not comprise the physical server corresponding to the target virtual node;
and the candidate physical nodes do not exist, and are positioned at other virtual nodes of the same virtual network with the target virtual node.
8. The virtual network mapping apparatus according to claim 6, wherein the virtual network mapping apparatus further comprises:
the acquisition module is further used for acquiring first information of at least two network nodes; the at least two network nodes comprise a virtual node and a physical node; a network node corresponding to a first message;
the evaluation module is used for evaluating the first information of the at least two network nodes to obtain the security value of each network node;
the processing module is further configured to:
according to the safety values, carrying out safety grade division on the at least two network nodes to obtain the safety grade of each network node;
executing a first operation on each network node to obtain second information of the at least two network nodes; a network node corresponds to a second message; the first operation is: writing a security level of a first network node into first information of the first network node; the first network node is any one of the at least two network nodes;
clustering the at least two network nodes according to the second information of the at least two network nodes and a preset algorithm to obtain a clustering identifier of each network node;
executing a second operation on each network node to obtain target information of the at least two network nodes; one network node corresponds to one target information; the second operation is: writing the cluster identifier of the second network node into second information of the second network node; the second network node is any one of the at least two network nodes.
9. The virtual network mapping apparatus of claim 8,
the first information of the third network node comprises the sum of the processor main frequency of the third network node, the position of the third network node and the bandwidth of a link connected with the third network node; the third network node is any one of the at least two network nodes;
the evaluation module is specifically configured to:
executing a third operation on each network node to obtain a security value of each network node; the third operation is:
quantizing the processor main frequency of the third network node to obtain a first quantized value;
quantizing the position of the third network node to obtain a second quantized value;
quantizing the sum of the bandwidths of the links connected with the third network node to obtain a third quantized value;
taking the sum of the first quantized value, the second quantized value and the third quantized value as the security value of the third network node.
10. The virtual network mapping apparatus of claim 8,
the preset algorithm is a k-means clustering algorithm.
11. A virtual network mapping apparatus comprising a processor which executes computer executable instructions to cause the virtual network mapping apparatus to perform the virtual network mapping method of any one of claims 1 to 5 when the virtual network mapping apparatus is run.
12. A computer-readable storage medium comprising instructions that, when executed on a computer, cause the computer to perform the virtual network mapping method of any of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011112004.0A CN112242951B (en) | 2020-10-16 | 2020-10-16 | Virtual network mapping method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011112004.0A CN112242951B (en) | 2020-10-16 | 2020-10-16 | Virtual network mapping method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112242951A true CN112242951A (en) | 2021-01-19 |
| CN112242951B CN112242951B (en) | 2022-03-15 |
Family
ID=74168948
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011112004.0A Active CN112242951B (en) | 2020-10-16 | 2020-10-16 | Virtual network mapping method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112242951B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7788522B1 (en) * | 2007-05-31 | 2010-08-31 | Oracle America, Inc. | Autonomous cluster organization, collision detection, and resolutions |
| CN103457752A (en) * | 2012-05-30 | 2013-12-18 | 中国科学院声学研究所 | Virtual network mapping method |
| CN104104621A (en) * | 2013-04-07 | 2014-10-15 | 中国科学院声学研究所 | Dynamic adaptive adjustment method of virtual network resources based on nonlinear dimensionality reduction |
| US20150036541A1 (en) * | 2013-07-31 | 2015-02-05 | Tsinghua University | Inter-domain virtual network mapping method and system and inter-domain virtual network |
| CN105681153A (en) * | 2016-03-16 | 2016-06-15 | 北京邮电大学 | Virtual network mapping method and device |
| CN110213149A (en) * | 2019-05-30 | 2019-09-06 | 西安邮电大学 | A kind of virtual network mapping algorithm based on node entropy |
| US20190319844A1 (en) * | 2016-12-27 | 2019-10-17 | Huawei Technologies Co., Ltd. | Service deployment method and apparatus |
-
2020
- 2020-10-16 CN CN202011112004.0A patent/CN112242951B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7788522B1 (en) * | 2007-05-31 | 2010-08-31 | Oracle America, Inc. | Autonomous cluster organization, collision detection, and resolutions |
| CN103457752A (en) * | 2012-05-30 | 2013-12-18 | 中国科学院声学研究所 | Virtual network mapping method |
| CN104104621A (en) * | 2013-04-07 | 2014-10-15 | 中国科学院声学研究所 | Dynamic adaptive adjustment method of virtual network resources based on nonlinear dimensionality reduction |
| US20150036541A1 (en) * | 2013-07-31 | 2015-02-05 | Tsinghua University | Inter-domain virtual network mapping method and system and inter-domain virtual network |
| CN105681153A (en) * | 2016-03-16 | 2016-06-15 | 北京邮电大学 | Virtual network mapping method and device |
| US20190319844A1 (en) * | 2016-12-27 | 2019-10-17 | Huawei Technologies Co., Ltd. | Service deployment method and apparatus |
| CN110213149A (en) * | 2019-05-30 | 2019-09-06 | 西安邮电大学 | A kind of virtual network mapping algorithm based on node entropy |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112242951B (en) | 2022-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109729131B (en) | Application request processing method and device and router | |
| US9003222B2 (en) | Configuration fault localization in shared resource environments | |
| CN111538558B (en) | System and method for automatically selecting secure virtual machines | |
| US11601338B2 (en) | Method for gathering traffic analytics data about a communication network | |
| CN108351806A (en) | Database trigger of the distribution based on stream | |
| EP2766809A1 (en) | Methods and systems for identifying action for responding to anomaly in cloud computing system | |
| US11194688B1 (en) | Application architecture optimization and visualization | |
| CN110784515B (en) | Data storage method based on distributed cluster and related equipment thereof | |
| US11108687B1 (en) | Scalable network function virtualization service | |
| CN111083013B (en) | Test method and device based on flow playback, electronic equipment and storage medium | |
| CN110597719B (en) | Image clustering method, device and medium for adaptation test | |
| CN110661719B (en) | Traffic load balancing method and device | |
| CN112764920A (en) | Edge application deployment method, device, equipment and storage medium | |
| Forti et al. | Declarative continuous reasoning in the cloud-IoT continuum | |
| CN115827223A (en) | Service grid hosting method and system based on cloud native platform | |
| Aslanpour et al. | Auto-scaling of web applications in clouds: A tail latency evaluation | |
| CN112242951B (en) | Virtual network mapping method and device | |
| US11205092B2 (en) | Clustering simulation failures for triage and debugging | |
| CN116546028A (en) | Service request processing method and device, storage medium and electronic equipment | |
| CN111078560A (en) | Test method and device based on flow pruning, electronic equipment and storage medium | |
| Zhou et al. | An interactive and reductive graph processing library for edge computing in smart society | |
| CN112532448B (en) | Network topology processing method and device and electronic equipment | |
| CN108123821B (en) | Data analysis method and device | |
| US11973666B1 (en) | Systems and methods for using blockchain to manage service-level agreements between multiple service providers | |
| CN115314513B (en) | Trust twinning method based on block chain and related 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 |