Cross-domain virtual network mapping method and device, computer equipment and storage medium
Through dynamic topology perception and resource attribute-driven mapping algorithms and secure communication mechanisms, cross-domain underlying network convergence and communication security problems are solved, efficient resource management and information security protection are achieved, and 5G service needs are adapted.
Patent Information
- Application Number
- CN202411137844.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-19
- Publication Date
- 2024-11-26
AI Technical Summary
The prior art is difficult to realize inter-layer convergence of cross-domain underlying networks and collaborative management of physical resources, and the security of cross-domain device communication is difficult to ensure, especially in multi-domain virtual network environments.
Using a mapping algorithm based on dynamic topology awareness and resource attribute-driven mapping algorithm, virtual nodes are mapped to suitable physical nodes, and virtual links are mapped to physical links that meet the needs through the k-shortest path algorithm, while combining privileged containers and secure communication mechanisms , uses hook functions and encryption and decryption systems to interact information between cross-domain containers.
It realizes seamless integration of cross-domain underlying networks, simplifies the mapping process, improves resource utilization efficiency and network performance, enhances information security, adapts to the diversified needs of 5G services, and has good scalability and stability.
Smart Images

Figure CN119030878A_ABST
Abstract
Description
Technical Field
[0001] The present application belongs to the field of industrial Internet technology, and in particular, relates to a cross-domain virtual network mapping method, device, computer equipment and storage medium. Background Art
[0002] The current cross-domain underlying network is composed of heterogeneous wireless access networks, optical network backbone networks and data center networks. Each layer of the network has different physical resources. How to coordinate the cross-layer and cross-domain communications of the end-edge-cloud system and enhance the inter-layer integration of the cross-domain underlying network and the collaborative management of physical resources has become a key challenge in current research.
[0003] In order to solve the "rigidity" problem of the current Internet structure, researchers have proposed the idea of network virtualization. Through virtualization technology, multiple virtual networks that run in parallel and are isolated from each other can share the same underlying network. Each virtual network can independently test and deploy different protocols, thereby achieving resource sharing and reducing network energy consumption and operating expenses. The network architecture is divided into underlying networks and virtual networks. Network service providers are divided into infrastructure providers and service providers. Infrastructure providers are responsible for the management and maintenance of underlying facilities and resources, while service providers lease physical facilities and resources from infrastructure providers to build virtual networks. Cross-domain and cross-technology network virtualization technology provides an efficient management method for the current multi-domain underlying network. By abstracting multi-domain physical resources to form a resource sharing pool, this technology is conducive to the unified management and scheduling of multi-domain resources, improving the utilization of physical resources, and thus realizing the integration and coexistence of multi-domain underlying networks. The essence of the cross-domain virtual network mapping problem is to select appropriate physical nodes and physical paths for multi-domain virtual network requests in the cross-domain underlying network according to business resource requirements and physical resource constraints, so as to realize the carrying and resource allocation of multi-domain virtual network requests. Minimizing the deployment of virtualized operating systems on a physical host can reduce the probability of crosstalk between different systems during information interaction. However, due to cost and functional considerations, in actual work, multiple virtualized operating systems may be run on each physical host at the same time. In this case, high requirements are placed on the operability and coordination capabilities of the container. To achieve this function, only the back-end driver is retained in the privileged container, and the front-end driver is placed in different client containers. Each client container on the same physical host has a front-end driver, which is connected to the back-end driver on the privileged container through a common interface. The specific process is as follows: Any instruction on the client container (including information input and output instructions) first reaches the front-end driver of the local machine. In the virtualized operating system, the instruction cannot be directly transmitted to the underlying device. At this time, the information in the front-end driver must be transmitted to the back-end driver on the privileged container through cross-domain communication, and then the privileged container realizes the connection between the control information and the underlying device, thereby realizing program response or device control. However, since the traditional network architecture is independent and closed to each other, it cannot meet the business needs of the emerging industrial Internet, and it is difficult to achieve inter-layer integration of cross-domain underlying networks and collaborative management of physical resources. In addition, in terms of cross-domain device communication technology, information interaction based on a fully virtualized environment is difficult to ensure the security of the communication path, and there is a lack of relevant strategies to ensure communication security. Summary of the invention
[0004] The present application provides a cross-domain virtual network mapping method, apparatus, computer equipment and storage medium, aiming to solve at least one of the above-mentioned technical problems in the prior art to a certain extent.
[0005] In order to solve the above problems, this application provides the following technical solutions:
[0006] A cross-domain virtual network mapping method, comprising:
[0007] Representing the underlying cross-domain fusion network as a first weighted undirected graph including physical nodes and physical links;
[0008] Representing the cross-domain virtual network as a second weighted undirected graph including virtual nodes and virtual links;
[0009] A mapping algorithm based on dynamic topology perception and resource attribute drive is used to map the first weighted undirected graph and the second weighted undirected graph, the virtual nodes are mapped to suitable physical nodes, and a k-shortest path algorithm is used to map the virtual links to physical links that meet the requirements.
[0010] The technical solution adopted by the embodiment of the present application also includes: the underlying cross-domain fusion network is represented as a first weighted undirected graph including physical nodes and physical links, specifically:
[0011] The first weighted undirected graph is expressed as Where N S is the set of physical nodes, L S is the physical link set, and They are physical nodes n S (n S ∈N S ) and physical link l S (l S ∈L S ) has the attribute that the physical node n S The properties include radio node resource blocks Backbone network node computing resources and data center node computing resources The geographical location of the physical node is Loc(n S ), and the physical nodes have different computing capabilities and resource attributes; the physical link l S The attributes include the bandwidth of the wireless backhaul link and spectrum resources of optical fiber links and The path of the underlying cross-domain fusion network is represented by P s , physical path l P (l P ∈P S ) consists of multiple physical links l S composition.
[0012] The technical solution adopted by the embodiment of the present application also includes: the cross-domain virtual network is represented as a second weighted undirected graph including virtual nodes and virtual links, specifically:
[0013] The second weighted undirected graph is expressed as Where N V is a set of virtual nodes, L V is a virtual link set, and They are virtual nodes n V (n V ∈N V ) and virtual link l V (l V ∈L V ), the resource requirements of the virtual node include the wireless resource block request RB (n V ), the computing resource requirements of the virtual backbone network switching nodes and virtual data center nodes CPU (n V ), the geographic location of the virtual node Loc(n V ) and the mappable range of the virtual node D(n V ), the resource requirement of the virtual link is the bandwidth resource requirement BW(l V ).
[0014] The technical solution adopted by the embodiment of the present application also includes: the first weighted undirected graph and the second weighted undirected graph are mapped using a mapping algorithm based on dynamic topology perception and resource attribute drive, the virtual nodes are mapped to suitable physical nodes, and the k-shortest path algorithm is used to map the virtual links to physical links that meet the requirements, specifically:
[0015] The node expansion resource is defined as the sum of the bandwidth resources of its adjacent links divided by the number of adjacent links, which is divided into the expansion resource demand of the virtual node E(n V ) and the extended resource surplus E(n S ):
[0016]
[0017] Where L(n) is the set of neighboring links of a node; l (n) is the number of neighboring links of the node;
[0018] The inverse of bandwidth resources is defined as the link unit resource cost. Physical links with more resources have a smaller unit resource cost coefficient:
[0019]
[0020] In the formula, η is the link resource cost adjustment coefficient;
[0021] The constraints are:
[0022]
[0023] dis(Loc(n V ), Loc(n s ))≤D(n V )
[0024]
[0025] In the above formula, n V (u)↑n S (i) indicates virtual node n V (u) is mapped to physical node n s (i) up; l V (u,w)↑l S (i, j) represents virtual link l V (u, w) is mapped to physical link l s (i, j); dis() means calculating the distance between nodes.
[0026] The technical solution adopted by the embodiment of the present application also includes: the mapping algorithm based on dynamic topology perception and resource attribute drive is used to map the first weighted undirected graph and the second weighted undirected graph, the virtual node is mapped to a suitable physical node, and the k-shortest path algorithm is used to map the virtual link to the physical link that meets the requirements, including:
[0027] Define the second weighted undirected graph G V To the first weighted undirected graph G S The mapping is M:G V (N V , R V ) → G S (N S , C S ), virtual node n V Mapped to physical node n S The upper n V ↑n s , virtual link l V Mapping to physical link l s l V ↑l s , virtual link l V Map to physical path l P The upper is l V ↑l P The mapping algorithm based on dynamic topology perception and resource attribute drive adopts a two-stage mapping strategy. The specific mapping process includes:
[0028] Deploy virtual nodes, sort the virtual nodes in descending order of mapping priority, select the first virtual node in the queue, sort the backup physical node set of the virtual node in descending order of mapping priority, and select the underlying node with the largest mapping priority and meeting the resource requirements of the virtual node for deployment;
[0029] After completing the deployment of all virtual nodes in the request, the k-shortest path algorithm is used to select a physical path that meets the virtual link bandwidth requirements and has the minimum number of hops to deploy the virtual link, taking the link bandwidth resource cost as the weight.
[0030] The technical solution adopted by the embodiment of the present application also includes: the first weighted undirected graph and the second weighted undirected graph are mapped by using a mapping algorithm based on dynamic topology perception and resource attribute drive, the virtual node is mapped to a suitable physical node, and the virtual link is mapped to a physical link that meets the requirements by using a k-shortest path algorithm, and further includes:
[0031] After completing the cross-domain virtual network mapping, privileged containers and secure communication mechanisms are combined, and hook functions and encryption and decryption systems are used to interact with information between cross-domain containers.
[0032] The technical solution adopted by the embodiment of the present application also includes: combining the privileged container and the secure communication mechanism, using the hook function and the encryption and decryption system to perform information interaction between cross-domain containers, specifically:
[0033] The privileged container marks the physical host sending the information as A by identifying the source of the information, and determines the target physical host B of the information according to the control instruction; determines whether A and B are the same physical host, and if so, enables the anti-virus software or security system on the physical host to ensure communication security; otherwise, starts the security communication model, and verifies through the security communication model whether the sending system and the sending system of the information are located on the same physical host, and if so, calls the hook function inside the system to extract the information features and encrypts them for protection, and then completes the information transmission with the help of the front-end driver and the back-end driver; otherwise, calls the hook function inside the system to extract the information features and encrypts them for protection, and then uses the network card or external communication device to transmit the encrypted information to the container on another physical host.
[0034] Another technical solution adopted by the embodiment of the present application is: a cross-domain virtual network mapping device, comprising:
[0035] The first network representation module is used to represent the underlying cross-domain fusion network as a first weighted undirected graph including physical nodes and physical links;
[0036] A second network representation module: used for representing the cross-domain virtual network as a second weighted undirected graph including virtual nodes and virtual links;
[0037] Network mapping module: used to map the first weighted undirected graph and the second weighted undirected graph using a mapping algorithm based on dynamic topology perception and resource attribute drive, map the virtual nodes to suitable physical nodes, and use the k-shortest path algorithm to map the virtual links to physical links that meet the requirements.
[0038] Another technical solution adopted by the embodiment of the present application is: a computer device, the computer device includes a processor and a memory coupled to the processor, wherein:
[0039] The memory stores program instructions for implementing the cross-domain virtual network mapping method;
[0040] The processor is used to execute the program instructions stored in the memory to control the cross-domain virtual network mapping method.
[0041] Another technical solution adopted by the embodiment of the present application is: a storage medium storing program instructions executable by a processor, wherein the program instructions are used to execute the cross-domain virtual network mapping method.
[0042] Compared with the prior art, the beneficial effects of the embodiments of the present application are: the cross-domain virtual network mapping method, device, computer equipment and storage medium of the embodiments of the present application adopt a two-stage mapping strategy through a mapping algorithm driven by dynamic topology perception and resource attributes, first prioritize virtual nodes and map resource matching, and then map virtual links using the k-shortest path algorithm, so as to achieve seamless integration between the layers of the cross-domain underlying network, simplify the complexity of the mapping process, improve mapping efficiency, optimize the collaborative management of physical resources, reduce network operation and maintenance costs, improve resource utilization efficiency and network performance, and better support the diversified needs of 5G services. In combination with privileged containers and secure communication mechanisms, information interaction between cross-domain containers is carried out through hook functions and encryption and decryption systems, which effectively protects information security in cross-domain communications and improves the security and reliability of the network. By dynamically adjusting the mapping process, the embodiments of the present application can better cope with changes in network topology and resources, improve the stability and reliability of the system, and reduce network failures and resource waste. The embodiments of the present application take into account the needs of large-scale network environments, have good scalability, can support the deployment and expansion of large-scale cross-domain virtual networks, and adapt to the trend of future network development. BRIEF DESCRIPTION OF THE DRAWINGS
[0043] Figure 1 is a flow chart of a cross-domain virtual network mapping method according to an embodiment of the present application;
[0044] Figure 2 This is the startup process of the cross-domain container communication security model of the embodiment of the present application;
[0045] Figure 3 This is a data cyclic encryption / decryption flow chart of an embodiment of the present application;
[0046] Figure 4 This is a schematic diagram of the structure of a cross-domain virtual network mapping device according to an embodiment of the present application;
[0047] Figure 5 A schematic diagram of the computer device structure of an embodiment of the present application;
[0048] Figure 6 A schematic diagram of the structure of a storage medium according to an embodiment of the present application. DETAILED DESCRIPTION
[0049] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0050] The terms "first", "second", "third" in this application are only used for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Thus, the features defined as "first", "second", "third" can expressly or implicitly include at least one of the features. In the description of this application, the meaning of "multiple" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined. In the embodiments of this application, all directional indications (such as up, down, left, right, front, back...) are only used to explain the relative position relationship, movement, etc. between the components under a certain specific posture (as shown in the accompanying drawings). If the specific posture changes, the directional indication also changes accordingly. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions. For example, a process, method, system, product or computer device that includes a series of steps or units is not limited to the steps or units listed, but optionally also includes steps or units that are not listed, or optionally also includes other steps or units inherent to these processes, methods, products or computer devices.
[0051] Reference to "embodiments" herein means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.
[0052] In order to solve the deficiencies of the prior art, the cross-domain virtual network mapping method of the embodiment of the present application provides a mapping algorithm based on dynamic topology perception and resource attribute drive, by representing the underlying network as a weighted undirected graph, the weighted undirected graph contains physical nodes and physical links, and the physical nodes have different computing capabilities and resource attributes. The cross-domain virtual network is composed of virtual nodes and virtual links. The mapping algorithm first prioritizes and maps resources to virtual nodes, and maps virtual nodes to suitable physical nodes according to resource requirements and priorities; secondly, the k-shortest path algorithm is used to map virtual links to physical paths that meet the requirements, thereby optimizing the collaborative management of physical resources and improving the flexibility and adaptability of the network. In addition, in terms of communication security, by combining privileged containers and secure communication mechanisms, using hook functions and encryption and decryption systems for information interaction between cross-domain containers, not only the security of information interaction is enhanced, but also the overall performance and resource utilization efficiency of cross-domain communication are improved.
[0053] Specifically, see Figure 1 , is a flow chart of a cross-domain virtual network mapping method according to an embodiment of the present application. The cross-domain virtual network mapping method according to an embodiment of the present application comprises the following steps:
[0054] S100: representing the underlying cross-domain fusion network as a first weighted undirected graph including physical nodes and physical links;
[0055] In this step, the first weighted undirected graph Among them NS 为 Physical node set, including wireless access network node set Backbone Node Set and datacenter node set and L s is a set of physical links, including a set of wireless backhaul links and fiber link sets and and They are physical nodes n s (n s ∈N s ) and physical link l s (l s ∈L s ) has the following attributes, specifically, physical node n s The properties include radio node resource blocks Backbone network node computing resources and data center node computing resources The geographical location of the physical node is Loc(n s ), and the physical nodes have different computing capabilities and resource attributes.s The attributes include the bandwidth of the wireless backhaul link and spectrum resources of optical fiber links and The path of the underlying cross-domain fusion network is represented by P S , physical path l P (l P ∈P S ) consists of multiple physical links l S composition.
[0056] S110: representing the cross-domain virtual network as a second weighted undirected graph including virtual nodes and virtual links;
[0057] In this step, the second weighted undirected graph is represented as Where N V is a set of virtual nodes, L V is a virtual link set, and They are virtual nodes n V (n V ∈N V ) and virtual link l V (l V ∈I V Specifically, the resource requirements of the virtual node include the wireless resource block request RB (n V ), the computing resource requirements of the virtual backbone network switching nodes and virtual data center nodes CPU (n V ), the geographic location of the virtual node Loc(n V ) and the mappable range of the virtual node D(n V ), the resource requirement of the virtual link is the bandwidth resource requirement BW(l V ).
[0058] S120: Mapping the first weighted undirected graph and the second weighted undirected graph using a mapping algorithm based on dynamic topology perception and resource attribute drive, mapping the virtual nodes to suitable physical nodes, and using a k-shortest path algorithm to map the virtual links to physical links that meet the requirements;
[0059] In this step, by analyzing the centrality and resource attributes of the virtual network, different virtual nodes can be deployed on the same underlying node, but the same virtual node cannot be deployed on the same underlying node. The node's adjacent link resources will affect the node's attributes. Define the node's extended resource as the sum of its adjacent link bandwidth resources divided by the number of adjacent links, which is divided into the virtual node's extended resource demand E(n V ) and the extended resource surplus E(n s ):
[0060]
[0061] Where L(n) is the set of neighboring links of a node; l (n) is the number of neighboring links of the node.
[0062] The inverse of bandwidth resources is defined as the link unit resource cost. Physical links with more resources have a smaller unit resource cost coefficient:
[0063]
[0064] Wherein, η is the link resource cost adjustment coefficient, which is taken as 1 in the embodiment of the present application and can be set according to the actual application scenario.
[0065] In addition, the constraints need to be met:
[0066]
[0067] dis(Loc(n V ), Loc(n s ))≤D(n V ) (4)
[0068]
[0069] In the above formula, n V (u)↑n S (i) indicates virtual node n V (u) is mapped to physical node n s (i) up; l V (u,w)↑l s (i, j) represents virtual link l V (u, w) is mapped to physical link l S (i, j); dis() means calculating the distance between nodes.
[0070] Node centrality can reflect the importance of a node in a network. Specific evaluation indicators include degree centrality (DC), betweenness centrality (BC) and closeness centrality (CC). Degree centrality is defined as the number of adjacent edges to the node, which is used to characterize the local influence of the node. The larger the degree value, the more adjacent nodes a node can directly affect, and the more important it is. The disadvantage of the degree centrality indicator is that it only considers the most local information of the node, without analyzing the influence of the surrounding adjacent nodes. Betweenness centrality is defined as the ratio of the number of paths passing through the node in the shortest paths of all node pairs in the network to the total number of shortest paths. The calculation of betweenness centrality requires the global topological information of the network, which can reflect the load capacity of the node during network information transmission. Closeness centrality is used to describe the difficulty of node information transmission to other nodes. Nodes with higher closeness centrality are more likely to establish communication links with other nodes in the network, so data transmission delay can be reduced to a certain extent.
[0071] Based on the above analysis, define the second weighted undirected graph G V To the first weighted undirected graph G S The mapping is M:G V (N V , R V ) → G S (N S , C S ), virtual node n V Mapped to physical node n S The upper n V ↑n s , virtual link l V Mapping to physical link l s l V ↑l S , virtual link l V Map to physical path l P The upper is l V ↑l P In order to simplify the mapping complexity, the mapping algorithm based on dynamic topology perception and resource attribute drive in the embodiment of the present application adopts a two-stage mapping strategy. The specific mapping process includes:
[0072] S121: deploy virtual nodes, sort the virtual nodes in descending order of mapping priority, select the first virtual node in the queue, sort the backup physical node set of the virtual node in descending order of mapping priority, and select the bottom node with the largest mapping priority and meeting the resource requirements of the virtual node for deployment;
[0073] S122: After completing the deployment of all virtual nodes in the request, a physical path that meets the virtual link bandwidth requirement and has the minimum number of hops is selected using the k-shortest path algorithm to deploy the virtual link, taking the link bandwidth resource cost as a weight.
[0074] Based on the above, the embodiment of the present application adopts a cross-domain virtual network mapping algorithm based on dynamic topology perception and resource attributes, first prioritizes the virtual nodes and maps the resource matching, and then uses the k-shortest path algorithm to map the virtual links, which simplifies the mapping complexity, improves the mapping efficiency, optimizes the collaborative management of physical resources, reduces the network operation and maintenance costs, and improves the flexibility and adaptability of the network, realizes the seamless integration of the underlying network layers across domains, and can dynamically adjust the mapping process according to the actual resource conditions of the nodes and links, thereby improving the resource utilization efficiency and network performance, and can better support the diversified needs of 5G services.
[0075] 130: After completing the cross-domain virtual network mapping, combine the privileged container and secure communication mechanism, use the hook function and encryption and decryption system to perform information interaction between cross-domain containers;
[0076] In this step, for two different physical hosts, after the client container issues an instruction or message, it first passes through the front-end driver of the local machine and is prepared to be transmitted to the back-end driver of the privileged container through a general interface. During the transmission process, the monitoring program of the container is started to detect and filter the data packet to ensure information security. After detection, the data packet is transmitted to the back-end driver of the privileged container and finally transmitted to the network card on the physical host. In order to improve the response speed and reduce the container operation load, the security mode is placed on the privileged container. When the containers of two different physical hosts interact with each other, the encryption / decryption system is started at the same time. The container transmits the encrypted information to the privileged container with the security mode through the front-end and back-end drivers in turn. After the privileged container receives the information, the security model calls the hook function to quickly retrieve the table data in the inter-domain shared storage system, and performs corresponding actions according to the judgment result, specifically: if the judgment result is "no", the encrypted information is transmitted to the physical host through the communication loop, and then transmitted to another physical host through the network card and the external network. After virtualization processing, the encrypted information enters the privileged container, the inter-domain shared storage system performs the decryption operation, and then finally transmits it to another container through the back-end and front-end drivers. By combining privileged containers and secure communication mechanisms, hook functions and encryption and decryption systems are used to ensure the security of cross-domain communications between containers, effectively addressing the challenges of data transmission security between different physical hosts.
[0077] Furthermore, if Figure 2As shown, this is the startup process of the cross-domain container communication security model of the embodiment of the present application. The startup process utilizes the function of the inter-domain shared storage system to monitor the running information on the physical host in real time and comprehensively. Among them, the main function of the inter-domain shared storage system is to serve as a bridge between the application software and the underlying hardware, ensuring that the underlying hardware can take corresponding actions according to the instructions issued by the application software. The privileged container marks the physical host sending the information as A by identifying the source of the information, and determines the target physical host B of the information according to the control instruction. It is then determined whether A and B are the same physical host. If so, it means that the information interaction is completed inside the physical host, and only the antivirus software or security system on the physical host needs to be enabled to ensure the communication security; otherwise, it means that the information interaction is completed between two different physical hosts, so it is necessary to start the secure communication model to ensure the communication security of the cross-domain container. The secure communication model of the embodiment of the present application mainly has the following two functions: first, verify whether the sending system and the receiving system of the information are located on the same physical host; second, if the two containers that send and receive the information are located on the same physical host, call the hook function inside the system to extract the information features and encrypt them for protection, and then use the front-end driver and the back-end driver to complete the information transmission; if the two containers that send and receive the information are located on two different physical hosts, call the hook function inside the system to extract the information features and encrypt them for protection, and then use the network card or external communication device to transmit the encrypted information to the container on the other physical host.
[0078] Furthermore, the normal operation and functional implementation of the secure communication model requires the use of the container kernel firewall framework. After the secure communication model is started, it is first initialized and set up through an initialization program. The initialization program is also used to identify the source of all input data packets and the destination of all output data packets. The identification is based on the IP address. Whether the IP addresses are consistent is ultimately used to determine whether the two containers are deployed on the same physical host.
[0079] Furthermore, after the non-privileged virtualized operating system sends the information to the front-end driver, it will add the information to the encryption / decryption processing request queue function for encryption processing. The cyclic encryption process is as follows: Figure 3As shown, the specific encryption process includes: extracting characteristic data in the front-end driver through the security communication model, executing the judgment condition "whether all data in the encryption / decryption processing request queue function are encrypted", and verifying all data one by one; after completing the first verification, executing corresponding actions according to the verification result, specifically: if the result is "yes", the cyclic encryption process ends; if the result is "no", re-encrypt all data in the encryption / decryption processing request queue function for a second time, and perform a second verification after the processing is completed, and repeat the above steps according to the verification result until all data in the encryption / decryption processing request queue function are encrypted, then jump out of the loop condition and complete the entire cyclic encryption process.
[0080] Based on the above, the cross-domain virtual network mapping method of the embodiment of the present application adopts a two-stage mapping strategy through a mapping algorithm driven by dynamic topology perception and resource attributes, first prioritizes and maps virtual nodes, and then maps virtual links using the k-shortest path algorithm, thereby achieving seamless integration between the layers of the cross-domain underlying network, simplifying the complexity of the mapping process, improving mapping efficiency, optimizing the collaborative management of physical resources, reducing network operation and maintenance costs, improving resource utilization efficiency and network performance, and better supporting the diversified needs of 5G services. In combination with privileged containers and secure communication mechanisms, information interaction between cross-domain containers is carried out through hook functions and encryption and decryption systems, effectively protecting information security in cross-domain communications and improving network security and reliability. By dynamically adjusting the mapping process, the embodiment of the present application can better cope with changes in network topology and resources, improve the stability and reliability of the system, and reduce network failures and resource waste. The embodiment of the present application takes into account the needs of large-scale network environments, has good scalability, can support the deployment and expansion of large-scale cross-domain virtual networks, and adapt to the trend of future network development.
[0081] See also Figure 4 , is a schematic diagram of the structure of a cross-domain virtual network mapping device according to an embodiment of the present application. The cross-domain virtual network mapping device 40 according to an embodiment of the present application includes:
[0082] The first network representation module 41 is used to represent the underlying cross-domain fusion network as a first weighted undirected graph including physical nodes and physical links;
[0083] The second network representation module 42 is used to represent the cross-domain virtual network as a second weighted undirected graph including virtual nodes and virtual links;
[0084] Network mapping module 43: used to map the first weighted undirected graph and the second weighted undirected graph using a mapping algorithm based on dynamic topology perception and resource attribute drive, map the virtual nodes to suitable physical nodes, and use the k-shortest path algorithm to map the virtual links to physical links that meet the requirements.
[0085] It should be noted that the information interaction, execution process, etc. between the above-mentioned devices / units are based on the same concept as the method embodiment of the present application. Their specific functions and technical effects can be found in the method embodiment part and will not be repeated here.
[0086] The device provided in the embodiment of the present application can be applied in the aforementioned method embodiment. For details, please refer to the description of the aforementioned method embodiment, which will not be repeated here.
[0087] See also Figure 5 , is a schematic diagram of the computer device structure of an embodiment of the present application. The computer device 50 includes:
[0088] A memory 51 storing executable program instructions;
[0089] A processor 52 connected to the memory 51;
[0090] The processor 52 is used to call the executable program instructions stored in the memory 51 and perform the following steps: represent the underlying cross-domain fusion network as a first weighted undirected graph including physical nodes and physical links; represent the cross-domain virtual network as a second weighted undirected graph including virtual nodes and virtual links; use a mapping algorithm based on dynamic topology perception and resource attribute drive to map the first weighted undirected graph and the second weighted undirected graph, map the virtual nodes to suitable physical nodes, and use the k-shortest path algorithm to map the virtual links to physical links that meet the requirements.
[0091] The processor 52 may also be referred to as a CPU (Central Processing Unit). The processor 52 may be an integrated circuit chip having signal processing capabilities. The processor 52 may also be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.
[0092] See also Figure 6, is a schematic diagram of the structure of the storage medium of the embodiment of the present application. The storage medium of the embodiment of the present application stores a program instruction 61 that can implement the following steps: the underlying cross-domain fusion network is represented as a first weighted undirected graph containing physical nodes and physical links; the cross-domain virtual network is represented as a second weighted undirected graph containing virtual nodes and virtual links; the first weighted undirected graph and the second weighted undirected graph are mapped using a mapping algorithm based on dynamic topology perception and resource attribute drive, the virtual nodes are mapped to suitable physical nodes, and the k-shortest path algorithm is used to map the virtual links to physical links that meet the requirements. Among them, the program instruction 61 can be stored in the above-mentioned storage medium in the form of a software product, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network computer device, etc.) or a processor (processor) to perform all or part of the steps of each implementation method of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk and other media that can store program instructions, or terminal computer devices such as computers, servers, mobile phones, tablets, etc. Among them, the server can be an independent server, or it can be a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (CDN), and big data and artificial intelligence platforms.
[0093] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the system embodiments described above are only schematic. For example, the division of units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.
[0094] In addition, each functional unit in each embodiment of the present application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The above integrated unit can be implemented in the form of hardware or in the form of software functional units. The above is only an implementation method of the present application, and does not limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made by using the description and drawings of this application, or directly or indirectly used in other related technical fields, is also included in the patent protection scope of the present application.
Claims
1. A cross-domain virtual network mapping method, characterized in that: include: Representing the underlying cross-domain fusion network as a first weighted undirected graph including physical nodes and physical links; Representing the cross-domain virtual network as a second weighted undirected graph including virtual nodes and virtual links; A mapping algorithm based on dynamic topology perception and resource attribute drive is used to map the first weighted undirected graph and the second weighted undirected graph, the virtual nodes are mapped to suitable physical nodes, and a k-shortest path algorithm is used to map the virtual links to physical links that meet the requirements.
2. The cross-domain virtual network mapping method according to claim 1, characterized in that: The underlying cross-domain fusion network is represented as a first weighted undirected graph including physical nodes and physical links, specifically: The first weighted undirected graph is expressed as Where N S is the set of physical nodes, L s is the physical link set, and They are physical nodes n s (n s ∈N s ) and physical link l s (l s ∈L s ) has the attribute that the physical node n s The properties include radio node resource blocks Backbone network node computing resources and data center node computing resources The geographical location of the physical node is Loc(n s ), and the physical nodes have different computing capabilities and resource attributes; the physical link l s The attributes include the bandwidth of the wireless backhaul link and spectrum resources of optical fiber links and The path of the underlying cross-domain fusion network is represented by P S , physical path l P (l P ∈P S ) consists of multiple physical links l S composition.
3. The cross-domain virtual network mapping method according to claim 2, characterized in that: The cross-domain virtual network is represented as a second weighted undirected graph including virtual nodes and virtual links, specifically: The second weighted undirected graph is expressed as Where N V is a set of virtual nodes, L V is a virtual link set, and They are virtual nodes n V (n V ∈N V ) and virtual link l V (l V ∈L V ), the resource requirements of the virtual node include the wireless resource block request RB (n V ), the computing resource requirements of the virtual backbone network switching nodes and virtual data center nodes CPU (n V ), the geographic location of the virtual node Loc(n V ) and the mappable range of the virtual node D(n V ), the resource requirement of the virtual link is the bandwidth resource requirement BW(l V ).
4. The cross-domain virtual network mapping method according to claim 3, characterized in that: The mapping algorithm based on dynamic topology perception and resource attribute drive is used to map the first weighted undirected graph and the second weighted undirected graph, the virtual nodes are mapped to suitable physical nodes, and the k-shortest path algorithm is used to map the virtual links to the physical links that meet the requirements, specifically: The node expansion resource is defined as the sum of the bandwidth resources of its adjacent links divided by the number of adjacent links, which is divided into the expansion resource demand of the virtual node E(n V ) and the extended resource surplus E(n s ): Where L(n) is the set of neighboring links of a node; l (n) is the number of neighboring links of the node; The inverse of bandwidth resources is defined as the unit resource cost of the link. The unit resource cost coefficient of a physical link with more resources is small: Where η is the link resource cost adjustment coefficient; The constraints are: dis(Loc(n V ),Loc(n s ))≤D(n V ) In the above formula, n V (u)↑n S (i) represents virtual node n V (u) is mapped to physical node n s (i) up; l V (u,w)↑l S (i, j) represents virtual link l V (u, w) is mapped to physical link l s (i, j); dis() means calculating the distance between nodes.
5. The cross-domain virtual network mapping method according to claim 4, characterized in that: The method uses a mapping algorithm based on dynamic topology perception and resource attribute drive to map the first weighted undirected graph and the second weighted undirected graph, maps the virtual nodes to suitable physical nodes, and uses a k-shortest path algorithm to map the virtual links to physical links that meet the requirements, including: Define the second weighted undirected graph G V To the first weighted undirected graph G S The mapping is M:G V (N V , R V ) → G S (N S , D S ), virtual node n V Mapped to physical node n S The upper n V ↑n S , virtual link l V Mapping to physical link l s The upper is l V ↑l s , virtual link l V Map to physical path l P The upper is l V ↑l P The mapping algorithm based on dynamic topology perception and resource attribute drive adopts a two-stage mapping strategy. The specific mapping process includes: Deploy virtual nodes, sort the virtual nodes in descending order of mapping priority, select the first virtual node in the queue, sort the backup physical node set of the virtual node in descending order of mapping priority, and select the underlying node with the largest mapping priority and meeting the resource requirements of the virtual node for deployment; After completing the deployment of all virtual nodes in the request, the k-shortest path algorithm is used to select a physical path that meets the virtual link bandwidth requirements and has the minimum number of hops to deploy the virtual link, taking the link bandwidth resource cost as the weight.
6. The cross-domain virtual network mapping method according to any one of claims 1 to 5, characterized in that: The method further includes: mapping the first weighted undirected graph and the second weighted undirected graph by using a mapping algorithm based on dynamic topology perception and resource attribute drive, mapping the virtual nodes to suitable physical nodes, and mapping the virtual links to physical links that meet the requirements by using a k-shortest path algorithm. After completing the cross-domain virtual network mapping, privileged containers and secure communication mechanisms are combined, and hook functions and encryption and decryption systems are used to interact with information between cross-domain containers.
7. The cross-domain virtual network mapping method according to claim 6, characterized in that: The privileged container and the secure communication mechanism are combined to use the hook function and the encryption and decryption system to perform information interaction between cross-domain containers, specifically: The privileged container marks the physical host sending the information as A by identifying the source of the information, and determines the target physical host B of the information according to the control instruction; determines whether A and B are the same physical host, and if so, enables the anti-virus software or security system on the physical host to ensure communication security; otherwise, starts the security communication model, and verifies through the security communication model whether the sending system and the sending system of the information are located on the same physical host, and if so, calls the hook function inside the system to extract the information features and encrypts them for protection, and then completes the information transmission with the help of the front-end driver and the back-end driver; otherwise, calls the hook function inside the system to extract the information features and encrypts them for protection, and then uses the network card or external communication device to transmit the encrypted information to the container on another physical host.
8. A cross-domain virtual network mapping device, characterized in that: include: The first network representation module is used to represent the underlying cross-domain fusion network as a first weighted undirected graph including physical nodes and physical links; A second network representation module: used for representing the cross-domain virtual network as a second weighted undirected graph including virtual nodes and virtual links; Network mapping module: used to map the first weighted undirected graph and the second weighted undirected graph using a mapping algorithm based on dynamic topology perception and resource attribute drive, map the virtual nodes to suitable physical nodes, and use the k-shortest path algorithm to map the virtual links to physical links that meet the requirements.
9. A computer device, characterized in that: The computer device includes a processor and a memory coupled to the processor, wherein: The memory stores program instructions for implementing the cross-domain virtual network mapping method according to any one of claims 1 to 7; The processor is used to execute the program instructions stored in the memory to control the cross-domain virtual network mapping method.
10. A storage medium, characterized in that: Program instructions executable by a processor are stored, and the program instructions are used to execute the cross-domain virtual network mapping method described in any one of claims 1 to 7.
