CN109981479A - A kind of sliding of single window dynamic and Redundancy Management system and method towards PRP network - Google Patents
A kind of sliding of single window dynamic and Redundancy Management system and method towards PRP network Download PDFInfo
- Publication number
- CN109981479A CN109981479A CN201910146105.0A CN201910146105A CN109981479A CN 109981479 A CN109981479 A CN 109981479A CN 201910146105 A CN201910146105 A CN 201910146105A CN 109981479 A CN109981479 A CN 109981479A
- Authority
- CN
- China
- Prior art keywords
- window
- sliding
- data
- circulation searching
- searching table
- 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.)
- Granted
Links
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 kind of sliding of single window dynamic and Redundancy Management system and method towards PRP network.The system includes redundant data frame characteristics extraction module, circulation searching table module, circulation searching table ageing module, discard algorithm module and result feedback module, by establishing a kind of single window dynamic sliding discard algorithm, guarantee that repeating frame is properly received in redundant network, avoid network congestion, network communication robustness is improved, achievees the effect that zero self-healing seamless switching of failure and clear applications；Ageing time is introduced for circulation searching table in the system, the contents in table in circulation searching table is removed, reaches recycling for look-up table；It is mapped by using each state in single window and frame reception flag, saves space resources, improve efficiency of tabling look-up, reduce conflict；It by using virtual sequence number is calculated, is virtually opened a window, will virtually open a window and be compared with original window, obtained sliding with original window overlapping region, completion window dynamic, simplify redundancy fault-tolerant management.
Description
[technical field]
The invention belongs to PRP field of network management, and in particular to it is a kind of towards PRP network single window dynamic sliding with it is superfluous
Remaining management system and method.
[background technique]
In parallel redundancy PRP network, using first-come first-served basis, duplicate data frame is abandoned, network congestion is reduced, reaches
To the effect of zero self-healing seamless switching and clear applications of failure.Repeating frame discard algorithm mainly includes Dual-window discard algorithm, looks into
Read table algorithm etc..In Dual-window discard algorithm redundancy port according to sequence number SN and network identifier safeguard respectively one it is independent
Window Table requires two tables of inquiry for each data frame received, realizes relative complex；It consults table algorithm and is based on source MAC
Address and No. SN realization, each No. SN needs to be stored in different list items, occupy resource it is big, and due to No. SN be incremented by do not connect
It is continuous, reduce efficiency of tabling look-up.Therefore there is the larger problem of room and time expense in both algorithms.
[summary of the invention]
It is an object of the invention to overcome the above-mentioned prior art, it is dynamic to provide a kind of single window towards PRP network
State sliding and Redundancy Management system and method；The system combination circulation searching table completes the discarding to the repeating frame in PRP network
Management simplifies hard-wired time complexity and space complexity, improves the reliability and robustness of network communication.
In order to achieve the above objectives, the present invention is achieved by the following scheme:
A kind of sliding of single window dynamic and Redundancy Management system towards PRP network, comprising: redundant data frame characteristic value mentions
Modulus block, circulation searching table module, circulation searching table ageing module, discard algorithm module and result feedback module；
Redundant data frame characteristics extraction module, for extract and store complete data frame source MAC and No. SN；
Circulation searching table module, for creating the MAC not occurred according to the source MAC of complete data frame and No. SN
Address information, or the existing corresponding sliding window of mac address information is updated and kept according to discard algorithm module, it records simultaneously
The SN state of communications data frame in network；
Circulation searching table ageing module removes the aging content in circulation searching table, so that following by setting ageing time
Ring look-up table can be recycled；
Discard algorithm module will new whole frame for the source MAC of the new whole frame data received to be established sliding window
After data normalization processing, the overlapping region of the original window and sliding window in circulation searching table, sliding window are searched and saved
Mouth abandons the data frame that its interior SN respective flag is 1, receives the data frame that SN respective flag is 0 in original window；And it will
It abandons result and is transmitted to result feedback module；
As a result feedback module, according to discard algorithm module as a result, record data frame abandons or the result of storage.
A further improvement of the present invention is that:
Preferably, the element of the circulation searching table storage includes: effective marker, MAC Address, original window coboundary
Beginning No. SN, original window lower boundary terminate No. SN, all SN reception flags and chain within the scope of original window up-and-down boundary
Location；
The effective marker is for indicating whether the original window in circulation searching table is used；
All SN reception flags have been received by 1 expression, 1 expression data frame within the scope of original window up-and-down boundary,
It repeats to abandon；0 indicates not receive；
Chain address is for joining end to end the data that hash function is identical in whole frame data but source MAC value is different.
Preferably, the original window magnitude range in circulation searching table is 1-65535, and original window is less than or equal in it
Record the SN maximum value of data frame.
Preferably, the hash function is used to the source MAC of new whole frame data being converted to ASCII character by keyword
Table.
Preferably, ageing time is set by network topology, and when the content of circulation searching table is updated, counter is set to
Otherwise maximum aging time itself subtracts 1, until value is 0.
Preferably, the SN range of communications data frame is 0-65535 in network.
Preferably, in discard algorithm module (4), the normalized are as follows: when system receives new whole frame data, lead to
Cross No. SN SN size with initial data in original window for comparing new whole frame data, the sliding window of the new whole frame data of judgement
With the original window relative position of circulation searching table.
Preferably, in discard algorithm module (4), judge the new sliding window of whole frame data and the window of circulation searching table
Behind relative position, to original window size in No. SN circulation searching table that adds deduct of new whole frame data, rising for sliding window is obtained
Only sequence number, and be compared with original window start-stop sequence number, find out overlapping region.
A kind of sliding of single window dynamic and redundancy management method based on above-mentioned towards PRP network, comprising:
Extracted from network and store complete data frame source MAC and No. SN；
According to the source MAC of complete data frame and No. SN, when source MAC did not occurred in circulation searching table
When, create the mac address information not occurred；When source MAC do not occur in circulation searching table it is out-of-date, it is new by what is received
The source MAC of whole frame data establishes sliding window, after new whole frame data normalized, searches and saves circulation searching table
In original window and sliding window overlapping region, sliding window abandon its interior SN respective flag be 1 data frame, receive
The data frame that SN respective flag is 0 in original window；Circulation searching table updates and keeps the existing corresponding cunning of mac address information
Window is moved, while recording No. SN of communications data frame in network；
When the update mark of circulation searching table is effective, starts aging timing, removes aging list item at the end of ageing time,
Circulation searching table is written and reads the newly MAC Address of whole frame data and No. SN simultaneously, and then reuses circulation searching table, record
The MAC Address window information of new whole frame data；
System stores simultaneously and records the result that data frame is abandoned or stored.
Preferably, the specific steps of the normalized are as follows: new by comparing when system receives new whole frame data
No. SN size of No. SN of whole frame data and initial data in original window judges the sliding window and circulation of new whole frame data
The original window relative position of look-up table, in the setting network communications data frame SN between 0-65535.
Compared with prior art, the invention has the following advantages:
The invention discloses a kind of sliding of single window dynamic and Redundancy Management system and method towards PRP network.This is
System includes redundant data frame characteristics extraction module, circulation searching table module, circulation searching table ageing module, discard algorithm module
Guarantee that repeating frame correctly connects in redundant network by proposing a kind of single window dynamic sliding discard algorithm with result feedback module
It receives, avoids network congestion, improve network communication robustness, achieve the effect that zero self-healing seamless switching of failure and clear applications；It should
Ageing time is introduced for circulation searching table in system, the contents in table in circulation searching table is removed, reaches the circulation of look-up table
It utilizes；Realize that each state and frame reception flag map in single window, save space resources, improve by using hash function
It tables look-up efficiency, reduces conflict；By using virtual sequence number is calculated, is virtually opened a window, will virtually be opened a window and original window pair
Than obtaining sliding with original window overlapping region, completion window dynamic, simplifying redundancy fault-tolerant management.
[Detailed description of the invention]
Fig. 1 is the structural block diagram of present system；
Fig. 2 is window of the invention sliding overlapping schematic diagram to the left；
Fig. 3 is that window of the invention slides underlapped schematic diagram to the left；
Fig. 4 is window of the invention sliding overlapping schematic diagram to the right；
Fig. 5 is that window of the invention slides to the right underlapped schematic diagram；
Wherein: 1- redundant data frame characteristics extraction module；2- circulation searching table module；3- circulation searching table aging mould
Block；4- discard algorithm module；5- result feedback module.
[specific embodiment]
The invention will be described in further detail with reference to the accompanying drawing, and the invention discloses a kind of lists towards PRP network
The sliding of window dynamic and Redundancy Management system and method；Referring to Fig. 1, the system include redundant data frame characteristics extraction module 1,
Circulation searching table module 2, circulation searching table ageing module 3, discard algorithm module 4 and result feedback module 5.Circulation searching table mould
Module centered on block 2 is connect with other four modules respectively.
Redundant data frame characteristics extraction module 1: for extract and store complete data frame source MAC and No. SN；
Data frame unique identification is used as according to PRP data frame format, source MAC and No. SN, communications data frame SN model in network
It encloses for 0-65535；When the complete inerrancy of data frame in network, source MAC and No. SN current, and root are extracted from redundancy port
It is recorded, is stored in a caching according to redundancy port network identity, restoring data frame reception sequence；If a port number
According to frame it is imperfect or occur mistake when, then abandon the frame, without characteristic value store.
Circulation searching table module 2: according to the source MAC for receiving all data frames in redundancy port communication process, wound
It builds and keeps a lasting circulation searching table.The table includes 6 elements: effective marker, MAC Address, window upper edge starting
No. SN, lower boundary terminate No. SN, all SN reception flags and chain address within the scope of window up-and-down boundary, wherein effective marker
Whether the window for indicating in the circulation searching table is used, and window size is settable in look-up table, range 1-65535,
128 are defaulted as in the present invention, all SN reception flags have indicated data frame using 1 expression, 1 within the scope of window up-and-down boundary
It receives, repeats to abandon；0 indicates not receive；It solves to conflict using chain address, by hash function value is identical but source MAC value difference is believed
Breath joins end to end.Pass through the sliding window established in original module in circulation searching table module 2 and discard algorithm module 4
Comparison, establishes lasting circulation searching table.
After receiving new whole frame data and normalized, the MAC Address of new data in hash function by closing
Key word k value is that source MAC is compareed ASCII character table, converts characters to number and takes and be worth, and realizes that source MAC arrives
Look-up table storage mapping, and the ASCII character after conversion is stored in sliding window, source MAC uniquely enters as the table
Message breath realizes source MAC x with original window in existing circulation searching table by hash function h (x)=k mod m
The mapping of location m.
The course of work of the module are as follows: when data frame characteristic value is effective, carry out hash index, read original in look-up table
The content of window；If reading in look-up table, storage mark is invalid in the content of original window, indicates that the mac address information is not created
It builds, then window information is added in the position in a lookup table, and juxtaposition storage mark is effective；Otherwise readout window state；It abandons simultaneously
Algoritic module 4 opens discard algorithm, and updates window last state after waiting algorithm.
Circulation searching table ageing module 3: introducing ageing time, and ageing time is arranged in conjunction with network topology, when lookup list item
When content is updated, counter is set to maximum aging time, otherwise itself subtracts 1, when value is 0, the window of MAC Address creation
Oral thermometer content is removed, and recycling for look-up table is reached.
Discard algorithm module 4: when system receives new whole frame data, since communications data frame SN is 0- in network
65535 are recycled, and need to consider that window overturns situation.By in window originate No. SN with termination No. SN be compared, when
Starting SN is greater than when terminating SN, and it is effective to set overturning mark, indicates window SN and is recycled again from 65535 to 0.It is right
In receiving current No. SN of data frame and the phase relation of window is divided into 3 kinds, it is located in window, on the left of window or on the right side of window, originally
Invention overturns phase relation normalized by judging current sequence number and any intermediate sequence relativeness, by window,
Intermediate sequence number (MID_SN) selects 32768 in the present embodiment.Due to saving SN reception flag in window, if window sliding
When have overlapping region, then need to record existing reception flag, avoid in ageing time to same sequence number data frame weight
Multiple connection is received.The present invention, to current No. SN window size that adds deduct, it is (sliding to obtain virtual window using virtual sequence mode is calculated
Dynamic window) start-stop sequence number, and be compared with original window start-stop sequence number, find out overlapping region, while adoption status
Machine mode realizes SN reception flag in the sliding of window dynamic and update start-stop SN, window.
Circulation searching table result feedback module: it is stored according to redundancy port network identity by whether data frame abandons result
It is invalid to indicate that data frame is repeating frame in FIFO, it needs to abandon；Otherwise it receives, guarantees the transparency of application.
The course of work of whole system are as follows:
When redundant data frame characteristics extraction module 1 receives legal data frame in a network, extraction source MAC,
No. SN and network identifier, network identifier indicate that the whole frame data of explanation derive from the source port of redundant data frame characteristic value,
These information are transferred to circulation searching table module 2；Circulation searching table module 2 is proved according to 5 discard algorithm of result feedback module
The comparison storage end mark of the whole frame data is effective, carries out hash index using source MAC, reads table parameter, work as storage
When identifying effective, reads window start-stop sequence number and Window state passes to discard algorithm module 4, circulation searching table module 2
Judge whether that source MAC creates new list item thus according to the calculated result of discard algorithm module 4, and default window is risen to sequence number
Discard algorithm module 4 is passed to Window state, while each MAC Address corresponding table item update mark is passed into circulation searching
Table ageing module 3；Circulation searching table ageing module 3 detects update mark effectively, then aging starts timing, and ageing time terminates
When write-back circulation searching table module 2, remove aging list item；Discard algorithm module 4 is new after receiving effective storage mark
Whole frame data establish new sliding window, while opening discard algorithm, carry out normalizing with window phase relation to current No. SN
Change processing, as shown in table 1 below.In conjunction with sliding window overturning mark, it is divided into two major classes, a kind of window does not slide, i.e., SN current
In in window, decided whether according to SN reception flag as repeating frame；A kind of window sliding passes through intermediate sequence number and virtual SN
Number overlapping region is searched, complete the sliding of window or so dynamic and window start-stop SN and Window state updates, and by arithmetic result
Incoming result feedback module 5；As a result feedback module 5 stores arithmetic result according to network identity respectively, and 1 is the reception data
Frame, 0 is abandons the data frame, and algorithm end mark is passed to circulation searching table module 2.
Table 1 SN and window phase relation
Embodiment 1
The window sliding overlapping schematic diagram to the left that Fig. 2 is 4 indicates that original window originates No. SN using MinSn in figure,
MaxSn indicates that original window terminates No. SN, and CurSn indicates current and receives data frame SN, and NewMinSn indicates sliding rear hatch
Starting SN, NewMaxSn indicate that sliding rear hatch terminates No. SN, and OW_LEN indicates window size, and window is big in sliding process
It is small to remain constant.CurSn is located on the left of original window, and window is slided to the left, obtained virtually when CurSn subtracts OW_LEN value
Window end SN within the scope of original window start-stop SN when, indicate overlapping region be located at original window left side, by overlay region
SN reception flag is saved in sliding window in domain, sets NewMinSn=CurSn, NewMaxSn=CurSn+OW_LEN, and will
NewMinSn corresponding SN reception flag position 1, expression newly receive the serial number data frame.
Embodiment 2
The window that Fig. 3 is 4 slides underlapped schematic diagram to the left, and CurSn is located on the left of original window, when CurSn subtracts OW_
LEN value obtains virtual window and terminates No. SN and the non-overlapping region of original window, sets NewMinSn=CurSn, NewMaxSn=
CurSn+OW_LEN, and by NewMinSn corresponding SN reception flag position 1, remaining reception flag sets 0.
Embodiment 3
Sliding overlapping schematic diagram, CurSn are located on the right side of original window the window that Fig. 4 is 4 to the right, and window slides to the right, when
When CurSn obtains virtual window termination SN within the scope of original window start-stop SN plus OW_LEN value, overlapping region is indicated
On the right side of original window, SN reception flag in overlapping region is saved in sliding window, NewMinSn=CurSn-OW_ is set
LEN, NewMaxSn=CurSn, and by NewMaxSn corresponding SN reception flag position 1, expression newly receives the serial number data frame.
Embodiment 4
The window that Fig. 5 is 4 slides to the right underlapped schematic diagram, and CurSn is located on the right side of original window, and window slides to the right,
No. SN and the non-overlapping region of original window are terminated when CurSn obtains virtual window plus OW_LEN value, sets NewMinSn=
CurSn-OW_LEN, NewMaxSn=CurSn, and by NewMaxSn corresponding SN reception flag position 1, remaining reception flag is equal
Set 0.
According to above scheme, single window dynamic sliding is described with redundancy management method with Verilog HDL language,
And complete logic synthesis and placement-and-routing；Logical design is mapped in programmable logic device and is realized, and to weight in PRP network
Multi-frame discard is tested.Test result shows that the present invention has good exploitativeness, and performance meets expection.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention
Within mind and principle, any modification, equivalent replacement, improvement and so on be should all be included in the protection scope of the present invention.
Claims (10)
1. a kind of sliding of single window dynamic and Redundancy Management system towards PRP network characterized by comprising redundant data
Frame characteristics extraction module (1), circulation searching table module (2), circulation searching table ageing module (3), discard algorithm module (4) and
As a result feedback module (5)；
Redundant data frame characteristics extraction module (1), for extract and store complete data frame source MAC and No. SN；
Circulation searching table module (2), for according to the source MAC of complete data frame and No. SN, creating the MAC not occurred
Location information, or the existing corresponding sliding window of mac address information is updated and kept according to discard algorithm module (4), remember simultaneously
Record the SN state of communications data frame in network；
Circulation searching table ageing module (3) removes the aging content in circulation searching table, so that following by setting ageing time
Ring look-up table can be recycled；
Discard algorithm module (4) will new whole frame for the source MAC of the new whole frame data received to be established sliding window
After data normalization processing, the overlapping region of the original window and sliding window in circulation searching table (2) is searched and saved, is slided
Window abandons the data frame that its interior SN respective flag is 1, receives the data frame that SN respective flag is 0 in original window；And
Result will be abandoned and be transmitted to result feedback module (5)；
As a result feedback module (5), according to discard algorithm module (4) as a result, record data frame abandons or the result of storage.
2. a kind of sliding of single window dynamic and Redundancy Management system, feature towards PRP network according to claim 1
It is, the element of the circulation searching table storage includes: effective marker, MAC Address, original window coboundary starting SN, original
Beginning window lower edge terminates No. SN, all SN reception flags and chain address within the scope of original window up-and-down boundary；
The effective marker is for indicating whether the original window in circulation searching table is used；
All SN reception flags have been received, have been repeated by 1 expression, 1 expression data frame within the scope of original window up-and-down boundary
It abandons；0 indicates not receive；
Chain address is for joining end to end the data that hash function is identical in whole frame data but source MAC value is different.
3. a kind of sliding of single window dynamic and Redundancy Management system, feature towards PRP network according to claim 2
It is, the original window magnitude range in circulation searching table is 1-65535, and original window is less than or equal to record data frame in it
SN maximum value.
4. a kind of sliding of single window dynamic and Redundancy Management system, feature towards PRP network according to claim 2
It is, the hash function is used to the source MAC of new whole frame data being converted to ASCII character table by keyword.
5. a kind of sliding of single window dynamic and Redundancy Management system, feature towards PRP network according to claim 1
It is, ageing time is set by network topology, when the content of circulation searching table is updated, when counter is set to maximum aging
Between, otherwise itself subtract 1, until value is 0.
6. a kind of sliding of single window dynamic and Redundancy Management system, feature towards PRP network according to claim 1
It is, the SN range of communications data frame is 0-65535 in network.
7. a kind of sliding of single window dynamic and Redundancy Management system, feature towards PRP network according to claim 6
It is, in discard algorithm module (4), the normalized are as follows: new whole by comparing when system receives new whole frame data
The SN size of No. SN of frame data and initial data in original window judges the sliding window and circulation searching of new whole frame data
The original window relative position of table.
8. a kind of sliding of single window dynamic and Redundancy Management system, feature towards PRP network according to claim 7
It is, in discard algorithm module (4), judges the new sliding window of whole frame data and the window relative position of circulation searching table
Afterwards, to original window size in No. SN circulation searching table that adds deduct of new whole frame data, the start-stop sequence number of sliding window is obtained,
And be compared with original window start-stop sequence number, find out overlapping region.
9. a kind of sliding of single window dynamic and redundancy management method towards PRP network characterized by comprising
Extracted from network and store complete data frame source MAC and No. SN；
According to the source MAC of complete data frame and No. SN, when source MAC does not occur out-of-date, wound in circulation searching table
Build the mac address information not occurred；When source MAC does not occur out-of-date, will to receive new whole frame in circulation searching table
The source MAC of data establishes sliding window, after new whole frame data normalized, searches and saves in circulation searching table
The overlapping region of original window and sliding window, sliding window abandon the data frame that its interior SN respective flag is 1, receive original
The data frame that SN respective flag is 0 in window；Circulation searching table updates and keeps the existing corresponding sliding window of mac address information
Mouthful, while recording No. SN of communications data frame in network；
When the update mark of circulation searching table is effective, starts aging timing, remove aging list item at the end of ageing time, simultaneously
Circulation searching table is written and reads the newly MAC Address of whole frame data and No. SN, and then reuses circulation searching table, and record is new whole
The MAC Address window information of frame data；
System stores simultaneously and records the result that data frame is abandoned or stored.
10. a kind of sliding of single window dynamic and redundancy management method towards PRP network according to claim 9, special
Sign is, the specific steps of the normalized are as follows: when system receives new whole frame data, passes through and compares new whole frame data
No. SN with No. SN size of initial data in original window, judge the sliding window and circulation searching table of new whole frame data
Original window relative position, in the setting network communications data frame SN between 0-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 true CN109981479A (en) | 2019-07-05 |
| CN109981479B 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) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111263240A (en) * | 2020-02-12 | 2020-06-09 | 青岛海信宽带多媒体技术有限公司 | IPTV4K audio and video playing management method and device and display equipment |
| CN111277480A (en) * | 2020-01-19 | 2020-06-12 | 山东网聪信息科技有限公司 | Method and system for discarding high-availability seamless redundant looped network repeat frame |
| CN111917663A (en) * | 2020-06-16 | 2020-11-10 | 深圳市风云实业有限公司 | Hash barrel full-covering method for HSR (high speed Downlink shared Rate) repeated message filtering table |
| CN113312520A (en) * | 2021-06-11 | 2021-08-27 | 西安微电子技术研究所 | Linux modular parallel redundancy protocol system based on HASH and LRU algorithm and data processing method |
| CN115102673A (en) * | 2022-04-29 | 2022-09-23 | 中国船舶重工集团公司第七一六研究所 | PRP protocol repeated frame distinguishing and processing method and system based on frame memory pool |
| CN115174483A (en) * | 2022-04-25 | 2022-10-11 | 平安付科技服务有限公司 | Time window-based current limiting method and device, server and storage medium |
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 |
|---|
| MARKUS RENTSCHLER，HOLGER HEINE: "The Parallel Redundancy Protocol for Industrial IP Networks", 《IEEE》 * |
| 张宪军，刘颖，余华武，陈新之: "IEC62439 PRP冗余丢弃算法设计", 《电力系统保护与控制》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111277480A (en) * | 2020-01-19 | 2020-06-12 | 山东网聪信息科技有限公司 | Method and system for discarding high-availability seamless redundant looped network repeat frame |
| CN111277480B (en) * | 2020-01-19 | 2021-08-17 | 山东网聪信息科技有限公司 | Method and system for discarding high-availability seamless redundant looped network repeat frame |
| CN111263240A (en) * | 2020-02-12 | 2020-06-09 | 青岛海信宽带多媒体技术有限公司 | IPTV4K audio and video playing management method and device and display equipment |
| CN111917663A (en) * | 2020-06-16 | 2020-11-10 | 深圳市风云实业有限公司 | Hash barrel full-covering method for HSR (high speed Downlink shared Rate) repeated message filtering table |
| CN111917663B (en) * | 2020-06-16 | 2022-11-04 | 深圳市风云实业有限公司 | Hash barrel full-covering method for HSR (high speed repeat request) repeated message filtering table |
| CN113312520A (en) * | 2021-06-11 | 2021-08-27 | 西安微电子技术研究所 | Linux modular parallel redundancy protocol system based on HASH and LRU algorithm and data processing method |
| CN113312520B (en) * | 2021-06-11 | 2023-05-02 | 西安微电子技术研究所 | Linux modularized parallel redundancy protocol system and data processing method based on HASH and LRU algorithm |
| CN115174483A (en) * | 2022-04-25 | 2022-10-11 | 平安付科技服务有限公司 | Time window-based current limiting method and device, server and storage medium |
| CN115174483B (en) * | 2022-04-25 | 2023-10-13 | 平安付科技服务有限公司 | Time window based current limiting method, device, server and storage medium |
| CN115102673A (en) * | 2022-04-29 | 2022-09-23 | 中国船舶重工集团公司第七一六研究所 | PRP protocol repeated frame distinguishing and processing method and system based on frame memory pool |
| CN115102673B (en) * | 2022-04-29 | 2023-11-03 | 中国船舶集团有限公司第七一六研究所 | PRP protocol repeated frame discrimination processing method and system based on frame memory pool |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109981479B (en) | 2022-06-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109981479A (en) | A kind of sliding of single window dynamic and Redundancy Management system and method towards PRP network | |
| CN108521378A (en) | Retransmission method, device and the network switching equipment of heterogeneous protocol message | |
| US9627063B2 (en) | Ternary content addressable memory utilizing common masks and hash lookups | |
| US6453358B1 (en) | Network switching device with concurrent key lookups | |
| US6065064A (en) | Inter-network connecting device | |
| US6549519B1 (en) | Network switching device with pipelined search engines | |
| US6625662B1 (en) | Inter-network connecting device | |
| US20170228251A1 (en) | Learning A MAC Address in VXLAN | |
| EP1005746B1 (en) | Method and device for network packet forwarding lookup with a reduced number of memory accesses | |
| CN102487374B (en) | Access control list realization method and apparatus thereof | |
| US9444915B2 (en) | Method and device for modifying and forwarding message in data communication network | |
| CN109005170A (en) | A kind of conversion method of RapidIO agreement to FC agreement | |
| JPH0685870A (en) | Interface system for high-speed data service, terminal adaptor as well as system and method for retrieval of specific entry | |
| CN109639579B (en) | Multicast message processing method and device, storage medium and processor | |
| JP2003510963A (en) | Method and apparatus for a four-way hash table | |
| CN111277612B (en) | Network message processing strategy generation method, system and medium | |
| EP2429132B1 (en) | Table creating and searching method used by network processor | |
| US20090282167A1 (en) | Method and apparatus for bridging | |
| CN101478488B (en) | Packet forwarding method, forwarding engine chip and routing device | |
| CN109921995A (en) | A kind of network equipment of the method for configuration address table, the FPGA and application FPGA | |
| CN108540387A (en) | Method for network access control and device | |
| EP1489782A1 (en) | Data transfer device,method and system using fragmentation and reassembly | |
| GB2305084A (en) | Control of simultaneously-occurring messages in communications systems. | |
| CN106878185B (en) | Message IP address matching circuit and method | |
| JPH06205025A (en) | Combination hash table and cam address recognition |
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 |