Unicast Frames Research Articles

Enhanced Effective Filtering Approach (eEFA) for Improving HSR Network Performance in Smart Grids

The effective filtering approach (EFA) is one of the most effective approaches for improving the network traffic performance of high-availability seamless redundancy (HSR) networks. However, because EFA uses port locking (PL) for detecting nondestination doubly-attached nodes with HSR protocol (DANH) rings in HSR networks, it forwards the first sent frame to all DANH rings in the network. In addition, it uses a control message for discovering passive QuadBox rings in both unidirectional and bidirectional communications. In this study, we propose an enhanced version of EFA called enhanced-EFA (eEFA) that does not forward unicast frames to nondestination DANH rings. eEFA does not use any control message to discover passive QuadBox rings in bidirectional communications. eEFA thus reduces the network traffic in HSR networks compared with EFA. Analytical and simulation results for a sample network show that the traffic reduction of eEFA was 4–26% and 2–20% for unidirectional and bidirectional communications, respectively, compared to EFA. eEFA, thus, clearly saves network bandwidth and improves the network performance.

A Combined Approach Effectively Enhancing Traffic Performance for HSR Protocol in Smart Grids

In this paper, we propose a very effectively filtering approach (EFA) to enhance network traffic performance for high-availability seamless redundancy (HSR) protocol in smart grids. The EFA combines a novel filtering technique for QuadBox rings (FQR) with two existing filtering techniques, including quick removing (QR) and port locking (PL), to effectively reduce redundant unicast traffic within HSR networks. The EFA filters unicast traffic for both unused terminal rings by using the PL technique and unused QuadBox rings based on the newly-proposed FQR technique. In addition, by using the QR technique, the EFA prevents the unicast frames from being duplicated and circulated in rings; the EFA thus significantly reduces redundant unicast traffic in HSR networks compared with the standard HSR protocol and existing traffic filtering techniques. The EFA also reduces control overhead compared with the filtering HSR traffic (FHT) technique. In this study, the performance of EFA was analyzed, evaluated, and compared to that of the standard HSR protocol and existing techniques, and various simulations were conducted to validate the performance analysis. The analytical and simulation results showed that for the sample networks, the proposed EFA reduced network unicast traffic by 80% compared with the standard HSR protocol and by 26–62% compared with existing techniques. The proposed EFA also reduced control overhead by up to 90% compared with the FHT, thus decreasing control overhead, freeing up network bandwidth, and improving network traffic performance.

A Novel Dual Separate Paths (DSP) Algorithm Providing Fault-Tolerant Communication for Wireless Sensor Networks.

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.

A novel ring-based dual paths approach for reducing redundant traffic in HSR networks

In this paper, we propose a novel dual paths-based approach, called ring-based dual paths (RDP), to significantly reduce redundant unicast traffic in high-availability seamless redundancy (HSR) networks. RDP establishes dual paths for forwarding unicast frames between nodes in HSR networks. Unlike existing dual paths-based approaches, such as dual virtual paths (DVP) that establish dual paths for each connection pair of HSR terminal nodes, RDP sets up dual paths for each connection pair of HSR rings. Therefore, RDP significantly reduces the number of established dual paths, which, in turn, reduces the overhead in discovering and establishing dual paths, as well as the memory space required to store these paths compared with the existing dual paths-based approaches. The performance of RDP has been analyzed, evaluated, and compared to that of the standard HSR protocol and the DVP approach. Various simulations were conducted to validate the traffic performance analysis. Analytical and simulation results showed that for the sample networks RDP reduced network unicast traffic by 80–88% compared with the standard HSR protocol, thus freeing up network bandwidth and improving network traffic performance.

FHT: A Novel Approach for Filtering High-Availability Seamless Redundancy (HSR) Traffic

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.

DVP: A Novel High-Availability Seamless Redundancy (HSR) Protocol Traffic-Reduction Algorithm for a Substation Automation System Network

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.

Towards Reliable Broadcast in ad hoc Networks

This letter presents new results obtained with a novel MAC scheme designed to be reliable and maximize the throughput of a single-hop network. Contrarily to the IEEE 802.11 MAC scheme, all nodes adopt a common optimal contention window size for unicast and broadcast transmissions, which is based on a common view of the channel. In this way, the conditional collision probability is independent of the type of traffic (broadcast or unicast). Simulation results for different amounts of broadcast/unicast traffic indicate that our approach significantly outperforms IEEE 802.11, exhibiting broadcast aggregate throughput gains up to 40%. Moreover, the simulation results indicate that the probability of successful transmitting a broadcast frame can be also improved up to 50% and, as the number of nodes increase, broadcast frames can obtain approximately the same reliability and throughput achieved by IEEE 802.11 unicast frames.

On providing metro ethernet services over transparent WDM optical rings

The long list of benefits (especially cost and capacity) of Ethernet LANs has made the IEEE, the ITU-T, and the Metro Ethernet Forum define the requirements for taking Ethernet beyond the local area, toward the metropolitan region. In addition, the ever-increasing traffic demands of new applications and users can only be met by the huge bandwidth capacity provided by optical fibers. This work studies how to provide metro Ethernet services over transparent tunable-transmitter fixed-receiver WDM optical ring networks. A new adaptation layer of ME to WDM is proposed, and its benefits and drawbacks are studied. It is shown that such a transparent WDM ring network can be seen as a logical full-mesh topology by the upper ME layer, thus reducing to one the number of optical-electronic-optical conversions per unicast frame. Additionally, two different approaches are proposed in the case of broadcast/multicast traffic, since this may bring scalability difficulties in ring topologies.

A virtual topology management protocol for ATM LAN emulation

This paper proposes a virtual topology management protocol based on the multiple spanning tree protocol (MSTP) for ATM LAN emulation (LANE) service. The protocol allows unicast data frames to be routed based on the LANE server identifier rather than the media access control (MAC) address, since the MAC addressing scheme is not hierarchical. The broadcast service provided by the protocol is considerably more efficient because each spanning tree is constructed with respect to the source server. The integrated multicast service also provides a number of enhancements to the LANE design. The MSTP algorithm provides the basis for efficient broadcast and unicast routing as well as the virtual topology abstraction. Detailed topology performance evaluation of this algorithm and comparison to the single spanning tree algorithm adopted by the existing LANE specification are given. Special emphasis is placed on the design and operation of the virtual topology management protocol based on the MSTP algorithm. We demonstrate that the virtual management protocol proposed in this paper can significantly enhance performance and provide flexibility and scalability in a large internetworking environment.

Design and evaluation of multicast GFR for supporting TCP/IP over hybrid wired/wireless ATM

The major challenges of designing multicast traffic control protocols for a combined wired/wireless network are the varying transmission characteristics (bandwidth, error, and propagation delay) of the wireless and wired media, and the different, possibly conflicting frame rate requests from multiple sources. To address these issues, in this paper we design and evaluate new unicast and multicast guaranteed frame rate (GFR) schemes for supporting TCP/IP traffic over a combined wired/wireless ATM network. We first propose a new, flexible weighted buffer management, and a frame‐based virtual spacing (VS) mechanism implementing weighted fair queueing. The unicast GFR scheme is based on the integration of the new weighted buffer management, and either cell‐based or frame‐based VS. It is then extended to support multicast GFR flows. The multicast scheme presented in this paper is the first multicast GFR scheme appeared in the literature. These schemes are carefully evaluated over several network configuration, supporting heterogeneous TCP/IP traffic with various frame rates. Simulation results show that the new schemes guarantee the minimum rates requested, provide excellent fairness, and achieve reasonably high efficiency. The new schemes may be extended to provide differentiated service in both IP and mobile IP frame work.