A communication method and module supporting multiple communication protocols

Abstract

This invention discloses a communication method and module supporting multiple communication protocols, specifically relating to the field of network communication technology. This invention constructs a multi-dimensional dynamic routing decision system, significantly improving communication stability and transmission performance. It calculates the link quality coefficient by comprehensively considering four core indicators: link latency, packet loss rate, remaining bandwidth, and jitter. It also calculates the stability evaluation coefficient by combining node CPU, memory, and session load, and obtains a path evaluation coefficient through weighted fusion. This replaces traditional single-dimensional static routing, accurately selecting the path with the best overall performance. Simultaneously, it predicts fault risks based on historical fault performance, selects low-overlapping primary and backup paths to achieve fault isolation, and allows seamless switching during faults, effectively avoiding communication interruptions caused by single-point failures and adapting to the high-reliability communication requirements of complex edge network environments.

Description

Technical Field

[0001] This invention relates to the field of network communication technology, and more specifically, to a communication method and communication module that supports multiple communication protocols. Background Technology

[0002] With the rapid development of industries such as the Industrial Internet of Things, smart cities, smart grids, and vehicle-to-everything (V2X), the number of terminal devices connected in edge scenarios has exploded. The communication protocols used by terminal devices with different application scenarios, different manufacturers, and different functions are significantly heterogeneous. Various protocols have essential differences in frame structure, interaction timing, verification mechanisms, and semantic models, forming serious protocol barriers and becoming the core bottleneck for the interconnection, data collaboration, and command interaction of heterogeneous terminal devices.

[0003] Existing communication methods that support multiple communication protocols still have the following technical shortcomings in practical applications: The routing and forwarding mechanisms of existing multi-protocol communication solutions have serious deficiencies. Most existing routes are statically configured fixed paths or single-dimensional dynamic routes based solely on network hop count. They do not comprehensively consider multi-dimensional indicators such as link latency, packet loss rate, remaining bandwidth, node load, and path stability. In edge scenarios with complex network environments and frequent fluctuations in link quality, they cannot select the transmission path with the best overall performance, which can easily lead to problems such as communication lag, packet loss, and transmission interruption. More importantly, existing solutions lack the ability to predict and recover from communication link and node failures. They cannot predict the failure risk of links and nodes based on historical failure performance, nor can they plan primary and backup paths with fault isolation capabilities in advance. At the same time, existing solutions do not consider the overlap of nodes and links in the primary and backup paths when planning backup paths. Primary and backup paths often have a large number of overlapping forwarding nodes and transmission links. Once a single point of failure occurs, the primary and backup paths will fail simultaneously, making it impossible to achieve true fault recovery and difficult to meet the requirements of application scenarios with extremely high communication continuity requirements, such as industrial scenarios.

[0004] To address this, a communication method and module supporting multiple communication protocols have been developed. Summary of the Invention

[0005] To overcome the above-mentioned deficiencies of the prior art, embodiments of the present invention provide a communication method and communication module that support multiple communication protocols.

[0006] To achieve the above objectives, the present invention provides the following technical solution: A communication method supporting multiple communication protocols, comprising: Each proxy node broadcasts the protocol fingerprints it supports and its own network address to other proxy nodes, forming a protocol capability graph. When source device A intends to communicate with target device B, source device A will send a request data packet to the first communication proxy node directly connected to it. The first communication agent node searches the protocol capability graph for communication agent nodes that can process the intent object and are directly connected to the target device B, based on the intent object in the request data packet. For each candidate target agent node, the multi-constraint target optimization algorithm is used to calculate the path evaluation coefficient of each candidate path from the first communication agent node to the target candidate agent node. The path evaluation coefficient of each candidate path is compared with the preset path threshold coefficient. Based on the comparison results, the candidate combination paths are output and filtered to determine the selectable proxy nodes. Each candidate path determined in the selectable proxy nodes is comprehensively analyzed based on the path evaluation coefficient and the fault trend prediction results, and the second communication proxy node and its primary and backup paths are output. A connection is established through a high-speed virtual channel. The first communication agent node sends the intent object along with the original data payload to the second communication agent node through the virtual channel. After receiving the intent object, the second communication agent node reassembles the intent object into a data packet of the protocol supported by the target device B and sends it to the target device B.

[0007] Specifically, the calculation logic of the path evaluation coefficient; The link quality parameters and node load status of each candidate path are correlated and analyzed to determine the link quality coefficient and stability evaluation coefficient of the candidate path. After weighted fusion processing, the path evaluation coefficient of each candidate path in the target candidate proxy node is obtained.

[0008] Specifically, the logic for calculating the chain quality coefficient; Link quality parameters include cumulative path delay, cumulative path packet loss rate, minimum remaining path bandwidth, and cumulative path jitter. Extract the hop-by-hop link sequence of the candidate path; The cumulative path delay is obtained by summing the effective delay values ​​of each single-hop link in the hop-by-hop link sequence; the cumulative path packet loss rate is obtained by summing the effective packet loss values ​​of each single-hop link in the hop-by-hop link sequence; the remaining available bandwidth of each single-hop link in the hop-by-hop link sequence is obtained, and the minimum remaining available bandwidth of all single-hop links in the candidate path is taken as the minimum remaining bandwidth of the candidate path; the single-hop jitter of each single-hop link in the hop-by-hop link sequence is obtained, and the cumulative path jitter is obtained by calculating the average value of the algorithm. The chain quality coefficient is obtained by weighting and fusing the cumulative path delay, cumulative path packet loss rate, minimum remaining bandwidth of the path, and cumulative path jitter.

[0009] Specifically, the communication proxy node sends probe messages to all directly connected adjacent nodes at set intervals. After receiving the probe messages, the directly connected adjacent nodes immediately send back response messages. After receiving the response messages, the communication proxy node records the time of receipt and calculates the single-hop bidirectional average delay using the standard bidirectional delay formula. The sliding average of the single-hop bidirectional average delay of the communication proxy node five times before the current time is taken as the effective delay value of the single-hop link. Within the set detection period, x probe messages with consecutive sequence numbers are sent continuously; x > 80; the receiving node counts the number of successfully received messages and calculates the active probe packet loss rate; the node counts the actual transmission and reception of service traffic on the direct link in real time and calculates the actual packet loss rate of service traffic; the weighted average of active probe and passive statistics is taken as the effective packet loss value of the single-hop link. Every set time interval, the node counts the bidirectional real-time traffic rate on the direct link and takes the average value of the bidirectional traffic as the real-time occupied bandwidth. The total link bandwidth is then subtracted from the real-time occupied bandwidth to obtain the remaining available bandwidth for a single hop. Obtain the continuous single-hop bidirectional delay sequence within the sliding window, calculate the absolute value of the delay difference between two consecutive probes, and then calculate the single-hop jitter using the root mean square.

[0010] Specifically, the calculation logic for the stability assessment coefficient; Node load status includes CPU utilization, memory utilization, and forwarding session utilization; The forwarding session utilization rate represents the proportion of the number of cross-protocol forwarding sessions currently marked as active by the node to the maximum stable number of sessions that the node can carry. After weighted fusion of CPU utilization, memory utilization, and forwarding session utilization of all proxy nodes along the candidate path, the load evaluation coefficient of a single node is obtained. The average load evaluation coefficients of all proxy nodes traversed by the candidate path are calculated to obtain the stability evaluation coefficient of the candidate path.

[0011] Specifically, the filtering logic for optional proxy nodes; For each candidate proxy node, sort the candidate paths from smallest to largest, and select the top two candidate paths as the combined path based on the sorting results. If the path evaluation coefficients of a certain combination path are all lower than the path threshold coefficient, it is determined to be a candidate combination path; Obtain the candidate combination paths for each candidate proxy node and calculate the path overlap of the candidate combination paths. If the path overlap of the candidate combination paths for a certain candidate proxy node is lower than the preset reference overlap, it is marked as a selectable proxy node. The path overlap of the candidate combination paths is the proportion of the intersection of the nodes passed through by the two paths to their union.

[0012] Specifically, the determination logic for the second communication agent node and its primary / backup paths; After analyzing the path evaluation coefficients of the candidate combination paths in the optional agent nodes in conjunction with the fault trend prediction results, the fusion evaluation coefficients of the candidate combination paths in the optional agent nodes are determined. Identify the path with the lowest fusion evaluation coefficient and select the corresponding alternative proxy node as the second communication proxy node; The path with the lowest fusion evaluation coefficient among the second communication nodes will be the primary execution path, and the other path will be the backup path.

[0013] Specifically, the failure trend prediction result is a failure trend additional coefficient; The fault trend additional coefficient is obtained by weighting and fusing the fault performance parameters of each path in the selected combination path within a set time zone before the current time point, and then through pre-edited mapping and transformation rules. The fusion evaluation coefficient is obtained by multiplying the path evaluation coefficient by the failure trend additional coefficient.

[0014] Specifically, the fault performance parameters include the number of node failures, the duration of continuous abnormalities of nodes, the number of node session rejections, and the number of times the associated links of nodes are interrupted. After weighted fusion of the fault performance parameters of the nodes contained in each path in the candidate combined path, the node anomaly coefficient is obtained. The average of the node anomaly coefficients of the nodes contained in each path is taken to obtain the comprehensive fault coefficient of each path in the candidate combined path. The comprehensive fault coefficient is then substituted into the mapping transformation rule to transform the fault trend additional coefficient.

[0015] A communication module supporting multiple communication protocols, comprising: Protocol Status Declaration Module: Monitors network interfaces to capture data packets, extracts protocol features to generate fingerprints, and propagates them through broadcast protocols to form a protocol capability map; Semantic intent parsing module: When source device A intends to communicate with target device B, source device A will send a request data packet to the first communication proxy node directly connected to it; Multi-constraint route calculation module: Based on the intent object in the request data packet, it searches the protocol capability graph for communication proxy nodes that can process the intent object and are directly connected to the target device B as candidate communication proxy nodes, and calculates the path evaluation coefficient for each candidate path for each candidate target proxy node. Primary and backup path determination module: The path evaluation coefficient of each candidate path is compared with the preset path threshold coefficient. Based on the comparison results, the candidate combination paths are output and filtered to determine the optional proxy nodes. Each candidate path determined in the optional proxy nodes is comprehensively analyzed based on the path evaluation coefficient and the fault trend prediction results, and then the second communication proxy node and its primary and backup paths are output.

[0016] Direct connection assembly communication module: The first communication agent node and the second communication agent node establish a connection through a high-speed virtual channel. The first communication agent node sends the intent object along with the original data payload to the second communication agent node through the virtual channel. After receiving the intent object, the second communication agent node reassembles the intent object into a data packet of the protocol supported by the target device B and sends it to the target device B.

[0017] The technical effects and advantages of this invention are as follows: (1) This invention constructs a multi-dimensional dynamic routing decision system, which greatly improves communication stability and transmission performance. It calculates the link quality coefficient by comprehensively considering four core indicators: link delay, packet loss rate, remaining bandwidth, and jitter. It also calculates the stability evaluation coefficient by combining node CPU, memory, and session load. The weighted fusion is used to obtain the path evaluation coefficient, which replaces the traditional single-dimensional static routing and accurately selects the path with the best comprehensive performance. At the same time, it predicts the failure risk by combining historical failure performance, selects low overlap primary and backup paths to achieve fault isolation, and can seamlessly switch during failure, effectively avoiding communication interruption caused by single point failure, and adapting to the high reliability communication requirements of complex edge network environments. (2) This invention achieves accurate and reliable interconnection of heterogeneous protocols, effectively breaking down protocol barriers. By extracting protocol features to generate a unique fingerprint, and combining it with distributed broadcasting to form a protocol capability map, it can quickly match proxy nodes that support the target protocol. At the same time, it adopts semantic-level intent parsing to extract standardized intent objects that are unrelated to the protocol, replacing the traditional syntax-level protocol conversion, thus avoiding semantic distortion and instruction execution deviation in cross-protocol communication from the root, and greatly improving the accuracy and compatibility of cross-protocol interaction. Attached Figure Description

[0018] Figure 1 This is a flowchart of a communication method supporting multiple communication protocols according to the present invention; Figure 2 This is a flowchart of a communication module supporting multiple communication protocols according to the present invention. Detailed Implementation

[0019] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention. Example

[0020] like Figure 1 As shown, a communication method supporting multiple communication protocols is as follows: Protocol status declaration: Each communication agent node listens to its network interface, captures raw data packets, performs deep packet inspection on the captured data packets, extracts their protocol features, and generates a unique protocol fingerprint for that protocol. Protocol features include, but are not limited to: frame header structure, synchronization header, verification method, specific port number, and communication timing.

[0021] Each proxy node propagates the protocol fingerprints it supports and its own network address to other proxy nodes in the shared network via broadcast or gossip protocol, forming a protocol capability graph; Communication proxy nodes are deployed at the network edge and are directly connected to terminal devices in the corresponding area. They are used to realize data packet capture, protocol identification, semantic parsing, route calculation, protocol encapsulation and forwarding of terminal devices.

[0022] Semantic intent parsing: When source device A intends to communicate with target device B, source device A will send a request data packet to the first communication proxy node directly connected to it; The first communication agent node does not directly perform protocol conversion, but rather performs semantic deconstruction on data packets, extracts the core intent of the communication, and forms an intent object that is independent of the specific protocol. The core intent includes the operation object, operation type, and operation parameters.

[0023] Multi-constraint route calculation: The first communication agent node searches the protocol capability map for communication agent nodes that can process the intent object and are directly connected to the target device B, based on the intent object in the request data packet. For each candidate target agent node, the multi-constraint target optimization algorithm is used to calculate the path evaluation coefficient of each candidate path from the first communication agent node to the target candidate agent node. Pre-filtering conditions for candidate communication proxy nodes: Does the protocol fingerprint database of the candidate communication agent node contain the corresponding protocol fingerprint of the protocol used by the target device B, and does it have the semantic mapping, encapsulation and forwarding capabilities of the protocol? Does the candidate communication proxy node have a direct physical / logical link with the target device B, and does it have the ability to directly send and receive data packets to and from the target device B?

[0024] Communication proxy nodes that meet the above conditions are selected as candidate communication proxy nodes.

[0025] Specifically: Correlation analysis is performed on the link quality parameters and node load status of each candidate path to determine the path evaluation coefficient of each candidate path in the target candidate proxy node; Link quality parameters include cumulative path delay, cumulative path packet loss rate, minimum remaining path bandwidth, and cumulative path jitter. The communication proxy node sends TWAMP probe messages to all directly connected neighboring nodes every set interval (100ms); The message includes the sending node ID, the receiving node ID, and the sending end's local timestamp. And the message sequence number.

[0026] After receiving the probe message, the directly connected adjacent node immediately sends back a response message; The response message includes: the receiver's local reception timestamp. Receiver response sending timestamp .

[0027] After receiving the response message, the communication proxy node records the time of receipt. The average single-hop bidirectional delay is calculated using the standard bidirectional delay formula. Single-hop bidirectional average delay ;in The total round-trip time of the message. The processing time for the receiving node is in milliseconds (ms).

[0028] Each communication proxy node is only responsible for collecting single-hop link quality data between itself and its directly connected neighboring proxy nodes. Cross-hop link data is obtained synchronously through a distributed protocol, with no centralized collection node.

[0029] Take the sliding average of the single-hop bidirectional average delay of the 5 communication proxy nodes before the current time point as the effective delay value of the single-hop link. If there is no response after 3 consecutive probes, the link is determined to be interrupted, the effective delay value is marked as infinite, and the link status is set to unreachable. The node synchronizes the effective latency values ​​of all directly connected links to all proxy nodes in the network via the Gossip protocol, and each node maintains a network-wide single-hop link latency matrix locally.

[0030] It shares TWAMP messages with delayed probes and continuously sends x probe messages with consecutive sequence numbers within a set probe period; x > 80 and is an integer, here we take 100; The receiving node counts the number of successfully received packets and calculates the active packet loss rate. Active packet loss rate = (Total number of packets sent - Number of packets successfully received) / Total number of packets sent.

[0031] The node provides real-time statistics on the actual transmission and reception of business traffic on the directly connected link and calculates the actual packet loss rate of the business traffic; based on TCP acknowledgment messages; Actual packet loss rate = (Total number of forwarded data packets - Number of data packets confirmed received by the other end) / Total number of forwarded data packets; The weighted average of active detection and passive statistics is taken as the effective value of packet loss for a single-hop link; The active packet loss rate and the actual packet loss rate will be multiplied by their respective set weight coefficients, then summed and divided by 2 to obtain the effective packet loss value. The default active weight is 0.3 and the passive weight is 0.7, with the passive statistics being more in line with real business scenarios.

[0032] If the packet loss rate is 100% for two consecutive detection cycles, the link is determined to be interrupted, l_i=1, and the link status is set to unreachable.

[0033] Each node synchronizes the effective packet loss values ​​of all directly connected links to the entire network via the Gossip protocol, and each node maintains a local single-hop link packet loss rate matrix for the entire network.

[0034] Every set time interval, the node counts the real-time bidirectional traffic rate on the direct link and takes the average value of the bidirectional traffic as the real-time bandwidth occupied. Subtract the real-time occupied bandwidth from the total link bandwidth to obtain the remaining available bandwidth for a single hop. Total link bandwidth acquisition: When adjacent nodes establish a direct link, they automatically negotiate and announce the total physical bandwidth of the link to each other through the interface (e.g., 1000Mbps for Gigabit Ethernet, 1200Mbps for WiFi 6 link), which serves as the benchmark value for bandwidth calculation.

[0035] Each node synchronizes the remaining single-hop bandwidth of all directly connected links to the entire network via the Gossip protocol, and each node maintains a matrix of the remaining single-hop bandwidth of the entire network locally.

[0036] It shares TWAMP messages with single-hop delay probes to obtain the continuous single-hop bidirectional delay sequence within the sliding window (defaulting to the last 10 probes); Calculate the absolute value of the delay difference between two consecutive probes, and then calculate the single-hop jitter using the root mean square. Single jump jitter Where k is the number of probes within the sliding window, and m is the probe number. It represents the absolute value of the delay difference between two consecutive detections.

[0037] Each node synchronizes the single-hop jitter of all directly connected links to the entire network via the Gossip protocol, and each node maintains a network-wide single-hop link jitter matrix locally.

[0038] Extract the hop-by-hop link sequence of candidate paths from the locally maintained network link matrix; For example, the first communication agent node S → node A → node B → target candidate agent node T is broken down into 3 single-hop links: SA, AB, and BT; The cumulative path delay is obtained by summing the effective delay values ​​of each single-hop link in the hop-by-hop link sequence; the candidate path has 3 hops. =10ms =15ms If the latency is 5ms, then the cumulative path delay is 10 + 15 + 5 = 30ms. This represents the total end-to-end transmission time. The larger the value, the slower the communication response, leading to the failure of services such as real-time control and data synchronization.

[0039] The cumulative packet loss rate of the path is obtained by summing the effective packet loss values ​​calculated for each single-hop link in the hop-by-hop link sequence. This represents the probability of end-to-end data packet loss. The higher the value, the lower the reliability of data transmission, leading to data retransmission, command execution failure, and communication interruption.

[0040] Obtain the remaining available bandwidth of each single-hop link in the hop-by-hop link sequence, and take the minimum remaining available bandwidth of all single-hop links in the candidate path as the minimum remaining bandwidth of the candidate path. The bottleneck bandwidth of the path is represented. The smaller the value, the weaker the transmission capacity, which can lead to traffic congestion, spiked latency, and failure of large file transfers.

[0041] The single-hop jitter of each single-hop link in the hop-by-hop link sequence is obtained, and the cumulative path jitter is obtained by calculating the average value of the algorithm. This represents the fluctuation range of end-to-end latency. The larger the value, the worse the communication stability, leading to real-time service lag, data packet out-of-order issues, and reduced control precision.

[0042] The chain quality coefficient is obtained by weighting and fusing the cumulative path delay, cumulative path packet loss rate, minimum remaining bandwidth of the path, and cumulative path jitter. The specific calculation process is as follows: The path cumulative delay, path cumulative packet loss rate, path minimum remaining bandwidth, and path cumulative jitter are marked as follows: as well as Chain quality coefficient ;in as well as This indicates the preset allowed path cumulative latency, allowed path cumulative packet loss rate, allowed path minimum remaining bandwidth, and allowed path cumulative jitter; These are preset weighting coefficients, and their sum is one.

[0043] Node load status includes CPU utilization, memory utilization, and forwarding session utilization; The forwarding session utilization rate represents the proportion of the number of cross-protocol forwarding sessions currently marked as active by the node to the node's maximum stable capacity of sessions, directly reflecting the forwarding service load pressure on the node. CPU utilization is the real-time CPU load rate of the proxy node, which represents the node's computing resource usage. Memory utilization rate is the real-time memory usage of the agent node, representing the node's memory resource usage.

[0044] After weighted fusion of CPU utilization, memory utilization, and forwarding session utilization of all proxy nodes along the candidate path, the load evaluation coefficient of a single node is obtained. The specific calculation process is as follows: After normalizing CPU utilization, memory utilization, and forwarding session utilization, the results are substituted into the formula. ; calculate the load evaluation coefficient. ;in This represents CPU utilization, memory utilization, and forwarding session utilization. These are preset weighting coefficients, and their sum is one.

[0045] The average load evaluation coefficients of all proxy nodes traversed by the candidate path are calculated to obtain the stability evaluation coefficient of the candidate path. The load assessment coefficient represents the overall forwarding pressure of all communication agent nodes participating in packet forwarding on the candidate path. It is an aggregated quantitative value of the comprehensive load status of a single node. The larger the value, the higher the node's computing / memory / forwarding resource consumption, the higher the risk of communication lag, packet loss, session rejection, and the lower the routing priority.

[0046] After weighted fusion of the chain quality coefficient and stability evaluation coefficient of the candidate paths, the path evaluation coefficient of each candidate path in the target candidate proxy node is obtained. The specific calculation process is as follows: Path evaluation coefficient ; This is the stability rating coefficient; and These are preset weighting coefficients, and their sum is one.

[0047] Primary and backup path determination: The path evaluation coefficient of each candidate path from the first communication agent node to the target candidate agent node is compared with the preset path threshold coefficient. Based on the comparison results, the candidate combination paths are output and filtered to determine the selectable agent nodes. Each candidate path determined in the selectable agent nodes is comprehensively analyzed based on the path evaluation coefficient and the fault trend prediction results, and the second communication agent node and its primary and backup paths are output. Specifically: For each candidate proxy node, the candidate paths are sorted from smallest to largest, and the top two candidate paths are selected as the combined paths based on the sorting results; if the path evaluation coefficient of a combined path is lower than the path threshold coefficient, it is determined to be a candidate combined path. If any one of them does not meet the "below path threshold coefficient", then the combined path is not marked as a candidate combined path, and the corresponding candidate agent node is directly eliminated.

[0048] Obtain the candidate combination paths for each candidate proxy node and calculate the path overlap of the candidate combination paths. If the path overlap of the candidate combination paths for a certain candidate proxy node is lower than the preset reference overlap, it is marked as a selectable proxy node. The path overlap of the candidate combination paths is the proportion of the intersection of the nodes passed through by the two paths to their union.

[0049] After analyzing the path evaluation coefficients of the candidate combination paths in the optional agent nodes in conjunction with the fault trend prediction results, the fusion evaluation coefficients of the candidate combination paths in the optional agent nodes are determined. Identify the path with the lowest fusion evaluation coefficient and select the corresponding alternative proxy node as the second communication proxy node; Iterate through the fusion evaluation coefficients of the two paths in the candidate combination paths under each optional agent node; Find the path with the lowest fusion evaluation coefficient; The optional proxy node to which this path belongs is determined as the second communication proxy node.

[0050] The second communication node with the lowest fusion evaluation coefficient is used as the main execution path, and the other one is used as a backup path. The failure trend prediction result is an additional coefficient for the failure trend. The fault trend additional coefficient is obtained by weighting and fusing the fault performance parameters of each path in the selected combination path within a set time zone before the current time point, and then through pre-edited mapping and transformation rules. The fusion evaluation coefficient is obtained by multiplying the path evaluation coefficient by the failure trend additional coefficient; Fault performance parameters include the number of node failures, the duration of continuous node anomalies, the number of node session rejections, and the number of times the associated links of the node are interrupted. After weighted fusion processing of the number of node failures, the duration of continuous abnormality, the number of times the node load exceeds the limit, the number of times the node session is rejected, and the number of times the node associated link is interrupted for each path in the candidate combined path, the node abnormality coefficient is obtained. The average of the node abnormality coefficients of the nodes in each path is taken to obtain the comprehensive failure coefficient of each path in the candidate combined path. Additional information: The node failure count is the total number of times a node has gone offline, restarted, disconnected from the link, or exited due to overload within the specified time zone in the past. The duration of continuous abnormality of a node is the cumulative duration during which the node has been in a state of overload, link unreachable, or forwarding abnormality within a set time zone in the past. The number of times a node load exceeds the limit is the number of times the node load assessment coefficient exceeds the preset overload threshold within a set time zone in the past; The number of node session rejections is the number of times a node has rejected creating a new forwarding task due to reaching the maximum number of forwarding sessions within the previously set time zone. The number of times the node-associated link is interrupted refers to the total number of times that the link directly connected to the node has experienced consecutive probe failures or 100% packet loss within a set time zone in the past.

[0051] The specific calculation process is as follows: After normalizing the number of node failures, the duration of consecutive node anomalies, the number of times node load exceeded limits, the number of times node session denials occurred, and the number of times node-related link interruptions occurred, the results were substituted into the formula. The node anomaly coefficient was calculated. This represents the number of node failures, the duration of consecutive node anomalies, the number of times a node's load exceeds its limit, the number of times a node session is refused, and the number of times a node's associated link is interrupted after normalization. 'r' is the node number. The weighting coefficients are set, and their sum is one.

[0052] The comprehensive fault coefficient is substituted into the mapping transformation rule to transform the fault trend additional coefficient.

[0053] The mapping and transformation rules define the coefficient ranges corresponding to the comprehensive fault coefficient, and each coefficient range corresponds to a set of fault trend additional coefficients. The range of the fault trend additional coefficients is limited to 1.02-1.27, and the higher the comprehensive fault coefficient, the higher the probability of matching 1.27. Direct connection assembly communication: The first communication agent node and the second communication agent node establish a connection through a high-speed virtual channel. The first communication agent node sends the intent object along with the original data payload to the second communication agent node through this virtual channel. After receiving the intent object, the second communication agent node reassembles the intent object into a data packet of the protocol supported by the target device B and sends it to the target device B. Channel Negotiation Request: The first communication agent node sends a channel establishment request to the second communication agent node. The request includes: Session identifiers: source device, destination device, timestamp; Metadata of the intent object (business type, estimated traffic); Security capability negotiation parameters (encryption algorithm, authentication method).

[0054] The first communication agent node establishes an end-to-end high-speed virtual channel with the second communication agent node based on the selected main execution path. After the virtual channel is established, the first communication agent node encapsulates the intent object obtained by semantic-level intent parsing and the original data payload sent by the source device A, and sends it to the second communication agent node through the main execution path. During data transmission, the first communication agent node monitors the link status and node operation status of the main execution path in real time. If it detects that the main execution path has a link interruption, latency exceeding the limit, packet loss rate exceeding the standard, or node overload abnormality, it immediately switches to the determined backup path, re-establishes the virtual channel through the backup path, and continues to transmit data to ensure uninterrupted communication. After receiving the intent object and original data payload from the first communication proxy node, the second communication proxy node remaps and encapsulates the protocol-independent intent object into a protocol data packet that can be recognized by the target device B according to the protocol type and protocol fingerprint supported by the target device B. Then, it sends the encapsulated data packet to the target device B through a physical or logical link directly connected to the target device B, thus completing the cross-protocol communication from the source device A to the target device B. Example

[0055] Please see Figure 2 As shown, based on the communication method supporting multiple communication protocols provided in Embodiment 1 of this application, Embodiment 2 of this application proposes a communication module supporting multiple communication protocols. Embodiment 2 is merely a preferred embodiment of Embodiment 1, and the implementation of Embodiment 2 will not affect the individual implementation of Embodiment 1.

[0056] Specifically, Embodiment 2 of this application provides a communication module supporting multiple communication protocols, comprising: Protocol Status Declaration Module: Monitors network interfaces to capture data packets, extracts protocol features to generate fingerprints, and propagates them through broadcast protocols to form a protocol capability map; Semantic intent parsing module: When source device A intends to communicate with target device B, source device A will send a request data packet to the first communication proxy node directly connected to it; Multi-constraint route calculation module: Based on the intent object in the request data packet, it searches the protocol capability graph for communication proxy nodes that can process the intent object and are directly connected to the target device B as candidate communication proxy nodes, and calculates the path evaluation coefficient for each candidate path for each candidate target proxy node. Primary and backup path determination module: The path evaluation coefficient of each candidate path is compared with the preset path threshold coefficient. Based on the comparison results, the candidate combination paths are output and filtered to determine the optional proxy nodes. Each candidate path determined in the optional proxy nodes is comprehensively analyzed based on the path evaluation coefficient and the fault trend prediction results, and then the second communication proxy node and its primary and backup paths are output.

[0057] Direct connection assembly communication module: The first communication agent node and the second communication agent node establish a connection through a high-speed virtual channel. The first communication agent node sends the intent object along with the original data payload to the second communication agent node through the virtual channel. After receiving the intent object, the second communication agent node reassembles the intent object into a data packet of the protocol supported by the target device B and sends it to the target device B.

[0058] The above formulas are all dimensionless calculations. Dimensionless calculations can be performed using various methods such as standardization, which will not be elaborated here. The formulas are derived from software simulations based on a large amount of collected data, and the preset parameters in the formulas can be set by those skilled in the art according to the actual situation.

[0059] The above embodiments can be implemented, in whole or in part, by software, hardware, firmware, or any other combination thereof. When implemented using software, the above embodiments can be implemented, in whole or in part, as a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more sets of available media. The available medium can be a magnetic medium (e.g., floppy disk, ATA hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. The semiconductor medium can be a solid-state ATA hard disk.

[0060] It should be understood that in the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0061] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0062] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0063] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment, depending on actual needs.

[0064] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0065] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable ATA hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0066] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A communication method supporting multiple communication protocols, characterized in that, include: Each proxy node broadcasts the protocol fingerprints it supports and its own network address to other proxy nodes, forming a protocol capability graph. When source device A intends to communicate with target device B, source device A will send a request data packet to the first communication proxy node directly connected to it. The first communication agent node searches the protocol capability graph for communication agent nodes that can process the intent object and are directly connected to the target device B, based on the intent object in the request data packet. For each candidate target agent node, the multi-constraint target optimization algorithm is used to calculate the path evaluation coefficient of each candidate path from the first communication agent node to the target candidate agent node. The path evaluation coefficient of each candidate path is compared with the preset path threshold coefficient. Based on the comparison results, the candidate combination paths are output and filtered to determine the selectable proxy nodes. Each candidate path determined in the selectable proxy nodes is comprehensively analyzed based on the path evaluation coefficient and the fault trend prediction results, and the second communication proxy node and its primary and backup paths are output. A connection is established through a high-speed virtual channel. The first communication agent node sends the intent object along with the original data payload to the second communication agent node through the virtual channel. After receiving the intent object, the second communication agent node reassembles the intent object into a data packet of the protocol supported by the target device B and sends it to the target device B.

2. The communication method supporting multiple communication protocols according to claim 1, characterized in that: The calculation logic of the path evaluation coefficient; The link quality parameters and node load status of each candidate path are correlated and analyzed to determine the link quality coefficient and stability evaluation coefficient of the candidate path. After weighted fusion processing, the path evaluation coefficient of each candidate path in the target candidate proxy node is obtained.

3. The communication method supporting multiple communication protocols according to claim 2, characterized in that: Chain quality coefficient calculation logic; Link quality parameters include cumulative path delay, cumulative path packet loss rate, minimum remaining path bandwidth, and cumulative path jitter. Extract the hop-by-hop link sequence of the candidate path; The cumulative path delay is obtained by summing the effective delay values ​​of each single-hop link in the hop-by-hop link sequence; the cumulative path packet loss rate is obtained by summing the effective packet loss values ​​of each single-hop link in the hop-by-hop link sequence; the remaining available bandwidth of each single-hop link in the hop-by-hop link sequence is obtained, and the minimum remaining available bandwidth of all single-hop links in the candidate path is taken as the minimum remaining bandwidth of the candidate path; the single-hop jitter of each single-hop link in the hop-by-hop link sequence is obtained, and the cumulative path jitter is obtained by calculating the average value of the algorithm. The chain quality coefficient is obtained by weighting and fusing the cumulative path delay, cumulative path packet loss rate, minimum remaining bandwidth of the path, and cumulative path jitter.

4. A communication method supporting multiple communication protocols according to claim 3, characterized in that: The communication proxy node sends probe messages to all directly connected adjacent nodes at set intervals. After receiving the probe messages, the directly connected adjacent nodes immediately send back response messages. After receiving the response messages, the communication proxy node records the time of receipt and calculates the single-hop bidirectional average delay using the standard bidirectional delay formula. The sliding average of the single-hop bidirectional average delay of the communication proxy node five times before the current time is taken as the effective delay value of the single-hop link. Within a set detection period, continuously send x detection messages with consecutive sequence numbers; x > 80; the receiving node counts the number of successfully received messages and calculates the active detection packet loss rate; The node provides real-time statistics on the actual transmission and reception of business traffic on the direct connection link and calculates the actual packet loss rate of the business traffic. The weighted average of active detection and passive statistics is taken as the effective value of packet loss for a single-hop link; Every set time interval, the node counts the bidirectional real-time traffic rate on the direct link and takes the average value of the bidirectional traffic as the real-time occupied bandwidth. The total link bandwidth is then subtracted from the real-time occupied bandwidth to obtain the remaining available bandwidth for a single hop. Obtain the continuous single-hop bidirectional delay sequence within the sliding window, calculate the absolute value of the delay difference between two consecutive probes, and then calculate the single-hop jitter using the root mean square.

5. A communication method supporting multiple communication protocols according to claim 2, characterized in that: Logic for calculating stability assessment coefficient; Node load status includes CPU utilization, memory utilization, and forwarding session utilization; The forwarding session utilization rate represents the proportion of the number of cross-protocol forwarding sessions currently marked as active by the node to the maximum stable number of sessions that the node can carry. After weighted fusion of CPU utilization, memory utilization, and forwarding session utilization of all proxy nodes along the candidate path, the load evaluation coefficient of a single node is obtained. The average load evaluation coefficients of all proxy nodes traversed by the candidate path are calculated to obtain the stability evaluation coefficient of the candidate path.

6. A communication method supporting multiple communication protocols according to claim 2, characterized in that: Logic for filtering optional proxy nodes; For each candidate proxy node, sort the candidate paths from smallest to largest, and select the top two candidate paths as the combined path based on the sorting results. If the path evaluation coefficients of a certain combination path are all lower than the path threshold coefficient, it is determined to be a candidate combination path; Obtain the candidate combination paths for each candidate proxy node and calculate the path overlap of the candidate combination paths. If the path overlap of the candidate combination paths for a certain candidate proxy node is lower than the preset reference overlap, it is marked as a selectable proxy node. The path overlap of the candidate combination paths is the proportion of the intersection of the nodes passed through by the two paths to their union.

7. A communication method supporting multiple communication protocols according to claim 6, characterized in that: The logic for determining the second communication agent node and its primary / backup paths; After analyzing the path evaluation coefficients of the candidate combination paths in the optional agent nodes in conjunction with the fault trend prediction results, the fusion evaluation coefficients of the candidate combination paths in the optional agent nodes are determined. Identify the path with the lowest fusion evaluation coefficient and select the corresponding alternative proxy node as the second communication proxy node; The node with the lowest fusion evaluation coefficient among the second communication agent nodes will be used as the primary execution path, and the other will be used as a backup path.

8. A communication method supporting multiple communication protocols according to claim 7, characterized in that: The failure trend prediction result is an additional coefficient for the failure trend. The fault trend additional coefficient is obtained by weighting and fusing the fault performance parameters of each path in the selected combination path within a set time zone before the current time point, and then through pre-edited mapping and transformation rules. The fusion evaluation coefficient is obtained by multiplying the path evaluation coefficient by the failure trend additional coefficient.

9. A communication method supporting multiple communication protocols according to claim 7, characterized in that: Fault performance parameters include the number of node failures, the duration of continuous node anomalies, the number of node session rejections, and the number of times the associated links of the node are interrupted. After weighted fusion of the fault performance parameters of the nodes contained in each path in the candidate combined path, the node anomaly coefficient is obtained. The average of the node anomaly coefficients of the nodes contained in each path is taken to obtain the comprehensive fault coefficient of each path in the candidate combined path. The comprehensive fault coefficient is then substituted into the mapping transformation rule to transform the fault trend additional coefficient.

10. A communication module supporting multiple communication protocols, applied to a communication method supporting multiple communication protocols according to any one of claims 1-9, characterized in that: Protocol Status Declaration Module: Monitors network interfaces to capture data packets, extracts protocol features to generate fingerprints, and propagates them through broadcast protocols to form a protocol capability map; Semantic intent parsing module: When source device A intends to communicate with target device B, source device A will send a request data packet to the first communication proxy node directly connected to it; Multi-constraint route calculation module: Based on the intent object in the request data packet, it searches the protocol capability graph for communication proxy nodes that can process the intent object and are directly connected to the target device B as candidate communication proxy nodes, and calculates the path evaluation coefficient for each candidate path for each candidate target proxy node. Primary and backup path determination module: The path evaluation coefficient of each candidate path is compared with the preset path threshold coefficient. Based on the comparison results, the candidate combination paths are output and filtered to determine the optional proxy nodes. Each candidate path determined in the optional proxy nodes is comprehensively analyzed based on the path evaluation coefficient and the fault trend prediction results, and then the second communication proxy node and its primary and backup paths are output. Direct connection assembly communication module: The first communication agent node and the second communication agent node establish a connection through a high-speed virtual channel. The first communication agent node sends the intent object along with the original data payload to the second communication agent node through the virtual channel. After receiving the intent object, the second communication agent node reassembles the intent object into a data packet of the protocol supported by the target device B and sends it to the target device B.

Images