Abstract
The high-availability seamless redundancy (HSR) protocol is one of the most potential redundancy protocols that provides two frame copies for each sent frame; one copy from each direction or path. The HSR protocol is a seamless redundancy protocol because if one of the sent copies is lost due to an error or a component failure, the destination node will stay ready to receive the other frame copy without any interruption; therefore, it is a zero recovery time protocol. However, in a closed-loop network, HSR traffic performance suffers from unnecessary redundant frame copies generated and spread through the network due to the consecutive duplication of every sent frame copy at each QuadBox node. These duplicated frame copies will consume the available network bandwidth and may cause network congestion or delay. In this paper, we introduce a novel approach called removing the unnecessary redundant traffic (RURT). The idea of the RURT approach is to remove the unnecessary redundant traffic from the network at an early stage instead of keeping it circulating in the network. For the network sample selected in this paper, the RURT approach shows a 38.4-50% reduction in network traffic under failure-free and failure cases compared to the standard HSR protocol. Consequently, the RURT approach will increase network performance by freeing more bandwidth to avoid any network congestion or delay. As a result, more applications can be run on the network without any network problem.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.