CN117499270A - Flow processing method and device, computer equipment and storage medium - Google Patents
Flow processing method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN117499270A CN117499270A CN202311368539.8A CN202311368539A CN117499270A CN 117499270 A CN117499270 A CN 117499270A CN 202311368539 A CN202311368539 A CN 202311368539A CN 117499270 A CN117499270 A CN 117499270A
- Authority
- CN
- China
- Prior art keywords
- node
- target
- traffic
- flow
- identifier
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 74
- 238000005111 flow chemistry technique Methods 0.000 title claims abstract description 34
- 238000013507 mapping Methods 0.000 claims description 44
- 238000004458 analytical method Methods 0.000 claims description 28
- 238000004590 computer program Methods 0.000 claims description 6
- 238000012795 verification Methods 0.000 abstract description 27
- 238000012545 processing Methods 0.000 description 15
- 238000004891 communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 230000006835 compression Effects 0.000 description 2
- 238000007906 compression Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 235000019800 disodium phosphate Nutrition 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000003909 pattern recognition Methods 0.000 description 1
- 230000003068 static effect 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/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
-
- 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/50—Testing arrangements
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a flow processing method, a flow processing device, computer equipment and a storage medium, wherein the flow processing method comprises the following steps: obtaining a target flow forwarded by a first node; judging whether the target flow is gray flow or not based on the node identification; under the condition that the target flow is gray flow, acquiring a route identifier, a lane identifier and a link identifier carried by the target flow; forwarding the target traffic to the target node according to the route identification, the lane identification and the lane identification; and calling the target node to process the target traffic. In this embodiment of the present application, if the target traffic is a grayscale traffic, the target traffic is forwarded to a target node according to a route identifier, the lane identifier and the lane identifier, so as to invoke the target node to process the target traffic, thereby avoiding that non-grayscale traffic may exist in the grayscale version application during the grayscale verification process of the application, and further improving the accuracy of the grayscale verification result of the application.
Description
Technical Field
The present invention relates to the field of data processing technology and the field of medical treatment, and in particular, to a flow processing method, a flow processing device, a computer device, and a storage medium.
Background
In the medical field, a large number of applications, for example, inquiry applications, medical applications, are developed. In the process of updating the application program, gray verification needs to be performed on the application program, and after the gray verification is passed, the version of the application program is updated.
In the prior art, an application program applying a micro-service architecture needs to call a plurality of nodes in a gray level verification process, and the nodes may include nodes incapable of forwarding gray level traffic, which results in that non-gray level traffic may exist in the application program entering a gray level version in the gray level verification process, and thus the gray level verification result of the application program is disturbed.
Disclosure of Invention
The invention mainly aims to provide a flow processing method, a flow processing device, computer equipment and a storage medium, and aims to solve the technical problem that non-gray flow possibly enters a gray version application program in the gray verification process of the application program so as to interfere the gray verification result of the application program.
In order to achieve the above object, the present invention provides a flow processing method, including:
obtaining a target flow forwarded by a first node; the target flow carries a node identifier, and the node identifier is used for representing the node type of the first node;
judging whether the target flow is gray flow or not based on the node identification;
under the condition that the target flow is gray flow, acquiring a route identifier, a lane identifier and a link identifier carried by the target flow; the route identifier is used for representing a route version of the target traffic, the lane identifier is used for representing a route lane of the target traffic, and the link identifier is used for representing a route link of the target traffic;
forwarding the target traffic to a target node according to the route identification, the lane identification and the lane identification;
and calling the target node to process the target flow.
Optionally, the target node is a second node or a third node, and forwarding the target traffic to the target node according to the route identifier, the lane identifier and the link identifier includes:
determining whether the target flow is an expected flow according to the link identifier;
determining a second node according to the lane identification and forwarding the target traffic to the second node under the condition that the target traffic is the expected traffic;
and under the condition that the target traffic is not the expected traffic, determining a third node according to the route identification, and forwarding the target traffic to the third node.
Optionally, the determining whether the target traffic is the expected traffic according to the link identifier includes:
analyzing the link identifier;
if the analysis result of the link identifier indicates that nodes which forward the target flow except the first node are all gray nodes, determining that the target flow is expected flow;
and if the link identification represents that the node which forwards the target traffic except the first node has a non-gray node, determining that the target traffic is unexpected traffic.
Optionally, the determining a second node according to the lane identifier, and forwarding the target traffic to the second node includes:
resolving the lane identification;
if the analysis result of the lane identification represents that the route lane of the target flow is not the default lane, a first mapping table is obtained; the first mapping table stores the mapping relation between the route lanes and the nodes;
inquiring the route lanes of the target flow in the first mapping table to obtain a second node;
forwarding the target traffic to the second node.
Optionally, the third node is determined according to the route identifier, and the target traffic is forwarded to the third node
Analyzing the route identification;
if the analysis result of the route identifier indicates that the route version of the target flow is not the default version, a second mapping table is obtained; the second mapping table stores the mapping relation between the routing version and the nodes;
inquiring the route version of the target flow in the second mapping table to obtain a third node;
forwarding the target traffic to the third node.
Optionally, the determining, based on the node identifier, whether the target traffic is a gray traffic includes:
analyzing the node identification;
if the analysis result of the node identification represents that the first node is a gray level node, determining that the target flow is gray level flow;
and if the analysis result of the node identification represents that the first node is a non-gray level node, determining that the target flow is a non-gray level flow.
Optionally, after the determining, based on the node identifier, whether the target traffic is a gray traffic, the method further includes:
forwarding the target traffic to a non-gray node if the target traffic is non-gray traffic;
and calling the non-gray node to process the target traffic.
In addition, in order to achieve the above object, the present invention also provides a flow rate processing apparatus including:
the first acquisition module is used for acquiring the target flow forwarded by the first node; the target flow carries a node identifier, and the node identifier is used for representing the node type of the first node;
the judging module is used for judging whether the target flow is gray flow or not based on the node identification;
the second acquisition module is used for acquiring a route identifier, a lane identifier and a link identifier carried by the target flow when the target flow is gray flow; the route identifier is used for representing a route version of the target traffic, the lane identifier is used for representing a route lane of the target traffic, and the link identifier is used for representing a route link of the target traffic;
the first forwarding module is used for forwarding the target traffic to a target node according to the route identifier, the lane identifier and the lane identifier;
and the first calling module is used for calling the target node to process the target flow.
In order to solve the above technical problems, the embodiments of the present application further provide a computer device, which adopts the following technical schemes:
the computer device comprises a memory and a processor, wherein the memory stores a computer program, and the processor realizes the steps of any one of the flow processing methods in the embodiments of the application when executing the computer program.
In order to solve the above technical problems, embodiments of the present application further provide a computer readable storage medium, which adopts the following technical solutions:
the computer readable storage medium stores a computer program which, when executed by a processor, implements the steps of any of the flow processing methods set forth in the embodiments of the present application.
Compared with the prior art, the embodiment of the application has the following main beneficial effects:
the invention provides a flow processing method, a flow processing device, computer equipment and a storage medium, wherein the flow processing method comprises the following steps: obtaining a target flow forwarded by a first node; the target flow carries a node identifier, and the node identifier is used for representing the node type of the first node; judging whether the target flow is gray flow or not based on the node identification; under the condition that the target flow is gray flow, acquiring a route identifier, a lane identifier and a link identifier carried by the target flow; the route mark is used for representing the route version of the target flow, the lane mark is used for representing the route lane of the target flow, and the link mark is used for representing the route link of the target flow; forwarding the target traffic to the target node according to the route identification, the lane identification and the lane identification; and calling the target node to process the target traffic. In the embodiment of the present application, whether the target traffic is gray is determined based on the node identifier, if the target traffic is gray, the target traffic is forwarded to the target node according to the route identifier, the lane identifier and the lane identifier, so as to invoke the target node to process the target traffic, thereby completing the processing of the target traffic. Therefore, the situation that non-gray traffic enters the gray version application program possibly exists in the gray verification process of the application program is avoided, and the accuracy of the gray verification result of the application program is improved.
Drawings
For a clearer description of the solution in the present application, a brief description will be given below of the drawings that are needed in the description of the embodiments of the present application, it being obvious that the drawings in the following description are some embodiments of the present application, and that other drawings may be obtained from these drawings without inventive effort for a person of ordinary skill in the art.
FIG. 1 is an exemplary system architecture diagram in which the present application may be applied;
FIG. 2 is a flow chart of a flow processing method provided by an embodiment of the present invention;
FIG. 3 is an application flow chart of a flow processing method provided by an embodiment of the present invention;
FIG. 4 is a schematic structural diagram of one embodiment of a computer device according to the present application;
fig. 5 is a basic structural block diagram of the computer device of the present embodiment.
Detailed Description
The method for determining a data format provided in the embodiments of the present invention is applied to a data processing system, and all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application pertains unless defined otherwise; the terminology used in the description of the applications herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application; the terms "comprising" and "having" and any variations thereof in the description and claims of the present application and in the description of the figures above are intended to cover non-exclusive inclusions. The terms first, second and the like in the description and in the claims or in the above-described figures, are used for distinguishing between different objects and not necessarily for describing a sequential or chronological order.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment of the present application. The appearances of such phrases in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments.
In order to better understand the technical solutions of the present application, the following description will clearly and completely describe the technical solutions in the embodiments of the present application with reference to the accompanying drawings.
As shown in fig. 1, a system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium to provide communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
The user may interact with the server 105 via the network 104 using the terminal devices 101, 102, 103 to receive or send messages or the like. Various communication client applications, such as a web browser application, a shopping class application, a search class application, an instant messaging tool, a mailbox client, social networking platform software, etc., may be installed on the terminal devices 101, 102, 103.
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablet computers, electronic book readers, MP3 players (Moving Picture Experts Group Audio Layer III, dynamic video expert compression standard audio plane 3), MP4 (Moving Picture Experts Group Audio Layer IV, dynamic video expert compression standard audio plane 4) players, laptop and desktop computers, and the like.
The server 105 may be a server providing various services, such as a background server providing support for pages displayed on the terminal devices 101, 102, 103.
It should be noted that, the flow processing method provided in the embodiments of the present application is generally executed by a server/terminal device, and accordingly, the flow processing apparatus is generally disposed in the server/terminal device.
It should be understood that the number of terminal devices, networks and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
With continued reference to fig. 2, a flow chart of one embodiment of a flow processing method according to the present application is shown. The embodiment of the application can acquire and process related data based on an artificial intelligence technology, wherein the flow processing method can be applied to a flow processing device. The flow processing method provided by the embodiment of the invention comprises the following steps:
s210, obtaining target traffic forwarded by a first node.
It should be appreciated that in the process of performing gray level verification on medical applications of an application microservice architecture, traffic needs to be forwarded through different nodes, so that gray level verification is completed. The first node may be understood as any node involved in the gray scale verification process.
In this step, a target traffic forwarded by a first node is obtained, where the target traffic carries a node identifier, and the node identifier is used to characterize a node type of the first node. The above node types include, but are not limited to, gray nodes, also known as controlled nodes, and non-gray nodes, also known as non-gray nodes.
S220, judging whether the target flow is gray flow or not based on the node identification.
As described above, the node identification is used to characterize the node type of the first node.
In this step, whether the target traffic is the gray traffic may be determined based on the node identifier, and for a specific implementation, reference is made to the following examples.
S230, under the condition that the target flow is gray flow, obtaining a route identifier, a lane identifier and a link identifier carried by the target flow.
In this step, when the target traffic is the gray traffic, it indicates that the target traffic is the traffic required for gray verification of the application program, and the route identifier, the lane identifier, and the link identifier carried by the target traffic are obtained.
Wherein the route identifier is used for representing a route version of the target traffic, the lane identifier is used for representing a route lane of the target traffic, and the link identifier is used for representing a route link of the target traffic.
S240, forwarding the target traffic to a target node according to the route identification, the lane identification and the lane identification.
In this step, after the route identifier, the lane identifier and the lane identifier are obtained, the target node may be determined according to the route identifier, the lane identifier and the lane identifier, and the target traffic may be forwarded to the target node. Wherein the target node is a gray node.
For a specific technical solution for determining the target node according to the route identifier, the lane identifier and the lane identifier, please refer to the subsequent embodiment.
S250, calling the target node to process the target flow.
In the step, after the target flow is forwarded to the target node, the target node is called to process the target flow, so that the gray level verification of the medical application program is realized.
In this embodiment, a target flow forwarded by a first node is obtained; the target flow carries a node identifier, and the node identifier is used for representing the node type of the first node; judging whether the target flow is gray flow or not based on the node identification; under the condition that the target flow is gray flow, acquiring a route identifier, a lane identifier and a link identifier carried by the target flow; the route mark is used for representing the route version of the target flow, the lane mark is used for representing the route lane of the target flow, and the link mark is used for representing the route link of the target flow; forwarding the target traffic to the target node according to the route identification, the lane identification and the lane identification; and calling the target node to process the target traffic. In the embodiment of the present application, whether the target traffic is gray is determined based on the node identifier, if the target traffic is gray, the target traffic is forwarded to the target node according to the route identifier, the lane identifier and the lane identifier, so as to invoke the target node to process the target traffic, thereby completing the processing of the target traffic. Therefore, the situation that non-gray traffic enters the gray version application program possibly exists in the gray verification process of the application program is avoided, and the accuracy of the gray verification result of the application program is improved.
Optionally, the target node is a second node or a third node, and forwarding the target traffic to the target node according to the route identifier, the lane identifier and the link identifier includes:
determining whether the target flow is an expected flow according to the link identifier;
determining a second node according to the lane identification and forwarding the target traffic to the second node under the condition that the target traffic is the expected traffic;
and under the condition that the target traffic is not the expected traffic, determining a third node according to the route identification, and forwarding the target traffic to the third node.
As described above, the target traffic carries a link identification that is used to characterize the routing links of the target traffic.
In this embodiment, whether the target traffic is the expected traffic may be determined according to the link identifier. In an alternative embodiment, if all the routing nodes in the routing link of the target traffic are gray nodes, determining the target traffic as the expected traffic; if all the routing nodes in the routing link of the target traffic are not all gray nodes, determining that the target traffic is unexpected traffic.
As described above, the target traffic carries a lane identifier, where the lane identifier is used to represent a route lane of the target traffic, and in the case that the target traffic is an expected traffic, all the route nodes in the route link representing the target traffic are gray nodes, that is, the target traffic is full-link gray traffic, the second node is determined according to the lane identifier, and the target traffic is forwarded to the second node. Wherein the target node comprises a second node. For a specific solution for determining the second node according to the lane identification, please refer to the following examples.
As described above, the target traffic carries a routing identifier, where the routing identifier is used to characterize a routing version of the target traffic, and when the target traffic is unexpected, the routing link representing the target traffic includes a non-gray node, that is, the target traffic is not full-link gray traffic, then the third node is determined according to the routing identifier, and the target traffic is forwarded to the third node. How to determine the technical solution of the third node according to the route identifier is described in the following embodiments.
Optionally, the determining whether the target traffic is the expected traffic according to the link identifier includes:
analyzing the link identifier;
if the analysis result of the link identifier indicates that nodes which forward the target flow except the first node are all gray nodes, determining that the target flow is expected flow;
and if the link identification represents that the node which forwards the target traffic except the first node has a non-gray node, determining that the target traffic is unexpected traffic.
In this embodiment, the link identifier carried by the target flow is analyzed.
And if the analysis result of the link identifier indicates that the nodes for forwarding the target flow except the first node are all gray nodes, namely, the target flow is the full-link gray flow, determining that the target flow is the expected flow.
And if the analysis result of the link identifier indicates that the node which forwards the target flow except the first node has a non-gray node, namely the target flow is not the full-link gray flow, determining that the target flow is the unexpected flow.
In this embodiment, through the link identifier carried by the target traffic, it is determined whether the forwarding link of the target traffic is a full link only including gray nodes, so as to accurately determine whether the target traffic is an expected traffic.
Optionally, the determining a second node according to the lane identifier, and forwarding the target traffic to the second node includes:
resolving the lane identification;
if the analysis result of the lane identification represents that the route lane of the target flow is not the default lane, a first mapping table is obtained; the first mapping table stores the mapping relation between the route lanes and the nodes;
inquiring the route lanes of the target flow in the first mapping table to obtain a second node;
forwarding the target traffic to the second node.
In this embodiment, a first mapping table is preset, where the first mapping table stores a mapping relationship between a route lane and a node.
As described above, the target traffic carries a lane identification. In this embodiment, a lane identifier carried by the target traffic is analyzed, if the analysis result of the lane identifier indicates that the route lane of the target traffic is not the default lane, the route lane of the target traffic is queried in the first mapping table to obtain the second node, and further, the target traffic is forwarded to the second node.
If the analysis result of the lane mark represents that the route lane of the target flow is the default lane, forwarding the target flow to a non-gray node, and processing the target flow by the non-gray node.
In this embodiment, for the expected traffic, the second node is determined through the route lanes of the expected traffic and the first mapping table, and the expected traffic is processed by the second node, so that an application program with non-gray traffic entering a gray version is avoided in the gray verification process of the application program, and the accuracy of the gray verification result of the application program is improved.
Optionally, the third node is determined according to the route identifier, and the target traffic is forwarded to the third node
Analyzing the route identification;
if the analysis result of the route identifier indicates that the route version of the target flow is not the default version, a second mapping table is obtained; the second mapping table stores the mapping relation between the routing version and the nodes;
inquiring the route version of the target flow in the second mapping table to obtain a third node;
forwarding the target traffic to the third node.
In this embodiment, a second mapping table is preset, and the first mapping table stores a mapping relationship between the routing version and the node.
As described above, the target traffic carries the route identification. In this embodiment, a routing identifier carried by the target traffic is analyzed, if the analysis result of the routing identifier indicates that the routing version of the target traffic is not a default version, the routing version of the target traffic is queried in the second mapping table to obtain a third node, and further, the target traffic is forwarded to the third node.
If the analysis result of the route identification represents that the route version of the target flow is the default version, forwarding the target flow to a non-gray node, and processing the target flow by the non-gray node.
In this embodiment, for an unexpected traffic, a third node is determined through a routing version and a second mapping table of the unexpected traffic, and the unexpected traffic is processed by the third node, so that an application program with a gray scale version is prevented from being entered by the unexpected traffic possibly in the gray scale verification process of the application program, and accuracy of a gray scale verification result of the application program is improved.
Optionally, the determining, based on the node identifier, whether the target traffic is a gray traffic includes:
analyzing the node identification;
if the analysis result of the node identification represents that the first node is a gray level node, determining that the target flow is gray level flow;
and if the analysis result of the node identification represents that the first node is a non-gray level node, determining that the target flow is a non-gray level flow.
As described above, the target traffic carries a node identification, which is used to characterize the node type of the first node.
In this embodiment, a node identifier carried by the target traffic is analyzed, and if the analysis result of the node identifier indicates that the first node is a gray node and indicates that the target traffic is a gray traffic forwarded by the gray node, the target traffic is determined to be the gray traffic.
If the analysis result of the node identification indicates that the first node is a non-gray node and the target traffic is the non-gray traffic forwarded by the non-gray node, determining that the target traffic is the non-gray traffic.
In this embodiment, the node identifier carried by the target node may represent the node type of the first node, and by determining whether the first node is a gray node, it is further determined accurately whether the first node is a gray traffic.
Optionally, after the determining, based on the node identifier, whether the target traffic is a gray traffic, the method further includes:
forwarding the target traffic to a non-gray node if the target traffic is non-gray traffic;
and calling the non-gray node to process the target traffic.
In this embodiment, if the node identifier indicates that the node type of the first node is a non-gray node, and indicates that the target traffic is forwarded by the non-gray node, it is determined that the target traffic is the non-gray traffic.
And forwarding the target traffic to a non-gray node and processing the target traffic by calling the non-gray node when the target traffic is the non-gray traffic.
In this embodiment, for the non-gray traffic, since the non-gray traffic is not allowed to flow into the application program for gray verification, the non-gray node is called to process the non-gray traffic, so that the application program that the non-gray traffic may enter the gray version in the gray verification process of the application program is prevented, and the accuracy of the gray verification result of the application program is improved.
In order to facilitate understanding of the overall technical solution, please refer to fig. 3, as shown in fig. 3, when the flow enters the filter, the flow identification is performed to determine whether the flow is a surprise flow; under the condition that the flow is a surprise flow, namely the flow is a non-gray level flow, calling a non-gray level node to process the flow; and under the condition that the traffic is not the surprise traffic, namely the traffic is gray traffic, gray pattern recognition is carried out, namely whether the traffic is full-link gray traffic is judged based on the link identification carried by the traffic in the embodiment of the application.
If the traffic is full-link gray traffic, identifying a full-link default identifier (corresponding to a lane identifier in the embodiment of the application) of the traffic, and judging whether a route lane of the traffic is a default lane or not; if yes, calling a non-gray node to process the flow; if not, determining a forwarding node according to a load strategy, and processing the traffic by the node, wherein the load strategy comprises the forwarding node which obtains the traffic by inquiring a first mapping table.
If the traffic is not the full-link gray traffic, identifying a version reason default identifier (corresponding to a routing identifier in the embodiment of the application) of the traffic, and judging whether the routing version of the traffic is the default version or not; if yes, calling a non-gray node to process the flow; if not, determining a forwarding node according to a load strategy, and processing the traffic by the node, wherein the load strategy comprises the forwarding node for obtaining the traffic through inquiring a second mapping table.
With further reference to fig. 4, as an implementation of the method shown in fig. 2, the present application provides an embodiment of a flow processing apparatus 400, which corresponds to the method embodiment shown in fig. 2, and which is particularly applicable to various electronic devices.
The flow processing apparatus 400 provided in the embodiment of the present invention, the flow processing apparatus 400 includes:
a first obtaining module 410, configured to obtain a target traffic forwarded by a first node; the target flow carries a node identifier, and the node identifier is used for representing the node type of the first node;
a judging module 420, configured to judge whether the target traffic is a gray traffic based on the node identifier;
a second obtaining module 430, configured to obtain, when the target traffic is a grayscale traffic, a route identifier, a lane identifier, and a link identifier carried by the target traffic; the route identifier is used for representing a route version of the target traffic, the lane identifier is used for representing a route lane of the target traffic, and the link identifier is used for representing a route link of the target traffic;
a first forwarding module 440, configured to forward the target traffic to a target node according to the route identifier, the lane identifier, and the lane identifier;
and the first calling module 450 is used for calling the target node to process the target traffic.
Optionally, the target node is a second node or a third node, and the first forwarding module 440 is specifically configured to:
determining whether the target flow is an expected flow according to the link identifier;
determining a second node according to the lane identification and forwarding the target traffic to the second node under the condition that the target traffic is the expected traffic;
and under the condition that the target traffic is not the expected traffic, determining a third node according to the route identification, and forwarding the target traffic to the third node.
Optionally, the first forwarding module 440 is further specifically configured to:
analyzing the link identifier;
if the analysis result of the link identifier indicates that nodes which forward the target flow except the first node are all gray nodes, determining that the target flow is expected flow;
and if the link identification represents that the node which forwards the target traffic except the first node has a non-gray node, determining that the target traffic is unexpected traffic.
Optionally, the first forwarding module 440 is further specifically configured to:
resolving the lane identification;
if the analysis result of the lane identification represents that the route lane of the target flow is not the default lane, a first mapping table is obtained; the first mapping table stores the mapping relation between the route lanes and the nodes;
inquiring the route lanes of the target flow in the first mapping table to obtain a second node;
forwarding the target traffic to the second node.
Optionally, the first forwarding module 440 is further specifically configured to:
analyzing the route identification;
if the analysis result of the route identifier indicates that the route version of the target flow is not the default version, a second mapping table is obtained; the second mapping table stores the mapping relation between the routing version and the nodes;
inquiring the route version of the target flow in the second mapping table to obtain a third node;
forwarding the target traffic to the third node.
Optionally, the judging module 420 is specifically configured to:
analyzing the node identification;
if the analysis result of the node identification represents that the first node is a gray level node, determining that the target flow is gray level flow;
and if the analysis result of the node identification represents that the first node is a non-gray level node, determining that the target flow is a non-gray level flow.
Optionally, the flow processing apparatus 400 further includes:
the second forwarding module is used for forwarding the target traffic to a non-gray node under the condition that the target traffic is the non-gray traffic;
and the second calling module is used for calling the non-gray node to process the target flow.
In the embodiment of the present application, whether the target traffic is gray is determined based on the node identifier, if the target traffic is gray, the target traffic is forwarded to the target node according to the route identifier, the lane identifier and the lane identifier, so as to invoke the target node to process the target traffic, thereby completing the processing of the target traffic. Therefore, the situation that non-gray traffic enters the gray version application program possibly exists in the gray verification process of the application program is avoided, and the accuracy of the gray verification result of the application program is improved.
In order to solve the technical problems, the embodiment of the application also provides computer equipment. Referring specifically to fig. 5, fig. 5 is a basic structural block diagram of a computer device according to the present embodiment.
The computer device 5 comprises a memory 51, a processor 52, a network interface 53 which are communicatively connected to each other via a system bus. It should be noted that only the computer device 5 with components 51-53 is shown in the figures, but it should be understood that not all of the illustrated components are required to be implemented and that more or fewer components may be implemented instead. It will be appreciated by those skilled in the art that the computer device herein is a device capable of automatically performing numerical calculations and/or information processing in accordance with predetermined or stored instructions, the hardware of which includes, but is not limited to, microprocessors, application specific integrated circuits (Application Specific Integrated Circuit, ASICs), programmable gate arrays (fields-Programmable Gate Array, FPGAs), digital processors (Digital Signal Processor, DSPs), embedded devices, etc.
The computer equipment can be a desktop computer, a notebook computer, a palm computer, a cloud server and other computing equipment. The computer equipment can perform man-machine interaction with a user through a keyboard, a mouse, a remote controller, a touch pad or voice control equipment and the like.
The memory 51 includes at least one type of readable storage medium including flash memory, hard disk, multimedia card, card memory (e.g., SD or DX memory, etc.), random Access Memory (RAM), static Random Access Memory (SRAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), programmable Read Only Memory (PROM), magnetic memory, magnetic disk, optical disk, etc. In some embodiments, the storage 51 may be an internal storage unit of the computer device 5, such as a hard disk or a memory of the computer device 5. In other embodiments, the memory 51 may also be an external storage device of the computer device 5, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash Card (Flash Card) or the like, which are provided on the computer device 5. Of course, the memory 51 may also comprise both an internal memory unit of the computer device 5 and an external memory device. In this embodiment, the memory 51 is typically used to store an operating system and various application software installed on the computer device 5, such as program codes of a flow processing method, and the like. Further, the memory 51 may be used to temporarily store various types of data that have been output or are to be output.
The processor 52 may be a central processing unit (Central Processing Unit, CPU), controller, microcontroller, microprocessor, or other data processing chip in some embodiments. The processor 52 is typically used to control the overall operation of the computer device 5. In this embodiment, the processor 52 is configured to execute the program code stored in the memory 51 or process data, such as the program code for executing the flow processing method.
The network interface 53 may comprise a wireless network interface or a wired network interface, which network interface 53 is typically used to establish communication connections between the computer device 5 and other electronic devices.
The present application also provides another embodiment, namely, a computer readable storage medium storing the flow processing program, where the flow processing program is executable by at least one processor, so that the at least one processor performs the steps of the flow processing method as described above.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general purpose hardware online platform, and of course also by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art in the form of a software product stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk), comprising several instructions for causing a terminal device (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the method described in the embodiments of the present application.
The subject application is operational with numerous general purpose or special purpose computer system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like. The application may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The application may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
It is apparent that the embodiments described above are only some embodiments of the present application, but not all embodiments, the preferred embodiments of the present application are given in the drawings, but not limiting the patent scope of the present application. This application may be embodied in many different forms, but rather, embodiments are provided in order to provide a more thorough understanding of the present disclosure. Although the present application has been described in detail with reference to the foregoing embodiments, it will be apparent to those skilled in the art that modifications may be made to the embodiments described in the foregoing, or equivalents may be substituted for elements thereof. All equivalent structures made by the specification and the drawings of the application are directly or indirectly applied to other related technical fields, and are also within the protection scope of the application.
Claims (10)
1. A flow processing method, comprising:
obtaining a target flow forwarded by a first node; the target flow carries a node identifier, and the node identifier is used for representing the node type of the first node;
judging whether the target flow is gray flow or not based on the node identification;
under the condition that the target flow is gray flow, acquiring a route identifier, a lane identifier and a link identifier carried by the target flow; the route identifier is used for representing a route version of the target traffic, the lane identifier is used for representing a route lane of the target traffic, and the link identifier is used for representing a route link of the target traffic;
forwarding the target traffic to a target node according to the route identification, the lane identification and the lane identification;
and calling the target node to process the target flow.
2. The method of claim 1, wherein the target node is a second node or a third node, and wherein forwarding the target traffic to the target node based on the route identification, the lane identification, and the link identification comprises:
determining whether the target flow is an expected flow according to the link identifier;
determining a second node according to the lane identification and forwarding the target traffic to the second node under the condition that the target traffic is the expected traffic;
and under the condition that the target traffic is not the expected traffic, determining a third node according to the route identification, and forwarding the target traffic to the third node.
3. The method of claim 2, wherein said determining whether said target traffic is expected traffic based on said link identification comprises:
analyzing the link identifier;
if the analysis result of the link identifier indicates that nodes which forward the target flow except the first node are all gray nodes, determining that the target flow is expected flow;
and if the link identification represents that the node which forwards the target traffic except the first node has a non-gray node, determining that the target traffic is unexpected traffic.
4. The method of claim 2, wherein the determining a second node from the lane identification and forwarding the target traffic to the second node comprises:
resolving the lane identification;
if the analysis result of the lane identification represents that the route lane of the target flow is not the default lane, a first mapping table is obtained; the first mapping table stores the mapping relation between the route lanes and the nodes;
inquiring the route lanes of the target flow in the first mapping table to obtain a second node;
forwarding the target traffic to the second node.
5. The method of claim 2, wherein the determining a third node from the route identification and forwarding the target traffic to the third node
Analyzing the route identification;
if the analysis result of the route identifier indicates that the route version of the target flow is not the default version, a second mapping table is obtained; the second mapping table stores the mapping relation between the routing version and the nodes;
inquiring the route version of the target flow in the second mapping table to obtain a third node;
forwarding the target traffic to the third node.
6. The method of claim 1, wherein the determining whether the target traffic is grayscale traffic based on the node identification comprises:
analyzing the node identification;
if the analysis result of the node identification represents that the first node is a gray level node, determining that the target flow is gray level flow;
and if the analysis result of the node identification represents that the first node is a non-gray level node, determining that the target flow is a non-gray level flow.
7. The method according to any one of claims 1-6, wherein after the determining whether the target traffic is gray scale traffic based on the node identification, the method further comprises:
forwarding the target traffic to a non-gray node if the target traffic is non-gray traffic;
and calling the non-gray node to process the target traffic.
8. A flow processing apparatus, comprising:
the first acquisition module is used for acquiring the target flow forwarded by the first node; the target flow carries a node identifier, and the node identifier is used for representing the node type of the first node;
the judging module is used for judging whether the target flow is gray flow or not based on the node identification;
the second acquisition module is used for acquiring a route identifier, a lane identifier and a link identifier carried by the target flow when the target flow is gray flow; the route identifier is used for representing a route version of the target traffic, the lane identifier is used for representing a route lane of the target traffic, and the link identifier is used for representing a route link of the target traffic;
the first forwarding module is used for forwarding the target traffic to a target node according to the route identifier, the lane identifier and the lane identifier;
and the first calling module is used for calling the target node to process the target flow.
9. A computer device comprising a memory and a processor, the memory having stored therein a computer program, the processor implementing the steps of the flow processing method according to any of claims 1 to 7 when the computer program is executed.
10. A computer readable storage medium, characterized in that the computer readable storage medium has stored thereon a computer program which, when executed by a processor, implements the steps of the flow processing method according to any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311368539.8A CN117499270A (en) | 2023-10-20 | 2023-10-20 | Flow processing method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311368539.8A CN117499270A (en) | 2023-10-20 | 2023-10-20 | Flow processing method and device, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117499270A true CN117499270A (en) | 2024-02-02 |
Family
ID=89668094
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311368539.8A Pending CN117499270A (en) | 2023-10-20 | 2023-10-20 | Flow processing method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117499270A (en) |
-
2023
- 2023-10-20 CN CN202311368539.8A patent/CN117499270A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112416458A (en) | Preloading method and device based on ReactNative, computer equipment and storage medium | |
| CN111552463A (en) | Page jump method and device, computer equipment and storage medium | |
| CN112860662B (en) | Automatic production data blood relationship establishment method, device, computer equipment and storage medium | |
| CN111580883B (en) | Application program starting method, device, computer system and medium | |
| CN116483425A (en) | Micro-service gray level edition issuing method, device, equipment and storage medium thereof | |
| CN113590447B (en) | Buried point processing method and device | |
| CN112765022B (en) | Webshell static detection method based on data stream and electronic equipment | |
| CN117499270A (en) | Flow processing method and device, computer equipment and storage medium | |
| CN116302847B (en) | Dynamic acquisition method and device of abnormal information, computer equipment and medium | |
| CN117290019A (en) | Interface calling method and device, computer equipment and storage medium | |
| CN112086096B (en) | Data processing method, device, system and medium | |
| CN117851014A (en) | Application program calling method and device, computer equipment and storage medium | |
| CN114842097A (en) | Method for converting picture format and related equipment thereof | |
| CN117874073A (en) | Search optimization method, device, equipment and storage medium thereof | |
| CN117827320A (en) | Service execution method, device, equipment and storage medium thereof | |
| CN117667668A (en) | Application analysis method, device, equipment and storage medium based on application upgrading | |
| CN117408794A (en) | Request processing method, device, equipment and storage medium thereof | |
| CN116017069A (en) | Software program package loading method and device, computer equipment and storage medium | |
| CN117331595A (en) | Data updating method, device, computer equipment and storage medium | |
| CN115578050A (en) | Approval progress identification method and device, computer equipment and storage medium | |
| CN117828221A (en) | Page event statistics method based on buried point technology and related equipment thereof | |
| CN115080045A (en) | Link generation method and device, computer equipment and storage medium | |
| CN118277385A (en) | Data storage method, device, computer equipment and storage medium | |
| CN117271635A (en) | List export method, device, computer equipment and storage medium | |
| CN116894736A (en) | Mail management method, device, computer equipment and storage medium |
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 |