Network mapping method, device and equipment and readable storage medium

Abstract

The invention provides a network mapping method, device and equipment and a readable storage medium, and relates to the technical field of computers. The method comprises the following steps: constructing a network topological graph; for each node in the network topological graph, selecting at least one mappable entity device conforming to the node attribute of the corresponding node; according to the number of the at least one mappable entity device of each node, arranging each node in an ascending order to obtain a target sequence; and starting from the head position of the target sequence, taking each node as a target object in sequence, selecting a target mapping entity device from at least one mapping entity device of the target object to complete mapping of the target object, and performing mapping of a link associated with the target object, resources which are not mapped and conform to the node attributes of the target object exist in the target mappable entity equipment. According to the invention, the technical problem that node mapping and link mapping are not coordinated in a network mapping method provided in the related technology is solved.

Description

Technical Field

[0001] The present disclosure relates to the field of computer technology, and in particular to a network mapping method, device, equipment and readable storage medium. Background Art

[0002] At present, to realize Virtual Network Embedding (VNE), a greedy heuristic algorithm can be used to convert the virtual network mapping problem into a two-stage solution, that is, first complete the node mapping, and then perform link mapping. However, there may be the following problems: if the link mapping is unsuccessful, all node mappings need to be overturned, which will waste a lot of time when the network topology is large. Therefore, how to solve the coordination problem between node mapping and link mapping is a problem that technicians in this field need to solve.

[0003] To address the above problems, no effective solution has been proposed yet. Summary of the invention

[0004] The embodiments of the present disclosure provide a network mapping method, apparatus, device and readable storage medium to at least solve the technical problem of inconsistency between node mapping and link mapping in the network mapping method provided in the related art.

[0005] According to one embodiment of the present disclosure, a network mapping method is provided, including: constructing a network topology diagram; for each node in the network topology diagram, selecting at least one mappable entity device that meets the node attributes of the corresponding node; arranging each node in ascending order according to the number of at least one mappable entity device of each node to obtain a target sequence; starting from the first position of the target sequence, taking each node as a target object in turn, selecting a target mappable entity device from at least one mappable entity device of the target object to complete the mapping of the target object, and mapping the links associated with the target object, wherein there are resources in the target mappable entity device that have not been mapped and meet the node attributes of the target object.

[0006] Optionally, constructing a network topology diagram includes: obtaining network requirements; the network requirements include: network nodes to be simulated and their node attributes, and link parameters between different network nodes; and constructing a network topology diagram according to the network requirements.

[0007] Optionally, constructing a network topology map according to network requirements includes: searching a historical topology template for a historical topology map that meets the network requirements; and using the historical topology map as the network topology map.

[0008] Optionally, a network topology map is constructed according to network requirements, including: determining the topological features of each historical topology map in the historical topology template; calculating the similarity between each topological feature and the network requirements; selecting a target topological feature whose similarity is higher than a target value; and modifying the historical topology map corresponding to the target topological feature to obtain a network topology map.

[0009] Optionally, the similarity between each topological feature and the network demand is calculated, including: dividing the network demand according to domains or levels to obtain multiple sub-demands; calculating the similarity between each sub-demand and each topological feature; accordingly, modifying the historical topological map corresponding to the target topological feature to obtain a network topological map, including: modifying the corresponding historical topological map according to the sub-demand corresponding to the target topological feature; connecting the modified historical topological map according to the connection relationship between different domains or the connection relationship between different levels to obtain a network topological map.

[0010] Optionally, among at least one mappable physical device of the target object, a target mappable physical device is selected to complete the mapping of the target object, including: constructing the target object, the number of at least one mappable physical device of the target object, and device identification information of at least one mappable physical device of the target object into a triple; and using the triple to select the target mappable physical device to complete the mapping of the target object.

[0011] Optionally, mapping the link associated with the target object includes: determining a mapped target node among neighboring nodes of the target object; and mapping the link between the target object and the target node.

[0012] Optionally, it also includes: if the target mappable entity device does not exist, deleting the mapping of the previous mapped node and the mapping of the associated links, and taking the previous mapped node as the target object, executing the steps of selecting the target mappable entity device from at least one mappable entity device of the target object to complete the mapping of the target object, and mapping the links associated with the target object, so as to re-map the previous mapped node and the mapping of the associated links.

[0013] According to one embodiment of the present disclosure, a network mapping device is also provided, including: a construction module, used to construct a network topology map; a selection module, used to select at least one mappable entity device that meets the node attributes of the corresponding node for each node in the network topology map; a sorting module, used to arrange each node in ascending order according to the number of at least one mappable entity device of each node to obtain a target sequence; a mapping module, used to start from the first position of the target sequence, take each node as a target object in turn, select a target mappable entity device from at least one mappable entity device of the target object to complete the mapping of the target object, and map the links associated with the target object, wherein there are resources in the target mappable entity device that have not been mapped and meet the node attributes of the target object.

[0014] Optionally, the construction module is also used to: obtain network requirements; the network requirements include: network nodes to be simulated and their node attributes, and link parameters between different network nodes; and construct a network topology diagram according to the network requirements.

[0015] Optionally, the construction module is further used to: query the historical topology template for a historical topology map that meets the network requirements; and use the historical topology map as the network topology map.

[0016] Optionally, the construction module is also used to: determine the topological features of each historical topological map in the historical topological template; calculate the similarity between each topological feature and the network requirements; select the target topological feature whose similarity is higher than the target value; modify the historical topological map corresponding to the target topological feature to obtain the network topological map.

[0017] Optionally, the construction module is also used to: divide the network requirements according to domains or levels to obtain multiple sub-requirements; calculate the similarity between each sub-requirement and each topological feature; modify the corresponding historical topological map according to the sub-requirements corresponding to the target topological features; connect the modified historical topological map according to the connection relationship between different domains or the connection relationship between different levels to obtain a network topological map.

[0018] Optionally, the mapping module is further used to: construct a triple of target object, the number of at least one mappable physical device of the target object, and device identification information of at least one mappable physical device of the target object; and use the triple to select the target mappable physical device to complete the mapping of the target object.

[0019] Optionally, the mapping module is further used to: determine a mapped target node among neighboring nodes of the target object; and map a link between the target object and the target node.

[0020] Optionally, it also includes a backtracking module, which is used to delete the mapping of the previous mapped node and the mapping of the associated links if the target mappable entity device does not exist, and take the previous mapped node as the target object, execute the steps of selecting the target mappable entity device from at least one mappable entity device of the target object to complete the mapping of the target object, and mapping the links associated with the target object, so as to re-map the previous mapped node and the mapping of the associated links.

[0021] According to one embodiment of the present disclosure, an electronic device is also provided, including: a memory for storing a computer program; a processor for executing the computer program, wherein the above-mentioned network mapping method is executed when the program is running.

[0022] According to one embodiment of the present disclosure, a readable storage medium is further provided for storing a computer program, wherein the computer program implements the above-mentioned network mapping method when executed by a processor.

[0023] In the disclosed embodiment, a network topology diagram is constructed, and then for each node in the network topology diagram, at least one mappable physical device that meets the node attributes of the corresponding node is selected, and each node is arranged in ascending order according to the number of at least one mappable physical device of each node to obtain a target sequence, and then starting from the first position of the target sequence, each node is taken as a target object in turn, and finally, from at least one mappable physical device of the target object, a target mappable physical device is selected to complete the mapping of the target object, and the mapping of the link associated with the target object is performed. There are resources in the target mappable physical device that have not been mapped and meet the node attributes of the target object, so that the purpose of not overturning the mapping of all nodes when the link mapping is unsuccessful is achieved, thereby achieving the technical effect of improving the efficiency of virtual network mapping, and then solving the technical problem of incoordination between node mapping and link mapping in the network mapping method provided in the related art. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The drawings described herein are used to provide a further understanding of the present disclosure and constitute a part of the present disclosure. The illustrative embodiments of the present disclosure and their descriptions are used to explain the present disclosure and do not constitute an improper limitation on the present disclosure. In the drawings:

[0025] Figure 1 is a flow chart of a network mapping method according to one embodiment of the present disclosure;

[0026] Figure 2 is a schematic diagram of another network mapping method according to one embodiment of the present disclosure;

[0027] Figure 3 is a schematic diagram of a network mapping result according to one embodiment of the present disclosure;

[0028] Figure 4 It is a structural block diagram of a network mapping device according to one embodiment of the present disclosure. DETAILED DESCRIPTION

[0029] In order to enable those skilled in the art to better understand the scheme of the present disclosure, the technical scheme in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in the field without creative work should fall within the scope of protection of the present disclosure.

[0030] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product, or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products, or devices.

[0031] At present, to realize Virtual Network Embedding (VNE), a greedy heuristic algorithm can be used to convert the virtual network mapping problem into a two-stage solution, that is, first complete the node mapping, and then perform link mapping. However, there may be the following problems: if the link mapping is unsuccessful, all node mappings need to be overturned, which will waste a lot of time when the network topology is large. To this end, the present disclosure provides a network mapping solution that can simultaneously complete the node mapping and related link mapping of a node, which solves the technical problem of the incoordination between node mapping and link mapping to a certain extent.

[0032] According to an embodiment of the present disclosure, a method embodiment of a network mapping method is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0033] Figure 1 is a flow chart of a network mapping method according to one embodiment of the present disclosure, such as Figure 1 As shown, the method comprises the following steps:

[0034] Step S101, constructing a network topology map;

[0035] Step S102, for each node in the network topology diagram, selecting at least one mappable entity device that meets the node attributes of the corresponding node;

[0036] Step S103, arranging each node in ascending order according to the number of at least one mappable physical device of each node to obtain a target sequence;

[0037] Step S104, starting from the first position of the target sequence, each node is taken as the target object in turn, and a target mappable physical device is selected from at least one mappable physical device of the target object to complete the mapping of the target object, and the mapping of the links associated with the target object is performed. There are resources in the target mappable physical device that have not been mapped and meet the node attributes of the target object.

[0038] The network topology diagram is a graph consisting of a series of nodes and links between nodes, which is used to describe the structure of the virtual network and the connection relationship between nodes. In the network topology diagram, each node represents a network device in the virtual network, such as a router, switch, server, etc., and the link represents the connection between these devices, such as a physical or virtual network connection.

[0039] The above node attributes include but are not limited to: node type (switch or routing device, etc.), label (indicating the type of service that the device can provide), keyword (device ID, service purpose, location in the network, etc.), name, brand, model, serial port, interface (management port, switch port, etc.). If the node is a virtual device, the node attributes may further include: description, firmware, computing solution, application scenario, scenario description, operating system, system user name, password, IP type, IP address, mask and gateway, service information, dependent services, software information, source code information, password information, built-in Flag information and virtualization type, etc. At the same time, virtual devices also support uploading of scene attachments and vulnerability exploit files, and the file formats support doc, docx, pdf, mp4, flv, jpg, png, jpeg, gif, etc.

[0040] The above-mentioned mappable physical devices refer to actual devices in the physical environment that can meet the attributes and functional requirements of the nodes in the virtual network topology diagram. Mappable physical devices include but are not limited to servers, routers, switches, virtual machines, or other hardware or software resources that can provide the required network functions.

[0041] Exemplarily, a network topology diagram consisting of four nodes A, B, C and D is constructed, wherein there are direct connections between nodes A and B, between B and C, between C and D, and between D and A. These four nodes form a closed-loop network structure. Assume that node A requires high-performance computing capabilities, node B requires a large amount of storage space, node C requires a fast network interface, and node D requires high security. According to the above node requirements, a high-performance server is selected as a mappable physical device of node A, a storage server with a large-capacity hard disk is selected as a mappable physical device of node B, a router with a high-speed network interface is selected as a mappable physical device of node C, and a security firewall is selected as a mappable physical device of node D. Assume that the above high-performance server has two optional devices in the physical network, the above storage server has three optional devices in the physical network, the above router has four optional devices in the physical network, and the above security firewall has only one optional device in the physical network. According to the number of mappable physical devices of each node, the nodes are arranged in ascending order to obtain the target sequence. Since node D has only one optional device, and nodes A, B, and C have 2, 3, and 4 optional devices respectively, the target sequence is D, A, B, C. Finally, starting from the first position of the target sequence, map each node as the target object in turn. First, map node D to the selected security firewall, then map node A to the high-performance server, and map the link between node A and node D at the same time. Next, map node B to the storage server, and map the link between node B and node A at the same time. Finally, map node C to the router, and map the link between node C and node B, as well as the link between node C and node D. Each time you map a node and a link, make sure to select a resource from the optional physical devices that has not been mapped and meets the node attributes of the target object. For example, select a currently unmapped device from two high-performance servers to map node A to the high-performance server.

[0042] Based on the above optional embodiments, by constructing a network topology map, and then for each node in the network topology map, at least one mappable physical device that meets the node attributes of the corresponding node is selected, and each node is arranged in ascending order according to the number of at least one mappable physical device of each node to obtain a target sequence, and then starting from the first position of the target sequence, each node is taken as the target object in turn, and finally, from at least one mappable physical device of the target object, a target mappable physical device is selected to complete the mapping of the target object, and the mapping of the link associated with the target object is performed. There are resources in the target mappable physical device that have not been mapped and meet the node attributes of the target object, so that the purpose of not overturning the mapping of all nodes when the link mapping is unsuccessful is achieved, thereby achieving the technical effect of improving the efficiency of virtual network mapping, and then solving the technical problem of incoordination between node mapping and link mapping in the network mapping method provided in the related art.

[0043] The network mapping method in the embodiment of the present disclosure is further introduced below.

[0044] Optionally, step S101, constructing a network topology map, includes: obtaining network requirements, the network requirements including network nodes to be simulated and their node attributes, and link parameters between different network nodes; and constructing a network topology map according to the network requirements.

[0045] The above network requirements refer to the specific requirements of users or systems for virtual networks, including network nodes to be simulated and their node attributes, as well as link parameters between different network nodes. Among them, the network nodes to be simulated and their node attributes refer to the various device nodes that need to be simulated in the virtual network, such as switches, routers, servers, etc., as well as the technical parameters and characteristics of these devices, such as CPU model, memory size, storage capacity, operating system version, network interface type, etc. The link parameters between different network nodes refer to the link characteristics of the connection between each device node in the virtual network, such as bandwidth, delay, jitter and other network performance indicators.

[0046] Specifically, in the process of constructing a network topology diagram, we first obtain the network nodes to be simulated and their node attributes, as well as the link parameters between different network nodes, to determine their network requirements, and then create corresponding nodes in the virtual environment based on the determined network requirements, and establish connection relationships between the nodes based on the link parameters, and finally form a network topology diagram.

[0047] Based on the above optional embodiments, by obtaining network requirements and constructing a network topology map according to the network requirements, the node and link coordination problem in the network map can be better handled while reducing resource waste.

[0048] Optionally, constructing a network topology map according to network requirements includes: searching a historical topology template for a historical topology map that meets the network requirements; and using the historical topology map as the network topology map.

[0049] The above historical topology template refers to a collection of a series of pre-stored network topology diagrams, including but not limited to records of real network topologies used in past projects, or theoretical network topology models designed according to different network characteristics and requirements. Each historical topology diagram in the historical topology template has a specific network structure and parameters, such as the number of nodes, node attributes, link connection methods, and link parameters.

[0050] For example, when there are new network requirements, you can search in the historical topology template to see if there is a topology map that matches the current requirements. If a matching topology map is found, the historical topology map can be directly used as the network topology map, thereby saving time and resources in rebuilding the network topology map. At the same time, when processing similar or repeated network mapping requests, it can improve the efficiency and flexibility of network mapping.

[0051] Based on the above optional embodiments, searching for historical topology maps that meet network requirements in historical topology templates and using the historical topology maps as network topology maps can significantly reduce the time for building new topology maps and avoid the complex process of building network topology maps from scratch. At the same time, historical topology maps usually have been resource matched and optimized, and direct use can ensure the reasonable allocation and utilization of resources, avoid waste and over-configuration of resources, and help improve overall system performance and resource utilization.

[0052] Optionally, a network topology map is constructed according to network requirements, including: determining the topological features of each historical topology map in the historical topology template; calculating the similarity between each topological feature and the network requirements; selecting a target topological feature whose similarity is higher than a target value; and modifying the historical topology map corresponding to the target topological feature to obtain a network topology map.

[0053] The topological features of the above historical topological map refer to the structural attributes and parameters of the historical topological map, including but not limited to the number and type of nodes, the connection mode between nodes (topological structure, such as star, ring, bus, etc.), the bandwidth, delay, jitter and other attributes of the link, and the specific device type and configuration information that may be included. By comparing the topological features with the network requirements proposed by the user, the similarity between the historical topological map and the required network can be evaluated, so as to select the most appropriate template for modification or direct use to meet the new network requirements, thereby helping to improve the efficiency and accuracy of network topology construction.

[0054] Exemplarily, the topological features of the historical topological graph, such as node type, node number, and link parameters, are first determined. Second, the cosine similarity is used to quantify the degree of matching between the two topological graphs in terms of node type, number, and link parameters. Assuming the target value is 0.75, the similarity between each topological feature in the historical topological graph A and the network requirement is 0.7, the similarity between each topological feature in the historical topological graph B and the network requirement is 0.8, and the similarity between each topological feature in the historical topological graph C and the network requirement is 0.5. The topological features in the historical topological graph B with a similarity higher than the target value are selected as the target topological features, and the number of nodes is adjusted according to the network requirement, the link parameters are modified, and the connection relationship between the nodes is reconfigured to modify the historical topological graph B.

[0055] Based on the above optional embodiments, by determining the topological features of each historical topological map in the historical topological template, and calculating the similarity between each topological feature and the network requirements, and then selecting the target topological feature with a similarity higher than the target value, and finally modifying the historical topological map corresponding to the target topological feature, a network topological map is obtained. This ensures that the final network topological map fully meets the specific needs of the user, while making full use of the existing template resources, thereby improving the efficiency of building the network topological map.

[0056] Optionally, calculating the similarity between each topological feature and the network requirement includes: dividing the network requirement according to domains or levels to obtain multiple sub-requirements; calculating the similarity between each sub-requirement and each topological feature;

[0057] For example, a large network may include different functional domains, such as security domain, data domain, control domain, etc., or include network structures of different levels, such as access layer, aggregation layer, core layer, etc. When looking for a match between the historical topology map and the current network demand, a similarity calculation is performed for each sub-demand and the topological features of the historical topology map. If it is found that the similarity between the topological features of a historical topology map and a sub-demand is higher than the target value, then the historical topology map is selected as the target topological feature related to the sub-demand, and then the necessary modifications are made to the historical topology map to make it more in line with the specific requirements of the sub-demand.

[0058] Based on the above optional embodiments, the network requirements are divided according to domains or levels to obtain multiple sub-requirements, and the similarity between each sub-requirement and each topological feature is calculated, so that the similarity between the network requirements and the historical topological map can be analyzed and matched more carefully. When the network requirements change, the method of dividing according to domains or levels can easily add new sub-requirements or adjust the priorities of existing sub-requirements without completely redesigning and mapping the network, thereby enhancing the scalability and adaptability of the network mapping solution.

[0059] Optionally, modify the historical topology map corresponding to the target topology feature to obtain a network topology map, including: modifying the corresponding historical topology map according to the sub-requirements corresponding to the target topology feature; connecting the modified historical topology map according to the connection relationship between different domains or the connection relationship between different levels to obtain a network topology map.

[0060] Exemplarily, first, according to the sub-demands corresponding to the target topology features, the relevant parts of the historical topology map are modified to ensure that the historical topology map can meet these sub-demands. For example, if the sub-demands involve a specific type of network node or link parameter, the corresponding node attributes or link information in the historical topology map need to be adjusted to meet the new network requirements. Secondly, considering that the network requirements may involve multiple domains or levels, when modifying the historical topology map, it is necessary to make targeted adjustments to each domain or level respectively to ensure that each sub-topology can independently meet the corresponding sub-requirements. After completing the modification of the historical topology maps of each domain or level, these modified sub-topologies are connected according to the connection relationship between different domains or levels. The final network topology map can not only meet all sub-requirements, but also maintain the correct connection between each domain or level, thereby constructing a complete network topology structure that can effectively reflect network requirements.

[0061] Based on the above optional embodiments, the corresponding historical topology map is modified according to the sub-demands corresponding to the target topology characteristics, and then the modified historical topology map is connected according to the connection relationship between different domains or the connection relationship between different levels to obtain a network topology map, which can effectively improve the efficiency of network construction and reduce resource waste.

[0062] Optionally, among at least one mappable physical device of the target object, a target mappable physical device is selected to complete the mapping of the target object, including: constructing the target object, the number of at least one mappable physical device of the target object, and device identification information of at least one mappable physical device of the target object into a triple; and using the triple to select the target mappable physical device to complete the mapping of the target object.

[0063] For example, if the target object is a virtual router, and the virtual router needs to be mapped to three physical routers in the physical network, the constructed triplet can be expressed as (virtual router ID, 3, [physical router ID] , physical router , physical router ).

[0064] Based on the above optional embodiments, by constructing the target object, the number of at least one mappable physical device of the target object and the device identification information of at least one mappable physical device of the target object into a triple, and then using the triple to select the target mappable physical device to complete the mapping of the target object, not only can the efficiency of virtual network mapping be improved, but also the orderliness and flexibility of the mapping process can be increased, and the resource waste and redundant calculation that may occur in the mapping process can be reduced.

[0065] Optionally, mapping the link associated with the target object includes: determining a mapped target node among neighboring nodes of the target object; and mapping the link between the target object and the target node.

[0066] The neighbor nodes mentioned above refer to the nodes that are directly connected to the target object in the network topology. In graph theory, if there is an edge, i.e., a link, between two nodes, then the two nodes are neighbors. Therefore, in the process of network mapping, the neighbor nodes of the target object are other nodes that are directly connected to it through links in the network topology.

[0067] Specifically, in the process of mapping the links associated with the target object, first check the connection relationship of the target object in the virtual network topology diagram and identify all directly connected neighbor nodes; secondly, traverse the above neighbor nodes, query the records and confirm which neighbor nodes have been mapped to the physical devices in the physical network, and use the above neighbor nodes as the target nodes; finally, map the links between the target object and the target node.

[0068] Based on the above optional embodiments, by determining the mapped target node among the neighboring nodes of the target object and then mapping the link between the target object and the target node, the coordination problem between node mapping and link mapping can be effectively solved, thereby improving the efficiency and flexibility of virtual network mapping.

[0069] Optionally, it also includes: if the target mappable entity device does not exist, deleting the mapping of the previous mapped node and the mapping of the associated links, and taking the previous mapped node as the target object, executing the steps of selecting the target mappable entity device from at least one mappable entity device of the target object to complete the mapping of the target object, and mapping the links associated with the target object, so as to re-map the previous mapped node and the mapping of the associated links.

[0070] Exemplarily, for the same node, the target mappable physical device of the remapping is different from the target mappable physical device of the previous mapping. If after remapping, the next node still cannot complete the mapping of the subsequent node, then fall back again and repeat the above steps. If the mapping of the subsequent node still cannot be completed after falling back to the first position node, then an error message is output to indicate that this mapping has failed.

[0071] Based on the above optional embodiment, by gradually backtracking and remapping, the possibility of successful mapping can be increased, thereby improving the efficiency and success rate of virtual network mapping, while avoiding the problem of wasting all previous node mappings due to a single link mapping failure in large network mapping.

[0072] Figure 2 is a schematic diagram of another network mapping method according to one embodiment of the present disclosure, such as Figure 2 As shown, the method comprises the following steps:

[0073] 1. Condensate and abstract the simulated network and determine the relevant parameters of the devices and links involved.

[0074] Condensing and abstracting the network to be simulated means selecting key devices in the network for simulation. Non-key devices may not participate in the simulation, and key devices may be specified by the user. Key devices can be physical devices or virtual services, and their attribute parameters include but are not limited to: type, name, brand, model, serial port, management port, CPU, memory model, operating system, database, firmware, etc., and the bandwidth, delay and jitter requirements of the link are clarified. Condensing and abstracting the network scenario can determine the network topology and key nodes of the test scenario, and then describe the classification, labeling, keywords and uses of the user test scenario.

[0075] Search the current resource pool (physical devices and virtual services in the physical environment) to see if there are devices that meet the above requirements. The devices can be virtual devices or physical devices. If there are no devices that meet the above requirements in the resource pool, add the corresponding physical devices or virtual devices to the resource pool. Virtual devices support technologies such as KVM, Docker, and VMware. Physical devices are added by importing the following information into the resource pool, including but not limited to name, type, brand, model, serial port, interface (management port, switch, switch port), etc. Virtual devices are added by importing the following information into the resource pool, including but not limited to name, type, classification, description, firmware, computing solution, application scenario, scenario description, operating system, system user name, password, IP type, IP address, mask and gateway, service information, dependent services, software information, source code information, password information, built-in Flag information, and virtualization type. At the same time, virtual devices also support uploading of scene attachments and vulnerability exploit files. The file formats supported are doc, docx, pdf, mp4, flv, jpg, png, jpeg, gif, etc.

[0076] 2. Build a virtual topology map of the scene.

[0077] Search the existing scene templates (i.e. historical topology templates) to see if there is a scene topology (i.e. historical topology map) that meets the above requirements. If it exists, you can directly select the existing scene template for instantiation. If the existing scene does not meet the requirements, build the scene topology according to the above requirements.

[0078] There are three ways to build scene topology in real time:

[0079] (1) Scenario topology cloning: quickly clone an existing topology and edit it, such as editing the parameters of nodes and links in the topology, modifying node connection relationships, adding or deleting topology nodes, and then saving it as a new topology.

[0080] (2) Scenario topology combination and grouping: For a relatively complex large network, it is divided into smaller networks according to the domains in the network. Each smaller network is searched for similar topological structures. If so, it is edited according to the method in step a. If not, it is manually constructed. After that, all the edited smaller network topologies are merged into the required network topology. In this way, multiple topologies are combined into a new topological structure.

[0081] (3) Multi-layer and multi-level scenario topology construction: For complex networks with multiple layers that require collaboration among multiple people, the networks are divided according to their hierarchical structure, and each layer is independently constructed. The corresponding personnel construct the network topology in the manner of step (2). After completing the topology construction of each layer, the network topologies of all layers are merged to construct the required network topology. The third method is to jointly design the network topology based on the hierarchical structure division of multi-layer and multi-level complex networks through multi-person collaboration, which can quickly and effectively support the construction process of complex networks.

[0082] 3. Scene resource mapping.

[0083] When the scenario topology is built, a mapping relationship is established with the virtual or physical resources in the endogenous security target range based on the performance of the nodes in the topology, the bandwidth, delay, jitter and other requirements of the link. Endogenous security refers to: security functions or attributes obtained by using the system's architecture, mechanism, scenario, rules and other internal factors.

[0084] The optional devices in the physical environment include virtual devices and physical devices, and the link resources include virtual links (logical links) and simulated links (links simulated according to link parameters).

[0085] The above constructed scenario topology (i.e. network topology graph) can be described as an undirected graph ,in Represents a collection of nodes in the scene topology. Represents the set of links in the scene topology, and Represents the node attribute set and link attribute set in the scene topology.

[0086] For the physical network of the cyber range (the physical network composed of devices in the physical environment), it can be described as an undirected graph ,in Represents a set of nodes in a physical network, represents the set of links in the physical network, and Represents the node attribute set and link attribute set in the physical network. Devices in the physical network are divided into virtual devices (a cloud service device supported by a physical device) and physical devices.

[0087] The properties of the nodes in the above constructed scenario topology include: node ID; node type, which is a mimic device (marked with 0), a general server (marked with 1), or other device (marked with 2); resource requirements (i.e. the aforementioned name, brand, model, etc.), which can be recorded as:

[0088] [(node , node type, resource requirements), (node , node type, resource requirements), …].

[0089] When the nodes in the scene topology are mimetic devices, the resource requirements can specifically include the corresponding names and key parameters of various types of mimetic devices. The device names include: mimetic router, mimetic Web server, mimetic domain name server, mimetic distributed storage, mimetic firewall, etc. The key parameter starts with the parameter name, followed by the indicator, separated by a colon. When there are multiple key parameters, they are arranged in sequence, and the order can be ignored. For example: If a node is a mimetic router, then the node can be defined and recorded as: (virtual node ID, 0, mimetic router, number of executors: 5). The number of executors is the number of executors included in the node, which is a key parameter.

[0090] When the node in the scenario topology is a general-purpose server, the resource requirements may specifically include: CPU frequency requirements, memory requirements, and storage capacity requirements. General-purpose servers are generally deployed as virtual devices in the form of images. For example: If a node is a general-purpose server, then the node can be defined and recorded as: (virtual node ID, 1, CPU: 2GHz, memory: 8GB, storage: 1TB), that is, a virtual machine is required, the CPU frequency is not less than 2GHz, the available memory is not less than 8GB, and the available storage space is not less than 1TB.

[0091] When the nodes in the scenario topology are other devices, the resource requirements can specifically include: device name and key parameters, which are similar to the description of the mimic device. For example: If a node is a firewall, then the node can be defined and recorded as: (virtual node ID, 2, firewall, throughput: 2Gbit / s, maximum number of concurrent sessions: 500,000).

[0092] If a node is a mimic device or other device, the node is generally mapped to a single physical device. If a node is a server, it is generally mapped to a virtual mirror device on a general server.

[0093] Accordingly, the devices in the physical network can be recorded as:

[0094] [(physical node ID, node type, resource characteristics), (physical node ID, node type, resource characteristics), …]. Node types are also divided into three categories, namely, mimic devices, general servers, and other devices.

[0095] When the device in the physical network is a mimetic device, the resource characteristics are the corresponding mimetic device names and key parameters of various types. The device names include but are not limited to: mimetic router, mimetic Web server, mimetic domain name server, mimetic distributed storage and mimetic firewall. The key parameter starts with the parameter name, followed by the indicator, separated by a colon. When there are multiple key parameters, they are arranged in sequence, and the order can be ignored. The key parameters here are the parameters of the device. The parameters of the device are listed as detailed as possible (only the required parameters are listed in the virtual topology, and as many detailed parameters as possible are listed in the physical network) to facilitate device retrieval and comparison. If the device in the physical network is a mimetic router, then the node can be defined and recorded as: (physical node ID, 0, mimetic router, number of executors: 5, scheduling cleaning time: 10s).

[0096] When the device type in the physical network is a general server, the resource characteristics correspond to the available CPU frequency, available memory, and available storage capacity, etc. If the device type in the physical network is a general server, then the node can be defined and recorded as: (physical node ID, 1, CPU: 100GHz, memory: 128GB, storage: 4TB), that is, a physical server is required, whose CPU available frequency is 100GHz, memory is 128GB, and storage space is 4TB.

[0097] When the device in the physical network is other devices, the resource characteristics correspond to the device name and key parameters, which are similar to the description of the mimic device. If the device in the physical network is a firewall, then the node can be defined and recorded as: (physical node ID, 2, firewall, throughput: 2Gbit / s, maximum number of concurrent sessions: 500,000, number of new sessions per second: 30,000, maximum security policy: 3000).

[0098] The attributes of the link in the scene topology include the link ID. If it is a virtual link, the virtual link connects two node IDs in the scene topology. The key parameters for defining the virtual link in the corresponding resource requirements include: bandwidth requirements, latency, and jitter, etc. You can fill in one or more parameters according to the requirements, which can be recorded as follows:

[0099] [(virtual link ID, virtual node , virtual node , resource requirements), (virtual link ID, virtual node , virtual node , resource requirements), …].

[0100] The link in the physical network is a physical link. Its attributes include the link ID. The physical link connects two physical node IDs in the physical network. The resource characteristics include the remaining bandwidth, latency, and jitter, which can be recorded as follows:

[0101] [(Entity Link ID, Entity Node , entity node , resource characteristics), (physical link ID, physical node , entity node , resource characteristics), …].

[0102] The resource requirements in the virtual link attributes and the resource characteristics in the physical link attributes are defined in the same way as the above nodes, and will not be described in detail here.

[0103] The following scheme adopts the node and link interleaving mapping scheme. First, a node is mapped. After the node mapping is completed, whether to map its related links is considered based on whether there are adjacent mapped nodes in the topology. It does not simply map a node and then map a link.

[0104] For node mapping, the nodes are classified and mapped according to the node type, and are sorted into mimicry devices, other devices, and general servers. That is, the mimicry device type nodes are mapped first, then the other device type nodes are mapped, and finally the general server type nodes are mapped.

[0105] For nodes of the mimic device type, the key parameters defined in the node to be mapped are used as keywords to search for the corresponding physical devices that meet the conditions in the physical network. Based on this, the search of all mimic device type nodes is completed, and the node ID, the number of devices that can be mapped, and the mappable physical node ID are recorded. The above search operation is also performed for node types of other devices and general servers.

[0106] Finally, the following record information is obtained:

[0107] (Virtual Node , 1 (number of mappable devices), physical node )

[0108] (Virtual Node ,3 (number of mappable devices), physical nodes , entity node , entity node )

[0109] …

[0110] (Virtual Node , n (number of mappable devices), physical nodes , entity node ,…,Entity Node )

[0111] If the number of mappable devices is found to be 0 during the above search process, the mapping is terminated and an error is returned.

[0112] The above recorded information is sorted from small to large according to the number of mappable devices, so that nodes with a smaller number of mappable devices are sorted first.

[0113] The following is a detailed description of the mapping process: First, select the node ranked first in the above records (i.e., the node with the least mappable physical devices) for mapping, randomly select one from its mappable physical nodes, and then start mapping subsequent nodes. When mapping the i-th node, it is necessary to first determine whether its mappable device is occupied by the previously mapped node. If it is occupied, it is necessary to select from the remaining unoccupied mappable devices. If there is no mappable device available at this time, it is necessary to backtrack, that is, adjust the mapping of the previous node (i-1th node), and replace a mappable physical device for the previous node. If the i-1th node being adjusted has a link mapping at this time, it is also necessary to synchronously change its original mapping link, and then re-map the i-th node. If this backtracking process goes back to the first node and still cannot complete the mapping of the i-th node, an error prompt message is returned.

[0114] After completing the mapping of the i-th node, check whether the i-th node and the previous mapped node have an adjacent relationship in topology. If there is an adjacent relationship, link mapping is performed at this time. For all links between the mapped node and the i-th node, the corresponding path is mapped on the physical link. If the i-th node and the previous mapped node cannot find a mapping that meets the conditions on the physical link, then link mapping cannot be performed. At this time, the mapping of the i-th node can be adjusted. The specific process is similar to the above adjustment process. Then start mapping the i+1th node. If after the mapping of the i-th node is completed, there is no adjacent node in the topology with the mapped node, then start mapping the i+1th node directly. And so on, complete the mapping of all nodes and links.

[0115] This embodiment establishes a mapping relationship with the virtual machine or physical device in the physical environment according to the performance of the network element in the topology, the bandwidth, delay, jitter and other requirements of the link. According to the constraints such as the type of node and the demand for resources, the number of physical resources that can be mapped by the virtual node is calculated, and each virtual node is sorted according to the number of mappable resources, and the virtual nodes with a smaller number of mappable nodes are mapped first. The virtual nodes with a larger number of mappable nodes are mapped later. In the node mapping process, if the mapped node is an adjacent node in the virtual topology, link mapping is carried out, that is, link mapping between all mapped adjacent nodes is carried out, and the subsequent node mapping is continued after completing this part of the link mapping. If a node does not have a physical node that meets the conditions in the subsequent mapping process, it will fall back to the previous mapped node for remapping. If a suitable node is still not found, it will continue to fall back to the previous node, and so on, until the first node. If the first node traverses its own mappable set and cannot meet the requirements, it returns failure. In the process of fallback, if a node is remapped, the link connected to this node also needs to be remapped.

[0116] After the mapping is completed, you can perform a connectivity test to verify whether it meets the expectations at the beginning of topology construction. And verify the services on the nodes in the scene, such as verifying whether a certain WEB service port is normal. Finally, save the scene template and instantiate it to actual business.

[0117] Figure 3 is a schematic diagram of a network mapping result according to one embodiment of the present disclosure, such as Figure 3 As shown, for a real network, according to this embodiment, the network topology can be condensed and mapped to the physical devices and virtual devices in the resource pool, and the mapping results can also be observed according to the device type.

[0118] This embodiment supports multiple scene construction methods, and saves the constructed scene topology as a template, which can reduce the construction of repetitive scenes and greatly reduce the complexity of scene construction in the endogenous security target range. The network mapping method provided by the present disclosure first condenses and abstracts the network to be constructed, and determines the network topology and key nodes to be constructed. Then, according to the classification, label, keyword, purpose and other contents, quickly retrieve and locate the existing scene. Check whether there is a scene template that meets the requirements, and if so, instantiate the scene template. If not, construct the scene topology according to the network topology. In the construction process, scene topology cloning, scene topology combination and grouping, and multi-layer and multi-level scene topology construction methods can be used. After the scene topology is constructed, add the corresponding physical device or virtual device in the scene. Then, according to the performance of the network element in the topology, the bandwidth, delay, jitter and other requirements of the link, establish a mapping relationship with the virtual machine or physical resource in the resource pool. Finally, the availability of services, threats, tools, etc. on the nodes in the scene is verified and a scene template is generated. The scene template is issued to the actual business through instantiation.

[0119] Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course can also be implemented by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present disclosure, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, a disk, or an optical disk), and includes a number of instructions for enabling a terminal device (which can be a mobile phone, a computer, a server, or a network device, etc.) to execute the methods described in each embodiment of the present disclosure.

[0120] In the embodiments of the present disclosure, a network mapping device is also provided, which is used to implement the above embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated. As used below, the term "module" can implement a combination of software and / or hardware for a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0121] Figure 4 1 is a structural block diagram of a network mapping device according to one embodiment of the present disclosure. Figure 4 As shown, the device comprises:

[0122] Construction module 401, used to construct a network topology diagram;

[0123] A selection module 402 is used to select, for each node in the network topology diagram, at least one mappable entity device that meets the node attributes of the corresponding node;

[0124] A sorting module 403 is used to sort each node in ascending order according to the number of at least one mappable physical device of each node to obtain a target sequence;

[0125] The mapping module 404 is used to start from the first position of the target sequence, take each node as the target object in turn, select a target mappable entity device from at least one mappable entity device of the target object to complete the mapping of the target object, and map the links associated with the target object. There are resources in the target mappable entity device that have not been mapped and meet the node attributes of the target object.

[0126] Optionally, the construction module 401 is further used to: obtain network requirements; the network requirements include: network nodes to be simulated and their node attributes, and link parameters between different network nodes; and construct a network topology diagram according to the network requirements.

[0127] Optionally, the construction module 401 is further used to: search the historical topology template for a historical topology map that meets the network requirements; and use the historical topology map as the network topology map.

[0128] Optionally, construction module 401 is also used to: determine the topological features of each historical topological map in the historical topological template; calculate the similarity between each topological feature and the network requirements; select the target topological feature whose similarity is higher than the target value; modify the historical topological map corresponding to the target topological feature to obtain the network topological map.

[0129] Optionally, construction module 401 is also used to: divide network requirements according to domains or levels to obtain multiple sub-requirements; calculate the similarity between each sub-requirement and each topological feature; modify the corresponding historical topological map according to the sub-requirements corresponding to the target topological features; connect the modified historical topological map according to the connection relationship between different domains or the connection relationship between different levels to obtain a network topological map.

[0130] Optionally, the mapping module 404 is further used to: construct a triple of target object, the number of at least one mappable physical device of the target object, and device identification information of at least one mappable physical device of the target object; and use the triple to select the target mappable physical device to complete the mapping of the target object.

[0131] Optionally, the mapping module 404 is further used to: determine a mapped target node among neighboring nodes of the target object; and map a link between the target object and the target node.

[0132] Optionally, it also includes: a backtracking module, which is used to delete the mapping of the previous mapped node and the mapping of the associated links if the target mappable entity device does not exist, and take the previous mapped node as the target object, execute the steps of selecting the target mappable entity device from at least one mappable entity device of the target object to complete the mapping of the target object, and mapping the links associated with the target object, so as to re-map the previous mapped node and the mapping of the associated links.

[0133] It can be seen that this embodiment provides a network mapping device, which starts from the node with the least selectivity and completes the node mapping and related link mapping of a node at the same time. There is no need to complete the mapping of all nodes before performing link mapping. Therefore, when the link mapping is unsuccessful, there is no need to overturn the mapping of all nodes. This solves the coordination problem of node mapping and link mapping to a certain extent, and can improve the efficiency of virtual network mapping.

[0134] It should be noted that the above modules can be implemented by software or hardware. For the latter, it can be implemented in the following ways, but not limited to: the above modules are all located in the same processor; or the above modules are located in different processors in any combination.

[0135] According to one embodiment of the present disclosure, an electronic device is also provided, including: a memory for storing a computer program; a processor for executing the computer program, wherein the network mapping method is executed when the program is running. Optionally, in this embodiment, the processor can be configured to perform the following steps through the computer program:

[0136] Step S1, constructing a network topology map;

[0137] Step S2, for each node in the network topology diagram, selecting at least one mappable entity device that meets the node attributes of the corresponding node;

[0138] Step S3, arranging each node in ascending order according to the number of at least one mappable physical device of each node to obtain a target sequence;

[0139] Step S4, starting from the first position of the target sequence, take each node as the target object in turn, select the target mappable physical device from at least one mappable physical device of the target object to complete the mapping of the target object, and map the links associated with the target object. There are resources in the target mappable physical device that have not been mapped and meet the node attributes of the target object.

[0140] According to one embodiment of the present disclosure, a readable storage medium is further provided for storing a computer program, wherein the computer program implements the above-mentioned network mapping method when executed by a processor. Optionally, in this embodiment, the above-mentioned storage medium can be configured to store a computer program for performing the following steps:

[0141] Step S1, constructing a network topology map;

[0142] Step S2, for each node in the network topology diagram, selecting at least one mappable entity device that meets the node attributes of the corresponding node;

[0143] Step S3, arranging each node in ascending order according to the number of at least one mappable physical device of each node to obtain a target sequence;

[0144] Step S4, starting from the first position of the target sequence, take each node as the target object in turn, select the target mappable physical device from at least one mappable physical device of the target object to complete the mapping of the target object, and map the links associated with the target object. There are resources in the target mappable physical device that have not been mapped and meet the node attributes of the target object.

[0145] Optionally, in this embodiment, the above-mentioned storage medium may include but is not limited to: a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk, and other media that can store computer programs.

[0146] The serial numbers of the above-mentioned embodiments of the present disclosure are only for description and do not represent the advantages or disadvantages of the embodiments.

[0147] In the above embodiments of the present disclosure, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0148] In the several embodiments provided in the present disclosure, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only schematic. For example, the division of the units can be a logical function division. There may be other division methods in actual implementation. For example, 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 through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.

[0149] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0150] In addition, each functional unit in each embodiment of the present disclosure may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0151] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present disclosure, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, server or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present disclosure. The aforementioned storage medium includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, disk or optical disk, etc. Various media that can store program codes.

[0152] The above is only a preferred embodiment of the present disclosure. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principle of the present disclosure. These improvements and modifications should also be regarded as the scope of protection of the present disclosure.

Claims

1. A network mapping method, It is characterized in that include: Build network topology diagram; For each node in the network topology diagram, selecting at least one mappable entity device that conforms to the node attributes of the corresponding node; Arrange each node in ascending order according to the number of at least one mappable physical device of each node to obtain a target sequence; Starting from the first position of the target sequence, each node is taken as the target object in turn, and among at least one mappable entity device of the target object, a target mappable entity device is selected to complete the mapping of the target object, and mapping of the link associated with the target object is performed, and there are resources in the target mappable entity device that have not been mapped and meet the node attributes of the target object.

2. The method according to claim 1, It is characterized in that The constructing of the network topology diagram includes: Obtaining network requirements; the network requirements include: network nodes to be simulated and their node attributes, and link parameters between different network nodes; The network topology diagram is constructed according to the network requirements.

3. The method according to claim 2, It is characterized in that The network topology diagram is constructed according to the network requirements, including: Querying a historical topology template for a historical topology map that meets the network requirements; The historical topology map is used as the network topology map.

4. The method according to claim 2, It is characterized in that The network topology diagram is constructed according to the network requirements, including: Determine the topological features of each historical topology graph in the historical topology template; Calculating the similarity between each topological feature and the network requirement; Select the target topological features with a similarity higher than the target value; The historical topology map corresponding to the target topology feature is modified to obtain the network topology map.

5. The method according to claim 4, It is characterized in that Calculate the similarity between each topological feature and the network requirement, including: Divide the network requirements according to domains or levels to obtain multiple sub-requirements; Calculate the similarity between each sub-demand and each topological feature; Accordingly, modifying the historical topology map corresponding to the target topology feature to obtain the network topology map includes: Modify the corresponding historical topology map according to the sub-demand corresponding to the target topology feature; According to the connection relationship between different domains or the connection relationship between different levels, the modified historical topology graph is connected to obtain the network topology graph.

6. The method according to any one of claims 1 to 5, It is characterized in that Selecting a target mappable entity device from at least one mappable entity device of the target object to complete mapping of the target object comprises: constructing the target object, the number of at least one mappable physical device of the target object, and device identification information of at least one mappable physical device of the target object into a triple; The target mappable entity device is selected using the triplet to complete the mapping of the target object.

7. The method according to any one of claims 1 to 5, It is characterized in that Mapping the link associated with the target object includes: Determine a target node for which mapping has been completed among each neighbor node of the target object; The link between the target object and the target node is mapped.

8. The method according to any one of claims 1 to 5, It is characterized in that Also includes: If the target mappable entity device does not exist, the mapping of the previous mapped node and the mapping of the associated links are deleted, and the previous mapped node is used as the target object. The target mappable entity device is selected from at least one mappable entity device of the target object to complete the mapping of the target object, and the steps of mapping the links associated with the target object are performed to re-map the previous mapped node and the mapping of the associated links.

9. A network mapping device, It is characterized in that include: Construction module, used to construct the network topology diagram; A selection module, configured to select, for each node in the network topology diagram, at least one mappable entity device that meets the node attributes of the corresponding node; A sorting module, used to arrange each node in ascending order according to the number of at least one mappable physical device of each node to obtain a target sequence; A mapping module is used to start from the first position of the target sequence, take each node as the target object in turn, select a target mappable entity device from at least one mappable entity device of the target object to complete the mapping of the target object, and map the links associated with the target object, wherein there are resources in the target mappable entity device that have not been mapped and meet the node attributes of the target object.

10. An electronic device, It is characterized in that include: Memory for storing computer programs; A processor, configured to execute the computer program to implement the method according to any one of claims 1 to 8.

11. A readable storage medium, It is characterized in that Used to store a computer program, wherein when the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.

Images