The high-availability seamless redundancy (HSR) protocol, a potential candidate for substation automation system (SAS) networks, provides duplicated frame copies of each sent frame, with zero fault-recovery time. This means that even in the case of node or link failure, the destination node will receive at least one copy of the sent frame. Consequently, there is no network operation down time. However, the forwarding process of the QuadBox node in HSR is not smart and relies solely on duplication and random forwarding of all received frames. Thus, if a unicast frame is sent in any closed-loop network, the frame copies will be spread through most of all the links in both directions until they reach the destination node, which inevitably results in significant, unnecessary network traffic. In this paper, we present an algorithm called the dual virtual paths (DVP) algorithm to solve such an HSR excessive traffic issue. The idea behind our DVP algorithm is to establish automatic DVP between each HSR node and all the other nodes in the network, except for the QuadBox node. These virtual paths will be used for DVP unicast traffic transmission, rather than using the standard HSR transmission process. Therefore, the DVP algorithm results in less traffic, because there is no duplication or random forwarding, contrary to standard HSR. For the sample networks selected in this paper, the DVP algorithm shows more than a 70% reduction in network traffic and about an 80% reduction in the discarded traffic compared to the standard HSR protocol.

This paper investigates several existing techniques for reducing high-availability seamless redundancy (HSR) unicast traffic in HSR networks for substation automation systems (SAS). HSR is a redundancy protocol for Ethernet networks that provides duplicate frames for separate physical paths with zero recovery time. This feature of HSR makes it very suited for real-time and mission-critical applications such as SAS systems. HSR is one of the redundancy protocols selected for SAS systems. However, the standard HSR protocol generates too much unnecessary redundant unicast traffic in connected-ring networks. This drawback degrades network performance and may cause congestion and delay. Several techniques have been proposed to reduce the redundant unicast traffic, resulting in the improvement of network performance in HSR networks. These HSR traffic reduction techniques are broadly classified into two categories based on their traffic reduction manner, including traffic filtering-based techniques and predefined path-based techniques. In this paper, we provide an overview and comparison of these HSR traffic reduction techniques found in the literature. The concepts, operational principles, network performance, advantages, and disadvantages of these techniques are investigated, summarized. We also provide a comparison of the traffic performance of these HSR traffic reduction techniques.