CN109981479B - PRP network-oriented single-window dynamic sliding and redundancy management system and method - Google Patents
PRP network-oriented single-window dynamic sliding and redundancy management system and method Download PDFInfo
- Publication number
- CN109981479B CN109981479B CN201910146105.0A CN201910146105A CN109981479B CN 109981479 B CN109981479 B CN 109981479B CN 201910146105 A CN201910146105 A CN 201910146105A CN 109981479 B CN109981479 B CN 109981479B
- Authority
- CN
- China
- Prior art keywords
- window
- lookup table
- data
- cyclic
- mac address
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
- H04L45/7453—Address table lookup; Address filtering using hashing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/22—Traffic shaping
- H04L47/225—Determination of shaping rate, e.g. using a moving window
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/27—Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
- H04L12/437—Ring fault isolation or reconfiguration
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a PRP network-oriented single-window dynamic sliding and redundancy management system and a PRP network-oriented single-window dynamic sliding and redundancy management method. The system comprises a redundant data frame characteristic value extraction module, a cyclic lookup table aging module, a discarding algorithm module and a result feedback module, wherein a single-window dynamic sliding discarding algorithm is established to ensure that repeated frames in a redundant network are correctly received, network congestion is avoided, network communication robustness is improved, and the effects of fault zero self-healing seamless switching and transparent application are achieved; the system introduces aging time to the circular lookup table, and eliminates the table item content in the circular lookup table, thereby achieving the cyclic utilization of the lookup table; by adopting the mapping of each bit state in the single window and the frame receiving mark, the space resource is saved, the table look-up efficiency is improved, and the conflict is reduced; the virtual serial number is calculated, virtual windowing is carried out, the virtual windowing is compared with an original window, an overlapping area of the virtual windowing and the original window is obtained, dynamic sliding of the window is completed, and redundant fault-tolerant management is simplified.
Description
[ technical field ] A
The invention belongs to the field of PRP network management, and particularly relates to a PRP network-oriented single-window dynamic sliding and redundancy management system and method.
[ background ] A method for producing a semiconductor device
In a parallel redundant PRP network, a first-come-first-obtain principle is adopted, repeated data frames are discarded, network congestion is reduced, and the effects of fault zero self-healing seamless switching and transparent application are achieved. The repeated frame discarding algorithm mainly comprises a double-window discarding algorithm, a look-up table algorithm and the like. In the double-window discarding algorithm, a redundant port respectively maintains an independent window table according to a serial number SN and a network identifier, and for each received data frame, two tables are required to be inquired, so that the implementation is relatively complex; the look-up table algorithm is realized based on the source MAC address and the SN number, each SN number needs to be stored in different table entries, the occupied resource is large, and the look-up table efficiency is reduced because the SN number is not continuously increased. Both algorithms have a large space and time overhead problem.
[ summary of the invention ]
The present invention aims to overcome the disadvantages of the prior art and provide a single window dynamic sliding and redundancy management system and method for a PRP network; the system combines the circular lookup table to complete the discard management of the repeated frames in the PRP network, simplify the time complexity and the space complexity of hardware realization and improve the reliability and the robustness of network communication.
In order to achieve the purpose, the invention adopts the following technical scheme to realize the purpose:
a PRP network-oriented single-window dynamic sliding and redundancy management system comprises: the device comprises a redundant data frame characteristic value extraction module, a cyclic lookup table aging module, a discarding algorithm module and a result feedback module;
the redundant data frame characteristic value extraction module is used for extracting and storing a source MAC address and an SN number of the complete data frame;
the cyclic lookup table module is used for creating the MAC address information which does not appear according to the source MAC address and the SN number of the complete data frame, or updating and keeping a sliding window corresponding to the existing MAC address information according to the discarding algorithm module, and simultaneously recording the SN number state of the communication data frame in the network;
the cyclic lookup table aging module is used for clearing aging contents in the cyclic lookup table by setting aging time so that the cyclic lookup table can be recycled;
the discarding algorithm module is used for establishing a sliding window for the source MAC address of the received new whole frame data, searching and storing an overlapping area of an original window and the sliding window in the cyclic lookup table after the new whole frame data are subjected to normalization processing, discarding the data frame with the SN number corresponding mark of 1 in the sliding window, and receiving the data frame with the SN number corresponding mark of 0 in the original window; and transmitting the discarded result to a result feedback module;
And the result feedback module records the result of discarding or storing the data frame according to the result of the discarding algorithm module.
The invention is further improved in that:
preferably, the elements stored in the circular lookup table include: the method comprises the following steps of (1) effectively marking, MAC address, initial SN number of upper boundary of an original window, end SN number of lower boundary of the original window, receiving marks of all SN numbers in the range of the upper boundary and the lower boundary of the original window and link address;
the valid flag is used for indicating whether an original window in the circular lookup table is used or not;
all SN number receiving marks in the range of the upper boundary and the lower boundary of the original window are represented by 1 bit, 1 represents that a data frame is received, and the data frame is repeatedly discarded; 0 means not received;
the link address is used for connecting the data with the same hash function but different source MAC values in the whole frame of data end to end.
Preferably, the original window size in the circular lookup table ranges from 1 to 65535, and the original window is less than or equal to the maximum value of the SN number of the data frame recorded therein.
Preferably, the hash function is used to convert the source MAC address of the new whole frame of data into an ASCII code table through a key.
Preferably, the aging time is set by the network topology, when the contents of the circular look-up table are updated, the counter is set to the maximum aging time, otherwise, the counter is reduced by 1 until the value is 0.
Preferably, the SN number of the communication data frame in the network ranges from 0 to 65535.
Preferably, in the discarding algorithm module (4), the normalization process is: when the system receives the new whole frame data, the relative positions of the sliding window of the new whole frame data and the original window of the circular lookup table are judged by comparing the SN number of the new whole frame data with the SN number of the original data in the original window.
Preferably, in the discarding algorithm module (4), after the relative position between the sliding window of the new whole frame data and the window of the cyclic lookup table is determined, the SN number of the new whole frame data is added or subtracted with the size of the original window in the cyclic lookup table to obtain the start-stop sequence number of the sliding window, and the start-stop sequence number of the sliding window is compared with the start-stop sequence number of the original window to find the overlapping region.
A single-window dynamic sliding and redundancy management method facing to a PRP network based on the PRP network comprises the following steps:
extracting and storing a source MAC address and an SN number of a complete data frame from a network;
according to the source MAC address and the SN number of the complete data frame, when the source MAC address does not appear in the circular lookup table, establishing the MAC address information which does not appear; when the source MAC address does not appear in the cyclic lookup table, establishing a sliding window for the source MAC address of the received new whole frame data, after the new whole frame data is normalized, searching and storing an overlapping area of an original window and the sliding window in the cyclic lookup table, discarding a data frame with an SN number corresponding mark of 1 in the sliding window, and receiving a data frame with an SN number corresponding mark of 0 in the original window; updating and keeping a sliding window corresponding to the existing MAC address information by a circulating lookup table, and simultaneously recording an SN (serial number) of a communication data frame in the network;
When the updating mark of the cyclic lookup table is effective, aging timing is started, aging table entries are cleared when the aging time is over, meanwhile, the cyclic lookup table writes and reads the MAC address and SN number of the new whole frame data, and then the cyclic lookup table is repeatedly utilized to record the MAC address window information of the new whole frame data;
the system simultaneously stores and records the result of data frame dropping or storing.
Preferably, the normalization processing includes the following specific steps: when the system receives the new whole frame data, the relative positions of the sliding window of the new whole frame data and the original window of the cyclic lookup table are judged by comparing the SN number of the new whole frame data with the SN number of the original data in the original window, and the SN number of the communication data frame in the network is set to be between 0 and 65535.
Compared with the prior art, the invention has the following beneficial effects:
the invention discloses a PRP network-oriented single-window dynamic sliding and redundancy management system and a PRP network-oriented single-window dynamic sliding and redundancy management method. The system comprises a redundant data frame characteristic value extraction module, a cyclic lookup table aging module, a discarding algorithm module and a result feedback module, and by providing a single-window dynamic sliding discarding algorithm, the repeated frames in a redundant network are ensured to be correctly received, network congestion is avoided, the network communication robustness is improved, and the effects of fault zero self-healing seamless switching and transparent application are achieved; the system introduces aging time to the circular lookup table, and eliminates the table item content in the circular lookup table, thereby achieving the cyclic utilization of the lookup table; by adopting the Hash function to realize the mapping of each bit state in a single window and the frame receiving mark, the space resource is saved, the table look-up efficiency is improved, and the conflict is reduced; the virtual serial number is calculated, virtual windowing is carried out, the virtual windowing is compared with an original window, an overlapping area of the virtual windowing and the original window is obtained, dynamic sliding of the window is completed, and redundant fault-tolerant management is simplified.
[ description of the drawings ]
FIG. 1 is a block diagram of the system of the present invention;
FIG. 2 is a schematic diagram of the sliding left overlap of windows according to the present invention;
FIG. 3 is a left-sliding non-overlapping view of the window of the present invention;
FIG. 4 is a schematic diagram of the sliding right overlap of windows according to the present invention;
FIG. 5 is a right sliding non-overlapping view of the window of the present invention;
wherein: 1-redundant data frame characteristic value extraction module; 2-a circular look-up table module; 3-circulating a look-up table aging module; 4-discard algorithm module; 5-result feedback module.
[ detailed description ] embodiments
The invention is further described in detail with reference to the accompanying drawings, and discloses a system and a method for single-window dynamic sliding and redundancy management facing to a PRP network; referring to fig. 1, the system includes a redundant data frame feature value extraction module 1, a cyclic lookup table module 2, a cyclic lookup table aging module 3, a discarding algorithm module 4, and a result feedback module 5. The circular lookup table module 2 is used as a central module and is respectively connected with the other four modules.
Redundant data frame characteristic value extraction module 1: the source MAC address and the SN number used for extracting and storing the complete data frame; according to the format of the PRP data frame, the source MAC address and the SN number as the unique identifier of the data frame, the range of the SN number of the communication data frame in the network is 0-65535; when the data frame in the network is complete and has no error, extracting the source MAC address and the current SN number from the redundant port, recording according to the network identifier of the redundant port, storing in a cache, and restoring the receiving sequence of the data frame; if a port data frame is incomplete or has errors, the frame is discarded, and the characteristic value is not stored.
The cyclic lookup table module 2: and creating and maintaining a continuous cyclic lookup table according to the source MAC addresses of all the data frames received in the communication process of the redundant port. The table includes 6 elements: the method comprises the following steps of effective marks, MAC addresses, window upper boundary initial SN numbers, lower boundary end SN numbers, all SN number receiving marks and chain addresses in a window upper and lower boundary range, wherein the effective marks are used for indicating whether windows in a cyclic lookup table are used or not, the window size in the lookup table can be set, the range is 1-65535, the method is default to 128, all SN number receiving marks in the window upper and lower boundary range are indicated by 1 bit, 1 indicates that a data frame is received, and the data frame is repeatedly discarded; 0 means not received; and solving the conflict by adopting a chain address, and connecting the information with the same hash function value but different source MAC values end to end. A continuous circular look-up table is established by comparing the original module in the circular look-up table module 2 with the sliding window established in the discard algorithm module 4.
When new whole frame data is received and normalized, the MAC address of the new data is taken as a source MAC address through a keyword k in a hash function, an ASCII code table is compared, characters are converted into numbers and taken as values, the source MAC address is mapped to a lookup table in a storage mode, the converted ASCII code is stored in a sliding window, the source MAC address is taken as the only entry information of the table, and the mapping between the source MAC address x and the original window address m in the existing cyclic lookup table is realized through a hash function h (x) k mod m.
The working process of the module is as follows: when the characteristic value of the data frame is effective, performing hash index, and reading the content of an original window in a lookup table; if the storage mark in the content of the original window in the reading lookup table is invalid and indicates that the MAC address information is not created, adding window information to the position in the lookup table, and juxtaposing the storage mark to be valid; otherwise, reading the window state; meanwhile, the discarding algorithm module 4 starts the discarding algorithm and updates the latest state of the window after the algorithm is finished.
The cyclic lookup table aging module 3: and introducing aging time, setting the aging time by combining with the network topology, setting the counter to be the maximum aging time when the contents of the lookup table entry are updated, and if not, subtracting 1 from the counter until the value is 0, and clearing the contents of the window table created by the MAC address to achieve the cyclic utilization of the lookup table.
The discarding algorithm module 4: when the system receives new whole frame data, the SN number of the communication data frame in the network is 0-65535 for cyclic use, and the window turning condition needs to be considered. By comparing the starting SN number with the ending SN number in the window, when the starting SN number is larger than the ending SN number, the flip flag is set to be effective, which indicates that the window SN number is recycled from 65535 to 0. The phase relation between the current SN number of the received data frame and the window is divided into 3 types, and the phase relation is positioned in the window, on the left side of the window or on the right side of the window. Because the SN number receiving mark is stored in the window, if the window has an overlapping area when sliding, the existing receiving mark needs to be recorded, and the repeated receiving of the data frame with the same serial number in the aging time is avoided. The invention adopts a mode of calculating a virtual serial number to add or subtract the window size to the current SN number to obtain the start-stop serial number of a virtual window (a sliding window), compares the start-stop serial number with the original window to find out an overlapping area, and simultaneously adopts a state machine mode to realize the dynamic sliding of the window and update the start-stop SN number and the SN number receiving mark in the window.
And a cyclic lookup table result feedback module: storing the discarded result of the data frame in FIFO according to the redundant port network identification, wherein the invalid data frame indicates that the data frame is a repeated frame and needs to be discarded; otherwise, receiving and ensuring the transparency of the application.
The working process of the whole system is as follows:
when receiving a legal data frame in a network, the redundant data frame characteristic value extraction module 1 extracts a source MAC address, an SN (serial number) and a network identifier, wherein the network identifier represents a source port which indicates that the whole frame of data comes from the redundant data frame characteristic value, and transmits the information to the circular lookup table module 2; the circular lookup table module 2 proves that the comparison storage end mark of the whole frame data is effective according to a result feedback module 5 discarding algorithm, hash index is carried out by using a source MAC address, table parameters are read, when the storage mark is effective, a window start-stop serial number and a window state are read and transmitted to the discarding algorithm module 4, the circular lookup table module 2 judges whether a new table item is created for the source MAC according to the calculation result of the discarding algorithm module 4, the default window start-stop serial number and the window state are transmitted to the discarding algorithm module 4, and meanwhile, a table item updating mark corresponding to each MAC address is transmitted to the circular lookup table aging module 3; when the cyclic lookup table aging module 3 detects that the update mark is valid, the aging starts to time, and when the aging time is over, the cyclic lookup table aging module 2 is written back to clear the aging table entry; after receiving the valid storage identifier, the discard algorithm module 4 establishes a new sliding window for the new whole frame of data, and simultaneously starts the discard algorithm to normalize the relationship between the current SN number and the window phase, as shown in table 1 below. Combining with a sliding window turning mark, the method is divided into two categories, wherein one category of windows do not slide, namely the current SN is positioned in the window, and whether the current SN is a repeated frame is determined according to an SN number receiving mark; one-class window sliding, searching an overlapping area through the intermediate serial number and the virtual SN number, finishing the dynamic sliding of the left and right of the window, updating the starting and stopping SN number of the window and the state of the window, and transmitting an algorithm result to a result feedback module 5; and the result feedback module 5 respectively stores the algorithm results according to the network identification, wherein 1 is to receive the data frame, 0 is to discard the data frame, and the algorithm end mark is transmitted to the circular lookup table module 2.
TABLE 1 SN number and Window phase relationship
Example 1
Fig. 2 is a schematic diagram of window leftward sliding overlap of fig. 4, in which MinSn is used to represent an original window starting SN number, MaxSn is used to represent an original window ending SN number, CurSn is used to represent a currently received data frame SN number, NewMinSn is used to represent a window starting SN number after sliding, NewMaxSn is used to represent a window ending SN number after sliding, OW _ LEN is used to represent a window size, and the window size is always kept unchanged during the sliding process. The method comprises the steps that CurSn is located on the left side of an original window, the window slides to the left, when a virtual window termination SN number obtained by subtracting OW _ LEN from CurSn is within the range of the original window start-stop SN number, an overlapping area is located on the left side of the original window, an SN receiving mark in the overlapping area is stored in the sliding window, New MinSn is set to be CurSn, New MaxSn is set to be CurSn + OW _ LEN, and an SN receiving mark position 1 corresponding to the New MinSn indicates that a sequence number data frame is newly received.
Example 2
Fig. 3 is a schematic diagram of a window sliding to the left without overlapping in fig. 4, where CurSn is located on the left side of an original window, and when a value obtained by subtracting OW _ LEN from CurSn results in a virtual window termination SN no-overlap region with the original window, NewMinSn ═ CurSn, NewMaxSn ═ CurSn + OW _ LEN is set, and an SN receiving flag corresponding to NewMinSn is set to position 1, and the other receiving flags are set to all 0.
Example 3
Fig. 4 is a schematic diagram illustrating window rightward sliding and overlapping of window 4, where CurSn is located on the right side of the original window, the window slides rightward, when a value obtained by adding OW _ LEN to CurSn is within a range of start and stop SN of the original window, it indicates that the overlapping region is located on the right side of the original window, an SN receiving flag in the overlapping region is stored in the sliding window, new minsn is set to CurSn-OW _ LEN, and new maxsn is set to CurSn, and a SN receiving flag position 1 corresponding to new maxsn indicates that the sequence number data frame is newly received.
Example 4
Fig. 5 is a schematic diagram illustrating that the window of fig. 4 slides rightward without overlapping, CurSn is located on the right side of the original window, the window slides rightward, when CurSn plus OW _ LEN value results in a region where the virtual window termination SN number does not overlap with the original window, new minsn is CurSn-OW _ LEN, new maxsn is CurSn, and SN receiving flag position 1 corresponding to new maxsn is set, and the rest receiving flags are all set to 0.
According to the scheme, a single-window dynamic sliding and redundancy management method is described by using a Verilog HDL language, and logic synthesis and layout wiring are completed; and mapping the logic design into a programmable logic device for realization, and testing the repeated frame discarding function in the PRP network. The test result shows that the invention has good implementability and the performance meets the expectation.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and should not be taken as limiting the scope of the present invention, which is intended to cover any modifications, equivalents, improvements, etc. within the spirit and scope of the present invention.
Claims (8)
1. A single-window dynamic sliding and redundancy management system for a PRP network, comprising: the device comprises a redundant data frame characteristic value extraction module (1), a cyclic lookup table module (2), a cyclic lookup table aging module (3), a discarding algorithm module (4) and a result feedback module (5);
the redundant data frame characteristic value extraction module (1) is used for extracting and storing a source MAC address and an SN number of a complete data frame;
the cyclic lookup table module (2) is used for creating the MAC address information which is not appeared according to the source MAC address and the SN number of the complete data frame, or updating and keeping a sliding window corresponding to the existing MAC address information according to the discarding algorithm module (4), and simultaneously recording the SN number state of the communication data frame in the network;
the cyclic lookup table aging module (3) is used for clearing aging contents in the cyclic lookup table by setting aging time so that the cyclic lookup table can be recycled;
the discarding algorithm module (4) is used for establishing a sliding window for the source MAC address of the received new whole frame data, searching and storing the overlapping area of the original window and the sliding window in the cyclic lookup table (2) after the new whole frame data is subjected to normalization processing, discarding the data frame with the SN number corresponding mark of 1 in the sliding window, and receiving the data frame with the SN number corresponding mark of 0 in the original window; and transmits the discarding result to a result feedback module (5);
The result feedback module (5) records the result of discarding or storing the data frame according to the result of the discarding algorithm module (4);
SN number range of communication data frame in network is 0-65535;
in the discarding algorithm module (4), the normalization process is as follows: when the system receives the new whole frame data, the relative positions of the sliding window of the new whole frame data and the original window of the circular lookup table are judged by comparing the SN number of the new whole frame data with the SN number of the original data in the original window.
2. The system according to claim 1, wherein the cyclic lookup table stores elements including: the method comprises the following steps of (1) effectively marking, MAC address, initial SN number of upper boundary of an original window, end SN number of lower boundary of the original window, receiving marks of all SN numbers in the range of the upper boundary and the lower boundary of the original window and link address;
the valid flag is used for indicating whether an original window in the loop lookup table is used or not;
all SN number receiving marks in the range of the upper boundary and the lower boundary of the original window are represented by 1 bit, 1 represents that a data frame is received, and the data frame is repeatedly discarded; 0 means not received;
the link address is used for connecting the data with the same hash function but different source MAC values in the whole frame of data end to end.
3. The system of claim 2, wherein the original window size in the cyclic lookup table ranges from 1 to 65535, and the original window is less than or equal to the maximum SN number of the data frame recorded therein.
4. The system for single-window dynamic sliding and redundancy management over a PRP network as claimed in claim 2, wherein the hash function is configured to convert the source MAC address of the new whole frame of data into an ASCII code table by means of a key.
5. The system according to claim 1, wherein the aging time is set by the network topology, and when the contents of the circular look-up table are updated, the counter is set to the maximum aging time, otherwise, the counter is decremented by 1 until the value is 0.
6. The system for single-window dynamic sliding and redundancy management towards a PRP network according to claim 1, wherein in the discard algorithm module (4), after determining the relative position between the sliding window of the new whole frame of data and the window of the cyclic lookup table, the SN number of the new whole frame of data is added or subtracted by the size of the original window in the cyclic lookup table to obtain the start/stop sequence number of the sliding window, and the start/stop sequence number of the sliding window is compared with the start/stop sequence number of the original window to find out the overlapping region.
7. A single window dynamic sliding and redundancy management method for a PRP network based on the system of claim 1, comprising:
extracting and storing a source MAC address and an SN number of a complete data frame from a network;
according to the source MAC address and the SN number of the complete data frame, when the source MAC address does not appear in the circular lookup table, establishing the MAC address information which does not appear; when the source MAC address does not appear in the cyclic lookup table, establishing a sliding window for the source MAC address of the received new whole frame data, after the new whole frame data is normalized, searching and storing an overlapping area of an original window and the sliding window in the cyclic lookup table, discarding a data frame with an SN number corresponding mark of 1 in the sliding window, and receiving a data frame with an SN number corresponding mark of 0 in the original window; updating and keeping a sliding window corresponding to the existing MAC address information by a circulating lookup table, and simultaneously recording an SN (serial number) of a communication data frame in the network;
when the updating mark of the cyclic lookup table is effective, aging timing is started, aging table entries are cleared when the aging time is over, meanwhile, the cyclic lookup table writes and reads the MAC address and SN number of the new whole frame data, and then the cyclic lookup table is repeatedly utilized to record the MAC address window information of the new whole frame data;
The system simultaneously stores and records the result of data frame dropping or storing.
8. The method for single-window dynamic sliding and redundancy management for a PRP network according to claim 7, wherein the normalization process comprises the following specific steps: when the system receives the new whole frame data, the relative positions of the sliding window of the new whole frame data and the original window of the cyclic lookup table are judged by comparing the SN number of the new whole frame data with the SN number of the original data in the original window, and the SN number of the communication data frame in the network is set to be between 0 and 65535.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910146105.0A CN109981479B (en) | 2019-02-27 | 2019-02-27 | PRP network-oriented single-window dynamic sliding and redundancy management system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910146105.0A CN109981479B (en) | 2019-02-27 | 2019-02-27 | PRP network-oriented single-window dynamic sliding and redundancy management system and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109981479A CN109981479A (en) | 2019-07-05 |
| CN109981479B true CN109981479B (en) | 2022-06-28 |
Family
ID=67077493
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910146105.0A Active CN109981479B (en) | 2019-02-27 | 2019-02-27 | PRP network-oriented single-window dynamic sliding and redundancy management system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109981479B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111277480B (en) * | 2020-01-19 | 2021-08-17 | 山东网聪信息科技有限公司 | Method and system for discarding high-availability seamless redundant looped network repeat frame |
| CN111263240B (en) * | 2020-02-12 | 2022-07-19 | 青岛海信宽带多媒体技术有限公司 | IPTV4K audio and video playing management method and device and display equipment |
| CN111917663B (en) * | 2020-06-16 | 2022-11-04 | 深圳市风云实业有限公司 | Hash barrel full-covering method for HSR (high speed repeat request) repeated message filtering table |
| CN113312520B (en) * | 2021-06-11 | 2023-05-02 | 西安微电子技术研究所 | Linux modularized parallel redundancy protocol system and data processing method based on HASH and LRU algorithm |
| CN115174483B (en) * | 2022-04-25 | 2023-10-13 | 平安付科技服务有限公司 | Time window based current limiting method, device, server and storage medium |
| CN115102673B (en) * | 2022-04-29 | 2023-11-03 | 中国船舶集团有限公司第七一六研究所 | PRP protocol repeated frame discrimination processing method and system based on frame memory pool |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101753348A (en) * | 2008-12-17 | 2010-06-23 | 中国科学院沈阳自动化研究所 | High-availability industrial Ethernet redundancy method |
| EP2568673A1 (en) * | 2011-08-30 | 2013-03-13 | ABB Technology AG | Parallel Redundancy Protocol, PRP, packet duplication over VLANs based on Spanning Tree instances. |
| CN104184678A (en) * | 2013-05-28 | 2014-12-03 | 上海博达数据通信有限公司 | Method for dropping frame duplicates to achieve highly-reliable seamless redundancy ring network |
| CN104283658A (en) * | 2013-11-30 | 2015-01-14 | 许继电气股份有限公司 | Method for realizing dual-network redundancy of protection device on the basis of PRP parallel redundancy |
| CN104378186A (en) * | 2014-10-31 | 2015-02-25 | 南京南瑞继保电气有限公司 | Network redundant data processing methods, devices and system |
| CN105282002A (en) * | 2014-07-08 | 2016-01-27 | 上海博达数据通信有限公司 | FPGA realization method of duplication processing in high-reliability seamless redundancy ring network |
| CN105357126A (en) * | 2015-11-12 | 2016-02-24 | 国电南瑞科技股份有限公司 | Lookup table optimization method for parallel redundancy protocol (PRP)/high reliable seamless redundancy (HSR) message dropping algorithm |
| CN109005088A (en) * | 2018-09-28 | 2018-12-14 | 北京东土科技股份有限公司 | The detection method and device of duplicate message in parallel redundancy network |
-
2019
- 2019-02-27 CN CN201910146105.0A patent/CN109981479B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101753348A (en) * | 2008-12-17 | 2010-06-23 | 中国科学院沈阳自动化研究所 | High-availability industrial Ethernet redundancy method |
| EP2568673A1 (en) * | 2011-08-30 | 2013-03-13 | ABB Technology AG | Parallel Redundancy Protocol, PRP, packet duplication over VLANs based on Spanning Tree instances. |
| CN104184678A (en) * | 2013-05-28 | 2014-12-03 | 上海博达数据通信有限公司 | Method for dropping frame duplicates to achieve highly-reliable seamless redundancy ring network |
| CN104283658A (en) * | 2013-11-30 | 2015-01-14 | 许继电气股份有限公司 | Method for realizing dual-network redundancy of protection device on the basis of PRP parallel redundancy |
| CN105282002A (en) * | 2014-07-08 | 2016-01-27 | 上海博达数据通信有限公司 | FPGA realization method of duplication processing in high-reliability seamless redundancy ring network |
| CN104378186A (en) * | 2014-10-31 | 2015-02-25 | 南京南瑞继保电气有限公司 | Network redundant data processing methods, devices and system |
| CN105357126A (en) * | 2015-11-12 | 2016-02-24 | 国电南瑞科技股份有限公司 | Lookup table optimization method for parallel redundancy protocol (PRP)/high reliable seamless redundancy (HSR) message dropping algorithm |
| CN109005088A (en) * | 2018-09-28 | 2018-12-14 | 北京东土科技股份有限公司 | The detection method and device of duplicate message in parallel redundancy network |
Non-Patent Citations (2)
| Title |
|---|
| IEC62439 PRP冗余丢弃算法设计;张宪军，刘颖，余华武，陈新之;《电力系统保护与控制》;20141101;110-115 * |
| The Parallel Redundancy Protocol for Industrial IP Networks;Markus Rentschler，Holger Heine;《IEEE》;20130228;1-6 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109981479A (en) | 2019-07-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109981479B (en) | PRP network-oriented single-window dynamic sliding and redundancy management system and method | |
| US8542686B2 (en) | Ethernet forwarding database method | |
| CN108521378A (en) | Retransmission method, device and the network switching equipment of heterogeneous protocol message | |
| CN114448891B (en) | Method, device, equipment and medium for synchronizing flow table | |
| CN109005170A (en) | A kind of conversion method of RapidIO agreement to FC agreement | |
| US20180287942A1 (en) | Forwarding Data Packets | |
| CN106790762A (en) | Domain name analytic method and device | |
| WO2014000669A1 (en) | Ternary content-addressable memory assisted packet classification | |
| CN108306835A (en) | A kind of the input-buffer structure and data forwarding method of Ethernet switch | |
| US20090282167A1 (en) | Method and apparatus for bridging | |
| US20120155485A1 (en) | Efficient space utilization of distributed mac address tables in ethernet switches | |
| GB2458546A (en) | Network switch wherein egress port specified by ingress interface is overwritten with standby port before switch fabric for failed ports | |
| US8477777B2 (en) | Bridge apparatus and communication method | |
| WO2022268138A1 (en) | Message matching method and apparatus, storage medium and electronic apparatus | |
| EP2429132B1 (en) | Table creating and searching method used by network processor | |
| CN108540387A (en) | Method for network access control and device | |
| CN111277480B (en) | Method and system for discarding high-availability seamless redundant looped network repeat frame | |
| CN103581020B (en) | The method of a kind of message forwarding, Apparatus and system | |
| CN108900621A (en) | A kind of otherness cloud synchronous method calculating mode based on mist | |
| EP2640015A1 (en) | Method and device for configuring vpls mac entry space | |
| CN117176651A (en) | Network switching implementation method based on FPGA | |
| US10069721B2 (en) | Communication device and method applicable to stacking communication system | |
| WO2020078012A1 (en) | Compression method and device and computer-readable storage medium | |
| US20050044261A1 (en) | Method of operating a network switch | |
| CN115865849A (en) | Two-layer network cloud exchange device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |