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.

Fault tolerance has long been a major concern for sensor communications in fault-tolerant cyber physical systems (CPSs). Network failure problems often occur in wireless sensor networks (WSNs) due to various factors such as the insufficient power of sensor nodes, the dislocation of sensor nodes, the unstable state of wireless links, and unpredictable environmental interference. Fault tolerance is thus one of the key requirements for data communications in WSN applications. This paper proposes a novel path redundancy-based algorithm, called dual separate paths (DSP), that provides fault-tolerant communication with the improvement of the network traffic performance for WSN applications, such as fault-tolerant CPSs. The proposed DSP algorithm establishes two separate paths between a source and a destination in a network based on the network topology information. These paths are node-disjoint paths and have optimal path distances. Unicast frames are delivered from the source to the destination in the network through the dual paths, providing fault-tolerant communication and reducing redundant unicast traffic for the network. The DSP algorithm can be applied to wired and wireless networks, such as WSNs, to provide seamless fault-tolerant communication for mission-critical and life-critical applications such as fault-tolerant CPSs. The analyzed and simulated results show that the DSP-based approach not only provides fault-tolerant communication, but also improves network traffic performance. For the case study in this paper, when the DSP algorithm was applied to high-availability seamless redundancy (HSR) networks, the proposed DSP-based approach reduced the network traffic by 80% to 88% compared with the standard HSR protocol, thus improving network traffic performance.

High-availability seamless redundancy (HSR) is a protocol for Ethernet networks that provides duplicated frames with zero recovery time in the event of any network component’s failure. It is suited for applications that demand high availability and a very short time-outs such as substation automation systems (SAS). However, HSR generates excessive unnecessary unicast frames and spreads them throughout connected-ring networks, whether or not the destination node exists in network’s rings. This unnecessary redundant traffic causes high bandwidth consumption, resulting in degradation of network performance. In this paper, we introduce a novel approach for filtering and reducing HSR unicast traffic in connected-ring networks, called “filtering HSR traffic” (FHT). The purpose of FHT is to filter HSR unicast traffic and remove circulated traffic for all rings in connected-ring networks. Therefore, FHT significantly reduces network unicast traffic in connected-ring networks. The traffic performance of FHT has been analyzed, evaluated, and compared to that of standard HSR protocol and the port locking (PL) approach. Various simulations were conducted to validate the traffic performance analysis. Analytical and simulation results showed that, for our sample network, FHT reduced network unicast traffic by about 82% compared with standard HSR and by about 56% compared with the PL approach, thus freeing up network bandwidth and improving network traffic performance.

Accurate and precise clock synchronization is one of the fundamental requirements for various applications, such as telecommunication systems, measurement and control systems, and smart grid systems. Precision time protocol (PTP) was designed and specified in IEEE 1588 to meet that requirement. PTP provides a mechanism for synchronizing the clocks in a PTP system to a high degree of accuracy and precision based on exchange synchronization messages through a master–slave hierarchy. The best master clock (BMC) algorithm is currently used to establish the master–slave hierarchy for PTP. However, the BMC algorithm does not provide a fast recovery mechanism in case of master failures. The accuracy and precision of the PTP clocks could be deteriorated by the occurrence of failure in the network (link or node failure). These fault occurrences will affect network performance and reliability, and cause clock time drifting of the PTP nodes. In this paper, we present a novel approach, called timing fault recovery (TFR), to significantly reduce clock time drifting in PTP systems. TFR detects the fault occurrence in the network and recovers it by using a handshake mechanism with a short duration. Therefore, the TFR approach provides clock stability and constancy and increases the reliability and the availability of PTP systems. The performance of TFR has been analyzed and compared to that of the standard PTP. Various simulations were conducted to validate the performance analysis. The results show that, for our sample network, the TFR approach reduces clock drifting by 90% in comparison to the standard PTP, thus providing better clock firmness and synchronization accuracy for PTP clocks.

High availability is crucial for industrial Ethernet networks as well as Ethernet-based control systems such as automation networks and substation automation systems (SAS). Since standard Ethernet does not support fault tolerance capability, the high availability of Ethernet networks can be increased by using redundancy protocols. Various redundancy protocols for Ethernet networks have been developed and standardized, such as rapid spanning tree protocol (RSTP), media redundancy protocol (MRP), parallel redundancy protocol (PRP), high-availability seamless redundancy (HSR) and others. RSTP and MRP have switchover delay drawbacks. PRP provides zero recovery time, but requires a duplicate network infrastructure. HSR operation is similar to PRP, but HSR uses a single network. However, the standard HSR protocol is mainly applied to ring-based topologies and generates excessively unnecessary redundant traffic in the network. In this paper, we develop a new switching node for the HSR protocol, called SwitchBox, which is used in HSR networks in order to support any network topology and significantly reduce redundant network traffic, including unicast, multicast and broadcast traffic, compared with standard HSR. By using the SwitchBox, HSR not only provides seamless communications with zero switchover time in case of failure, but it is also easily applied to any network topology and significantly reduces unnecessary redundant traffic in HSR networks.

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.