DVP: A novel high-availability seamless redundancy (HSR) protocol traffic-reduction algorithm for a substation automation system network

Abstract

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. © 2014 by the authors.