Broadcast frame transmission method, receiving node, sending node, multi-ring network, storage medium and program product

Abstract

The invention relates to a broadcast frame transmission method, a receiving node, a sending node, a multi-ring network, a storage medium and a program product. The method comprises the following steps: receiving a first broadcast frame sent by a sending node at a first port, wherein the first broadcast frame comprises sending node information, a first frame sequence number associated with the sending node information and destination node information; wherein the first frame number is used for indicating the sequence of the first broadcast frame in the broadcast frame sent by the sending node. The method is used for avoiding the network storm and optimizing the network resource utilization rate and the cache resource utilization rate.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a broadcast frame transmission method, a receiving node, a sending node, a multi-ring network, a storage medium, and a program product. Background Art

[0002] In existing Ethernet-based communication protocols, the current broadcast frame transmission method poses the risk of network storms in ring networks. Furthermore, when a large number of broadcast frames are present, network resources are significantly consumed. On the device side, the large number of identical broadcast frames can also place significant pressure on device cache resources, causing data reception and processing to affect the transmission of other information. Therefore, a new broadcast frame transmission method is urgently needed. Summary of the Invention

[0003] Based on this, it is necessary to provide a broadcast frame transmission method, a receiving node, a sending node, a multi-ring network, a storage medium and a program product to address the above technical problems.

[0004] In a first aspect, the present application provides a broadcast frame transmission method, applied to a receiving node, the method comprising:

[0005] receiving, at a first port, a first broadcast frame sent by a sending node, wherein the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information;

[0006] The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

[0007] In a second aspect, the present application provides a broadcast frame transmission method, applied to a sending node, the method comprising:

[0008] Sending a first broadcast frame, where the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information;

[0009] The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

[0010] In a third aspect, the present application further provides a receiving node, including: a memory, a transceiver, and a processor:

[0011] A memory for storing a computer program; a transceiver for transmitting and receiving data under the control of a processor; and a processor for reading the computer program in the memory and performing the following operations:

[0012] receiving, at a first port, a first broadcast frame sent by a sending node, wherein the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information;

[0013] The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

[0014] In a fourth aspect, the present application further provides a sending node, including: a memory, a transceiver, and a processor:

[0015] A memory for storing a computer program; a transceiver for transmitting and receiving data under the control of a processor; and a processor for reading the computer program in the memory and performing the following operations:

[0016] Sending a first broadcast frame, where the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information;

[0017] The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

[0018] In a fifth aspect, the present application further provides a receiving node, including:

[0019] A receiving module, configured to receive, at a first port, a first broadcast frame sent by a sending node, wherein the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information;

[0020] The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

[0021] In a sixth aspect, the present application further provides a sending node, including:

[0022] A sending module, configured to send a first broadcast frame, wherein the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information;

[0023] The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

[0024] In the seventh aspect, the present application also provides a multi-ring network, characterized in that it includes at least one sending node and multiple receiving nodes, each of the receiving nodes is used to execute the method described in the first aspect, and each of the sending nodes is used to execute the method described in the second aspect.

[0025] In an eighth aspect, the present application further provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the method described in the first aspect or the second aspect is implemented.

[0026] In a ninth aspect, the present application further provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, it implements the method described in the first aspect or the second aspect.

[0027] The above-mentioned broadcast frame transmission method, receiving node, sending node, multi-ring network, storage medium and program product are applied to the receiving node, which can receive the first broadcast frame sent by the sending node at the first port. The first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information; wherein the first frame sequence number is used to indicate the order of the first broadcast frame among the broadcast frames sent by the sending node. This solution embeds the sending node information and the first frame sequence number in the first broadcast frame. The first frame sequence number is associated with the sending node information to form a unique identifier, enabling the receiving node to identify and filter duplicate broadcast frames, avoid circular forwarding in the ring network, thereby eliminating the risk of network storms and significantly reducing the bandwidth and device cache occupied by redundant data. Secondly, combining broadcast frames and dynamic sequence number management, there is no need to rely on external detection mechanisms when a link is interrupted. The receiving node can quickly identify the breakpoint and trigger path switching based on the continuity of the frame sequence number, realizing seamless data transmission from the backup link, and improving the fault tolerance and real-time performance of the ring network. This dual mechanism reduces resource consumption while enhancing transmission reliability, and is particularly suitable for industrial communication scenarios with high real-time requirements. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] Figure 1 A schematic diagram of a multi-ring network architecture used in a broadcast frame transmission method;

[0029] Figure 2 A flowchart of a broadcast frame transmission method is shown;

[0030] Figure 3 is a flowchart of another broadcast frame transmission method;

[0031] Figure 4 A schematic diagram of forwarding logic for a receiving node;

[0032] Figure 5 A schematic diagram of a broadcast frame transmission of external data in a network without addressing information;

[0033] Figure 6 A schematic diagram of the structure of a network node provided by an embodiment;

[0034] Figure 7 It is a structural block diagram of a receiving node;

[0035] Figure 8 This is a structural block diagram of a sending node. DETAILED DESCRIPTION

[0036] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0037] In embodiments of the present invention, the term "and / or" describes the association relationship between associated objects, indicating that three possible relationships exist. For example, "A and / or B" can represent three situations: A exists alone, A and B exist simultaneously, and B exists alone. The character " / " generally indicates that the associated objects are in an "or" relationship.

[0038] In an embodiment of the present application, a broadcast frame transmission method is provided, in which the sending node information and the first frame sequence number are embedded in the first broadcast frame, and the first frame sequence number is associated with the sending node information to form a unique identifier, so that the receiving node can identify and filter repeated broadcast frames, avoid circular forwarding in the ring network, thereby eliminating the risk of network storms and significantly reducing the bandwidth and device cache occupied by redundant data; secondly, combined with dynamic sequence number management, when the link is interrupted, there is no need to rely on an external detection mechanism. The receiving node can quickly identify the breakpoint and trigger path switching based on the continuity of the frame sequence number, realize seamless data transmission from the backup link, and improve the fault tolerance and real-time performance of the ring network. This dual mechanism reduces resource consumption while enhancing transmission reliability, and is particularly suitable for industrial communication scenarios with high real-time requirements.

[0039] In the embodiment of the present application, a broadcast frame refers to a data frame transmitted in a broadcast manner.

[0040] In the embodiment of the present application, the above-mentioned broadcast frame transmission method can be applied to any network node in any communication network.

[0041] In some embodiments, the broadcast frame transmission method described above may be applied to a network including a single ring network, or to a network including multiple ring networks.

[0042] In some embodiments, the broadcast frame transmission method described above can be applied to operational technology (OT) layer networks. OT layer networks are primarily used to connect various devices, systems, and controllers in industrial production to monitor, control, and optimize production processes. They connect sensors, actuators, programmable logic controllers (PLCs), distributed control systems (DCSs), and other devices, enabling them to communicate and collaborate to ensure stable and efficient operation of industrial production processes.

[0043] For example, Figure 1 Schematic diagram of the network architecture used in a broadcast frame transmission method according to an embodiment of the present application. Figure 1 As shown, the network is a multi-ring network, in which nodes 1, 2, 3, 4, 5, and 6 form a first ring network 131; nodes 4, 5, 5.1, 5.2, 5.3, and 5.4 form a second ring network 132; and nodes 5.2, 5.3, 5.2.1, 5.2.2, and 5.2.3 form a third ring network 133. Any node in the network can perform data frame transmission based on the broadcast frame transmission method in the embodiment of the present application.

[0044] The broadcast frame transmission method provided in the embodiment of the present application can be applied to any network node, which can transmit a first broadcast frame, wherein the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information.

[0045] The first frame sequence number indicates the order of the first broadcast frame among the broadcast frames sent by the sending node. This eliminates the risk of network storms during data frame transmission, significantly reduces bandwidth and device cache usage by redundant data, and enables seamless data transmission from backup links, improving the fault tolerance and real-time performance of the ring network.

[0046] In some embodiments, the network node to which the above method is applied may be a sending node or a receiving node. A sending node may be the node that initially sends the first broadcast frame, and a receiving node may include a target node or a forwarding node. A target node may be the intended destination node for the first broadcast frame, and a forwarding node may be a node other than the sending node and the target node that transmits the first broadcast frame during data transmission.

[0047] In some embodiments, the above method is applied to a receiving node, and the receiving node may receive a first broadcast frame sent by a sending node at a first port, wherein the first port may be at least one port on the receiving node.

[0048] In some embodiments, the above method is applied to a sending node, and the receiving node may send a first broadcast frame.

[0049] For example, Figure 2 1 is a flow chart of a broadcast frame transmission method, which is applied to any network node. The method may include but is not limited to the following steps:

[0050] 201. A sending node sends a first broadcast frame, where the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information.

[0051] In some embodiments, the first broadcast frame further includes a broadcast identifier, wherein the broadcast identifier is used to indicate that the first broadcast frame is a data frame transmitted in a broadcast manner.

[0052] 202. A receiving node receives a first broadcast frame sent by a sending node.

[0053] In some embodiments, each time the sending node sends a broadcast frame, the frame sequence number increases by 1.

[0054] Exemplarily, a counter may be used to count the number of broadcast frames sent by the sending node, and the count value may be used as the frame sequence number corresponding to the currently sent broadcast frame.

[0055] In some embodiments, each sending node may independently count the number of broadcast frames it sends to determine the frame sequence number (i.e., the first frame sequence number). For example, each sending node maintains an independent counter that increments by 1 each time a broadcast frame is sent.

[0056] Exemplarily, the information recorded in a sending node may be as shown in Table 1 below.

[0057] Table 1

[0058]

[0059] It should be noted that the above Table 1 is illustrated by an example of a maximum of n broadcast frames, and the value of n is not specifically limited in the embodiment of the present application.

[0060] In some embodiments, the maximum value of the frame sequence number is set based on network performance parameters. For example, the value of n in Table 1 above is the maximum value that n can take based on the current network performance.

[0061] Among them, network performance parameters may include but are not limited to bandwidth, node processing capability, etc.

[0062] For example, the maximum frame sequence number (n) can be dynamically determined based on network bandwidth, node processing speed, ring network scale, etc. For example, if the maximum delay of the ring network is T, the counter overflow time must be much greater than T to prevent misjudgment caused by sequence number reset.

[0063] For example, when the network topology changes, the value of n can be automatically adjusted based on the network topology to adapt to the new network scale.

[0064] It should be noted that the order of the first broadcast frame indicated by the above-mentioned first frame sequence number in the broadcast frames sent by the sending node can be understood as: it refers to the order within the above-mentioned counter overflow time. In the embodiment of the present application, the transmission process related to the first frame sequence number also refers to the transmission process within the overflow time.

[0065] In the above embodiment, the frame sequence number implicitly indicates the broadcast timing for the same transmitting node, facilitating the receiving node's processing of sequence-dependent service logic. Furthermore, associating the transmitting node information with the first frame sequence number facilitates the receiving node's determination of whether the currently received broadcast frame is a duplicate data frame, thereby preventing the broadcast frame from circulating endlessly within the ring network.

[0066] In some embodiments, the destination node information may be a field that identifies the destination node or forwarding rule of the data frame. The destination node information may include: the node address of the destination node, or data frame forwarding indication information of the destination node.

[0067] In some embodiments, the above-mentioned sending node information includes: a node address of the sending node.

[0068] In some embodiments, the node address of the destination node, or the node address of the sending node, may include any of the following:

[0069] MAC address, a unique address based on Ethernet settings, and a unique identifier of an Ethernet node associated with the address.

[0070] In some embodiments, the size of the broadcast identifier is fixed. For example, the broadcast identifier is fixed in length, such as 1 bit, and can be embedded in the header of a data frame. For example, setting the 1 bit to 1 indicates a broadcast frame, and setting it to 0 indicates a unicast frame.

[0071] In the above embodiment, a broadcast identifier can be used to distinguish between broadcast and unicast. This allows the receiving node to quickly identify the frame type and decide whether to forward it. If a data frame is identified as a broadcast, it can be forwarded along the entire path. If a data frame is identified as a unicast, it can be forwarded based on the destination address (such as the node address of the destination node).

[0072] In the above embodiment, by embedding the sending node information and frame sequence number in the data frame, the receiving node can identify and filter repeated broadcast frames, avoiding circular forwarding in the ring network, thereby eliminating the risk of network storms and significantly reducing the bandwidth and device cache occupied by redundant data. Secondly, combined with dynamic sequence number management, when a link is interrupted, there is no need to rely on an external detection mechanism. The receiving node can quickly identify the breakpoint based on the continuity of the sequence number and trigger path switching, achieving seamless data transmission from the backup link, improving the fault tolerance and real-time performance of the ring network. This dual mechanism reduces resource consumption while enhancing transmission reliability.

[0073] In some embodiments, after the first port receives the first broadcast frame sent by the sending node, the broadcast frame transmission method provided by the embodiment of the present application also includes: when the sending node is determined to be a new sending source based on the sending node information, forwarding the first broadcast frame through other ports of the receiving node, and the other ports include all ports in the receiving node except the first port.

[0074] The method of determining the sending node as a new sending source based on the sending node information may include but is not limited to: judging whether the sending node information has been stored; if not, determining the sending node as a new sending source.

[0075] When the sending node is determined to be a new sending source based on the sending node information, after forwarding the first broadcast frame through other ports of the receiving node, the sending node information can be saved, and the first frame sequence number in the first broadcast frame and the sending node information can be stored correspondingly.

[0076] In the above embodiment, there is no need to consider the first frame sequence number in the first broadcast frame. When the sending node information has not been stored, it means that the current receiving node has not received the broadcast frame sent by the sending node. This is the first reception, and the first broadcast frame can be directly forwarded to realize broadcast frame transmission.

[0077] In some embodiments, after the first port receives the first broadcast frame sent by the sending node, the broadcast frame transmission method provided by the embodiment of the present application also includes: if the first frame sequence number has not been stored corresponding to the sending node information, then forwarding the first broadcast frame through other ports of the receiving node, and the other ports include all ports in the receiving node except the first port.

[0078] In some embodiments, after forwarding the first broadcast frame through other ports of the receiving node, the broadcast frame transmission method provided in the embodiment of the present application may further include: correspondingly storing the first frame sequence number and the sending node information.

[0079] In the above embodiment, when the sending node information has been stored, it means that the current sending node is not a new sending source, and it is necessary to further determine whether the first frame sequence number has been stored corresponding to the sending node information. If it has been stored correspondingly, it means that the first broadcast frame is a repeated broadcast frame that has been received, and the broadcast frame is not forwarded at this time. If it has not been stored correspondingly, it means that the first broadcast frame is not a broadcast frame that has been received, and the first broadcast frame needs to be forwarded through other ports to realize broadcast frame transmission.

[0080] In some embodiments, after the first port receives the first broadcast frame sent by the sending node, the broadcast frame transmission method provided in the embodiment of the present application may also include: if the current receiving node is determined to be the destination node of the first broadcast frame based on the destination node information, and it is determined that the sending node information has not been stored, then the sending node information and the first frame sequence number are stored accordingly, and the data in the first broadcast frame is obtained.

[0081] In the above embodiment, if the current receiving node is the destination node, then it is necessary to consider whether the current first broadcast frame is a duplicate broadcast frame. If it is determined that the sending node information has not been stored, it can be determined that the current first broadcast frame is not a duplicate broadcast frame. At this time, data can be obtained from the first broadcast frame, and the sending node information and the first frame sequence number can be stored accordingly for subsequent judgment when a duplicate broadcast frame is received.

[0082] In some embodiments, after the first port receives the first broadcast frame sent by the sending node, the broadcast frame transmission method provided by the embodiment of the present application may also include: if it is determined that the current receiving node is the destination node of the first broadcast frame based on the destination node information, and it is determined that the sending node information has been stored, then the first broadcast frame is processed according to the size relationship between the first frame sequence number and the stored maximum frame sequence number, and the stored maximum frame sequence number is the frame sequence number stored in the receiving node corresponding to the sending node information.

[0083] In the above embodiment, if the current receiving node is the destination node, then it is necessary to consider whether the current first broadcast frame is a duplicate broadcast frame. If it is determined that the sending node information has been stored, it means that the broadcast frame sent by the sending node has been received. At this time, it is necessary to use the size relationship between the first frame sequence number and the stored maximum frame sequence number to further determine whether the first broadcast frame is a duplicate broadcast frame, so as to process the first broadcast frame based on different determination results.

[0084] For example, Figure 3 2 is a flow chart of another broadcast frame transmission method, which is applied to a receiving node. The method may include but is not limited to the following steps:

[0085] 301. A receiving node receives, at a first port, a first broadcast frame sent by a sending node.

[0086] After the sending node sends the first broadcast frame, the receiving node can receive the first broadcast frame sent by the sending node at the first port. The first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, destination node information and a broadcast identifier.

[0087] The first port may be any port.

[0088] It should be noted that the receiving node may be a node directly connected to the sending node, or may be a node indirectly connected to the sending node via other nodes. Figure 1 Taking the network shown as an example, assuming that the sending node is node 1 and the receiving node is node 2, node 1 can directly send the first broadcast frame to node 2; assuming that the sending node is node 1 and the receiving node is node 5, node 1 can first send the first broadcast frame to node 6, and then forward it to node 5 through node 6.

[0089] When the receiving node is a node indirectly connected to the sending node through other nodes, the first broadcast frame sent by the sending node may be received at the first port after being forwarded by other nodes.

[0090] In some embodiments, after step 301 above, the receiving node may further determine whether the current receiving node is the destination node of the first broadcast frame according to the destination node information.

[0091] 302. The receiving node determines, according to the destination node information, whether the current receiving node is the destination node of the first broadcast frame.

[0092] If it is determined that the current receiving node is not the destination node of the first broadcast frame, then steps 303 to 306 may be continued; if it is determined that the current receiving node is the destination node of the first broadcast frame, then steps 307 to 309 may be continued.

[0093] In some embodiments, after receiving the first broadcast frame, the receiving node may obtain the destination node information included in the first broadcast frame and compare the destination node information with its own node information to determine whether the current receiving node itself is the destination node of the first broadcast frame.

[0094] For example, taking the above-mentioned target node information as the MAC address of the destination node as an example, the MAC address of the target node obtained from the first broadcast frame can be compared with the MAC address of the receiving node itself. If the two addresses are consistent, it is determined that the current receiving node is the destination node of the first broadcast frame; if the two addresses are inconsistent, it is determined that the current receiving node is not the destination node of the first broadcast frame.

[0095] 303. The receiving node determines whether the first frame sequence number and the sending node information have been stored in correspondence.

[0096] If it is determined that the first frame sequence number and the sending node information have not been stored correspondingly, then it means that the current first broadcast frame is a new data frame, and then execute the following steps 304 and 305; if it is determined that the first frame sequence number and the sending node information have been stored correspondingly, then it means that the current first broadcast frame is a repeated data frame, and then execute the following step 306.

[0097] 304. Forward the first broadcast frame through other ports of the receiving node.

[0098] The other ports include all ports in the receiving node except the first port.

[0099] In the above step 304, only new data frames are forwarded, which can avoid invalid link occupation.

[0100] 305. The receiving node stores the sending node information and the first frame sequence number.

[0101] In the receiving node, each time a new broadcast frame is received, its sending node information and frame sequence number can be stored accordingly.

[0102] For example, the information recorded in a receiving node may be as shown in Table 2 below.

[0103] Table 2

[0104]

[0105] It should be noted that Table 2 above stores information about the sending node X, and stores two frame sequence numbers 1 and 2 corresponding to the sending node X. This indicates that the receiving node has received two broadcast frames sent by the sending node X, and 1 and 2 in the table respectively indicate the order in which the sending node X sent the two broadcast frames. Table 2 also stores information about the sending node Y, and stores a frame sequence number 1 corresponding to the sending node Y. This indicates that the receiving node has received one broadcast frame sent by the sending node Y. Table 2 also stores information about the sending node W, and stores a frame sequence number 1 corresponding to the sending node W. This indicates that the receiving node has received one broadcast frame sent by the sending node W. Table 2 also stores information about the sending node Z, and stores three frame sequence numbers 1, 2, and 3 corresponding to the sending node Z. This indicates that the receiving node has received three broadcast frames sent by the sending node W, and 1, 2, and 3 in the table respectively indicate the order in which the sending node X sent the two broadcast frames.

[0106] In an embodiment of the present application, the receiving node only needs to maintain lightweight data (such as Table 2), and the data can also support aging cleanup, which can save memory overhead.

[0107] 306. The receiving node deletes the first broadcast frame.

[0108] If the first frame sequence number and the sending node information have been stored correspondingly, it means that the first broadcast frame is repeated with a data frame that has been received in the past. In this case, the first broadcast frame can be deleted.

[0109] The receiving node records the combination of the sending node information and frame sequence number that has been received, so that when a duplicate broadcast frame is received, the duplicate broadcast frame can be directly discarded, ensuring that the broadcast frame circulates the loop at most once, reducing redundant traffic, and preventing network bandwidth from being occupied by duplicate data. At the same time, it significantly reduces the node processing load (such as a decrease in CPU utilization), which is especially suitable for high-frequency broadcast scenarios (such as industrial sensor data polling).

[0110] For example, in Figure 1 Based on the network shown, Figure 4The figure shows a logic diagram of a receiving node forwarding. Node 5.2.3 sends a broadcast frame to the network. Node 5.3 identifies it as new broadcast data based on the sender information 5.2.3 and packet sequence number 7. At this point, the node 5.3 device copies the broadcast frame and sends it to the remaining two ports, sending it to node 5.2 and node 5.4 respectively. After node 5.2.3 sends the broadcast frame to the network, the broadcast frame can also reach node 5.2 through node 5.2.2 and node 5.2.1 when it is transmitted in the ring network 133. Assuming that the broadcast frame reaches node 5.2 first through the link transmitted by 5.3, node 5.2 has already stored the broadcast entry. By comparing the sender information (5.2.3) and packet sequence number (7), it is confirmed that the broadcast frame has been received. Then, at 5.2, the redundant data that reaches node 5.2 after passing through nodes 5.2.2 and 5.2.1 is deleted.

[0111] 307. The receiving node determines whether the sending node information has been stored.

[0112] After executing the above step 307, if it is determined that the sending node information has been stored, then execute the following step 308; if it is determined that the sending node information has not been stored, then execute the following step 309.

[0113] 308. The receiving node processes the first broadcast frame according to a size relationship between the first frame sequence number and the stored maximum frame sequence number.

[0114] 309. Correspondingly store the sending node information and the first frame sequence number, and obtain data in the first broadcast frame.

[0115] Among them, the above-mentioned corresponding storage of sending node information and first frame sequence number may include but is not limited to: if the storage entry of the broadcast sending information is full, and the earliest stored entry information in the storage space has exceeded the set aging time, then the earliest stored entry information is deleted, and the sending node information and the first frame sequence number are stored correspondingly as new entry information.

[0116] The above entry information refers to the broadcast frame record stored locally by the receiving node. Each record contains two key fields: the frame sequence number corresponding to the sending node information (such as MAC address). These records can be stored in the form of key-value pairs.

[0117] The oldest stored entry is the one with the oldest timestamp among the broadcast frame records stored by the receiving node (i.e., the earliest stored entry). Each record is associated with a timeout, for example, 30 seconds. If a record is not updated within the timeout (e.g., no new frames are received from the sending node), it is considered expired. The logic for handling storage fullness is as follows: When storage space is insufficient, the system first checks for expired entries (i.e., entries that have exceeded the timeout) and deletes them immediately. If no entries are expired, the oldest stored entry is deleted to make room for the new record.

[0118] In some embodiments, the first broadcast frame is processed based on the magnitude relationship between the first frame sequence number and the stored maximum frame sequence number, which may include but is not limited to the following situations:

[0119] Case 1: If the first frame sequence number is greater than the stored maximum frame sequence number, the first frame sequence number and the sending node information are stored in correspondence, and the data in the first broadcast frame is obtained.

[0120] When the first frame sequence number is greater than the stored maximum frame sequence number, it indicates that the first broadcast frame is a new data frame. The first frame sequence number and the sending node information are stored correspondingly to achieve data update.

[0121] Case 2: If the first frame sequence number is smaller than the stored maximum frame sequence number, the first broadcast frame is deleted.

[0122] When the first frame sequence number is smaller than the maximum stored frame sequence number, it indicates that the first broadcast frame is a repeated frame in history. In this case, the first broadcast frame can be considered as invalid data and deleted directly.

[0123] Case 3: If the first frame sequence number is equal to the stored maximum frame sequence number, then when the data verification result corresponding to the maximum frame sequence number indicates that the verification is passed, the first broadcast frame is deleted; when the data verification result corresponding to the maximum frame sequence number indicates that the verification is failed, and the data verification result corresponding to the first frame sequence number indicates that the verification is passed, the first frame sequence number and the sending node information are stored correspondingly, and the data in the first broadcast frame is obtained.

[0124] The first frame sequence number is equal to the largest stored frame sequence number, indicating that the first broadcast frame is the same data frame as the last received data frame. A query is then performed based on the data verification result of the last received data frame. If the verification passes, the last received data frame is considered correct and no longer needed. The first broadcast frame can be deleted. If the verification fails, the last received data frame is considered incorrect and the first broadcast frame can be used to overwrite the previous incorrect data frame.

[0125] In the above embodiment, the receiving node is the destination node. By dynamically updating Table 2 and verifying data integrity, it ensures that only the latest or valid broadcast frames are processed. This design not only avoids duplicate processing (for example, discarding frames with a sequence number less than the stored maximum value) but also supports fault recovery (for example, allowing duplicate frames to overwrite erroneous data if verification fails). This mechanism ensures data reliability while optimizing storage efficiency. By implementing an entry aging mechanism, memory overflow is prevented, making it suitable for industrial control scenarios requiring high reliability, such as PLC instruction distribution.

[0126] The method provided in the above embodiment can be applied to when external data is received in the network, and when no addressing information for the external data is generated in the network at this time, the data can be sent to each device in the network through the data frame broadcasting method provided in the embodiment of the present application. At this time, the target node information can be used as the unique identifier of the destination node.

[0127] For example, Figure 5 The figure shows a method for transmitting external data in a broadcast frame in a network without addressing information. When the destination node 145 receives the data frame, it verifies the target node information in the data frame. If it determines that the target node information is consistent with its own, it stops forwarding the broadcast data. For data frames in branches other than the destination node, it does not need to stop forwarding until it is sent to the end of the branch. Figure 5 Indicated by the dotted arrow.

[0128] It should be noted that in embodiments of the present application, when channel bandwidth is not a primary factor, broadcast frame transmission can be forwarded using a store-and-forward approach. When verifying the sender information, frame sequence number, and data check code (used to verify data correctness), the transmitted broadcast frame can be forwarded only after ensuring the data frame is correct. When bandwidth resources are a concern, broadcast frames can be forwarded using a cut-through forwarding approach. In this case, only the sender information and frame sequence number of the broadcast frame are verified, and data correctness cannot be guaranteed. This means that if the data broadcast on the network is erroneous, its broadcasting behavior will occupy a certain amount of bandwidth resources.

[0129] Store-and-forward is a highly reliable data frame transmission method. After receiving a complete broadcast frame, the receiving node first stores it in a local buffer and then performs a complete verification of the frame's sender information, frame sequence number, and data checksum (such as CRC). Forwarding is performed only after the data is confirmed to be correct. This method ensures data reliability and prevents the spread of erroneous data, but it introduces higher processing latency and may consume more bandwidth resources. It is suitable for scenarios where data accuracy is critical and bandwidth is relatively sufficient.

[0130] Cut-through forwarding is a highly efficient data frame transmission method. Upon receiving the frame header (such as the sender address and frame sequence number), a node immediately forwards the frame without waiting for the entire frame to be received. This method only verifies the header information, not the data itself, significantly reducing transmission latency. Cut-through forwarding is suitable for bandwidth-constrained scenarios with high real-time requirements.

[0131] It should be understood that, although the various steps in the flowcharts involved in the various embodiments described above are displayed in sequence according to the instructions of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the flowcharts involved in the various embodiments described above can include multiple steps or multiple stages, and these steps or stages are not necessarily executed and completed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of steps or stages in other steps.

[0132] The embodiments of the present application further provide a network node that can implement the functions of any network node in the aforementioned embodiments, such as the functions of a sending node and / or a receiving node.

[0133] For example, Figure 6 This is a schematic diagram of a network node structure provided by an embodiment. The electronic device includes: a memory 601, a transceiver 602, and a processor 603, wherein the memory 601, the transceiver 602, and the processor 603 are connected via a bus interface.

[0134] The memory 601 is used to store computer programs; the transceiver 602 is used to send and receive data under the control of the processor 603.

[0135] The processor 603 is configured to read the computer program in the memory 601 and perform the following operations:

[0136] Transmitting a first broadcast frame, wherein the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information;

[0137] The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

[0138] When the network node is a receiving node, transmitting the first broadcast frame includes receiving the first broadcast frame sent by the sending node at the first port; when the network node is a sending node, transmitting the first broadcast frame includes sending the first broadcast frame.

[0139] In some embodiments, the network node is a sending node, and the processor 603 is further configured to read the computer program in the memory 601 and perform the following operations:

[0140] The first broadcast frame is sent.

[0141] In some embodiments, each time the sending node sends a broadcast frame, the frame sequence number increases by 1.

[0142] In some embodiments, the maximum value of the frame sequence number is set based on a network performance parameter.

[0143] In some embodiments, the network node is a receiving node, and the processor 603 is configured to read the computer program in the memory 601 and perform the following operations:

[0144] The first broadcast frame sent by the sending node is received at a first port.

[0145] In some embodiments, the processor 603 is further configured to read the computer program in the memory 601 and perform the following operations:

[0146] If the first frame sequence number has not been stored corresponding to the sending node information, the first broadcast frame is forwarded through other ports of the receiving node, and the other ports include all ports of the receiving node except the first port.

[0147] In some embodiments, the processor 603 is further configured to read the computer program in the memory 601 and perform the following operations:

[0148] The first frame sequence number and the sending node information are stored correspondingly.

[0149] In some embodiments, the processor 603 is further configured to read the computer program in the memory 601 and perform the following operations:

[0150] If the sending node information and the first frame sequence number have been stored, deleting the first broadcast frame includes:

[0151] If it is determined according to the destination node information that the current receiving node is not the destination node of the first broadcast frame, and the sending node information and the first frame sequence number have been stored correspondingly, the first broadcast frame is deleted.

[0152] In some embodiments, the processor 603 is further configured to read the computer program in the memory 601 and perform the following operations:

[0153] After the first port receives the first broadcast frame sent by the sending node, if it is determined that the current receiving node is the destination node of the first broadcast frame based on the destination node information, and it is determined that the sending node information has not been stored, the sending node information and the first frame sequence number are stored accordingly, and the data in the first broadcast frame is obtained.

[0154] In some embodiments, the processor 603 is further configured to read the computer program in the memory 601 and perform the following operations:

[0155] If the storage entries of the broadcast transmission information are full and the earliest stored entry information in the storage space exceeds the set aging time, the earliest stored entry information is deleted, and the transmitting node information and the first frame sequence number are correspondingly stored as new entry information.

[0156] In some embodiments, the processor 603 is further configured to read the computer program in the memory 601 and perform the following operations:

[0157] If it is determined based on the destination node information that the current receiving node is the destination node of the first broadcast frame, and it is determined that the sending node information has been stored, the first broadcast frame is processed based on the size relationship between the first frame sequence number and the stored maximum frame sequence number, and the stored maximum frame sequence number is the frame sequence number stored in the receiving node corresponding to the sending node information.

[0158] In some embodiments, the processor 603 is further configured to read the computer program in the memory 601 and perform the following operations:

[0159] If the first frame sequence number is greater than the stored maximum frame sequence number, storing the first frame sequence number and the sending node information in correspondence, and obtaining data in the first broadcast frame;

[0160] If the first frame sequence number is less than the maximum frame sequence number stored, deleting the first broadcast frame;

[0161] If the first frame sequence number is equal to the stored maximum frame sequence number, then when the data verification result corresponding to the maximum frame sequence number indicates that the verification is passed, the first broadcast frame is deleted; when the data verification result corresponding to the maximum frame sequence number indicates that the verification is failed, and the data verification result corresponding to the first frame sequence number indicates that the verification is passed, the data in the first broadcast frame is obtained.

[0162] In some embodiments, the destination node information includes: a node address of the destination node, or data frame forwarding indication information of the target node.

[0163] In some embodiments, the sending node information includes: a node address of the sending node.

[0164] In some embodiments, the node address includes any of the following:

[0165] MAC address, a unique address based on Ethernet settings, and a unique identifier of an Ethernet node associated with the address.

[0166] In some embodiments, the size of the broadcast identifier is a fixed size.

[0167] In some embodiments, the method is applied to a network comprising a single ring network, or to a network comprising multiple ring networks.

[0168] In some embodiments, the method is applied to an Operational Technology (OT) layer network.

[0169] In an exemplary embodiment, Figure 7 As shown, a structural block diagram of a receiving node is provided, including:

[0170] The receiving module 701 is configured to receive, at a first port, a first broadcast frame sent by a sending node, wherein the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information;

[0171] The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

[0172] In some embodiments, after the first port receives the first broadcast frame sent by the sending node, the receiving node may also include: a forwarding module, which is used to forward the first broadcast frame through other ports of the receiving node if the first frame sequence number has not been stored corresponding to the sending node information, and the other ports include all ports in the receiving node except the first port.

[0173] In some embodiments, the network node may further include a storage module, which is configured to store the first frame sequence number and the sending node information correspondingly.

[0174] In some embodiments, the network node may further include a deletion module, configured to delete the first broadcast frame if the first frame sequence number and the sending node information have been correspondingly stored.

[0175] In some embodiments, the deletion module is used to delete the first broadcast frame if it is determined based on the destination node information that the current receiving node is not the destination node of the first broadcast frame, and the sending node information and the first frame sequence number have been stored correspondingly.

[0176] In some embodiments, the network node may also include a processing module, which is used to, after receiving the first broadcast frame sent by the sending node at the first port, if it is determined based on the destination node information that the current receiving node is the destination node of the first broadcast frame, and it is determined that the sending node information has not been stored, then store the sending node information and the first frame sequence number accordingly, and obtain the data in the first broadcast frame.

[0177] In some embodiments, the above-mentioned processing module is used to: if the storage entry of the broadcast sending information is full and the earliest stored entry information in the storage space has exceeded the set aging time, then delete the earliest stored entry information and store the sending node information and the first frame sequence number correspondingly as new entry information.

[0178] In some embodiments, the network node may also include a processing module, which is used to, after receiving the first broadcast frame sent by the sending node at the first port, if it is determined based on the destination node information that the current receiving node is the destination node of the first broadcast frame, and it is determined that the sending node information has been stored, then process the first broadcast frame based on the size relationship between the first frame sequence number and the stored maximum frame sequence number, and the stored maximum frame sequence number is the frame sequence number stored in the receiving node corresponding to the sending node information.

[0179] In some embodiments, the processing module is specifically used to: if it is determined that the sending node information has been stored, then process the first broadcast frame according to the size relationship between the first frame sequence number and the stored maximum frame sequence number, and the stored frame sequence number is the frame sequence number stored in the receiving node corresponding to the sending node information.

[0180] In some embodiments, the processing module is specifically configured to:

[0181] If the first frame sequence number is greater than the stored maximum frame sequence number, storing the first frame sequence number and the sending node information in correspondence, and obtaining data in the first broadcast frame;

[0182] If the first frame sequence number is less than the maximum frame sequence number stored, deleting the first broadcast frame;

[0183] If the first frame sequence number is equal to the stored maximum frame sequence number, then when the data verification result corresponding to the maximum frame sequence number indicates that the verification is passed, the first broadcast frame is deleted; when the data verification result corresponding to the maximum frame sequence number indicates that the verification is failed, and the data verification result corresponding to the first frame sequence number indicates that the verification is passed, the data in the first broadcast frame is obtained.

[0184] In some embodiments, the destination node information includes: a node address of the destination node, or data frame forwarding indication information of the target node.

[0185] In some embodiments, the sending node information includes: a node address of the sending node.

[0186] In some embodiments, the node address includes any of the following:

[0187] MAC address, a unique address based on Ethernet settings, and a unique identifier of an Ethernet node associated with the address.

[0188] In some embodiments, the size of the broadcast identifier is a fixed size.

[0189] In some embodiments, the method is applied to a network comprising a single ring network, or to a network comprising multiple ring networks.

[0190] In some embodiments, the method is applied to an Operational Technology (OT) layer network.

[0191] In an exemplary embodiment, Figure 8 As shown, a structural block diagram of a sending node is provided, including:

[0192] The sending module 801 is configured to send a first broadcast frame, where the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information;

[0193] The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

[0194] It should be noted that the division of modules in the embodiments of the present application is schematic and is merely a logical functional division. In actual implementation, other division methods may be used. Furthermore, the functional modules in the various embodiments of the present application may be integrated into a single processing module, or each module may exist physically separately, or two or more modules may be integrated into a single module. The aforementioned integrated modules may be implemented in the form of hardware or software functional modules.

[0195] If the above-mentioned integrated modules are implemented in the form of software functional modules and sold or used as independent products, they can be stored in a processor-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the existing technology, or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a number of instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present application.

[0196] It should be noted here that the above-mentioned network node provided in the embodiment of the present invention can implement all the method steps implemented in the above-mentioned method embodiment and can achieve the same technical effects. The parts and beneficial effects that are the same as those in the method embodiment will not be described in detail here.

[0197] In one embodiment, a multi-ring network is provided, comprising at least one sending node and multiple receiving nodes, wherein the at least one sending node and nodes in the multiple receiving nodes are connected via a bus to form the multi-ring network, wherein each receiving node is configured to execute the broadcast frame transmission method of the receiving node in the method embodiment, and each sending node is configured to execute the broadcast frame transmission method of the sending node in the method embodiment. Figure 1 This is an example of a multi-ring network structure.

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

[0199] In one embodiment, a computer program product is provided, comprising a computer program, which implements all the method steps implemented in the above method embodiment when executed by a processor.

[0200] Those skilled in the art will appreciate that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the above-mentioned embodiments. In particular, any reference to memory, database, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The databases involved in the various embodiments provided herein may include at least one of a relational database and a non-relational database. Non-relational databases may include, but are not limited to, distributed databases based on blockchains. The processors involved in the various embodiments provided herein may be, but are not limited to, general-purpose processors, central processing units (CPUs), graphics processing units (GPUs), digital signal processors (DSPs), programmable logic devices (PLDs), data processing logic devices based on quantum computing, and the like.

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

[0202] The above-described embodiments merely represent several implementation methods of the present application. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present application. It should be noted that a person of ordinary skill in the art may make various modifications and improvements without departing from the spirit of the present application, and these modifications and improvements fall within the scope of protection of the present application. Therefore, the scope of protection of the present application shall be determined by the appended claims.

Claims

1. A broadcast frame transmission method, characterized in that: The method is applied to a receiving node and includes: receiving, at a first port, a first broadcast frame sent by a sending node, wherein the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information; The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

2. The method according to claim 1, characterized in that After the first port receives the first broadcast frame sent by the sending node, the method further includes: If the first frame sequence number has not been stored corresponding to the sending node information, the first broadcast frame is forwarded through other ports of the receiving node, and the other ports include all ports of the receiving node except the first port.

3. The method according to claim 2, characterized in that The method further comprises: The first frame sequence number and the sending node information are stored correspondingly.

4. The method according to claim 1, wherein After the first port receives the first broadcast frame sent by the sending node, the method further includes: If the first frame sequence number and the sending node information have been stored correspondingly, the first broadcast frame is deleted.

5. The method according to claim 4, characterized in that If the sending node information and the first frame sequence number have been stored, deleting the first broadcast frame includes: If it is determined according to the destination node information that the current receiving node is not the destination node of the first broadcast frame, and the sending node information and the first frame sequence number have been stored correspondingly, the first broadcast frame is deleted.

6. The method according to claim 1, characterized in that After the first port receives the first broadcast frame sent by the sending node, the method further includes: If the current receiving node is determined to be the destination node of the first broadcast frame based on the destination node information, and it is determined that the sending node information has not been stored, the sending node information and the first frame sequence number are correspondingly stored, and the data in the first broadcast frame is obtained.

7. The method according to claim 6, characterized in that The corresponding storage of the sending node information and the first frame sequence number includes: If the storage entries of the broadcast transmission information are full and the earliest stored entry information in the storage space exceeds the set aging time, the earliest stored entry information is deleted, and the transmitting node information and the first frame sequence number are correspondingly stored as new entry information.

8. The method according to claim 1, characterized in that After the first port receives the first broadcast frame sent by the sending node, the method further includes: If it is determined based on the destination node information that the current receiving node is the destination node of the first broadcast frame, and it is determined that the sending node information has been stored, the first broadcast frame is processed based on the size relationship between the first frame sequence number and the stored maximum frame sequence number, and the stored maximum frame sequence number is the frame sequence number stored in the receiving node corresponding to the sending node information.

9. The method according to claim 8, characterized in that The processing of the first broadcast frame according to the magnitude relationship between the first frame sequence number and the stored frame sequence number includes: If the first frame sequence number is greater than the stored maximum frame sequence number, storing the first frame sequence number and the sending node information in correspondence, and obtaining data in the first broadcast frame; If the first frame sequence number is less than the maximum frame sequence number stored, deleting the first broadcast frame; If the first frame sequence number is equal to the stored maximum frame sequence number, then when the data verification result corresponding to the maximum frame sequence number indicates that the verification is passed, the first broadcast frame is deleted; when the data verification result corresponding to the maximum frame sequence number indicates that the verification is failed, and the data verification result corresponding to the first frame sequence number indicates that the verification is passed, the data in the first broadcast frame is obtained.

10. The method according to claim 1, characterized in that The destination node information includes: the node address of the destination node, or the data frame forwarding indication information of the target node; and / or, The sending node information includes: a node address of the sending node; and / or, The node address includes any one of a MAC address, a unique address set based on Ethernet, and an Ethernet node unique identifier related to the address.

11. A broadcast frame transmission method, characterized in that: The method is applied to a sending node, and the method includes: Sending a first broadcast frame, where the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information; The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

12. A receiving node, characterized in that: include: Memory, transceiver, processor: The memory is used to store computer programs; the transceiver is used to send and receive data under the control of the processor; The processor is configured to read the computer program in the memory and perform the following operations: receiving, at a first port, a first broadcast frame sent by a sending node, wherein the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information; The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

13. A sending node, characterized in that: include: Memory, transceiver, processor: The memory is used to store computer programs; the transceiver is used to send and receive data under the control of the processor; The processor is configured to read the computer program in the memory and perform the following operations: Sending a first broadcast frame, where the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information; The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

14. A receiving node, characterized in that: include: A receiving module, configured to receive, at a first port, a first broadcast frame sent by a sending node, wherein the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information; The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

15. A sending node, characterized in that: include: A sending module, configured to send a first broadcast frame, wherein the first broadcast frame includes: sending node information, a first frame sequence number associated with the sending node information, and destination node information; The first frame sequence number is used to indicate the sequence of the first broadcast frame in the broadcast frames sent by the sending node.

16. A multi-ring network, characterized in that: It includes at least one sending node and multiple receiving nodes, the at least one sending node and the nodes in the multiple receiving nodes are connected through a bus to form a multi-ring network, each of the receiving nodes is used to execute the method according to any one of claims 1 to 11, and each of the sending nodes is used to execute the method according to claim 10.

17. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 11 is implemented.

18. A computer program product, characterized in that The computer program product comprises a computer program, which implements the method according to any one of claims 1 to 11 when executed by a processor.

Images