Identification resolution method and system based on industrial Internet identification resolution

Abstract

The present application provides an identification resolution method and system based on industrial Internet identification resolution, and relates to the technical field of identification resolution. The method includes: collecting identification codes to be resolved; extracting the prefix of the identification codes to be resolved, recording it as a first prefix, and then matching the resolution path according to the first prefix, and then decomposing the identification codes to be resolved according to the resolution nodes at all levels of the resolution path to obtain multiple identification fields, and then using the resolution nodes to resolve the identification fields to obtain resolution sub-results, and then integrating the various resolution sub-results to obtain the final resolution result. The system includes: a data collection module, a data processing module, an identification resolution module and an integration module. The present application can improve the resolution efficiency of identification codes and the accuracy of resolution results.

Description

Technical Field

[0001] The present application relates to the technical field of identity resolution, and in particular, to an identity resolution method and system based on industrial Internet identity resolution. Background Art

[0002] In today's digital age, identification codes have become the cornerstone of information transmission and identification. Whether it is device identification in the Internet of Things, product coding in smart manufacturing, logistics information in supply chain management, or data tags in big data processing, identification codes play a vital role. These identification codes not only carry a large amount of information, but also connect different systems and devices, realizing seamless transmission and sharing of information.

[0003] However, with the continuous advancement of technology and the continuous expansion of application scenarios, the complexity and diversity of identification codes have also increased. On the one hand, the structure of identification codes is becoming more and more complex, containing multiple parts and levels, each of which carries different information and requires different parsing methods and parsing paths. On the other hand, the application scenarios of identification codes are becoming more and more diverse, from simple device identification to complex supply chain tracking, from single data processing to multi-dimensional data analysis, the application scope of identification codes is also expanding.

[0004] This increase in complexity and diversity has put forward higher requirements for identification resolution technology. Traditional resolution methods often use fixed resolution paths and single resolution nodes, which are difficult to adapt to the complex and changing identification coding requirements. When dealing with multi-level and multi-part identification codes, traditional methods are prone to low resolution efficiency and insufficient accuracy. Summary of the invention

[0005] In order to improve the parsing efficiency of identification codes and the accuracy of parsing results, the present application provides an identification resolution method and system based on industrial Internet identification resolution.

[0006] In the first aspect, the present application provides an identification resolution method based on industrial Internet identification resolution, which adopts the following technical solutions:

[0007] The identification resolution method based on industrial Internet identification resolution includes the following steps:

[0008] Data collection: collect the identification code to be parsed and record it as the first identification code;

[0009] Data processing: including path matching, node acquisition and decomposition;

[0010] Path matching: extract the prefix of the first identification code, record it as the first prefix, match the resolution path according to the first prefix, and obtain the first resolution path;

[0011] Get nodes: Get M parsing nodes in the first parsing path;

[0012] Decomposition: Decompose the first identification code according to the requirements of each parsing node to obtain N identification fields;

[0013] Identity resolution: The i-th identity field is transmitted to the j-th resolution node, and the j-th resolution node resolves the i-th identity field to obtain a resolution sub-result;

[0014] Integration: Integrate N sub-analysis results into the final analysis result.

[0015] By adopting the above technical solution, the present application collects the identification code to be parsed, extracts the prefix of the identification code, records it as the first prefix, and then matches the first prefix with the preset parsing path, so as to quickly locate the corresponding parsing rule or path. This solution helps to improve the efficiency and accuracy of parsing and reduce unnecessary calculations and resource consumption. The identification code to be parsed is decomposed according to the parsing node to obtain multiple identification fields, each identification field is transmitted to the corresponding parsing node, and these identification fields are parsed in parallel to obtain the parsing sub-result of each identification field. This solution enables each identification field to be accurately and efficiently parsed, improves the efficiency and accuracy of parsing, and finally integrates all the parsing sub-results to form the final parsing result.

[0016] Optionally, before executing the step of data collection, the method further includes:

[0017] Define a prefix set: formulate a prefix set, the prefix set includes the start node identifiers of all resolution paths, and the start node identifier is recorded as the first identifier;

[0018] Association: Establish matching rules between the prefix of the identification code and the first identifier.

[0019] By adopting the above technical solution, the present application stores the starting node identifier of the resolution path in a prefix set, so that when matching the first prefix and the first identifier, there is no need to search for the matching prefix from the beginning, thereby saving a lot of time and improving the resolution efficiency; the present application also formulates a matching rule for the prefix of the identification code and the first identifier, so that each prefix of the identification code can accurately correspond to one or more resolution nodes of the resolution path, and the association step establishes a direct connection between the prefix of the identification code and the resolution path, reducing the blindness of selecting the resolution path, so that the corresponding resolution path can be selected more accurately according to the prefix of the identification code, thereby reducing the possibility of incorrect resolution of the identification code.

[0020] Optionally, after executing the path matching step and before executing the node obtaining step, the method further includes:

[0021] Quantity judgment: judge whether the first parsing path is unique. If so, execute the step of obtaining nodes; if not, execute the step of path selection;

[0022] Path selection: including obtaining delay and determining path;

[0023] Obtaining delay: Obtain the round-trip delay of each first resolution path, and select the first resolution path with the smallest round-trip delay as the final first resolution path;

[0024] Determine the path: use the final first parsing path as a new first parsing path.

[0025] By adopting the above technical solution, when multiple first resolution paths are matched in the path matching step, by obtaining the round-trip time of each first resolution path and selecting the first resolution path with the smallest round-trip delay as the final resolution path, the solution can make decisions based on the actual network performance, screen out the first resolution path with the highest resolution efficiency, and further improve the overall resolution efficiency. By measuring the round-trip delay of each first resolution path, the actual performance of each first resolution path can be evaluated. A first resolution path with a smaller delay means a better network connection and a more stable resolution environment, which helps to improve the accuracy of the resolution.

[0026] Optionally, after executing the step of acquiring the delay and before executing the step of determining the path, the method further includes:

[0027] Path evaluation: including obtaining the used nodes, obtaining the bandwidth, obtaining the load, calculating the evaluation value and making evaluation judgments;

[0028] Obtaining used nodes: obtaining the number of parsing nodes used to parse the first identification code in the final first parsing path, and recording it as first data;

[0029] Obtaining bandwidth: obtaining a network link for transmitting the i-th identification field to the final first resolution path, recorded as the first network link, and obtaining a bandwidth occupied by the first network link when transmitting the i-th identification field, recorded as the second data;

[0030] Obtaining the load: obtaining the traffic carried by the final first resolution path in real time, recorded as the third data;

[0031] Calculate the evaluation value: Calculate the evaluation result of the final first parsing path. The calculation model is as follows:

[0032] ;

[0033] Among them, F is the evaluation result; is the weight of the first data; A is the first data; is the weight of the second data; The uplink bandwidth of the first network link for transmitting the i-th identification field; The downlink bandwidth of the first network link for transmitting the i-th identification field; is the second data; is the weight of the third data; C is the maximum flow that the final first resolution path can carry; D is the third data;

[0034] Evaluation and judgment: judging whether the evaluation result of the final first parsing path is greater than a preset threshold, if so, executing the step of determining the path; if not, executing the step of changing the path;

[0035] Change path: Calculate the evaluation results of all first parsing paths, record them as the fourth data, and select the first parsing path corresponding to the maximum fourth data as the new final first parsing path.

[0036] By adopting the above technical solution, the present application also comprehensively considers multiple factors such as the number of nodes used, the occupied bandwidth, and the load, and conducts a multi-faceted evaluation of the first resolution path, which helps to understand the actual performance and potential capabilities of each first resolution path. By obtaining the number of resolution nodes that parse the first identification code, the present application can evaluate the adaptability of the first resolution path to the first identification code; by obtaining the second data, the transmission capacity and stability of the network link can be evaluated; by understanding the current load condition (third data) of the first resolution path, the overloaded first resolution path can be filtered out, thereby improving the stability and efficiency of the resolution. By calculating the evaluation results, the present application can make a quantitative comparison of the first resolution path based on multiple dimensions, and this quantitative comparison is more accurate and comprehensive than a single indicator (such as round-trip delay). After comparing the evaluation results with the preset threshold, only the first resolution path whose performance meets or exceeds the expected standard will be selected, which helps to improve the accuracy and reliability of the selection of the first resolution path.

[0037] Optionally, after executing the step of data processing and before executing the step of identity resolution, the method further includes:

[0038] Encapsulation: including assigning ID, calculating offset, setting length and padding;

[0039] Assign ID: Assign a Stream ID to each parsing node;

[0040] Calculate the offset: calculate the offset of the i-th identification field, and use the offset as the Offset value of the Stream frame;

[0041] Set length: Get the length of the i-th identification field, record it as the fifth data, and use the fifth data as the data length of the Stream frame;

[0042] Filling: Encapsulate the i-th identification field in the Data field of the Stream frame;

[0043] Add: Add a QUIC header to the Stream frame to obtain a QUIC data packet.

[0044] By adopting the above technical solution, the present application assigns a unique Stream ID to each parsing node, and can accurately transmit the data stream to the corresponding parsing node. By calculating the offset, the position of each identification field in the Stream frame can be accurately located, thereby reducing the search time during parsing; obtaining and setting the length of the identification field, so that the boundary of the identification field can be quickly determined when processing data, thereby reducing unnecessary data reading and parsing operations. Adding a QUIC header to the Stream frame to form a QUIC data packet allows the QUIC data packet to adapt to the requirements of the QUIC protocol, providing a guarantee for the fast and reliable transmission of the identification field.

[0045] Optionally, in the identification resolution step, a QUIC data packet including the i-th identification field is transmitted to the j-th resolution node, and the j-th resolution node parses the i-th identification field and outputs an ACK packet including the resolution sub-result.

[0046] By adopting the above-mentioned technical scheme, the j-th parsing node in the present application is specifically suitable for parsing the i-th identification field, aiming to improve the efficiency and accuracy of the parsing. After completing the parsing task, the parsing node will output an ACK packet containing the parsing sub-results. The parsing sub-results in the ACK packet are the parsing results of the i-th identification field. This scheme helps to verify the integrity and accuracy of the data.

[0047] Optionally, after performing the step of identity resolution and before performing the step of integration, the method further includes:

[0048] Acquisition quantity: the number of ACK packets obtained, recorded as the sixth data;

[0049] Equal to judgment: judging whether the sixth data is equal to the number N of identification fields, if so, executing the integration step; if not, executing the greater than judgment step;

[0050] Greater than judgment: judging whether the sixth data is greater than the number N of the identification field, if so, executing the rate judgment step; if not, executing the step of continuing to receive;

[0051] Rate determination: Determine whether the transmission rate of the QUIC data packet exceeds the preset threshold. If so, execute the step of adjusting the rate; if not, execute the step of adjusting the link;

[0052] Adjust rate: reduce the transmission rate of QUIC packets;

[0053] Adjust link: adjust the transmission link;

[0054] Continue receiving: Set the waiting time, continue to receive ACK packets within the waiting time, and execute the steps to obtain the quantity.

[0055] By adopting the above technical solution, the present application can confirm whether all identification fields have been successfully parsed by judging whether the number of ACK packets is equal to the number of identification fields N. If the number of ACK packets is equal to the number of identification fields N, it means that all identification fields have been successfully parsed and the integration step can be performed. If not, it is necessary to further determine whether the number of ACK packets is greater than the number of identification fields N. If so, it means that there is a problem with the transmission link (the transmission link needs to be replaced), or the current transmission link has packet loss due to the high transmission rate (the transmission rate needs to be reduced later). If not, it means that the server where the parsing path is located has not received all QUIC data packets, and it is necessary to wait for a while to allow the sender (the party sending the identification field) to continue to receive ACK packets, and then perform the step of obtaining the number again.

[0056] Optionally, the sender's device information is added to the TEE signature of the QUIC data packet and recorded as the first information.

[0057] By adopting the above technical solution, the sender's device information is added to the TEE signature, which can be used as an additional identifier to help the receiver (the server where the resolution path is located) distinguish different data packets, thereby effectively preventing replay attacks.

[0058] Optionally, after executing the step of being greater than judgment and before executing the step of rate judgment, the method further includes:

[0059] Prefix acquisition: obtain the QUIC data packet corresponding to the current ACK packet, record it as the first data packet, and extract the first information in the TEE signature of the first data packet;

[0060] Prefix judgment: determine whether the server where the first resolution path is located has received a QUIC data packet containing the first information. If so, perform the integration step; if not, perform the rate judgment step.

[0061] By adopting the above technical solution, when the sender (the party sending the identification field) changes the IP address, it can be determined whether the sender and the receiver need to re-establish the connection by judging whether the first information has ever visited the receiver (the server where the first resolution path is located). If the sender has ever visited the receiver, it indicates that there has been a re-establishment of the connection between the sender and the receiver. The redundant ACK packets that appear at this time are generated during the re-establishment process and are not caused by packet loss. That is, the resolution sub-results are complete and the integration step can be performed. On the contrary, if the sender has never visited the receiver, it is considered that packet loss has occurred. At this time, the receiver has not received the complete identification code (all identification fields) and needs to perform the rate judgment step to further analyze the cause of the phenomenon.

[0062] In the second aspect, this application provides an identity resolution system based on industrial Internet identity resolution, which adopts the following technical solutions:

[0063] The identity resolution system based on industrial Internet identity resolution includes:

[0064] A data collection module, used for collecting the identification code to be parsed, recorded as the first identification code;

[0065] The data processing module is connected to the data acquisition module in communication, and includes a path matching unit, a node acquisition unit, and a decomposition unit;

[0066] A path matching unit, used for extracting a prefix of the first identification code, recorded as a first prefix, matching the resolution path according to the first prefix, and obtaining a first resolution path;

[0067] An acquisition node unit is used to acquire M parsing nodes in the first parsing path;

[0068] A decomposition unit, used for decomposing the first identification code according to each parsing node to obtain N identification fields;

[0069] The identification parsing module is connected to the data processing module for transmitting the ith identification field to the jth parsing node, and the jth parsing node parses the ith identification field to obtain a parsing sub-result;

[0070] The integration module is connected to the identity resolution module for integrating the N resolution sub-results into a final resolution result.

[0071] By adopting the above-mentioned technical solution, the present application obtains the identification code to be parsed through the data acquisition module, and pre-processes the code using the path matching unit, the node acquisition unit and the decomposition unit in the data processing module. Subsequently, the decomposed identification field is transmitted to the corresponding parsing node through the identification parsing module for parallel parsing, and finally the parsing sub-results are integrated into the final parsing result by the integration module. The present application can improve the parsing efficiency and accuracy.

[0072] In summary, the present application includes at least one of the following beneficial technical effects:

[0073] 1. This application collects the identification code to be parsed, extracts the prefix of the identification code, records it as the first prefix, and then matches the first prefix with the preset parsing path to quickly locate the corresponding parsing rule or path. This solution helps to improve the efficiency and accuracy of parsing and reduce unnecessary calculations and resource consumption. The identification code to be parsed is decomposed according to the parsing node to obtain multiple identification fields, each identification field is transmitted to the corresponding parsing node, and these identification fields are parsed in parallel to obtain the parsing sub-result of each identification field. This solution enables each identification field to be accurately and efficiently parsed, improves the efficiency and accuracy of parsing, and finally integrates all the parsing sub-results to form the final parsing result.

[0074] 2. When multiple first resolution paths are matched in the path matching step, by obtaining the round-trip time of each first resolution path and selecting the first resolution path with the smallest round-trip delay as the final resolution path, this solution can make decisions based on actual network performance and screen out the first resolution path with the highest resolution efficiency, further improving the overall resolution efficiency. By measuring the round-trip delay of each first resolution path, the actual performance of each first resolution path can be evaluated. A first resolution path with a smaller delay means a better network connection and a more stable resolution environment, which helps to improve the accuracy of resolution.

[0075] 3. This application can confirm whether all identification fields have been successfully parsed by judging whether the number of ACK packets is equal to the number of identification fields N. If the number of ACK packets is equal to the number of identification fields N, it means that all identification fields have been successfully parsed and the integration step can be performed. If not, it is necessary to further determine whether the number of ACK packets is greater than the number of identification fields N. If so, it means that there is a problem with the transmission link (the transmission link needs to be replaced), or the current transmission link has packet loss due to the high transmission rate (the transmission rate needs to be reduced later). If not, it means that the server where the parsing path is located has not received all QUIC data packets, and it is necessary to wait for a while to allow the sender (the party sending the identification field) to continue to receive ACK packets, and then perform the step of obtaining the number again. BRIEF DESCRIPTION OF THE DRAWINGS

[0076] Figure 1 is a flow chart of Example 1 of the present application;

[0077] Figure 2 is a flow chart of Example 2 of the present application;

[0078] Figure 3 This is a flowchart from S711 determining the ID to S72 adding in Example 3 of the present application;

[0079] Figure 4 This is a flowchart of S81 obtaining the quantity to S89 continuing to receive in Example 3 of the present application. DETAILED DESCRIPTION

[0080] The following combination Figures 1 to 4 This application is described in further detail.

[0081] Embodiment 1: This embodiment discloses an identification resolution method based on industrial Internet identification resolution, referring to Figure 1 The method includes: S1 data collection, S2 data processing, S3 identification resolution and S4 integration. First, the identification code to be resolved is collected, then the prefix of the identification code to be resolved is extracted, then the resolution path is matched according to the prefix, then the resolution node in the resolution path is extracted, then the identification code to be resolved is decomposed according to the requirements of the resolution node to obtain the identification field, then the identification field is transmitted to the corresponding resolution node, then the resolution node resolves the identification field to obtain the resolution sub-result, and then all the resolution sub-results are integrated into the final resolution result. This embodiment includes the following steps:

[0082] S1 data collection, collect the identification code to be parsed, and record it as the first identification code. The first identification code can be a string or a digital sequence containing the information required for parsing. The collection method can be user input, extraction from a file, or query in a database.

[0083] S2 data processing, including S21 path matching, S22 node acquisition and S23 decomposition.

[0084] S21 path matching, extracting the prefix of the first identification code, recording the prefix as the first prefix, the first prefix is ​​used to match the resolution path, that is, the first prefix indicates which rule or method is used to resolve the first identification code, and the matched resolution path is recorded as the first resolution path.

[0085] S22 obtains nodes and extracts M parsing nodes in the first parsing path.

[0086] S23 decomposition: according to the requirements of each parsing node, the first identification code is decomposed to obtain N identification fields.

[0087] S3 identity resolution transfers the i-th identity field to the j-th resolution node. Each resolution node is designed with specific resolution logic or rules for processing specific types of identity fields.

[0088] Then, the j-th parsing node parses the received i-th identification field and generates a parsing sub-result corresponding to the i-th identification field.

[0089] S4 integration collects all parsing sub-results (because there are N identification fields, there are N parsing sub-results), and integrates all parsing sub-results into the final parsing result.

[0090] The solution provided in this embodiment is further described below with reference to specific cases.

[0091] Assume that each package in a logistics system has a unique identification code, and a configuration table is set inside the logistics system, which lists the prefixes of all identification codes and the resolution path using the prefixes as the starting node identifier.

[0092] 1. The user enters an identification code to be parsed through the client interface of the logistics system, which is recorded as the "first identification code". For example, the first identification code entered by the user is: ABC123456789XYZ.

[0093] This first identification code contains some key information about the package, such as the logistics company's identification (prefix ABC), the package's serial number (123456789), and a check code or special identification (suffix XYZ).

[0094] 2.1 Path Matching

[0095] First, extract the prefix of the first identification code, that is, ABC. This prefix is ​​used to match the resolution path, which indicates which rule or method should be used to resolve this specific identification code. The first resolution path corresponding to the prefix ABC is: the parcel resolution rule of logistics company A.

[0096] 2.2. Get Node

[0097] In 2.1, path matching, the resolution nodes of the first resolution path corresponding to prefix ABC include:

[0098] M1-level node: Logistics company identity resolution (used to resolve prefix ABC).

[0099] M2-level node: sequence number parsing (used to parse the middle digital sequence 123456789).

[0100] M3-level node: checksum or special identifier resolution (used to resolve suffix XYZ).

[0101] 2.3 Decomposition

[0102] According to the requirements of each parsing node, the first identification code is decomposed:

[0103] Identification field one (logistics company identification): ABC.

[0104] Identification field two (serial number): 123456789.

[0105] Identification field three (check code or special identification): XYZ.

[0106] 3. Identity resolution

[0107] Transfer each identification field to the corresponding parsing node for parsing:

[0108] The first identification field (ABC) is transmitted to the M1-level node for parsing, and the parsing sub-result is Logistics Company A.

[0109] The second identification field (123456789) is transmitted to the M2-level node for parsing, and the parsing result is the specific package serial number.

[0110] The third identification field (XYZ) is transmitted to the M3 level node for parsing, and the parsing result is the verification passed or the meaning of some special identification (in this example, it is assumed that it is just a simple verification code and the verification passed).

[0111] Each parsing node is designed with specific parsing logic or rules to process specific types of identification fields and generate corresponding parsing sub-results.

[0112] 4. Integration

[0113] The logistics system collects all the parsing sub-results and integrates them into the final parsing result. In this example, the final parsing result is: the parcel serial number of logistics company A is 123456789, and the verification is passed.

[0114] This embodiment collects the identification code to be parsed (the first identification code), and then extracts the first prefix of the first identification code to match the parsing path, which is recorded as the first parsing path; then extracts M parsing nodes in the first parsing path, decomposes the first identification code according to the requirements of the parsing nodes, obtains N identification fields, transmits the identification fields to a specific parsing node for parsing, and generates parsing sub-results, aiming to process the first identification code in parallel and improve parsing efficiency; then collects and integrates all parsing sub-results into the final parsing result.

[0115] In other embodiments, before performing S1 data collection, the method further includes:

[0116] S51 defines a prefix set and formulates a prefix set, wherein the prefix set includes the start node identifiers of all resolution paths, and the start node identifier of the resolution path is recorded as the first identifier.

[0117] In this embodiment, the first identifier is the same as the first prefix. These first identifiers are the basis for subsequent path matching and node acquisition. They are intended to specify different resolution paths for different identification codes (searching for the first identifier that is the same as the first prefix in the prefix set, and then obtaining the resolution path with the first identifier), so that each identification code can be correctly resolved.

[0118] S52 establishes an association, formulating a matching rule between the prefix of the identification code and the first identifier, so that in the path matching in S21, the corresponding resolution path can be accurately found according to the prefix of the identification code.

[0119] The formulated matching rule clarifies the correspondence between the prefix of the identification code and the first identifier. For example, if the prefix ABC is the same as the first identifier ABC, then the two are associated; if the prefix ABD is different from the first identifier ABC, then the two are not associated.

[0120] This embodiment can more accurately identify and process different identification codes by defining clear prefix sets and matching rules, thereby improving the accuracy and efficiency of parsing.

[0121] Example 2: Reference Figure 2The difference between this embodiment and embodiment 1 is that in embodiment 1, it is assumed that the first resolution path matched by the first prefix is ​​unique. However, in an actual process, the first resolution path matched by the first prefix may not be unique. Therefore, after executing S21 path matching and before executing S22 obtaining the node, the following is further included:

[0122] S61 quantity judgment, judging whether the first parsing path is unique, if so, executing S22 to obtain the node; if not, executing S62 path selection.

[0123] S62 path selection, including S621 obtaining delay, S622 path evaluation, S623 changing the path, and S624 determining the path.

[0124] S621 obtains the delay, and obtains the round-trip delay of each first resolution path. The round-trip delay refers to the total time required for a data packet to be sent from the sender to the receiver and then returned from the receiver to the sender. By comparing the round-trip delays of different first resolution paths, the first resolution path with the smallest round-trip delay can be selected as the final first resolution path.

[0125] S622 path evaluation, including S6221 obtaining the used node, S6222 obtaining the bandwidth, S6223 obtaining the load, S6224 calculating the evaluation value and S6225 evaluation judgment.

[0126] S6221 obtains the usage node, obtains the number of parsing nodes used to parse the first identification code in the final first parsing path, and records it as the first data.

[0127] S6222 obtains bandwidth, obtains the network link that transmits the i-th identification field to the final first resolution path, recorded as the first network link, and obtains the bandwidth occupied by the first network link when transmitting the i-th identification field, recorded as second data.

[0128] S6223 obtains the load and obtains the traffic carried by the final first resolution path in real time, which is recorded as the third data.

[0129] S6224 calculates the evaluation value, and calculates the evaluation result of the final first parsing path. The calculation model is as follows:

[0130] ;

[0131] Among them, F is the evaluation result; is the weight of the first data; A is the first data; M is the number of parsing nodes; is the weight of the second data; The uplink bandwidth of the first network link for transmitting the i-th identification field; The downlink bandwidth of the first network link for transmitting the i-th identification field; is the second data; N is the number of identification fields; is the weight of the third data; C is the maximum flow that the final first resolution path can carry; D is the third data.

[0132] S6225 evaluates and determines whether the evaluation result of the final first parsing path is greater than the preset threshold. If so, it means that the current parsing path meets expectations, and then S624 is executed to determine the path; if not, it means that the current parsing path does not meet expectations, and S623 needs to be executed to change the path.

[0133] S623: Change the path, calculate the evaluation results of all the first parsing paths, record them as fourth data, and select the first parsing path corresponding to the largest fourth data as the new final first parsing path.

[0134] S624 determines the path, and uses the new final first resolution path in the path replacement in S623 as the new first resolution path.

[0135] After executing the path matching step, this embodiment will execute the quantity judgment step. If the first resolution path is not unique, the path selection step will be executed, which includes obtaining the round-trip delay of each first resolution path, and performing a comprehensive path evaluation based on the number of resolution nodes, network link bandwidth, first resolution path load and other factors. In this process, it involves obtaining the node, bandwidth, and load data used, and calculating the evaluation value to judge the quality of the first resolution path. If the evaluation result does not meet the preset standard, the first resolution path is replaced until the optimal first resolution path is found and determined as the new first resolution path. If the first resolution path is unique, the node acquisition step is directly executed. This embodiment improves the accuracy and flexibility of the first resolution path selection, and also improves the efficiency and reliability of subsequent node acquisition and data transmission.

[0136] Example 3: Reference Figure 3 The difference between this embodiment and embodiment 1 is that after executing S2 data processing and before executing S3 identifier resolution, it also includes:

[0137] S71 encapsulation includes S711 determining ID, S712 calculating offset, S713 setting length and S714 padding.

[0138] S711 determines the ID and assigns a Stream ID to each parsing node. The Stream ID is consistent with the level number of the parsing node. The Stream ID not only helps to identify the Stream frame, but also ensures that the data stream is unique and orderly during the transmission process.

[0139] S712 calculates an offset, calculates an offset of the i-th identification field, and uses the offset as an Offset value of the Stream frame. The offset enables the identification fields to be correctly arranged within the frame.

[0140] S713 sets the length, obtains the length of the i-th identification field, records it as the fifth data, and uses the fifth data as the data length of the Stream frame.

[0141] S714 fills and encapsulates the i-th identification field in the Data field of the Stream frame.

[0142] S72 adds a QUIC header to the Stream frame to generate a QUIC data packet. The QUIC header includes information such as connection ID and version number.

[0143] In order to enhance the security and traceability of the data packet, the sender's device information is also added to the TEE signature of the QUIC data packet and recorded as the first information.

[0144] In S3 identification resolution, the QUIC data packet containing the i-th identification field is transmitted to the j-th resolution node. When the j-th resolution node receives the i-th identification field, it will parse it and finally output an ACK packet including the resolution sub-result.

[0145] Assume that you need to parse an identification code that contains multiple identification fields, one of which is "ABC". Follow the steps of S71 encapsulation to process this data stream:

[0146] S711 Confirm ID:

[0147] First, a Stream ID is assigned to each parsing node. The level number of the parsing node with the transmission identification field "ABC" is "2", so a Stream ID of "2" is assigned to the parsing node. This Stream ID not only helps to identify the parsing node, but also enables the data stream to be transmitted in a directional manner according to the Stream ID.

[0148] S712 calculates the offset:

[0149] Calculate the offset of the identification field "ABC". "ABC" is the first identification field in the data stream, so the offset is "0". This offset will be used as the Offset value of the Stream frame to correctly locate the position of "ABC" in the Stream frame.

[0150] S713 Setting length:

[0151] The length of the identification field "ABC" is "3" (that is, 3 bytes), so the data length of the Stream frame is also "3".

[0152] S714 Filling:

[0153] The "ABC" identification field is encapsulated in the Data field of the Stream frame. At this time, the Stream frame contains the Offset value (0), the data length (3), and the actual "ABC" data.

[0154] After completing S71 encapsulation, perform S72 adding steps:

[0155] S72 added:

[0156] On the basis of the Stream frame, the QUIC header is added to obtain the QUIC data packet. The QUIC header includes information such as the connection ID and version number. In order to enhance the security and traceability of the data packet, the sender's device information is also added to the TEE signature of the QUIC data packet, which is recorded as the first information.

[0157] Now, the QUIC data packet containing the "ABC" identification field is ready to be transmitted to the corresponding parsing node.

[0158] S3 Identity Resolution:

[0159] This QUIC data packet is transmitted to the second parsing node, which parses the identification field "ABC" and outputs an ACK packet including the parsing sub-result (Logistics Company A).

[0160] This ACK packet can confirm the reception and parsing results of the data packet so that the sender knows that the data packet has been successfully transmitted and correctly parsed.

[0161] This embodiment assigns a Stream ID to the parsing node, then calculates the offset of the identification field, sets the data length and encapsulates it into a Stream frame, then adds a QUIC header, and adds device information to the TEE signature of the QUIC data packet, so that the data packet remains intact while having a certain degree of traceability. This example enables the QUIC data packet containing the i-th identification field to be accurately transmitted to the j-th parsing node, and then the j-th parsing node parses the i-th identification field, and then outputs an ACK packet containing the parsing sub-result, thereby improving the efficiency and accuracy of the entire parsing process.

[0162] Reference Figure 4 In other embodiments, after performing S3 identification resolution and before performing S4 integration, the method further includes:

[0163] S81 obtains the number, obtains the number of ACK packets, and records it as the sixth data.

[0164] S82 is equal to the judgment, judging whether the sixth data is equal to the number N of identification fields. If so, it means that the transmission process of the QUIC data packet is as expected, and then S4 integration is executed; if not, it means that there is a problem with the transmission link of the QUIC data packet, or packet loss occurs when transmitting the QUIC data packet, and it is necessary to execute S83 greater than the judgment.

[0165] S83 is greater than judgment, judging whether the fifth data is greater than the number N of identification fields. If so, it means that packet loss has occurred or the (sender and receiver) need to re-establish the connection due to network instability, and it is necessary to execute S84 prefix acquisition; if not, it means that not all ACK packets have been received, and it is necessary to execute S89 to continue receiving.

[0166] S84 prefix acquisition, obtain the QUIC data packet corresponding to the current ACK packet, record it as the first data packet, and extract the first information from the TEE signature of the first data packet.

[0167] S85 prefix judgment determines whether the server where the first resolution path is located has received the QUIC data packet containing the first information. If so, it means that the sender and the receiver have established a connection before, but due to network reasons, the two need to reconnect, so more than N ACK packets are received, and no failure occurs. S4 integration can be executed directly; if not, it means that packet loss has occurred. At this time, the sender receives all the resolution sub-results and cannot be integrated. It is necessary to execute S86 rate judgment.

[0168] S86 rate judgment determines whether the transmission rate of the QUIC data packet exceeds the preset threshold. If so, it means that the current network or server is in an overloaded state, resulting in packet loss during transmission, and it is necessary to execute S87 to adjust the rate; if not, it means that there is a fault in the current transmission link, and it is necessary to execute S88 to adjust the link.

[0169] S87 adjusts the rate to reduce the transmission rate of the QUIC data packet, and then re-executes S86 rate judgment until the QUIC data packet can be transmitted normally, and then resends the QUIC data packet corresponding to the first identification code.

[0170] S88 adjusts the link, replaces the transmission link, and re-executes S71 encapsulation on the new transmission link.

[0171] S89 continues to receive, sets the waiting time, continues to receive ACK packets within the waiting time, and executes S81 to obtain the quantity.

[0172] This embodiment determines whether the parsing sub-results can be integrated based on whether the number of ACK packets is equal to the number N of identification fields. The present application also analyzes the cause of this phenomenon when the number of ACK packets is not equal to the number N of identification fields, and takes corresponding improvement measures. Through this embodiment, the parsing process of the first identification code and the integration process of the parsing sub-results can be more accurately controlled in network transmission, thereby improving the efficiency and reliability of data transmission.

[0173] Embodiment 4: This embodiment discloses an identity resolution system based on industrial Internet identity resolution, and the system includes:

[0174] The data collection module is used to collect the identification code to be parsed, which is recorded as the first identification code.

[0175] The data processing module is connected to the data acquisition module in communication, and includes a path matching unit, a node acquisition unit and a decomposition unit.

[0176] The path matching unit is used to extract the prefix of the first identification code, record the prefix of the first identification code as a first prefix, and match the resolution path according to the first prefix to obtain the first resolution path.

[0177] The node acquisition unit is used to acquire M parsing nodes in the first parsing path. These parsing nodes are pre-configured and have the ability to parse data of a specific type or format.

[0178] The decomposition unit is responsible for decomposing the first identification code according to the requirements of each parsing node.

[0179] The identification resolution module is connected to the data processing module for transmitting the ith identification field to the corresponding jth resolution node, and the jth resolution node resolves the received ith identification field to obtain a resolution sub-result.

[0180] The integration module is connected to the identity resolution module for integrating the N resolution sub-results into a final resolution result.

[0181] The data acquisition module of this system is responsible for collecting the identification codes to be parsed, and the data processing module prepares for parsing through steps such as path matching, node acquisition and code decomposition. The identification parsing module transmits the decomposed identification field to the corresponding parsing node for parsing and generates parsing sub-results. Finally, the integration module integrates these parsing sub-results into the final parsing result. Each module works together to achieve an efficient and accurate data parsing process.

[0182] The above are all preferred embodiments of the present application, and the protection scope of the present application is not limited thereto. Therefore, any equivalent changes made according to the structure, shape, and principle of the present application should be included in the protection scope of the present application.

Claims

1. An identification resolution method based on industrial Internet identification resolution, characterized in that: include: Data collection: collect the identification code to be parsed and record it as the first identification code; Data processing: including path matching, node acquisition and decomposition; Path matching: extract the prefix of the first identification code, record it as the first prefix, match the resolution path according to the first prefix, and obtain the first resolution path; Quantity judgment: judge whether the first parsing path is unique. If so, execute the step of obtaining nodes; if not, execute the step of path selection; Path selection: including obtaining delay and determining path; Obtaining delay: Obtain the round-trip delay of each first resolution path, and select the first resolution path with the smallest round-trip delay as the final first resolution path; Path evaluation: including obtaining the used nodes, obtaining the bandwidth, obtaining the load, calculating the evaluation value and making evaluation judgments; Obtaining used nodes: obtaining the number of parsing nodes used to parse the first identification code in the final first parsing path, and recording it as first data; Obtaining bandwidth: obtaining a network link for transmitting the i-th identification field to the final first resolution path, recorded as the first network link, and obtaining a bandwidth occupied by the first network link when transmitting the i-th identification field, recorded as the second data; Obtaining the load: obtaining the traffic carried by the final first resolution path in real time, recorded as the third data; Calculate the evaluation value: Calculate the evaluation result of the final first parsing path. The calculation model is as follows: ； Among them, F is the evaluation result; is the weight of the first data; A is the first data; is the weight of the second data; The uplink bandwidth of the first network link for transmitting the i-th identification field; The downlink bandwidth of the first network link for transmitting the i-th identification field; is the second data; is the weight of the third data; C is the maximum flow that the final first resolution path can carry; D is the third data, and M is the number of resolution nodes; Evaluation and judgment: judging whether the evaluation result of the final first parsing path is greater than a preset threshold, if so, executing the step of determining the path; if not, executing the step of changing the path; Change path: Calculate the evaluation results of all first analytical paths, record them as the fourth data, and select the first analytical path corresponding to the maximum fourth data as the new final first analytical path; Determine the path: use the final first parsing path as a new first parsing path; Get nodes: Get M parsing nodes in the first parsing path; Decomposition: Decompose the first identification code according to the requirements of each parsing node to obtain N identification fields; Identity resolution: The i-th identity field is transmitted to the j-th resolution node, and the j-th resolution node resolves the i-th identity field to obtain a resolution sub-result; Integration: Integrate N sub-analysis results into the final analysis result.

2. The identification resolution method based on industrial Internet identification resolution according to claim 1 is characterized in that: Before executing the data collection step, it also includes: Define a prefix set: formulate a prefix set, the prefix set includes the start node identifiers of all resolution paths, and the start node identifier is recorded as the first identifier; Association: Establish matching rules between the prefix of the identification code and the first identifier.

3. The identification resolution method based on industrial Internet identification resolution according to claim 1 or 2 is characterized in that: After executing the step of data processing and before executing the step of identity resolution, the method further includes: Encapsulation: including assigning ID, calculating offset, setting length and padding; Assign ID: Assign a Stream ID to each parsing node; Calculate the offset: calculate the offset of the i-th identification field, and use the offset as the Offset value of the Stream frame; Set length: Get the length of the i-th identification field, record it as the fifth data, and use the fifth data as the data length of the Stream frame; Filling: Encapsulate the i-th identification field in the Data field of the Stream frame; Add: Add a QUIC header to the Stream frame to obtain a QUIC data packet.

4. The identification resolution method based on industrial Internet identification resolution according to claim 3 is characterized in that: In the identification resolution step, the QUIC data packet containing the i-th identification field is transmitted to the j-th resolution node, and the j-th resolution node parses the i-th identification field and outputs an ACK packet including the resolution sub-result.

5. The identification resolution method based on industrial Internet identification resolution according to claim 4 is characterized in that: After executing the identity resolution step and before executing the integration step, the following steps are also included: Acquisition quantity: the number of ACK packets obtained, recorded as the sixth data; Equal to judgment: judging whether the sixth data is equal to the number N of identification fields, if so, executing the integration step; if not, executing the greater than judgment step; Greater than judgment: judging whether the sixth data is greater than the number N of the identification field, if so, executing the rate judgment step; if not, executing the step of continuing to receive; Rate determination: Determine whether the transmission rate of the QUIC data packet exceeds the preset threshold. If so, execute the step of adjusting the rate; if not, execute the step of adjusting the link; Adjust rate: reduce the transmission rate of QUIC packets; Adjust link: adjust the transmission link; Continue receiving: Set the waiting time, continue to receive ACK packets within the waiting time, and execute the steps to obtain the quantity.

6. The identification resolution method based on industrial Internet identification resolution according to claim 5 is characterized in that: The sender’s device information is added to the TEE signature of the QUIC data packet and recorded as the first information.

7. The identification resolution method based on industrial Internet identification resolution according to claim 6 is characterized in that: After executing the step of greater than judgment and before executing the step of rate judgment, the method further includes: Prefix acquisition: obtain the QUIC data packet corresponding to the current ACK packet, record it as the first data packet, and extract the first information in the TEE signature of the first data packet; Prefix judgment: determine whether the server where the first resolution path is located has received a QUIC data packet containing the first information. If so, perform the integration step; if not, perform the rate judgment step.

8. An identity resolution system based on industrial Internet identity resolution, the system being used to execute the method according to any one of claims 1 to 7, characterized in that: include: A data collection module, used for collecting the identification code to be parsed, recorded as the first identification code; The data processing module is connected to the data acquisition module in communication, and includes a path matching unit, a node acquisition unit, and a decomposition unit; A path matching unit, used for extracting a prefix of the first identification code, recorded as a first prefix, matching the resolution path according to the first prefix, and obtaining a first resolution path; An acquisition node unit is used to acquire M parsing nodes in the first parsing path; A decomposition unit, used for decomposing the first identification code according to each parsing node to obtain N identification fields; The identification parsing module is connected to the data processing module for transmitting the ith identification field to the jth parsing node, and the jth parsing node parses the ith identification field to obtain a parsing sub-result; The integration module is connected to the identity resolution module for integrating the N resolution sub-results into a final resolution result.

Images