CN116938753B - Data processing method and device and electronic equipment - Google Patents
Data processing method and device and electronic equipment Download PDFInfo
- Publication number
- CN116938753B CN116938753B CN202311176536.4A CN202311176536A CN116938753B CN 116938753 B CN116938753 B CN 116938753B CN 202311176536 A CN202311176536 A CN 202311176536A CN 116938753 B CN116938753 B CN 116938753B
- Authority
- CN
- China
- Prior art keywords
- virtual machine
- underway
- node
- directed graph
- link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000003672 processing method Methods 0.000 title abstract description 27
- 238000000034 method Methods 0.000 claims abstract description 56
- 238000012545 processing Methods 0.000 claims abstract description 23
- 238000004590 computer program Methods 0.000 claims description 10
- 230000008569 process Effects 0.000 description 13
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 230000009471 action Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 3
- 238000012544 monitoring process Methods 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 238000000605 extraction Methods 0.000 description 2
- 238000002955 isolation Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/04—Processing captured monitoring data, e.g. for logfile generation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/46—Interconnection of networks
- H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0677—Localisation of faults
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/40—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using virtualisation of network functions or resources, e.g. SDN or NFV entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/20—Arrangements for monitoring or testing data switching networks the monitoring system or the monitored elements being virtualised, abstracted or software-defined entities, e.g. SDN or NFV
Abstract
The application discloses a data processing method, a data processing device and electronic equipment, and relates to the technical field of computers. The method comprises the following steps: acquiring an associated data request; extracting virtual machine identification from the associated data request; based on the virtual machine identification, the hash table and the directed graph are utilized to store the associated data of the Overlay and the Underlay. The present application first obtains an associated data request, where the associated data request typically includes an in-band telemetry message carrying cloud network Overlay and underway associated data. Extracting virtual machine identification from the associated data request; based on the virtual machine identification, the two data structures, namely the hash table and the directed graph, are utilized to store the associated data of the Overlay and the Underlay. By storing the Overlay and Underlay associated data in the cloud computing network into the hash table and the directed graph, the associated data can be completely recorded, redundant storage of the data can be avoided, and consumption of storage space is reduced.
Description
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a data processing method, an apparatus, and an electronic device.
Background
In current cloud computing networks, overlay is more complex than Underlay. In the virtual large two-layer network (Virtual eXtensible Local Area Network, vxLAN), underlay is an underlaid carrier network, and Overlay is a virtual network constructed on the basis of underlaid network Underlay interworking. Each physical server within the underway may host hundreds of Virtual Machines (VMs) and containers (dockers), all of which are potential endpoints of some paths within the Overlay. Therefore, data correlation of underway and Overlay is very challenging. On the other hand, quality of service QoS (Quality Of Service) between these Overlay endpoints is important for operation and control of the network. Once information such as Overlay network congestion, silent faults and the like is monitored or reported by a user, an administrator can quickly locate the root cause of the Underlay fault through the association relationship between the Overlay and the Underlay. Therefore, there is a need for a method for associating and processing data of cloud computing networks Overlay and Underlay.
Disclosure of Invention
In view of this, the present application provides a data processing method, a device and an electronic device, and mainly aims to provide a method for associating and processing data of a cloud computing network Overlay and an underway.
In a first aspect, the present application provides a data processing method, including:
acquiring an associated data request;
extracting a virtual machine identifier from the associated data request;
and storing the associated data of the Overlay and the Underlay by utilizing a hash table and a directed graph based on the virtual machine identification.
Optionally, based on the virtual machine identifier, storing associated data of the Overlay and the Underlay by using a hash table and a directed graph, including: searching whether a storage record of the virtual machine exists in a hash table based on the virtual machine identification;
if not, creating a new table entry in a hash table by taking the virtual machine identifier as a key, and determining a source node and a first path serial number of a corresponding underway link; determining a next node in sequence according to the source node and the first path serial number by utilizing the directed graph, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node;
if yes, creating a new path for the table item corresponding to the virtual machine identifier in the hash table, and determining a source node and a second path serial number of the corresponding underway link; and determining a next node in sequence through the source node and the second path sequence number by utilizing the directed graph, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node.
Optionally, the method further comprises: after receiving the query data request, determining the query type; and searching target information in the hash table and the directed graph according to the query type.
Optionally, the query types include a virtual machine identifier query type of an Overlay layer, a device identifier query type of an Underlay layer and a path sequence number query type of an Underlay layer link; the target information comprises virtual machine identification and/or underway link information of an Overlay layer;
searching target information in the hash table and the directed graph according to the query type, wherein the searching comprises the following steps: obtaining a virtual machine identifier of an Overlay layer, and searching at least one piece of underway link information corresponding to the virtual machine identifier in a hash table and a directed graph; or, acquiring the equipment identifier of the Underlay layer, and searching the Underlay link information corresponding to the equipment identifier and the virtual machine identifier of the corresponding Overlay layer in the hash table and the directed graph; or, obtaining the path sequence number of the link of the underway layer, and searching the underway link information corresponding to the path sequence number and the virtual machine identification of the corresponding Overlay layer in the hash table and the directed graph.
Optionally, the obtaining the virtual machine identifier of the Overlay layer searches the hash table and the directed graph for at least one piece of underway link information corresponding to the virtual machine identifier, including: searching the number of underway links, path sequence numbers and source nodes corresponding to the virtual machine identifiers in a hash table based on the virtual machine identifiers of the Overlay layers; and traversing all nodes on each underway link in turn by utilizing the directed graph from the source node, and returning the traversed link information as the target information until the next node is a virtual machine node.
Optionally, the obtaining the device identifier of the Underlay layer, searching the hash table and the directed graph for Underlay link information corresponding to the device identifier and a virtual machine identifier of the corresponding Overlay layer, including: based on the equipment identifier of the underway layer, finding a node corresponding to the equipment identifier in a directed graph, and determining link information of all underway links passing through the node; searching an Overlay virtual machine identifier corresponding to each underway link in the hash table; and returning the link information of all the underway links passing through the node and the Overlay virtual machine identification corresponding to each underway link as the target information.
Optionally, the obtaining the path sequence number of the link of the underway layer, searching the underway link information corresponding to the path sequence number and the virtual machine identifier of the corresponding Overlay layer in the hash table and the directed graph, including: searching a virtual machine identifier of a corresponding Overlay layer in a hash table based on a path serial number of the link of the Underlay layer; determining a source node of the virtual machine identifier in the directed graph by utilizing the virtual machine identifier; traversing from the source node in the directed graph to obtain link information of each underway link corresponding to the source node; and returning the virtual machine identification and the link information of each underway link as the target information.
Optionally, the method further comprises: after acquiring an update data request, updating the underway link to be updated in the directed graph based on the link information of the underway link to be updated; or acquiring an underway node with the node state changed, and updating the association relation between the underway node and the corresponding virtual machine identifier.
Optionally, the acquiring the Underlay node with the changed node state updates the association relationship between the Underlay node and the corresponding virtual machine identifier, including: obtaining path sequence numbers of all underway links corresponding to underway nodes with changed node states in the directed graph; deleting link information corresponding to each underway link in the directed graph according to the path sequence number; obtaining virtual machine identifiers of an Overlay layer from the hash table, and obtaining link information corresponding to a currently corresponding underway link based on the virtual machine identifiers; and storing the link information corresponding to the currently corresponding underway link into the directed graph.
In a second aspect, the present application provides a data processing apparatus comprising:
an acquisition unit configured to acquire an associated data request;
An extraction unit configured to extract a virtual machine identification in the associated data request;
and the processing unit is configured to store the associated data of the Overlay and the Underlay by utilizing a hash table and a directed graph based on the virtual machine identification.
In a third aspect, the present application provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the data processing method of the first aspect.
In a fourth aspect, the present application provides an electronic device, including a storage medium, a processor, and a computer program stored on the storage medium and executable on the processor, where the processor implements the data processing method according to the first aspect when executing the computer program.
By means of the technical scheme, the data processing method, the data processing device and the electronic equipment firstly acquire the associated data request, wherein the associated data request generally comprises in-band telemetry messages carrying cloud network Overlay and underway associated data. Further, extracting a virtual machine identifier from the associated data request; based on the virtual machine identification, the two data structures, namely the hash table and the directed graph, are utilized to store the associated data of the Overlay and the Underlay. By storing the Overlay and Underlay associated data in the cloud computing network into the hash table and the directed graph, the associated data can be completely recorded, redundant storage of the data can be avoided, and consumption of storage space can be reduced.
The foregoing description is only an overview of the technical solutions of the present application, and may be implemented according to the content of the specification in order to make the technical means of the present application more clearly understood, and in order to make the above-mentioned and other objects, features and advantages of the present application more clearly understood, the following detailed description of the present application will be given.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required to be used in the description of the embodiments or the prior art will be briefly described below, and it will be obvious to those skilled in the art that other drawings can be obtained from these drawings without inventive effort.
Fig. 1 shows a flow chart of a data processing method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a system architecture of a data processing method according to an embodiment of the present application;
FIG. 3 is a schematic diagram of a hash table in a data processing method according to an embodiment of the present application;
FIG. 4 is a schematic diagram of a directed graph in a data processing method according to an embodiment of the present application;
FIG. 5 is a schematic flow chart of another data processing method according to an embodiment of the present application;
FIG. 6 is a schematic flow chart of another data processing method according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present application.
Detailed Description
In order that the above objects, features and advantages of the present application may be more clearly understood, a further description of the aspects of the present application will be provided below. It should be noted that, in the case of no conflict, the embodiments of the present application and the features in the embodiments may be combined with each other.
The data processing method provided in this embodiment is applied to a data processing apparatus or electronic device, which may be installed or integrated in some in-band telemetry server devices or systems, and may perform any of the data processing methods mentioned below when running.
The embodiment provides a data processing method for storing, querying and updating associated data by using Overlay and Underlay of a programmable switch, as shown in fig. 1, the method includes:
S101, acquiring an associated data request.
First, the data processing method proposed in this embodiment is generally based on an in-band telemetry server, and can communicate with a programmable switch by means of requests and instructions with different functions. In an in-band network telemetry architecture, a switching device forwards data packets carrying telemetry instructions (Telemetry instructions). These telemetry instructions tell the network telemetry enabled network device what network status information should be collected and written as telemetry packets pass through the device. In this embodiment, the associated data instruction generally further includes cloud network Overlay and Underlay associated data, virtual machine identification, node information, and the like.
S102, extracting virtual machine identification from the associated data request.
The virtual machine identification is extracted from the associated data request, wherein the virtual machine identification generally selects the IP address of a pair of virtual machines at the Overlay level. Because multiple underway links may be associated between a pair of virtual machines.
S103, storing the associated data of the Overlay and the Underlay by utilizing a hash table and a directed graph based on the virtual machine identification.
The hash table takes a pair of virtual machine IP addresses of an Overlay layer in the cloud computing network as keywords, and associated data comprise path serial numbers of all underway links corresponding to the pair of virtual machines and source nodes of each underway link in the directed graph. The directed graph is implemented by adopting an Adjacency List (Adjacency List) method, each node in the Adjacency List represents a single device (such as a programmable switch or a router) at the underway level, and the neighbor node of the node and the link state information (forwarding delay, queue length, ingress and egress ports, etc.) of the neighbor node are recorded in the directed graph. Note that for the last node on the Underlay link, its neighbor node is the virtual machine address of the Overlay layer.
In this embodiment, after receiving an in-band telemetry message carrying cloud network Overlay and Underlay associated data, two data structures, namely a hash Table (handling Table) and a Directed Graph (Directed Graph), are used to store the Overlay and Underlay associated data. An associated data request is first obtained, where the associated data request typically includes an in-band telemetry message carrying cloud network Overlay and underway associated data. Further, extracting a virtual machine identifier from the associated data request; based on the virtual machine identification, the two data structures, namely the hash table and the directed graph, are utilized to store the associated data of the Overlay and the Underlay.
The advantage of storing associated data by means of hash tables is that due to functions such as load balancing, redundancy backup or high reliability, multiple different underway links may exist when the same pair of virtual machines in the Overlay layer communicate, and the hash tables identify the different links by using path sequence numbers. The source node is an entry when the complete underway link information is acquired from the directed graph after the path sequence number is acquired; since the portals of different underway links may be different, the source node for each underway link is to be recorded.
And the node is used for representing the equipment of a single underway layer by a directed graph mode, and the neighbor node of the node and the link state information of the neighbor node passing through the node are recorded, so that the link information is more complete. By storing the Overlay and Underlay associated data in the cloud computing network into the hash table and the directed graph, the associated data can be completely recorded, redundant storage of the data can be avoided, and consumption of storage space can be reduced.
Optionally, storing associated data of the Overlay and the Underlay by using the hash table and the directed graph based on the virtual machine identifier, including: searching whether a storage record of the virtual machine exists in the hash table based on the virtual machine identification;
if not, creating a new table entry in the hash table by taking the virtual machine identifier as a key, and determining a source node and a first path serial number of a corresponding underway link; determining a next node in sequence according to the source node and the first path serial number by utilizing the directed graph, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node;
if yes, creating a new path for the table item corresponding to the virtual machine identifier in the hash table, and determining the source node and the second path serial number of the corresponding underway link; and determining the next node in sequence through the source node and the second path sequence number by utilizing the directed graph, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node.
In the present embodiment, a procedure when associated data is stored through a hash table and a directed graph is described. Specifically, taking an IP address of a virtual machine identifier as a pair of Overlay layers as an example, firstly, whether the IP address already exists in a hash table is queried, because the virtual machine needing to store the associated data already has other underway links, and the newly added associated data is stored this time. If the virtual machine information does not exist, the fact that the pair of virtual machines does not exist in the current hash table is indicated, the IP address of the Overlay layer serves as a key word, a new table entry is created in the hash table, a globally unique path serial number is assigned to the Underlay link, and the first node of the link is the source node of the table entry of the hash table. And determining the next node in turn by using the directed graph through the source node and the second path sequence number, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node.
If the virtual machine corresponding to the IP address exists in the hash table, a new path is created in the table entry corresponding to the IP address in the hash table, and the source node and the second path serial number of the corresponding underway link are determined. The source node is identical to the source node, but the second path sequence number is different from the first path sequence number, which indicates that although the source node is the same, the underway link corresponding to the first path sequence number is different. And determining the next node in turn by using the directed graph through the source node and the second path sequence number, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node.
Optionally, the method further comprises: after receiving the query data request, determining the query type; target information is searched in the hash table and the directed graph according to the query type.
In this embodiment, after receiving a query request of cloud computing network Overlay or Underlay data, a result is returned by searching the hash table and the directed graph. When the associated data of the Overlay and the Underlay in the cloud computing network are queried, the data of the Underlay link is obtained on the premise of a given cloud computing network Overlay virtual machine, and the data of the Overlay virtual machine is obtained on the premise of a given Underlay link or equipment.
Optionally, the query types include a virtual machine identifier query type of the Overlay layer, a device identifier query type of the Underlay layer and a path sequence number query type of the Underlay layer link; the target information comprises virtual machine identification and/or Underlay link information of an Overlay layer;
searching target information in the hash table and the directed graph according to the query type, wherein the searching comprises the following steps: obtaining virtual machine identification of the Overlay layer, and searching at least one piece of Underlay link information corresponding to the virtual machine identification in the hash table and the directed graph; or, acquiring the equipment identifier of the underway layer, and searching the underway link information corresponding to the equipment identifier and the virtual machine identifier of the corresponding Overlay layer in the hash table and the directed graph; or, obtaining the path sequence number of the link of the underway layer, and searching the underway link information corresponding to the path sequence number and the virtual machine identification of the corresponding Overlay layer in the hash table and the directed graph.
In this embodiment, given one piece of information, the virtual machine identifier of the Overlay layer, the device identifier of the Underlay layer, and the path sequence number of the Underlay layer link, two pieces of information can be queried in a hash table and a directed graph manner. Specifically, the corresponding at least one link information can be searched in the hash table and the directed graph through virtual machine identification. Or searching the hash table and the directed graph for the corresponding underway link information of the equipment identifier and the corresponding virtual machine identifier of the Overlay layer according to the equipment identifier of the underway layer. Or searching the hash table and the directed graph for the Underray link information corresponding to the path sequence number and the virtual machine identification of the corresponding Overlay layer according to the path sequence number of the Underray layer link.
Optionally, obtaining the virtual machine identifier of the Overlay layer, searching at least one piece of underway link information corresponding to the virtual machine identifier in the hash table and the directed graph, including: searching the number of Underlay links, path serial numbers and source nodes corresponding to the virtual machine identifiers in the hash table based on the virtual machine identifiers of the Overlay layer; and traversing all nodes on each underway link in turn by utilizing the directed graph from the source node, and returning the traversed link information as target information until the next node is a virtual machine node.
In this embodiment, specifically, based on the IP addresses of a pair of virtual machines in the Overlay layer, the number of corresponding underway links, the path sequence number, and the source node are searched from the hash table; and triggering from the source node by utilizing the directed graph, traversing all nodes on each underway link in sequence, and returning the traversed link information as target information until the next node is a virtual machine node.
Optionally, acquiring the device identifier of the Underlay layer, searching the hash table and the directed graph for Underlay link information corresponding to the device identifier and the virtual machine identifier of the corresponding Overlay layer, including: based on the equipment identifier of the underway layer, finding out a node corresponding to the equipment identifier in the directed graph, and determining link information of all underway links passing through the node; searching an Overlay virtual machine identifier corresponding to each underway link in the hash table; and returning the link information of all the underway links passing through the node and the Overlay virtual machine identification corresponding to each underway link as target information. The information of one of the given three can be inquired through the hash table and the directed graph, and the inquiry efficiency is improved.
In this embodiment, based on the device identifier of the underway layer (from which it can be determined that it is on a certain node of a certain link), the node corresponding to the device identifier is found in the directed graph, and link information of all underway links passing through the node is determined; searching an Overlay virtual machine identifier corresponding to each underway link in the hash table; and finally, returning the link information of all the underway links passing through the node and the Overlay virtual machine identification corresponding to each underway link as target information.
Optionally, obtaining a path sequence number of the link of the underway layer, searching the underway link information corresponding to the path sequence number and the virtual machine identifier of the corresponding Overlay layer in the hash table and the directed graph, including: searching a virtual machine identifier of a corresponding Overlay layer in a hash table based on a path serial number of the link of the Underlay layer; determining a source node of the virtual machine identifier in the directed graph by utilizing the virtual machine identifier; traversing from a source node in the directed graph to obtain link information of each underway link corresponding to the source node; and returning the virtual machine identification and the link information of each underway link as target information. The information of one of the given three can be inquired through the hash table and the directed graph, and the inquiry efficiency is improved.
In this embodiment, through the path sequence number of the underway layer link, the IP address of the corresponding Overlay layer may be searched in the hash table, so as to determine the source node of the virtual machine identifier in the directed graph; traversing from a source node in the directed graph to obtain link information of each underway link corresponding to the source node; and returning the virtual machine identification and the link information of each underway link as target information. The information of one of the given three can be inquired through the hash table and the directed graph, and the inquiry efficiency is improved.
It should be noted that, in the query process, by combining the storage of the hash table and the directed graph, the embodiment can obtain one or more pieces of information of the Underlay link on the premise of giving the Underlay virtual machine, and can obtain the information of all the Underlay virtual machines carried on the Underlay link or the Underlay virtual machine when giving the Underlay link or the Underlay virtual machine; however, in the existing storage scheme at present, only a single corresponding underway link information can be obtained on the premise of giving an Overlay virtual machine address in a cloud computing network, so that Overlay data cannot be obtained from the underway, and the query function is very limited.
Optionally, the method further comprises: after the data updating request is acquired, updating the underway link to be updated in the directed graph based on the link information of the underway link to be updated; or acquiring an underway node with the node state changed, and updating the association relation between the underway node and the corresponding virtual machine identifier.
In this embodiment, the data update includes two ways, one is to update corresponding Underlay data when the Overlay layer changes, and update corresponding Overlay data when the Underlay layer changes. The existing data storage method does not consider the variability of Overlay and Underlay associated data in the cloud computing network, namely, the Overlay and Underlay associated data are considered to be invariable. The attributes of elastic shrinkage, resource sharing and the like inherent in the cloud computing network naturally cause frequent changes of Overlay and Underlay. Accordingly, the associated data of the Overlay and the underway in the cloud computing network needs to be updated quickly.
Optionally, acquiring an Underlay node with a changed node state, and updating an association relationship between the Underlay node and a corresponding virtual machine identifier, including: obtaining path sequence numbers of all underway links corresponding to underway nodes with changed node states in the directed graph; deleting link information corresponding to each underway link in the directed graph according to the path sequence number; obtaining virtual machine identifiers of the Overlay layer from the hash table, and obtaining link information corresponding to the currently corresponding underway link based on the virtual machine identifiers; and storing the link information corresponding to the currently corresponding underway link into the directed graph.
In this embodiment, if the state of the underway node changes, the update is performed in a manner of deletion first and addition second. Firstly, path sequence numbers of all underway links corresponding to underway nodes with node states changed are obtained in the directed graph, and link information corresponding to each underway link in the directed graph is deleted according to the path sequence numbers. And then obtaining the virtual machine identification of the Overlay layer from the hash table, obtaining the link information corresponding to the currently corresponding underway link based on the virtual machine identification, and re-storing the link information corresponding to the currently corresponding underway link into the directed graph, thereby ensuring the realization of the updating process.
The data processing method provided in this embodiment, specifically, a method for storing, querying and updating data associated with Overlay and Underlay, is further described and explained in conjunction with a system framework. First, as shown in fig. 2, a system architecture diagram of a data processing method according to an embodiment of the present application is shown. And (3) after receiving the telemetry message sent by the programmable switch, the in-band telemetry server stores, inquires and updates the cloud computing network Overlay and underway associated data. Specifically, after receiving an in-band telemetry message carrying cloud network Overlay and Underlay associated data, storing the Overlay and Underlay associated data by using two data structures, namely a hash table and a directed graph; after receiving a query request of cloud computing network Overlay or underway data, returning a result by searching the hash table and the directed graph; after receiving a request for updating Overlay or Underlay associated data, updating the hash table and the corresponding part in the directed graph.
In this embodiment, the specific configuration and the data storage structure manner of the hash table are shown in fig. 3, where the hash table uses a pair of virtual machine IP addresses at the Overlay level in the cloud computing network as a key, and the associated data includes path sequence numbers of all the Underlay links corresponding to the pair of virtual machines and source nodes of each Underlay link in the directed graph. Because of functions such as load balancing, redundancy backup or high reliability, a plurality of different underway links may exist when the same pair of virtual machines in the Overlay layer communicate, and the hash table identifies the different links by using the path sequence numbers. The source node is an entry when the complete underway link information is acquired from the directed graph after the path sequence number is acquired; since the portals of different underway links may be different, the source node for each underway link is to be recorded. VM1 and VM2 are virtual machine identifiers of a pair of virtual machines, and an IP address is generally selected as the virtual machine identifier; p1 and p2 represent two underway links between VM1 and VM 2; s1 is the source node of two links (the source nodes of two links are the same in the figure)
The specific structure diagram of the directed graph is shown in fig. 4, the directed graph is implemented by adopting a method of adjacent tables, and the directed graph on the right side is recorded in the table on the left side. Each node represents a single device (e.g., a programmable switch or router, recorded as s1, s2, or s3 in the graph), the neighbor node of this node (e.g., VM2: < p1, md_1> in the graph) and the link state information (forwarding delay, queue length, ingress and egress ports, etc.) through it and the neighbor node are also recorded in the directed graph. Note that for the last node on the Underlay link, its neighbor node is the virtual machine address of the Overlay layer.
Further, the data processing method based on the hash table and the directed graph provided in this embodiment will be described with reference to the above system architecture. First, the storage method, as shown in fig. 5, includes:
s501, acquiring an associated data request and extracting VM pairs.
When the telemetry monitoring system acquires the associated data request, the Overlay and Underlay data to be associated and Overlay VM pairs (IP addresses of a pair of virtual machines) are received simultaneously.
S502, judging whether related data exist in the hash table or not based on the VM pairs. If not, go to S5031; if yes, the process advances to S5032.
Firstly, searching in a hash table by taking Overlay VM pairs as keywords to judge whether the related data of the pair of virtual machines are recorded in the hash table and the directed graph. If not, the process proceeds to S5031; if so, the process advances to S5032.
S5031, creating a new table entry in the hash table by using the VM pair, and determining a source node and a first path serial number of a corresponding link.
The storage algorithm firstly uses the IP address (Overlay pair) of the Overlay virtual machine as a key word to be added into a hash table, meanwhile, assigns a globally unique path serial number p1 to the Underlay link, and takes a first Node (Underlay Node-1) as a source Node s1 of the hash table item. To this end, the hash table has recorded therein the pair of Overlay virtual machines and an associated one of the underway links (specifically configured as VM-1→s1→s2→vm-2), with source node and sequence number of s1 and p1, respectively.
S5032, creating a new path for the table entry corresponding to the VM pair in the hash table, and determining the source node and the second path serial number of the corresponding link.
The storage algorithm adds an Underlay new path p2 (e.g., VM-1- > s 3- > VM-2) to the table entry corresponding to the pair of Overlay virtual machines (Overlay Pairs) in the hash table. First, the path sequence number p2 and its source node s1 are recorded in a hash table. It should be noted that, the serial numbers of the multiple underway links corresponding to the same pair of Overlay virtual machines are different, that is, the meaning represented by the first path serial number and the second path serial number is different.
S5041, according to the source node and the first path serial number, determining the next node in the directed graph in sequence, and storing the link information in the directed graph and the hash table.
The storage algorithm first processes the source Node s1 corresponding to the underway path p1 in the directed graph according to the underway Node-1 in the telemetry message. Specifically, firstly, a neighbor node s2 corresponding to the next hop of the path p1 is found in the neighbor node of the path p1 by means of the directed graph, and then the following information s2 { < p1, md-1> } (storage process) is added in the table entry corresponding to the node s1 in the directed graph, which means that the nodes s1 and s2 are two nodes passing through the path p1 in sequence, and the underway link information (forwarding delay, queue length, ingress and egress ports, etc.) when passing through the node s1 is recorded in the md-1. In this way, each node subsequent to path p1 is processed in turn until the next hop is a virtual machine.
S5042, according to the source node and the second path serial number, determining the next node in the directed graph in sequence, and storing the link information in the directed graph and the hash table.
The same manner as in S5041, the neighbor node corresponding to the next hop of the path is found in the neighbor node by means of the directed graph, and then the Underlay link information (forwarding delay, queue length, ingress and egress ports, etc.) when the relevant information passes through the node is added in the table entry corresponding to the node in the directed graph is recorded in md-1. In this way, each node subsequent to the second path is processed in turn until the next hop is a virtual machine.
For example, the node s1 records the following information in the directed graph: s2 { < p1, md-1>, < p2, md-2> }, which indicates that there are two links between the nodes s1 and s2 with sequence numbers divided into p1 and p2, and the link states of these two links when passing through the node s1 are recorded in md-1 and md-2, respectively.
In this embodiment, the storage algorithm is used to store the data associated with the Overlay and the Underlay in the cloud computing network into the hash table and the directed graph. The method can not only record the associated data completely, but also process the situation that a single pair of Overlay virtual machines are associated with a plurality of Underlay links, and also process the situation that a single Underlay device is associated with a plurality of pairs of Overlay virtual machines, and meanwhile, can also reduce the consumption of storage space.
The following is a data query method in the data processing method provided in this embodiment, as shown in fig. 6, including:
s601, acquiring a data query request.
S602, judging the query type according to the data query request.
The query types comprise a virtual machine identification query type of an Overlay layer, a device identification query type of an Underlay layer and a path sequence number query type of an Underlay layer link. I.e. according to the virtual machine identification of the Overlay layer, the device identification of the Underlay layer or the path sequence number of the Underlay layer link. It should be noted that, since the above description has described that the related data is stored in the hash table and the directed graph when introducing the system architecture, it can be seen that one information in the three of the virtual machine identifier of the Overlay layer, the device identifier of the Underlay layer, and the path sequence number of the link of the Underlay layer can be queried by the hash table and the directed graph. The following steps are specific refinement processes based on the thought.
And S6031, if the virtual machine identifier of the Overlay layer inquires about the type, searching the number of corresponding underway links, the path sequence number and the source node in the hash table based on the virtual machine identifier. And then proceeds to S6041.
S6041, starting from a source node by utilizing a directed graph, traversing all nodes on each underway link in sequence to obtain link information of each link.
The query algorithm firstly uses the IP address of the Overlay virtual machine as a key word to search the number of the Underlay links corresponding to the pair of virtual machines, the corresponding serial numbers and the source nodes in the directed graph in the hash table. If k underway links with serial numbers p1, p2, …, pk and source nodes s1, s2, … and sk exist, the query algorithm first searches the data of the 1 st link p 1: by means of the directed graph, firstly, in the source node s1, the sx: { < p1, md-1> }, which indicates that the underway device of the link p1 after s1 is sx, and the state information (device ID, forwarding delay, queue length, ingress and egress ports, etc.) when the two devices communicate is recorded in md-1; then, the next hop sy of the link p1 and state information md-2 when sx communicates with sy are queried in the second node sx; next, each node on link p1 is processed in this way until the next hop is a virtual machine.
And S6032, if the device identifier query type is the device identifier query type of the underway layer, finding a corresponding node in the directed graph based on the device identifier, and determining link information of all underway links passing through the node. And then proceeds to S6042.
S6042, searching the Overlay virtual machine identification corresponding to each underway link in the hash table.
The query algorithm firstly finds the corresponding node in the directed graph according to the ID of the Underray node provided in the input data, then obtains the serial numbers p1, p2, … and pk of all Underray links passing through the node by means of the directed graph, and then searches the hash table for the Overlay virtual machines VM Pair-1, VM Pair-2, … and VM Pair-k corresponding to the k Underray links respectively, and takes the two as the return data. Note that, since the lookup key of the hash table is the IP address of the Overlay virtual machine, a traversal manner is required to be used for looking up the Overlay virtual machine according to the Underlay link sequence number.
In addition, although the data of each underway link is not returned here, after the user obtains the Overlay virtual machine address corresponding to each link, the user may obtain the data of the specific link through a query method, so as to mainly reduce communication overhead.
S6033, if the path sequence number of the link of the Underlay layer inquires the type, searching the virtual machine identification of the corresponding Underlay layer in the hash table based on the path sequence number. And then proceeds to S6043.
S6043, utilizing the virtual machine identification, finding a source node in the directed graph, and traversing from the source node to obtain the link information of each underway link corresponding to the source node.
Firstly, according to the underway link serial number, the query algorithm performs traversal in the hash table to find out the corresponding Overlay virtual machine VM Pair, and takes the Overlay virtual machine VM Pair as the first part of returned data; then, taking the IP of the virtual machine as a keyword to hash in a hash table to obtain a source node s1 of the directed graph of the underway link; finally, traversing from the node s1 in the directed graph in the above manner, and adding the state information of each passed node to the VM Pair successively to be used as return data.
It is additionally described that, in this embodiment, the target data, that is, the returned data, which includes, but is not limited to, virtual machine identification and/or Underlay link information of the Overlay layer, may also include status information of each node, etc., and the data specifically required to be returned may be determined according to the actual situation.
In this embodiment, when the associated data of the Overlay and the Underlay in the cloud computing network is queried, the data of the Underlay link is obtained on the premise of supporting the Overlay virtual machine of the given cloud computing network, and the data of the Overlay virtual machine is also obtained on the premise of supporting the Underlay link or the equipment. The data processing method in the related art can only obtain corresponding single Underray link information on the premise of giving the address of the Overlay virtual machine in the cloud computing network, and cannot obtain the Overlay data from the Underray, so that the query function is very limited.
Finally, there are two cases of updating the data in the data processing method provided in this embodiment, namely, updating the corresponding Overlay data when the Overlay layer changes, and updating the corresponding Overlay data when the Overlay layer changes. Specifically, the first case of the update algorithm is used for refreshing state information of 1 or more underway links corresponding to a pair of Overlay virtual machines; the second case is used to re-associate all Overlay virtual machines carried on a node of the Underlay link when the node changes (downtime, port failure, etc.).
In the first case, after receiving a request for refreshing the data of the underway links associated with the Overlay virtual machine, the update algorithm first requires the telemetry server to send in-band telemetry messages to obtain the latest state information of the underway links; then, it is determined whether the nodes of these underway links have changed: if the path is changed (the nodes are increased or decreased), the information of the source link is firstly erased in the directed graph, and then a new link is added to the directed graph. The purpose of this is to achieve incremental updating, i.e. multiplexing the original information as much as possible, to speed up the updating.
In the second case, the update algorithm performs the principle of deleting old data and re-adding new data after knowing the changed underway node. Firstly, obtaining sequence numbers of all underway links carried by the node in the directed graph, and then, for each underway link, adopting the following operations:
(1) Erasing the record of the link in the directed graph according to the underway link sequence number;
(2) Obtaining the IP address of the Overlay virtual machine in the hash table;
(3) Notifying a telemetry server to re-measure the latest data of the underway link corresponding to the pair of Overlay virtual machines;
(4) And recording the newly obtained underway link data into the directed graph.
In this embodiment, the refreshing of data of 1 or more Underlay links corresponding to the Overlay virtual machine is supported, and the refreshing of data of all Overlay virtual machines carried on an Underlay node when the node changes is also supported. However, the related art does not consider variability of Overlay and Underlay associated data in the cloud computing network, i.e., consider the Overlay and Underlay associated data as unchanged. The attributes of elastic shrinkage, resource sharing and the like inherent in the cloud computing network naturally cause frequent changes of Overlay and Underlay. Therefore, the associated data of the Overlay and the underway in the cloud computing network needs to be updated quickly.
Through the embodiment, the method for storing, inquiring and updating the Overlay and Underlay associated data in the cloud computing network can not only completely record the association mode of the Overlay and Underlay in the cloud computing network, but also support the rapid inquiry and updating of the associated data, can provide enough basis for operation and maintenance monitoring of the cloud computing network, and has wide application prospect. Cloud-based data center resource pool meets the requirements of network multiplexing and Yun Nazi source isolation, but greatly aggravates the difficulty of network management and control. Once information such as Overlay or Underlay network congestion, silent faults and the like is monitored or reported by a user, an administrator can quickly locate the root cause of the faults by virtue of the association relationship between Overlay and Underlay. Therefore, the data processing method provided by the embodiment can correlate the data of the cloud computing network Overlay and the data of the underway and support quick query and update.
Further, as a specific implementation of the method shown in fig. 1 to fig. 6, the present embodiment provides a data processing apparatus, as shown in fig. 7, including: an acquisition unit 71, an extraction unit 72, a processing unit 73.
An acquisition unit 71 configured to acquire the associated data request;
An extracting unit 72 configured to extract a virtual machine identification in the associated data request;
and a processing unit 73, configured to store the associated data of the Overlay and the Underlay by using a hash table and a directed graph based on the virtual machine identification.
In a specific application scenario, the processing unit 73 is specifically configured to search, based on the virtual machine identifier, whether a storage record of the virtual machine exists in a hash table; if not, creating a new table entry in a hash table by taking the virtual machine identifier as a key, and determining a source node and a first path serial number of a corresponding underway link; determining a next node in sequence according to the source node and the first path serial number by utilizing the directed graph, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node;
if yes, creating a new path for the table item corresponding to the virtual machine identifier in the hash table, and determining a source node and a second path serial number of the corresponding underway link; and determining a next node in sequence through the source node and the second path sequence number by utilizing the directed graph, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node.
In a specific application scenario, the processing unit 73 is specifically further configured to determine a query type after receiving the query data request; and searching target information in the hash table and the directed graph according to the query type.
In a specific application scenario, the processing unit 73 is specifically further configured to obtain a virtual machine identifier of the Overlay layer, and search the hash table and the directed graph for at least one piece of underway link information corresponding to the virtual machine identifier; or, acquiring the equipment identifier of the Underlay layer, and searching the Underlay link information corresponding to the equipment identifier and the virtual machine identifier of the corresponding Overlay layer in the hash table and the directed graph; or, obtaining the path sequence number of the link of the underway layer, and searching the underway link information corresponding to the path sequence number and the virtual machine identification of the corresponding Overlay layer in the hash table and the directed graph.
In a specific application scenario, the processing unit 73 is specifically further configured to search, based on the virtual machine identifier of the Overlay layer, the number of Underlay links, the path sequence number and the source node corresponding to the virtual machine identifier in the hash table; and traversing all nodes on each underway link in turn by utilizing the directed graph from the source node, and returning the traversed link information as the target information until the next node is a virtual machine node.
In a specific application scenario, the processing unit 73 is specifically further configured to find, based on the device identifier of the underway layer, a node corresponding to the device identifier in the directed graph, and determine link information of all underway links passing through the node; searching an Overlay virtual machine identifier corresponding to each underway link in the hash table; and returning the link information of all the underway links passing through the node and the Overlay virtual machine identification corresponding to each underway link as the target information.
In a specific application scenario, the processing unit 73 is specifically further configured to search the hash table for the virtual machine identifier of the corresponding Overlay layer based on the path sequence number of the link of the underway layer; determining a source node of the virtual machine identifier in the directed graph by utilizing the virtual machine identifier; traversing from the source node in the directed graph to obtain link information of each underway link corresponding to the source node; and returning the virtual machine identification and the link information of each underway link as the target information.
In a specific application scenario, the processing unit 73 is specifically further configured to update the underway link to be updated in the directed graph based on the link information of the underway link to be updated after the update data request is acquired; or acquiring an underway node with the node state changed, and updating the association relation between the underway node and the corresponding virtual machine identifier.
In a specific application scenario, the processing unit 73 is specifically further configured to obtain path sequence numbers of all underway links corresponding to the underway nodes with changed node states in the directed graph; deleting link information corresponding to each underway link in the directed graph according to the path sequence number; obtaining virtual machine identifiers of an Overlay layer from the hash table, and obtaining link information corresponding to a currently corresponding underway link based on the virtual machine identifiers; and storing the link information corresponding to the currently corresponding underway link into the directed graph.
It should be noted that, for other corresponding descriptions of each functional unit related to the data processing apparatus provided in this embodiment, reference may be made to corresponding descriptions in fig. 1 to fig. 6, and no further description is given here.
Based on the above-described methods shown in fig. 1 to 6, correspondingly, the present embodiment further provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor, implements the above-described methods shown in fig. 1 to 6.
Based on such understanding, the technical solution of the present application may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.), and includes several instructions for causing a computer device (may be a personal computer, a server, or a network device, etc.) to perform the method of each implementation scenario of the present application.
Based on the method shown in fig. 1 to 6 and the virtual device embodiment shown in fig. 7, in order to achieve the above object, the embodiment of the present application further provides an electronic device, which may be configured on a computer side or the like, where the device includes a storage medium and a processor; a storage medium storing a computer program; a processor for executing a computer program to implement the method as described above and shown in fig. 1 to 6.
Based on the method shown in fig. 1 to 6 and the virtual device embodiment shown in fig. 7, in order to achieve the above object, the embodiment of the present application further provides a chip, including one or more interface circuits and one or more processors; the interface circuit is configured to receive a signal from a memory of an electronic device and to send the signal to the processor, the signal including computer instructions stored in the memory; the computer instructions, when executed by the processor, cause the electronic device to perform the methods described above and illustrated in fig. 1-6.
Optionally, the entity device may further include a user interface, a network interface, a camera, a Radio Frequency (RF) circuit, a sensor, an audio circuit, a WI-FI module, and so on. The user interface may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), etc., and the optional user interface may also include a USB interface, a card reader interface, etc. The network interface may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface), etc.
It will be appreciated by those skilled in the art that the above-described physical device structure provided in this embodiment is not limited to this physical device, and may include more or fewer components, or may combine certain components, or may be a different arrangement of components.
The storage medium may also include an operating system, a network communication module. The operating system is a program that manages the physical device hardware and software resources described above, supporting the execution of information handling programs and other software and/or programs. The network communication module is used for realizing communication among all components in the storage medium and communication with other hardware and software in the information processing entity equipment.
From the above description of the embodiments, it will be apparent to those skilled in the art that the present application may be implemented by means of software plus necessary general hardware platforms, or may be implemented by hardware. By applying the scheme of the embodiment, the association mode of the Overlay and the Underlay in the cloud computing network can be completely recorded, rapid query and update of association data are supported, sufficient basis can be provided for operation and maintenance monitoring of the cloud computing network, and the application prospect is wide. Cloud-based data center resource pool meets the requirements of network multiplexing and Yun Nazi source isolation, but greatly aggravates the difficulty of network management and control. Once information such as Overlay or Underlay network congestion, silent faults and the like is monitored or reported by a user, an administrator can quickly locate the root cause of the faults by virtue of the association relationship between Overlay and Underlay. Therefore, the data processing method provided by the embodiment can correlate the data of the cloud computing network Overlay and the data of the underway and support quick query and update.
It should be noted that in this document, relational terms such as "first" and "second" and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The foregoing is merely a specific embodiment of the application to enable one skilled in the art to understand or practice the application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown and described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (11)
1. A method of data processing, comprising:
acquiring an associated data request;
extracting a virtual machine identifier from the associated data request, wherein the virtual machine identifier comprises a pair of virtual machine addresses of an Overlay layer;
based on the virtual machine identification, storing the associated data of the Overlay and the Underlay by utilizing a hash table and a directed graph;
based on the virtual machine identifier, storing associated data of the Overlay and the Underlay by using a hash table and a directed graph, wherein the method comprises the following steps:
searching whether a storage record of the virtual machine exists in a hash table based on the virtual machine identification;
if not, creating a new table entry in a hash table by taking the virtual machine identifier as a key, and determining a source node and a first path serial number of a corresponding underway link; determining a next node in sequence according to the source node and the first path serial number by utilizing the directed graph, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node; wherein one node represents a single underway-level device;
if yes, creating a new path for the table item corresponding to the virtual machine identifier in the hash table, and determining a source node and a second path serial number of the corresponding underway link; determining a next node in sequence through the source node and the second path sequence number by utilizing the directed graph, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node;
Wherein the association data includes: and the virtual machine identifies the path sequence numbers of all the corresponding underway links and the source node of each underway link in the directed graph.
2. The method according to claim 1, wherein the method further comprises:
after receiving the query data request, determining the query type;
and searching target information in the hash table and the directed graph according to the query type.
3. The method of claim 2, wherein the query types include an Overlay layer virtual machine identification query type, an Underlay layer device identification query type, and an Underlay layer link path sequence number query type; the target information comprises virtual machine identification and/or underway link information of an Overlay layer;
searching target information in the hash table and the directed graph according to the query type, wherein the searching comprises the following steps:
obtaining a virtual machine identifier of an Overlay layer, and searching at least one piece of underway link information corresponding to the virtual machine identifier in a hash table and a directed graph; or alternatively, the first and second heat exchangers may be,
acquiring an equipment identifier of an Underlay layer, and searching Underlay link information corresponding to the equipment identifier and a virtual machine identifier of a corresponding Overlay layer in a hash table and a directed graph; or alternatively, the first and second heat exchangers may be,
And acquiring a path sequence number of the link of the underway layer, and searching the underway link information corresponding to the path sequence number and the virtual machine identification of the corresponding Overlay layer in the hash table and the directed graph.
4. The method of claim 3, wherein the obtaining the virtual machine identifier of the Overlay layer, searching the hash table and the directed graph for at least one piece of Underlay link information corresponding to the virtual machine identifier, includes:
searching the number of underway links, path sequence numbers and source nodes corresponding to the virtual machine identifiers in a hash table based on the virtual machine identifiers of the Overlay layers;
and traversing all nodes on each underway link in turn by utilizing the directed graph from the source node, and returning the traversed link information as the target information until the next node is a virtual machine node.
5. The method of claim 3, wherein the obtaining the device identifier of the Underlay layer, searching the hash table and the directed graph for Underlay link information corresponding to the device identifier and the virtual machine identifier of the corresponding Underlay layer, includes:
based on the equipment identifier of the underway layer, finding a node corresponding to the equipment identifier in a directed graph, and determining link information of all underway links passing through the node;
Searching an Overlay virtual machine identifier corresponding to each underway link in the hash table;
and returning the link information of all the underway links passing through the node and the Overlay virtual machine identification corresponding to each underway link as the target information.
6. The method of claim 3, wherein the obtaining the path sequence number of the link of the Underlay layer, searching the hash table and the directed graph for Underlay link information corresponding to the path sequence number and the virtual machine identifier of the corresponding Underlay layer, includes:
searching a virtual machine identifier of a corresponding Overlay layer in a hash table based on a path serial number of the link of the Underlay layer;
determining a source node of the virtual machine identifier in the directed graph by utilizing the virtual machine identifier;
traversing from the source node in the directed graph to obtain link information of each underway link corresponding to the source node;
and returning the virtual machine identification and the link information of each underway link as the target information.
7. The method according to claim 1, wherein the method further comprises:
after acquiring an update data request, updating the underway link to be updated in the directed graph based on the link information of the underway link to be updated; or alternatively, the first and second heat exchangers may be,
And acquiring an Underlay node with the node state changed, and updating the association relation between the Underlay node and the corresponding virtual machine identifier.
8. The method of claim 7, wherein the obtaining the Underlay node whose node state changes updates an association relationship between the Underlay node and a corresponding virtual machine identifier, comprising:
obtaining path sequence numbers of all underway links corresponding to underway nodes with changed node states in the directed graph;
deleting link information corresponding to each underway link in the directed graph according to the path sequence number;
obtaining virtual machine identifiers of an Overlay layer from the hash table, and obtaining link information corresponding to a currently corresponding underway link based on the virtual machine identifiers;
and storing the link information corresponding to the currently corresponding underway link into the directed graph.
9. A data processing apparatus, comprising:
an acquisition unit configured to acquire an associated data request;
an extracting unit configured to extract a virtual machine identifier in the associated data request, the virtual machine identifier including a pair of virtual machine addresses of an Overlay layer;
The processing unit is configured to store the associated data of the Overlay and the Underlay by utilizing a hash table and a directed graph based on the virtual machine identification;
based on the virtual machine identifier, storing associated data of the Overlay and the Underlay by using a hash table and a directed graph, wherein the method comprises the following steps:
searching whether a storage record of the virtual machine exists in a hash table based on the virtual machine identification;
if not, creating a new table entry in a hash table by taking the virtual machine identifier as a key, and determining a source node and a first path serial number of a corresponding underway link; determining a next node in sequence according to the source node and the first path serial number by utilizing the directed graph, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node; wherein one node represents a single underway-level device;
if yes, creating a new path for the table item corresponding to the virtual machine identifier in the hash table, and determining a source node and a second path serial number of the corresponding underway link; determining a next node in sequence through the source node and the second path sequence number by utilizing the directed graph, recording link information when passing through the next node, and storing the link information into the directed graph and the hash table until the determined next node is a virtual machine node;
Wherein the association data includes: and the virtual machine identifies the path sequence numbers of all the corresponding underway links and the source node of each underway link in the directed graph.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the method of any one of claims 1 to 8.
11. An electronic device comprising a storage medium, a processor and a computer program stored on the storage medium and executable on the processor, characterized in that the processor implements the method of any one of claims 1 to 8 when executing the computer program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311176536.4A CN116938753B (en) | 2023-09-13 | 2023-09-13 | Data processing method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311176536.4A CN116938753B (en) | 2023-09-13 | 2023-09-13 | Data processing method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116938753A CN116938753A (en) | 2023-10-24 |
| CN116938753B true CN116938753B (en) | 2023-12-29 |
Family
ID=88382801
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311176536.4A Active CN116938753B (en) | 2023-09-13 | 2023-09-13 | Data processing method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116938753B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013112634A1 (en) * | 2012-01-23 | 2013-08-01 | The Regents Of The University Of California | System and method for implementing transactions using storage device support for atomic updates and flexible interface for managing data logging |
| CN108600321A (en) * | 2018-03-26 | 2018-09-28 | 中国科学院计算技术研究所 | A kind of diagram data storage method and system based on distributed memory cloud |
| CN112511432A (en) * | 2020-11-12 | 2021-03-16 | 中国科学院计算技术研究所 | Method and system for configuring and transmitting virtualization SFC (Small form factor) route of Overlay network |
| CN112702330A (en) * | 2020-12-21 | 2021-04-23 | 网络通信与安全紫金山实验室 | Lightweight in-band network telemetry method and device for Overlay network and storage medium |
| CN112866075A (en) * | 2020-12-21 | 2021-05-28 | 网络通信与安全紫金山实验室 | In-band network telemetering method, system and related device for Overlay network |
| CN113660158A (en) * | 2021-08-05 | 2021-11-16 | 北京网聚云联科技有限公司 | Method, server and storage medium for scheduling dynamic routing of Overlay virtual link |
| CN114844833A (en) * | 2022-03-30 | 2022-08-02 | 阿里云计算有限公司 | Message processing method and system, storage medium and computer terminal |
| CN115987751A (en) * | 2023-03-20 | 2023-04-18 | 阿里云计算有限公司 | Cloud network architecture and method for maintaining entity objects with dependencies |
-
2023
- 2023-09-13 CN CN202311176536.4A patent/CN116938753B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013112634A1 (en) * | 2012-01-23 | 2013-08-01 | The Regents Of The University Of California | System and method for implementing transactions using storage device support for atomic updates and flexible interface for managing data logging |
| CN108600321A (en) * | 2018-03-26 | 2018-09-28 | 中国科学院计算技术研究所 | A kind of diagram data storage method and system based on distributed memory cloud |
| CN112511432A (en) * | 2020-11-12 | 2021-03-16 | 中国科学院计算技术研究所 | Method and system for configuring and transmitting virtualization SFC (Small form factor) route of Overlay network |
| CN112702330A (en) * | 2020-12-21 | 2021-04-23 | 网络通信与安全紫金山实验室 | Lightweight in-band network telemetry method and device for Overlay network and storage medium |
| CN112866075A (en) * | 2020-12-21 | 2021-05-28 | 网络通信与安全紫金山实验室 | In-band network telemetering method, system and related device for Overlay network |
| CN113660158A (en) * | 2021-08-05 | 2021-11-16 | 北京网聚云联科技有限公司 | Method, server and storage medium for scheduling dynamic routing of Overlay virtual link |
| CN114844833A (en) * | 2022-03-30 | 2022-08-02 | 阿里云计算有限公司 | Message processing method and system, storage medium and computer terminal |
| CN115987751A (en) * | 2023-03-20 | 2023-04-18 | 阿里云计算有限公司 | Cloud network architecture and method for maintaining entity objects with dependencies |
Non-Patent Citations (1)
| Title |
|---|
| 结构化P2P中覆盖网络拓扑匹配的研究;朱丹 等;微计算机应用(06);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116938753A (en) | 2023-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10402293B2 (en) | System for virtual machine risk monitoring | |
| WO2018040530A1 (en) | Method and apparatus for determining virtual machine migration | |
| CN106982236B (en) | Information processing method, device and system | |
| CN106911524B (en) | HA implementation method and device | |
| CN107547349B (en) | Virtual machine migration method and device | |
| CN108462594B (en) | Virtual private network and rule table generation method, device and routing method | |
| US9331932B2 (en) | Network system | |
| CN107317832B (en) | Message forwarding method and device | |
| WO2014022264A1 (en) | High-speed content routing | |
| CN108199967B (en) | Route processing method and device | |
| US8984160B2 (en) | Apparatus and method for storing a port number in association with one or more addresses | |
| CN107645402B (en) | Route management method and device | |
| US10904130B2 (en) | Method for scalable computer network partitioning | |
| CN104836738A (en) | Router hardware item resource management method and device, and network equipment | |
| US20130124913A1 (en) | Management device and management method | |
| CN116938753B (en) | Data processing method and device and electronic equipment | |
| CN116055446B (en) | Cross-network message forwarding method, electronic equipment and machine-readable storage medium | |
| CN104702508A (en) | Method and system for dynamically updating table items | |
| CN111010362B (en) | Monitoring method and device for abnormal host | |
| WO2016173196A1 (en) | Method and apparatus for learning address mapping relationship | |
| CN114172853B (en) | Configuration method and device of traffic forwarding and bare computer server | |
| US9319271B2 (en) | Management device and management method | |
| US20170154004A1 (en) | Information processing apparatus and method for generating coupling information | |
| CN108600075B (en) | Fault processing method and device | |
| JP2012203421A (en) | Information processing method, management server and management program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |