Request transmission method and device, equipment, storage medium and program product

Abstract

The invention relates to the technical field of terminal and service testing, provides a request transmission method, device and equipment, a storage medium and a program product, and can monitor and diagnose flow of deep data such as a flow table in a network. According to the method, link tracking aiming at the flow table rule is carried out on different virtual machines according to the network card granularity; analyzing the link tracking data to obtain a flow table rule; comparing the flow table rule with a preset flow table rule pre-configured in a network card, and determining an abnormal flow table rule in the preset flow table rule; after optimizing the abnormal flow table rule, according to the optimized flow table rule, determining a transmission link for transmitting the target request from the source virtual machine to the target virtual machine; and transmitting the target request from the source virtual machine to the target virtual machine according to the transmission link.

Description

Technical Field

[0001] The present application relates to the technical field of terminal and service testing, and in particular to a request transmission method, apparatus, computer equipment, storage medium and computer program product. Background Art

[0002] Trace link tracing is a key technology for monitoring and diagnosis in microservice architecture and distributed systems. It associates call events across services by generating and passing a unique identifier (TraceId) on the service call link, thereby visualizing the flow of requests in the system.

[0003] However, traditional link tracking technology is still immature, and the monitoring and diagnosis of the flow of deep-level data such as flow tables in the network is still insufficient. As a result, when locating online network problems, the flow of data packets is unclear, and the troubleshooting time is long and the cost is high. Summary of the invention

[0004] Based on this, it is necessary to provide a request transmission method, apparatus, computer device, storage medium and computer program product to address the above technical issues.

[0005] The present application provides a request transmission method, the method comprising:

[0006] Perform link tracking for different virtual machines based on flow table rules at the NIC granularity;

[0007] Parse the link tracking data to obtain the flow table rules;

[0008] Compare the flow table rules with the preset flow table rules preconfigured in the network card to determine abnormal flow table rules in the preset flow table rules;

[0009] After optimizing the abnormal flow table rule, determining a transmission link for transmitting the target request from the source virtual machine to the target virtual machine according to the optimized flow table rule;

[0010] The target request is transmitted from the source virtual machine to the target virtual machine according to the transmission link.

[0011] In one embodiment, the flow table rule is compared with a preset flow table rule preconfigured in the network card to determine an abnormal flow table rule in the preset flow table rule, including:

[0012] Compare the flow table rules with the flow table rules pre-configured on the network card to determine inconsistent flow table rules in the pre-configured flow table rules;

[0013] According to the traffic observation results of each network card, an abnormal flow table rule is determined from the inconsistent flow table rules.

[0014] In one embodiment, link tracking data is parsed to obtain flow table rules, including:

[0015] Parsing the link tracking data to obtain a parsing result;

[0016] Performing feature extraction processing on the analysis result to obtain a feature extraction result;

[0017] According to the feature extraction result, a flow table rule is obtained.

[0018] In one embodiment, determining a transmission link for transmitting a target request from a source virtual machine to a target virtual machine according to an optimized flow table rule includes:

[0019] According to the optimized flow table rules, determine the nodes that each target request in the target request needs to pass through when it is transmitted from the source virtual machine to the target virtual machine, and form a node set;

[0020] Dividing the node set into an inter-node scheduling group and an intra-node scheduling group;

[0021] According to the inter-node scheduling group and the intra-node scheduling group, a transmission link for transmitting the target request from the source virtual machine to the target virtual machine is obtained.

[0022] In one embodiment, the node set includes a number of routers, a number of switches, a number of nodes where virtual machine pods are located, and a number of nodes where network cards are located; the node set is divided into an inter-node scheduling group and an intra-node scheduling group, including:

[0023] Aggregate several routers and several switches to obtain different inter-node scheduling groups;

[0024] The nodes where several virtual machine pods are located and the nodes where several network cards are located are aggregated to obtain different intra-node scheduling groups.

[0025] In one embodiment, obtaining a transmission link for transmitting a target request from a source virtual machine to a target virtual machine according to an inter-node scheduling group and an intra-node scheduling group includes:

[0026] In the conventional central node scheduling method, an initial transmission link for transmitting the target request from the source virtual machine to the target virtual machine is determined in the inter-node scheduling group and the intra-node scheduling group;

[0027] If the number of nodes of the initial transmission link exceeds a node number threshold, the initial transmission link is optimized by using an ant colony algorithm to obtain a transmission link.

[0028] The present application provides a request transmission device, the device comprising:

[0029] Link tracking module, used to track links of different virtual machines based on flow table rules at the granularity of network cards;

[0030] The parsing processing module is used to parse the link tracking data and obtain the flow table rules;

[0031] An abnormal rule determination module is used to compare the flow table rule with the preset flow table rule preconfigured in the network card to determine the abnormal flow table rule in the preset flow table rule;

[0032] A link determination module, configured to determine, after optimizing the abnormal flow table rule, a transmission link for transmitting the target request from the source virtual machine to the target virtual machine according to the optimized flow table rule;

[0033] The transmission processing module is used to transmit the target request from the source virtual machine to the target virtual machine according to the transmission link.

[0034] The present application provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the above method.

[0035] The present application provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program is executed by a processor to execute the above method.

[0036] The present application provides a computer program product, on which a computer program is stored, and the computer program is executed by a processor to perform the above method.

[0037] The above-mentioned request transmission method, device, computer equipment, storage medium and computer program product perform link tracking for flow table rules at the granularity of the network card for different virtual machines; parse the link tracking data to obtain the flow table rules; compare the flow table rules with the preset flow table rules preconfigured in the network card to determine the abnormal flow table rules in the preset flow table rules; after optimizing the abnormal flow table rules, determine the transmission link for the target request to be transmitted from the source virtual machine to the target virtual machine according to the optimized flow table rules; according to the transmission link, transmit the target request from the source virtual machine to the target virtual machine. The present application performs link tracking for different virtual machines at the granularity of the network card, and can monitor and diagnose the flow of deep-level data such as flow tables in the network. When locating online network problems, the flow destination of the data packet can be more clearly defined, shortening the troubleshooting time. In addition, after determining the abnormal flow table rules in the preset flow table rules, the abnormal flow table rules are optimized to determine a shorter transmission link for the target request to be transmitted from the source virtual machine to the target virtual machine, thereby avoiding the slow implementation of some functions due to the long transmission link of the request. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the related technologies, the drawings required for use in the embodiments or the related technical descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0039] Figure 1 A schematic diagram of a flow chart of a request transmission method in one embodiment;

[0040] Figure 2 A schematic diagram of the distribution of network cards in a layer 2 network and a layer 3 network in one embodiment;

[0041] Figure 3 A schematic diagram of a process for obtaining flow table rules in an embodiment;

[0042] Figure 4 A structural block diagram of a request transmission device in one embodiment;

[0043] Figure 5 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0044] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0045] The request transmission method provided in the present application can be executed by a computer device. The method includes: Figure 1 The steps shown are:

[0046] Step S101, performing link tracking for flow table rules on different virtual machines at the granularity of network cards;

[0047] Each virtual machine is equipped with a corresponding network card. The network card of the source virtual machine can be called the source network card, and the network card of the target virtual machine can be called the destination network card. Figure 2 The source network card includes a bridge network card located in the layer 2 network and a vpc (Virtual Private Cloud) network card located in the layer 3 network; the destination network card includes a bridge network card located in the layer 2 network and a vpc network card located in the layer 3 network.

[0048] Flow table rules are used to define the method and path of request forwarding.

[0049] When performing link tracking for flow table rules on virtual machines at the granularity of network cards, link tracking commands can be designed in the Layer 2 and Layer 3 networks to track links from Layer 2 to Layer 2, Layer 2 to Layer 3, and Layer 3 to Layer 3.

[0050] Step S102: parse the link tracking data to obtain flow table rules.

[0051] After link tracking, link tracking data can be obtained and parsed. The extracted data may include: priority, matching source address, destination address, port number, protocol type, actions such as forwarding, discarding, modifying packet header, counters, timestamps, logical flow tables, pipelines, DHCP management and security group policies, etc. DHCP is the full name of Dynamic Host Configuration Protocol in English.

[0052] Based on the extracted data, flow table rules are formed. Flow table rules are used to define the method and path of request forwarding.

[0053] Step S103, comparing the flow table rules with the preset flow table rules preconfigured in the network card, and determining abnormal flow table rules in the preset flow table rules.

[0054] After obtaining the flow table rules through link tracking, the flow table rules can be compared for consistency with the preset flow table rules pre-configured in the network card. If a preset flow table rule does not match the flow table rule, it is likely that the preset flow table rule is abnormal, thereby determining the abnormal flow table rule in the preset flow table rules.

[0055] Step S104: After optimizing the abnormal flow table rules, a transmission link for transmitting the target request from the source virtual machine to the target virtual machine is determined according to the optimized flow table rules.

[0056] After the abnormal flow table rules in the preset flow table rules, the abnormal flow table rules can be optimized, so that the preset flow table rules configured in the network card are optimized flow table rules. According to the optimized flow table rules, the transmission link for transmitting the target request from the source virtual machine to the target virtual machine is determined.

[0057] Step S105 : transmitting the target request from the source virtual machine to the target virtual machine according to the transmission link.

[0058] In the above-mentioned request transmission method, link tracking for flow table rules is performed for different virtual machines at the granularity of the network card; the link tracking data is parsed to obtain the flow table rules; the flow table rules are compared with the preset flow table rules preconfigured in the network card to determine the abnormal flow table rules in the preset flow table rules; after optimizing the abnormal flow table rules, the transmission link for the target request to be transmitted from the source virtual machine to the target virtual machine is determined according to the optimized flow table rules; according to the transmission link, the target request is transmitted from the source virtual machine to the target virtual machine. The present application performs link tracking for different virtual machines at the granularity of the network card, and can monitor and diagnose the flow of deep-level data such as flow tables in the network. When locating online network problems, the flow destination of the data packet can be more clearly understood, shortening the troubleshooting time. In addition, after determining the abnormal flow table rules in the preset flow table rules, the abnormal flow table rules are optimized to determine a shorter transmission link for the target request to be transmitted from the source virtual machine to the target virtual machine, thereby avoiding the slow implementation of some functions due to the long transmission link of the request.

[0059] In one embodiment, the flow table rules are compared with the preset flow table rules preconfigured in the network card to determine the abnormal flow table rules in the preset flow table rules, including:

[0060] The flow table rules are compared with the flow table rules pre-configured in the network card to determine inconsistent flow table rules in the pre-configured flow table rules; according to the flow observation results of each network card, abnormal flow table rules are determined in the inconsistent flow table rules.

[0061] A network traffic observation tool can be set up in advance on each network card. The flow table rules obtained by link tracking can be compared with the flow table rules pre-configured on the network card for consistency to determine whether the flow table rules obtained by link tracking are consistent with the flow table rules pre-configured on the network card; based on the consistency comparison results, the inconsistent flow table rules in the pre-configured flow table rules can be determined.

[0062] Determine a network card with an inconsistent flow table rule preset; obtain the flow observation result of the network card based on the network flow observation tool preset on the network card; determine whether the inconsistent flow table rule is abnormal based on the flow observation result of the network card; if the flow observation result of the network card indicates that the flow observation value of the network card is not within the normal flow range, then it can be determined that the consistent flow table rule is abnormal, and the consistent flow table rule is determined as an abnormal flow table rule; if the flow observation result of the network card indicates that the flow observation value of the network card is within the normal flow range, then it can be determined that the consistent flow table rule is normal, and the consistent flow table rule is not determined as an abnormal flow table rule.

[0063] In one embodiment, the link tracking data is parsed to obtain the flow table rules, including Figure 3 The steps shown are:

[0064] Step S301, parse the link tracking data to obtain the parsing result; step S302, perform feature extraction processing on the parsing result to obtain the feature extraction result; step S303, obtain the flow table rule according to the feature extraction result.

[0065] After obtaining the link tracking data, the link tracking data is parsed to obtain a parsing result, which may include data extracted from the link tracking data, such as priority, matching source address, destination address, port number, protocol type, actions such as forwarding, discarding, modifying packet headers, counters, timestamps, logical flow tables, pipelines, DHCP management and security group policies, etc.

[0066] After obtaining the parsing result, feature extraction processing can be performed on the parsing result to obtain a feature extraction result, and the flow table rules can be obtained based on the information carried in the feature extraction result.

[0067] In one embodiment, determining a transmission link for transmitting a target request from a source virtual machine to a target virtual machine according to an optimized flow table rule includes:

[0068] According to the optimized flow table rules, the nodes that each target request in the target request needs to pass through when transmitted from the source virtual machine to the target virtual machine are determined to form a node set; the node set is divided into an inter-node scheduling group and an intra-node scheduling group; based on the inter-node scheduling group and the intra-node scheduling group, the transmission link for the target request to be transmitted from the source virtual machine to the target virtual machine is obtained.

[0069] After optimizing the preset flow table rules of the gateway, the optimized flow table rules are used to define the optimized request forwarding method and path.

[0070] According to the optimized flow table rules, the nodes that each target request in the target request needs to pass through when transmitted from the source virtual machine to the target virtual machine can be determined to form a node set. Then, the node set can be input into the supervised learning algorithm for clustering to obtain the inter-node scheduling group and the intra-node scheduling group. For example, the supervised learning algorithm is the kmeans algorithm (K-means algorithm).

[0071] After obtaining the inter-node scheduling group and the intra-node scheduling group, a transmission link for transmitting the target request from the source virtual machine to the target virtual machine is determined in the inter-node scheduling group and the intra-node scheduling group.

[0072] In one embodiment, the node set includes a number of routers, a number of switches, a number of nodes where virtual machine pods are located, and a number of nodes where network cards are located; the node set is divided into an inter-node scheduling group and an intra-node scheduling group, including:

[0073] Several routers and switches are aggregated to obtain different inter-node scheduling groups; several nodes where virtual machine pods are located and several nodes where network cards are located are aggregated to obtain different intra-node scheduling groups.

[0074] When the node set includes several routers, several switches, several nodes where virtual machine pods (pod is the smallest basic unit of deployment and management in the container cluster management system) are located, and several nodes where network cards are located, the several routers and several switches can be input into the kmeans algorithm, and the kmeans algorithm clusters the several routers and several switches according to the similarity of routing paths to form scheduling groups between different nodes; the nodes where several virtual machine pods are located and the nodes where several network cards are located can also be input into the kmeans algorithm, and the kmeans algorithm clusters the nodes where several virtual machine pods are located and the nodes where several network cards are located to form scheduling groups within different nodes.

[0075] In one embodiment, obtaining a transmission link for transmitting a target request from a source virtual machine to a target virtual machine according to an inter-node scheduling group and an intra-node scheduling group includes:

[0076] In the previous central node scheduling method, the initial transmission link for transmitting the target request from the source virtual machine to the target virtual machine is determined in the inter-node scheduling group and the intra-node scheduling group; if the number of nodes in the initial transmission link exceeds the node number threshold, the initial transmission link is optimized through the ant colony algorithm to obtain the transmission link.

[0077] After clustering the node set to obtain the inter-node scheduling group and the intra-node scheduling group, the initial transmission link for transmitting the target request from the source virtual machine to the target virtual machine can be determined in the inter-node scheduling group and the intra-node scheduling group in the same manner as the central node scheduling.

[0078] It is determined whether the number of nodes of the initial transmission link exceeds the node number threshold. If not, the initial transmission link can be used as the transmission link. If exceeded, the initial transmission link can be optimized by the ant colony algorithm to obtain the transmission link.

[0079] The process optimized by the ant colony algorithm mainly includes the following aspects:

[0080] (1) Problem definition: The problem of obtaining short transmission links is transformed into a graph theory problem, in which a network topology graph is constructed based on the initial transmission links. The nodes of the network topology graph represent the nodes in the above-mentioned inter-node scheduling group and intra-node scheduling group, the edges represent the links connecting these nodes, and the weights of the edges represent the cost or delay of the links.

[0081] (2) Initialize the ant colony: A certain number of ants are randomly placed in the network topology. Each ant has a starting node and an ending node. The starting node is the node where the ant is currently located, and the ending node is the destination node that the flow table needs to reach.

[0082] (3) Update pheromone concentration: Each ant selects the next node according to the heuristic rule, and then updates the pheromone concentration on the path it passes. The pheromone concentration can be expressed as the pheromone concentration on the link, which represents the possibility of the ant choosing this path. In each iteration, the pheromone concentration is updated according to the path selected by the ant, and the pheromone concentration passing through the path is increased.

[0083] (4) Path selection: Ants select the next node by probability, following the pheromone concentration and heuristic rules. Specifically, when selecting the next node, each ant considers the pheromone concentration and the distance between nodes, and thus selects the node with the shortest transmission link.

[0084] (5) Update the shortest path: When an ant reaches the end node, the shortest path information is updated. After each ant reaches the end node, it updates the shortest path information. If a shorter path is found, the shortest path is updated.

[0085] (6) Adjust pheromone concentration: Update the pheromone concentration according to the ant’s path. The rules for updating the pheromone concentration can be defined according to the specific implementation of the ant colony algorithm.

[0086] In one embodiment, for a large number of concurrent requests, high-priority requests can be scheduled first through the time window so that all nodes can process the request. The load and bandwidth transmission rate of each node are calculated to evaluate the actual usage of the node to balance the processing of requests.

[0087] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0088] Based on the same inventive concept, the embodiment of the present application also provides a request transmission device for implementing the request transmission method involved above. The implementation solution provided by the device to solve the problem is similar to the implementation solution recorded in the above method, so the specific limitations in one or more request transmission device embodiments provided below can refer to the limitations on the request transmission method above, and will not be repeated here.

[0089] In one embodiment, Figure 4 As shown, a request transmission device is provided, comprising:

[0090] The link tracking module 401 is used to perform link tracking for different virtual machines at the granularity of a network card for flow table rules;

[0091] The parsing processing module 402 is used to parse the link tracking data to obtain the flow table rules;

[0092] The abnormal rule determination module 403 is used to compare the flow table rule with the preset flow table rule preconfigured in the network card to determine the abnormal flow table rule in the preset flow table rule;

[0093] A link determination module 404 is used to determine, after optimizing the abnormal flow table rule, a transmission link for transmitting the target request from the source virtual machine to the target virtual machine according to the optimized flow table rule;

[0094] The transmission processing module 405 is used to transmit the target request from the source virtual machine to the target virtual machine according to the transmission link.

[0095] In one embodiment, the abnormal rule determination module 403 is further used to:

[0096] The flow table rules are compared with the flow table rules pre-configured in the network card to determine inconsistent flow table rules in the preset flow table rules; and abnormal flow table rules are determined in the inconsistent flow table rules according to the flow observation results of each network card.

[0097] In one embodiment, the parsing processing module 402 is further used to:

[0098] The link tracking data is parsed to obtain a parsing result; feature extraction processing is performed on the parsing result to obtain a feature extraction result; and a flow table rule is obtained according to the feature extraction result.

[0099] In one embodiment, the link determination module 404 is further configured to:

[0100] According to the optimized flow table rules, the nodes that each target request in the target request needs to pass through when transmitted from the source virtual machine to the target virtual machine are determined to form a node set; the node set is divided into an inter-node scheduling group and an intra-node scheduling group; based on the inter-node scheduling group and the intra-node scheduling group, a transmission link for transmitting the target request from the source virtual machine to the target virtual machine is obtained.

[0101] In one embodiment, the node set includes a number of routers, a number of switches, a number of nodes where virtual machine pods are located, and a number of nodes where network cards are located; the link determination module 404 is further used to:

[0102] Several routers and switches are aggregated to obtain different inter-node scheduling groups; several nodes where virtual machine pods are located and several nodes where network cards are located are aggregated to obtain different intra-node scheduling groups.

[0103] In one embodiment, the link determination module 404 is further configured to:

[0104] In the previous central node scheduling method, an initial transmission link for transmitting the target request from the source virtual machine to the target virtual machine is determined in the inter-node scheduling group and the intra-node scheduling group; if the number of nodes in the initial transmission link exceeds the node number threshold, the initial transmission link is optimized through the ant colony algorithm to obtain the transmission link.

[0105] Each module in the above-mentioned request transmission device can be implemented in whole or in part by software, hardware or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute operations corresponding to each module above.

[0106] In an exemplary embodiment, a computer device is provided, the internal structure of which can be shown as follows: Figure 5As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store data involved in the above method. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a request transmission method is implemented.

[0107] Those skilled in the art will understand that Figure 5 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0108] In one embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps in the above-mentioned various method embodiments when executing the computer program.

[0109] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0110] In one embodiment, a computer program product is provided, on which a computer program is stored, and the computer program is used by a processor to execute the steps in the above-mentioned various method embodiments.

[0111] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0112] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0113] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0114] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A request transmission method, characterized in that: The method comprises: Perform link tracking for different virtual machines based on flow table rules at the NIC granularity; Parse the link tracking data to obtain the flow table rules; Compare the flow table rules with the preset flow table rules preconfigured in the network card to determine abnormal flow table rules in the preset flow table rules; After optimizing the abnormal flow table rule, determining a transmission link for transmitting the target request from the source virtual machine to the target virtual machine according to the optimized flow table rule; The target request is transmitted from the source virtual machine to the target virtual machine according to the transmission link.

2. The method according to claim 1, characterized in that Comparing the flow table rule with the preset flow table rule preconfigured in the network card to determine the abnormal flow table rule in the preset flow table rule includes: Compare the flow table rules with the flow table rules pre-configured on the network card to determine inconsistent flow table rules in the pre-configured flow table rules; According to the traffic observation results of each network card, an abnormal flow table rule is determined from the inconsistent flow table rules.

3. The method according to claim 1, characterized in that Parse the link tracking data to obtain the flow table rules, including: Parsing the link tracking data to obtain a parsing result; Performing feature extraction processing on the analysis result to obtain a feature extraction result; According to the feature extraction result, a flow table rule is obtained.

4. The method according to claim 1, characterized in that According to the optimized flow table rules, a transmission link for transmitting the target request from the source virtual machine to the target virtual machine is determined, including: According to the optimized flow table rules, determine the nodes that each target request in the target request needs to pass through when it is transmitted from the source virtual machine to the target virtual machine, and form a node set; Dividing the node set into an inter-node scheduling group and an intra-node scheduling group; According to the inter-node scheduling group and the intra-node scheduling group, a transmission link for transmitting the target request from the source virtual machine to the target virtual machine is obtained.

5. The method according to claim 4, characterized in that The node set includes a number of routers, a number of switches, a number of nodes where virtual machine pods are located, and a number of nodes where network cards are located; the node set is divided into an inter-node scheduling group and an intra-node scheduling group, including: Aggregate several routers and several switches to obtain different inter-node scheduling groups; The nodes where several virtual machine pods are located and the nodes where several network cards are located are aggregated to obtain different intra-node scheduling groups.

6. The method according to claim 4, characterized in that According to the inter-node scheduling group and the intra-node scheduling group, a transmission link for transmitting the target request from the source virtual machine to the target virtual machine is obtained, including: In the conventional central node scheduling method, an initial transmission link for transmitting the target request from the source virtual machine to the target virtual machine is determined in the inter-node scheduling group and the intra-node scheduling group; If the number of nodes of the initial transmission link exceeds a node number threshold, the initial transmission link is optimized by using an ant colony algorithm to obtain a transmission link.

7. A request transmission device, characterized in that: The device comprises: Link tracking module, used to track links of different virtual machines based on flow table rules at the granularity of network cards; The parsing processing module is used to parse the link tracking data and obtain the flow table rules; An abnormal rule determination module is used to compare the flow table rule with the preset flow table rule preconfigured in the network card to determine the abnormal flow table rule in the preset flow table rule; A link determination module, configured to determine, after optimizing the abnormal flow table rule, a transmission link for transmitting the target request from the source virtual machine to the target virtual machine according to the optimized flow table rule; The transmission processing module is used to transmit the target request from the source virtual machine to the target virtual machine according to the transmission link.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the method according to any one of claims 1 to 6 is implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

Images