CN117041393A

CN117041393A - Redundant message processing method and device and redundant bridge network

Info

Publication number: CN117041393A
Application number: CN202311036140.XA
Authority: CN
Inventors: 邵继超
Original assignee: Beijing Armyfly Technology Co Ltd
Current assignee: Beijing Armyfly Technology Co Ltd
Priority date: 2023-08-16
Filing date: 2023-08-16
Publication date: 2023-11-10

Abstract

The application relates to a method and a device for processing a redundant message and a redundant bridge network, wherein the method is applied to a redundant bridge device bridged between a first redundant network and a second redundant network and comprises the following steps: receiving a first redundant message from a first redundant network; the format of the first redundant message is matched with the format requirement of the redundant message transmitted in the first redundant network; judging whether the first redundant message is a received repeated message, if so, discarding the first redundant message, otherwise, converting the first redundant message into a second redundant message; the format of the second redundant message is matched with the format requirement of the redundant message transmitted in the second redundant network; and sending the second redundant message to the second redundant network. The application supports various redundancy protocol characteristics, is compatible with various redundancy protection in the practical application of large-scale networking, and enhances the utilization rate of redundancy equipment.

Description

Redundant message processing method and device and redundant bridge network

Technical Field

The present application relates to the field of network transmission technologies, and in particular, to a method and an apparatus for processing a redundant packet, a redundant bridge network, a computing device, and a storage medium.

Background

The demands for network reliability in industrial internet communication networks are continuously increasing, and the currently mainstream redundancy protocol IEC62439 is a standard for solving the problem of high-reliability automation networks, in which a link layer redundancy technology is defined: high reliability seamless redundancy protocol (High-availability Seamless Redundancy, HSR) and parallel redundancy protocol (Parallel Redundancy Protocol, PRP). Whereas in time-sensitive network topologies, the IEEE802.1CB protocol defines an on-board ethernet redundancy transport protocol (Frame Replication and Elimination for Reliability, FRER). Both standards are applied to implement redundancy protection in the presence of redundant paths and alternative paths in the network.

The PRP redundancy mechanism is implemented mainly by means of two logically or physically separated subnets (LAN a, LAN B, so-called a-net, B-net), the information transmission procedure is as follows:

the PRP sender (namely Source DANP, doubly Attached Node implementing PRP, dual port node of PRP, which can send PRP traffic directly) copies the original information Frame (C Frame) into one part, adds a specific field (namely redundant control body, redundancy Control Trailer, RCT) into two parts of frames to form PRP information frames (A Frame and B Frame), sends out the PRP information frames from two ports of the PRP sender (corresponding to A network and B network respectively) respectively, and routes two independent sub-networks to the same PRP receiver (Destination DANP); after the PRP receiver receives the two PRP information frames from the two ports respectively, the PRP information frames are processed by a series of frame processing algorithms, then the PRP information frames arriving later are eliminated according to the principle of 'coming before coming', only one PRP information frame arriving earlier is reserved, then specific fields in the PRP information frames are eliminated, and the original information is restored for forwarding.

FRER principle: when the Talker end sends data, the FRER function copies the data packet and transmits the data packet along different paths; when the Listener end receives data, the FRER function deletes the copied data packet, and only one data packet is reserved. Of course, it is not mandatory that the Talker or the Listener as the end node support the FRER function, which can be implemented by the bridge, in which case the bridge is called a proxy for the Talker or a proxy for the Listener.

However, in the case that the terminal device enters the mature redundant network, there are multiple redundant backup modes of the network, some terminals do not support PRP, or do not support FRER, relay devices are needed, or some networks need a terminal CAN function, so that device diversity selection in the network is suppressed.

Disclosure of Invention

In view of the above problems in the prior art, the present application provides a method and apparatus for processing a redundant packet, a redundant bridge network, a computing device, and a storage medium, so as to support diversity of devices in a network.

To achieve the above object, a first aspect of the present application provides a method for processing a redundant packet, which is applied to a redundant bridge device bridged between a first redundant network and a second redundant network, and includes:

receiving a first redundant message from a first redundant network; the format of the first redundant message is matched with the format requirement of the redundant message transmitted in the first redundant network;

Judging whether the first redundant message is a received repeated message, if so, discarding the first redundant message, otherwise, converting the first redundant message into a second redundant message; the format of the second redundant message is matched with the format requirement of the redundant message transmitted in the second redundant network;

and sending the second redundant message to the second redundant network.

The second aspect of the present application provides a processing device for redundant messages, including:

a receiving unit, configured to receive a first redundancy packet from a first redundancy network; the format of the first redundant message is matched with the format requirement of the redundant message transmitted in the first redundant network;

the processing unit is used for judging whether the first redundant message is a received repeated message, if so, discarding the first redundant message, and if not, converting the first redundant message into a second redundant message; the format of the second redundant message is matched with the format requirement of the redundant message transmitted in the second redundant network;

and the sending unit is used for sending the second redundant message to the second redundant network.

A third aspect of the present application provides a redundant bridge network comprising: a first redundant network, a second redundant network, and a redundant bridge device bridging between the first and second redundant networks, the redundant bridge device for implementing the method of any of the first aspects above.

A fourth aspect of the application provides a computing device comprising:

a processor, and

a memory having stored thereon program instructions which, when executed by the processor, cause the processor to perform the method of any of the above first aspects.

A fifth aspect of the present application provides a computer readable storage medium having stored thereon program instructions which, when executed by the computer, cause the computer to implement the method of any of the first aspects described above.

By the method, the first redundant network and the second redundant network are bridged by the redundant bridge equipment, so that multiple redundant protocol characteristics can be supported, multiple redundant protections are compatible, and different terminal equipment can be connected by the redundant bridge equipment through setting different first redundant networks and second redundant networks, so that the diversity of equipment in networking is supported.

Drawings

FIG. 1 is a flow chart of a method for processing a redundant message according to an embodiment of the present application;

fig. 2 is a schematic diagram of a time-sensitive service networking topology according to an embodiment of the present application;

fig. 3 is a schematic diagram of a IEEE802.1CB service networking topology according to an embodiment of the present application;

Fig. 4 is a flowchart of a method for determining a first redundant packet by a PRP device according to an embodiment of the present application;

FIG. 5 is a schematic diagram of a frame number and a corresponding window in a de-duplication pre-vector window frame elimination algorithm according to an embodiment of the present application;

FIG. 6 is a schematic diagram of a frame number and a corresponding window in a de-duplication vector window frame elimination algorithm according to an embodiment of the present application;

FIG. 7 is a schematic structural diagram of a redundant packet processing apparatus according to an embodiment of the present application;

FIG. 8 is a schematic diagram of a computing device provided by an embodiment of the application.

It should be understood that in the foregoing structural schematic diagrams, the sizes and forms of the respective block diagrams are for reference only and should not constitute an exclusive interpretation of the embodiments of the present application. The relative positions and inclusion relationships between the blocks presented by the structural diagrams are merely illustrative of structural relationships between the blocks, and are not limiting of the physical connection of embodiments of the present application.

Detailed Description

The technical scheme provided by the application is further described below by referring to the accompanying drawings and examples. It should be understood that the system structure and the service scenario provided in the embodiments of the present application are mainly for illustrating possible implementation manners of the technical solutions of the present application, and should not be interpreted as the only limitation to the technical solutions of the present application. As one of ordinary skill in the art can know, with the evolution of the system structure and the appearance of new service scenarios, the technical scheme provided by the application is applicable to similar technical problems.

It should be understood that, in the description of the following specific embodiments, some repetition may not be described again, but it should be considered that the specific embodiments have mutual references and may be combined with each other.

Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. If there is a discrepancy, the meaning described in the present specification or the meaning obtained from the content described in the present specification is used. In addition, the terminology used herein is for the purpose of describing embodiments of the application only and is not intended to be limiting of the application. For the purpose of accurately describing the technical content of the present application, and for the purpose of accurately understanding the present application, the following explanation or definition is given for terms used in the present specification before the explanation of the specific embodiments:

1) The TSN (Time-Sensitive Networking) Time sensitive network, i.e. the protocol family that implements deterministic minimum Time delay in a non-deterministic ethernet, is a set of protocol standards developed by the TSN working group in the IEEE 802.1 working group, defines a Time sensitive mechanism for ethernet data transmission, and adds deterministic and reliable features to standard ethernet to ensure real-Time, deterministic and reliable data transmission.

In order to solve the problem that in the mature redundant network of the terminal equipment, a plurality of redundant backup modes of the network exist, so that the equipment diversity selection in the networking is restrained. Some terminals do not support PRP, or FRER, require relay equipment, or some networking require terminal CAN functionality. In particular to a method and a device for processing a redundant message, which relate to the problem that PRP redundant equipment is required to play a role of bridging multiple redundant protocol equipment in cross-domain networking.

Fig. 1 is a flowchart of a method for processing a redundant packet according to an embodiment of the present application, where, as shown in fig. 1, the method is applied to a redundant bridge device bridged between a first redundant network and a second redundant network, and includes:

s110: receiving a first redundant message from a first redundant network; the format of the first redundant message is matched with the format requirement of the redundant message transmitted in the first redundant network;

S120: judging whether the first redundant message is a received repeated message, if so, discarding the first redundant message, otherwise, converting the first redundant message into a second redundant message; the format of the second redundant message is matched with the format requirement of the redundant message transmitted in the second redundant network;

s130: and sending the second redundant message to the second redundant network.

By the method, the first redundant network and the second redundant network are bridged by the redundant bridge equipment, the two redundant networks support different redundant protocols, the redundant bridge equipment supports conversion among different redundant protocols, compatibility of multiple redundant protocols can be supported, and the redundant bridge equipment can be connected with different terminal equipment by setting different first redundant networks and second redundant networks, so that equipment diversity in networking is realized.

In this embodiment, the first redundant network may be a PRP network and the second redundant network may be a TSN network; or, the first redundant network may be a TSN network, and the second redundant network may be a PRP network, where the PRP network, the TSN network, and the redundant bridge device form a time-sensitive service network shown in fig. 2, and the network implementation is redundant packet interaction among the PRP device, the redundant bridge device, and the CAN device.

The redundant network in the application can be a TSN network, so the application provides compatibility of redundant protection characteristics in the TSN network, and ultra-low delay and jitter guarantee is provided for time sensitive data through the TSN network.

In this embodiment, the first redundant network may be a PRP network and the second redundant network may be a FRER network; or, the first redundant network may be a FRER network, and the second redundant network may be a PRP network, where the PRP network, the FRER network, and the redundant bridge device form a IEEE802.1CB service networking topology shown in fig. 3, and redundant packet interactions among the PRP device, the redundant bridge device, and the FRER device are implemented in the IEEE802.1CB service networking.

[ PRP device data Transmission procedure between PRP network and redundant bridge device ]

In some embodiments, as shown in fig. 2 and 3, when the first redundant network is a PRP network, the format of the first redundant message matches the format requirements of the redundant message transmitted within the PRP network. As shown in fig. 4, the first redundant packet is determined by the PRP device as follows:

s41: the PRP equipment receives the PRP service message, identifies the PRP service message, and identifies a source MAC address in the PRP service message;

Specifically, the PRP service message may be identified according to a 7-tuple or a 12-tuple of the message.

S42: the PRP device performs table lookup operation according to the source MAC address, and obtains RCT sequence according to the lookup result.

Specifically, the PRP device creates an entry with the source MAC address as a key according to whether an entry with the source MAC address as a key exists in a lookup table of the source MAC address of the message, if not, the entry indicates that the table is empty, the entry also records RCT sequence, and at this time, the RCT sequence records as 0; when an entry is found in the table that is keyed to the source MAC address and RCT sequence=0, it indicates that the PRP device has received a message that includes the source MAC address and created the entry, at which point RCT sequence in the entry is incremented by 1. When an entry with the source MAC address as a key and RCT sequence=1 is found in the table, it indicates that the PRP device has received two messages including the source MAC address, and the RCT sequence in the entry is further added with 1, RCT sequence=2. When the subsequent PRP device receives the message including the source MAC address again, the table look-up operation is performed similarly, and RCT sequence is added by 1 and accumulated continuously. Wherein RCT sequence is the cumulative number of 2 bytes in length.

And setting the aging time of the item taking the source MAC address as a key word, and deleting the item taking the source MAC address as the key word in the table through a timer after the aging time is reached if the PRP equipment does not receive the message containing the source MAC address or receives the message containing other source MAC addresses subsequently. Deleting entries in the table saves memory in the table and shortens the lookup latency.

S43: the PRP device reads the state of the output ports (LanA, lanB), and determines whether to convert the PRP service message into a first redundant message according to the port state.

Specifically, if the output (redundancy) ports (LanA, lanB) are available, the PRP service message is converted into a first redundancy message, i.e. the tail of the PRP service message is added with a PRP identifier, so as to obtain the first redundancy message. And copying the first redundant message according to the number of the redundant ports, and forwarding the first redundant message from the redundant ports (LanA, lanB) to the redundant bridge equipment through the PRP network. Where two ports may be replicated twice and one port may be replicated once. If none of the outgoing (redundant) ports (LanA, lanB) is available, the PRP service message is discarded.

Wherein the PRP is identified as 6 bytes, abbreviated RCT, which includes RCT sequence, lan port number, LSDU length and protocol RCT suffix. The first redundant message also includes a re-checksum, which is a checksum (FCS) of the message that is recalculated when the content of the message increases or decreases.

The format of the first redundant message is shown in table 1:

TABLE 1

Redundant message deduplication process of redundant bridge device under PRP redundancy mechanism

In some embodiments, the determining whether the first redundant packet is a received duplicate packet includes:

determining a redundancy mechanism used by the first redundancy network;

and judging whether the first redundant message is the received repeated message or not by using the repeated message judging method matched with the redundant mechanism.

In some embodiments, when determining that the redundancy mechanism used by the first redundancy network is a PRP redundancy mechanism, the determining whether the first redundancy message is a received duplicate message includes:

judging whether first key information corresponding to the first redundant message is recorded or not, if not, determining that the first redundant message is not a repeated message, and recording the first key information; otherwise, determining the first redundant message as a repeated message, wherein the first key information is used for identifying the first redundant message.

In some embodiments, further comprising:

and deleting the recorded first key information after judging that the first redundant message is the received repeated message.

In these embodiments, as shown in fig. 2 and 3, the redundant bridge device receives a first redundant packet sent by the PRP device through the PRP network. The redundant bridge device specifically judges whether the first redundant message is a repeated message according to the following mode:

the redundant bridge device performs a table lookup operation according to first key information (i.e., source MAC address and RCT sequence, where RCT sequence is represented by a numerical value) in a first redundant message, queries whether an entry (i.e., the entry includes a value of source MAC address+rct sequence) using the source MAC address and the RCT sequence as a key exists in a table, if the entry is not found in the table, indicates that the table is empty, and indicates that the redundant bridge device receives the first redundant message for the first time, and if the first redundant message is not a repeated message, an entry using the source MAC and the RCT sequence () as key information is created in the table. If the entries of the source MAC address and the RCT sequence are found in the table, the redundant bridge equipment is indicated to receive the first redundant message for the second time, the first redundant message received for the second time is lost, and the entries which are created in the table and take the source MAC and the RCT sequence as key information are deleted. And the subsequent redundant bridge equipment repeats the process after receiving the redundant message.

In addition, an aging time of an entry taking the source MAC address and the RCT sequence as a key word may be set, in the aging time, if the redundant bridge device receives a first redundant message including the source MAC address and the RCT sequence once and does not receive the first redundant message, or receives a message including other source MAC addresses and/or other RCT sequences, the entry taking the source MAC address and the RCT sequence as the key word in the table fails to be matched with the source MAC address and the RCT sequence in the message, and after the aging time is reached, the entry taking the source MAC address and the RCT sequence as the key word in the table is deleted by a timer. The table entry is deleted to save the memory occupied by the table entry, shorten the time delay of table lookup, and avoid influencing the judgment of the subsequent redundant message.

[ redundant message conversion Process under PRP network as the first redundant network and TSN network as the second redundant network ]

In some embodiments, the converting the first redundant packet into the second redundant packet includes:

and when the first redundant network is a PRP network and the second redundant network is a TSN network, converting the mode of removing RCT information from the tail of the first redundant message into the second redundant message.

In this embodiment, when the first redundant network is a PRP network and the second redundant network is a TSN network, the message goes from the PRP network to the TSN network through the redundant bridge device in fig. 2 to the CAN device. At this time, the redundant bridge device reads the states of the two redundant ports of the CAN device, if the redundant ports are available, the RCT in the first redundant message is removed to obtain a second redundant message, the second redundant message is copied according to the number of the redundant ports, and the second redundant message is forwarded from the redundant ports to the TSN network respectively. If no redundant port is available, the first redundant message is discarded. The second redundancy message further includes a re-checksum, which is a checksum (FCS) of the message that is re-calculated when the content of the message increases or decreases.

Under the TSN redundancy mechanism, redundant message deduplication process of redundant bridge device

In some embodiments, when determining that the redundancy mechanism used by the first redundancy network is a TSN redundancy mechanism, the determining whether the first redundancy message is a received duplicate message includes:

if the second key information corresponding to the first redundant message is not recorded, determining that the received first redundant message is not a repeated message, and recording the second key information; and/or

If the second key information corresponding to the first redundant message is recorded, judging whether the difference value between the recorded time stamp of the second key information and the time stamp of the first redundant message is within a threshold value, if so, determining that the first redundant message is a repeated message, and if not, determining that the first redundant message is not the repeated message.

In some embodiments, further comprising:

and deleting the recorded second key information after judging that the first redundant message is the received repeated message.

In these embodiments, as shown in fig. 2, the redundant bridge device receives a first redundant packet sent by the CAN device through the TSN network. The redundant bridge device specifically judges whether the first redundant message is a repeated message according to the following mode:

s51: the redundant bridge device identifies the first redundant message according to the configured second key information, and obtains corresponding second key information, wherein the second key information can be 7-tuple.

Wherein, because CAN devices support CAN-ethernet traffic conversion, and routing to other CAN egress functions. The CAN-ethernet service conversion principle supports maximum configuration 7-tuple, where the 7-tuple includes SMAC (source MAC address), DMAC (destination MAC address), SIP (source IP address), DIP (destination IP address), L4 port (specifying the transport layer source port number of the message), L4DPORT (specifying the transport layer destination port number of the message), and procol (PROTOCOL number). The TSN network switch may identify 7-tuple data streams, supporting time-aware shaping (TAS) functions to provide ultra-low latency and jitter guarantees for time-sensitive data. The second key information can also be configured into other contents, and is configured according to the requirement.

S52: the redundant bridge device time stamps (timestamps) the first redundant message.

The time stamp records the time of message reception, supports 48bit seconds, and has the precision of nanoseconds.

S53: the redundant bridge device performs a table lookup operation according to the 7-tuple in the first redundant message, queries whether an entry taking the 7-tuple as a key exists in the table, if the entry is not found in the table, the table is empty, the redundant bridge device indicates that the first redundant message is received for the first time, the first redundant message is not a repeated message, creates an entry taking the 7-tuple as the key information in the table, and marks a timestamp in the entry. If an entry taking the 7-tuple as key information is found in the table and the difference between the time stamp included in the entry and the time stamp of the first redundant message is smaller than a preset time threshold value, the first redundant message is a second received message and is a repeated message, the entry taking the 7-tuple as key information is deleted in the table, and then the repeated received first redundant message is discarded.

Or if an entry taking the 7-tuple as key information is found in the table, and the difference between the time stamp included in the entry and the time stamp of the first redundant message is larger than a preset time threshold value, the first redundant message is the new message received for the first time, the first redundant message is not a repeated message, the entry taking the 7-tuple in the first redundant message as key information is created in the table, and the new time stamp is marked.

Because the messages sent by the two paths of the multi-path terminal CAN equipment are in interval time, and the time interval for sending the messages is smaller than a preset time threshold (for example, 5us or other values), the received messages in the preset time threshold are identified as repeated messages.

Meanwhile, the aging time of the entry with the 7-tuple as key information and marked with the timestamp can be set, if the redundant bridge equipment does not receive the redundant message after receiving the first redundant message including the 7-tuple once, the entry with the 7-tuple as key in the table can not be matched with the 7-tuple in the message, and after the aging time is reached, the entry with the 7-tuple as key in the table is deleted through a timer. Or if the difference between the time stamp included in the matched item and the time stamp of the first redundant message is greater than a preset time threshold, deleting the item after the aging time is reached. Deleting the corresponding item saves the memory occupied by the item, shortens the time delay of table lookup, and avoids influencing the judgment of the subsequent redundant message.

[ redundant message conversion Process under the condition that the first redundant network is a TSN network and the second redundant network is a PRP network ]

and when the first redundant network is a TSN network and the second redundant network is a PRP network, converting the mode of adding RCT information at the tail of the first redundant message into the second redundant message.

In some embodiments, when converting the manner of adding RCT information at the tail of the first redundant packet into the second redundant packet, adding RCT sequence corresponding to the source MAC address at the tail of the first redundant packet; the generation mode of the RCT sequence comprises the following steps:

after judging that the first redundant message is not a received repeated message, acquiring a source MAC address in the first redundant message, and accumulating and counting RCT sequence values corresponding to the source MAC address;

and when the aging time is reached, deleting the recorded source MAC address and the corresponding RCT sequence value.

In these embodiments, when the first redundant network is a TSN network and the second redundant network is a PRP network, after the redundant bridge device de-duplicates the first redundant packet, the redundant bridge device reads the state of the redundant port (LanA, lanB) to the PRP network, and if the redundant port is in the available state, adds the RCT to the tail of the first redundant packet to obtain the second redundant packet, where the RCT includes an RCT sequence, a Lan port number, an LSDU length and an RCT suffix. And copying the second redundant message according to the number of the available redundant ports, and forwarding the second redundant message to the PRP equipment through the PRP network by the redundant ports respectively. If no redundant port is available, the first redundant message is discarded. The second redundancy message further includes a re-checksum, which is a checksum (FCS) of the message that is re-calculated when the content of the message increases or decreases.

The method for determining the RCT sequence is the same as the method for determining the RCT sequence by the PRP device.

Embodiment of message generation by FRER device under FRER redundancy mechanism

The first redundant message sent to the redundant bridge device by the FRER device comprises an R-TAG identifier, wherein the R-TAG identifier comprises a FRER label, a reserve area and a sequence number of the FRER. The sequence number of the first redundant message is used as the frame number of the first redundant message.

The sequence number is determined in the same manner as the RCT sequence.

Namely: the FRER device inquires whether an entry taking the source MAC address as a key exists in a table (in the FRER device) according to the source MAC address of the received message, if not, an entry taking the source MAC address as the key is created if the table is empty, and a sequence number is recorded in the entry, wherein the sequence number is recorded as 0; when an entry with the source MAC address as a key and sequence number=0 is found in the table, it indicates that the FRER device has received a message including the source MAC address, and created the entry, at this time, the sequence number in the entry is added by 1. When an entry with the source MAC address as a key and sequence number=1 is found in the table, it indicates that the FRER device has received two messages including the source MAC address, and the sequence number in the entry is continuously incremented by 1,sequence number =2. When the subsequent FRER equipment receives the message comprising the source MAC address again, table lookup operation is performed similarly, the sequence number is added by 1, the accumulation is carried out continuously, and the reverse rotation is carried out after overflow. Where sequence number is the cumulative number of 2 bytes in length.

The first redundant message format is shown in table 2:

TABLE 2

Under FRER redundancy mechanism, redundancy message deduplication process of redundancy bridge device

In some embodiments, when determining that the redundancy mechanism used by the first redundancy network is a FRER redundancy mechanism, the determining whether the first redundancy message is a received duplicate message includes:

and judging whether the first redundant message is a received repeated message or not by adopting a vector window frame elimination algorithm and/or a matching frame elimination algorithm.

In these embodiments, as shown in fig. 3, the redundant bridge device receives a first redundant packet sent by the FRER device through the FRER network. The redundant bridge equipment adopts a vector window frame elimination algorithm and/or a matched frame elimination algorithm to judge whether the first redundant message is a received repeated message.

The principle of the vector window frame elimination algorithm is as follows: the algorithm includes a window vector that records frames ranging from RecovSeqNum-HL+1 to the current maximum frame number RecovSeqNum, which is referred to as the record window. Where HL is the bit width of the window vector. When the frame of the frame number in the window is recorded, the bit of the frame number corresponding to the window vector is set to 1, otherwise, the bit is set to 0. Frame erasure can only eliminate duplicate frames within a recording window.

The method also comprises a permission window which takes the current maximum frame number RecovSeqNum as a center and takes positive and negative HL as a radius, and the width of the permission window is 2HL-1. Frames with frame numbers within this window are accepted, otherwise discarded.

The default frames are received in frame numbers from small to large. Normally, the frame number of the newly received frame is larger than the RecovSeqNum, after receiving this frame, the RecovSeqNum becomes the frame number of the frame, at this time, the bit corresponding to the RecovSeqNum in the window vector is set to 1, and the bit of the RecovSeqNum is always 1 under normal conditions. At this time, the recording window and the permission window move along with the change of the RecovSeqNum, and the moving directions are both unidirectional moving in the increasing direction of the frame number. If the new frame number is smaller than the current RecovSeqNum, the RecovSeqNum value is unchanged, and the recording window and the permission window are not moved. If the new frame number is smaller than the current RecovSeqNum and the bit corresponding to the frame number is 1, then it is indicated that the frame corresponding to the frame number is received. If the new frame number is smaller than the current RecovSeqNum and the bit corresponding to the frame number is 0, it indicates that the frame corresponding to the frame number is not received, and the frames in both cases are collectively called out-of-order frames.

A variable RemainingTicks is maintained for controlling the time of frame sequence number reset. The variable is initialized after the frame number is reset and also after a frame is accepted. The rest time is reduced with time, and when the rest time is reduced to 0, the frame sequence number is reset if no frame is coming in a period of time, and the frame with any frame sequence number can be accepted.

Specifically, the method for judging whether the first redundant message is the received repeated message by adopting the vector window frame elimination algorithm comprises the following steps:

when the frame number of the first redundant message is greater than the current maximum frame number RecovSeqNum of the record window and the frame number of the first redundant message is in the allowed window, the message can be accepted, and the first redundant message is the first received message and is not the repeated message. Changing RecovSeqNum into the frame number of the first redundant message, setting bit of the frame number corresponding to the window vector to 1, and moving the recording window and the permission window.

When the frame number of the first redundant message is located in the recording window and the window vector bit corresponding to the frame number is 1, the first redundant message is indicated to be received and is a repeated message.

When the frame number of the first redundant message is located in the recording window and the window vector bit corresponding to the frame number is 0, the first redundant message is indicated to be not received and is an out-of-order message, and is discarded.

For example.

HL is 3 and recovseqnum is 6. The recording window is 4-6 and the permission window is 4-8.

As shown in fig. 5, if the message with the frame number 3 in fig. 5 arrives, the message is discarded because the frame number 3 is not in the allowed window of 4-8.

If the message with the frame number of 5 in fig. 5 arrives, the frame number of 5 is in the recording window and in the permission window, and if the bit corresponding to the frame number of 5 is 1, the message with the frame number of 5 is received, and the message is a repeated message. At this time, the frame number 5 is smaller than the maximum frame number 6 in the recording window, so that neither the permission window nor the recording window is moved.

If the message with the frame number 8 in fig. 5 arrives, the frame number 8 is larger than the maximum frame number 6 in the recording window, and in the permission window, the message with the frame number 8 arrives for the first time, and is not a repeated message. The maximum frame number RecovSeqNum of the sequence history (window vector) is reassigned to 8, and the bit corresponding to the frame number 8 is 1. Moving the recording window to 6-8 will allow the window to move to 6-10 as shown in fig. 6. Since the frame of frame number 7 has not passed before, the bit corresponding to frame number 7 is 0.

Principle of matching frame elimination algorithm: the algorithm includes a variable RecovSeqNum, recovSeqNum equal to the frame number of the most recently received frame. When the frame number of the newly received frame is different from the RecovSeqNum, the frame is received and the RecovSeqNum is changed to the frame number of the frame. The receipt of the same frame indicates a duplicate frame. The default frames are received in frame numbers from small to large.

Specifically, the method for judging whether the first redundant message is the received repeated message by adopting the matching frame elimination algorithm comprises the following steps:

when the frame number of the first redundant message is not equal to RecovSeqNum, it indicates that the first redundant message is the first received message and is not a duplicate message. The RecovSeqNum is changed to the frame number of the first redundant message.

When the frame number of the first redundant message is equal to RecovSeqNum, the first redundant message is indicated to be received and is a repeated message.

When the first redundant network is a FRER network and the second redundant network is a PRP network, redundant message conversion flow is shown

when the first redundant network is a FRER network and the second redundant network is a PRP network, the tail of the first redundant message is removed of R-TAG information, and RCT information adding mode is added into the first redundant message to be converted into the second redundant message.

In these embodiments, after the redundant bridge device removes the duplication according to the vector window frame elimination algorithm or the matching frame elimination algorithm, the redundant bridge device reads the state of the redundant port (LanA, lanB) of the PRP network, if the redundant port is in an available state, removes the R-TAG information from the tail of the first redundant message, and adds RCT information into the first redundant message to obtain a second redundant message, where RCT includes RCT sequence, lan port number, LSDU length and RCT suffix. And copying the second redundant message according to the number of the available redundant ports, and forwarding the second redundant message to the PRP equipment through the PRP network through the redundant ports respectively. If no redundant port is available, the first redundant message is discarded. The second redundancy message further includes a re-checksum, which is a checksum (FCS) of the message that is re-calculated when the content of the message increases or decreases.

[ redundant message conversion Process under PRP network as the first redundant network and FRER network as the second redundant network ]

When the first redundant network is a PRP network and the second redundant network is a FRER network, the RCT information is removed from the tail of the first redundant message, and the R-TAG is added into the first redundant message to be converted into the second redundant message.

In these embodiments, as shown in fig. 3, when the first redundant network is a PRP network and the second redundant network is a FRER network, the first redundant packet received by the redundant bridge device is sent by the PRP device through the PRP network, and the determination process of the first redundant packet is the same as the data transmission flow from the PRP device to the redundant bridge device through the PRP network. The process of the redundant bridge device for removing the duplicate of the first redundant message is the same as the process of removing the duplicate of the redundant message of the redundant bridge device under the PRP redundancy mechanism.

After the redundant bridge device de-duplicated the first redundant message, the process of sending the first redundant message to the FRER device through the FRER network is as follows:

the redundant bridge device reads the state of a redundant port (namely, the redundant port is destined for the FRER device) of the FRER network, if the redundant port is in an available state, RCT is removed at the tail part of the first redundant message, then R-TAG (comprising a FRER label, a reserve zone and a sequence number of the FRER) is added into the message, a second redundant message is obtained, the second redundant message is copied according to the number of the redundant ports, and the second redundant message is respectively forwarded to the FRER network from the redundant port. If no redundant port is available, the first redundant message is discarded. The second redundancy message further includes a re-checksum, which is a checksum (FCS) of the message that is re-calculated when the content of the message increases or decreases. The format of the second redundant message is shown in table 2.

The method for determining the sequence number of the fret is the same as the method for determining the RCT sequence in the above embodiment of generating the message by the fret device under the above-mentioned fret redundancy mechanism.

After the FRER receives the second redundant message through the FRER network, the vector window frame elimination algorithm and/or the matching frame elimination algorithm are/is sampled to remove the duplication of the second redundant message, the R-TAG is deleted, the checksum of the message with the R-TAG deleted is recalculated, and then the checksum is forwarded out through the CB service port.

Based on the same inventive concept, the present application also proposes a processing device of a redundant packet, where the processing device of a redundant packet may be used to implement the processing method of a redundant packet in the foregoing embodiment, as shown in fig. 7, where the processing device 400 of a redundant packet has a receiving unit 410, a processing unit 420, and a sending unit 430.

Specifically, the receiving unit is configured to receive a first redundancy packet from a first redundancy network; the format of the first redundant message is matched with the format requirement of the redundant message transmitted in the first redundant network;

And the sending unit is used for sending the second redundant message to the second redundant network. .

Reference may be made specifically to the detailed description of the method embodiments, which are not described here in detail.

Based on the same inventive concept, the application also proposes a redundant bridge network comprising: the first redundant network, the second redundant network, and a redundant bridge device bridging between the first redundant network and the second redundant network, the redundant bridge device being configured to implement the method described above.

Fig. 8 is a schematic diagram of a computing device 900 provided by an embodiment of the application. The computing device may be used as a processing device of the redundant message, and execute each optional embodiment of the processing method of the redundant message, where the computing device may be a terminal, or may be a chip or a chip system inside the terminal. As shown in fig. 8, the computing device 900 includes: processor 910, memory 920, and communication interface 930.

It should be appreciated that the communication interface 930 in the computing device 900 shown in fig. 8 may be used to communicate with other devices and may include, in particular, one or more transceiver circuits or interface circuits.

Wherein the processor 910 may be coupled to a memory 920. The memory 920 may be used to store the program codes and data. Accordingly, the memory 920 may be a storage unit internal to the processor 910, an external storage unit independent of the processor 910, or a component including a storage unit internal to the processor 910 and an external storage unit independent of the processor 910.

Optionally, computing device 900 may also include a bus. The memory 920 and the communication interface 930 may be connected to the processor 910 through a bus. The bus may be a peripheral component interconnect standard (Peripheral Component Interconnect, PCI) bus or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, or the like. The buses may be classified as address buses, data buses, control buses, etc. For ease of illustration, an unbiased line is shown in FIG. 8, but does not represent only one bus or one type of bus.

It should be appreciated that in embodiments of the present application, the processor 910 may employ a central processing unit (central processing unit, CPU). The processor may also be other general purpose processors, digital signal processors (digital signal processor, DSP), application specific integrated circuits (application specific integrated circuit, ASIC), off-the-shelf programmable gate arrays (field programmable gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. Or the processor 910 may employ one or more integrated circuits for executing associated programs to perform techniques provided by embodiments of the present application.

The memory 920 may include read only memory and random access memory and provide instructions and data to the processor 910. A portion of the processor 910 may also include nonvolatile random access memory. For example, the processor 910 may also store information of the device type.

When the computing device 900 is running, the processor 910 executes computer-executable instructions in the memory 920 to perform any of the operational steps of the methods described above, as well as any of the alternative embodiments.

It should be understood that the computing device 900 according to the embodiments of the present application may correspond to a respective subject performing the methods according to the embodiments of the present application, and that the above and other operations and/or functions of the respective modules in the computing device 900 are respectively for implementing the respective flows of the methods according to the embodiments, and are not described herein for brevity.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.

In the several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

The embodiments of the present application also provide a computer-readable storage medium having stored thereon a computer program for executing the above-described method when executed by a processor, the method comprising at least one of the aspects described in the respective embodiments above.

The computer storage media of embodiments of the application may take the form of any combination of one or more computer-readable media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

The computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Computer program code for carrying out operations of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).

In addition, the terms "first, second, third, etc." or module a, module B, module C, etc. in the description and the claims are used merely to distinguish similar objects from a specific ordering of the objects, it being understood that the specific order or sequence may be interchanged if allowed to enable embodiments of the application described herein to be practiced otherwise than as illustrated or described.

In the above description, reference numerals indicating steps such as S110, S120, … …, etc. do not necessarily indicate that the steps are performed in this order, and the order of the steps may be interchanged or performed simultaneously as the case may be.

The term "comprising" as used in the description and claims should not be interpreted as being limited to what is listed thereafter; it does not exclude other elements or steps. Thus, it should be interpreted as specifying the presence of the stated features, integers, steps or components as referred to, but does not preclude the presence or addition of one or more other features, integers, steps or components, or groups thereof. Thus, the expression "a device comprising means a and B" should not be limited to a device consisting of only components a and B.

Reference in the specification to "one embodiment" or "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the application. Thus, appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment, but may. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments as would be apparent to one of ordinary skill in the art from this disclosure.

Note that the above is only a preferred embodiment of the present application and the technical principle applied. It will be understood by those skilled in the art that the present application is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the application. Therefore, while the application has been described in connection with the above embodiments, the application is not limited to the above embodiments, but may include many other equivalent embodiments without departing from the spirit of the application, which fall within the scope of the application.

Claims

1. A method for processing a redundant message, applied to a redundant bridge device bridged between a first redundant network and a second redundant network, comprising:

And sending the second redundant message to the second redundant network.

2. The method of claim 1, wherein the determining whether the first redundant message is a received duplicate message comprises:

determining a redundancy mechanism used by the first redundancy network;

3. The method of claim 2, wherein determining whether the first redundant message is a received duplicate message when the redundancy mechanism used by the first redundant network is a PRP redundancy mechanism comprises:

4. The method of claim 2, wherein when determining that the redundancy scheme used by the first redundancy network is a TSN redundancy scheme, the determining whether the first redundancy message is a received duplicate message comprises:

5. The method according to claim 3 or 4, further comprising:

and deleting the recorded first key information or second key information after judging that the first redundant message is the received repeated message.

6. The method of claim 2, wherein determining whether the first redundant message is a received duplicate message when a redundancy mechanism used by the first redundant network is a fret redundancy mechanism comprises:

7. The method of claim 1, wherein the converting the first redundant message to a second redundant message comprises one of:

When the first redundant network is a PRP network and the second redundant network is a TSN network, converting the mode of removing RCT information from the tail of the first redundant message into the second redundant message;

when the first redundant network is a TSN network and the second redundant network is a PRP network, converting a mode of adding RCT information at the tail of the first redundant message into the second redundant message;

when the first redundant network is a PRP network and the second redundant network is a FRER network, removing RCT information from the tail of the first redundant message, and converting the mode of adding R-TAG into the first redundant message into the second redundant message;

when the first redundant network is a FRER network and the second redundant network is a PRP network, the tail of the first redundant message is removed of R-TAG information, and RCT information is added into the first redundant message to be converted into the second redundant message.

8. The method of claim 7, wherein converting the manner of adding RCT information at the tail of the first redundant packet into the second redundant packet comprises adding RCT sequence corresponding to a source MAC address at the tail of the first redundant packet; the generation mode of the RCT sequence comprises the following steps:

9. A redundant message processing apparatus, comprising:

10. A redundant bridge network, comprising: a first redundant network, a second redundant network, and a redundant bridge device bridging between the first and second redundant networks, the redundant bridge device for implementing the method of any one of claims 1 to 8.