Layer 2 Ethernet Communication Tunneling Possibilities in Automation Systems

Future trends in energy generation are renewable energy sources and distributed energy generation. In control systems, these changes require higher automatization, more intelligent devices and secure and reliable communication. Another requirement is faster communication. Building a system that is able to fulfill real-time communication requirements over network layer is a hindrance to automation systems. There are multiple protocols that can manage the requirements, but many of them have limitations and requirements of their own. The limitations can be related to packet sizes, used devices or they may require a license. Tunneling protocols can bring a more general solution for the real-time problem. Tunneling Ethernet communication over network layer and letting the tunneling protocol to handle the network layer packaging instead of the communication protocol removes the need of a layer 3 protocol. Layer 2 tunneling provides a direct connection between separate local area networks. It enables a way for devices to communicate with each other over network layer using layer 2 communication protocols. Tunnel uses a pre-configured route to the destination gateway device making the routing of messages simpler and faster than with traditional IP routing. Layer 2 tunneling can be used in any communication system that utilizes layer 2 and layer 3 communication. This thesis focuses on use of tunneling in automation systems. The purpose of this thesis is to provide information and possible solutions for layer 2 Ethernet tunneling. The main focus is in suitable tunneling protocols and communication protocols, but also security and resilience solutions are studied. This thesis is composed of published studies, researches, articles and books that address the topic

TEL: Low-Latency Failover Traffic Engineering in Data Plane

Modern network applications demand low-latency traffic engineering in the presence of network failure while preserving the quality of service constraints like delay and capacity. Fast Re-Route (FRR) mechanisms are widely used for traffic re-routing purposes in failure scenarios. Control plane FRR typically computes the backup forwarding rules to detour the traffic in the data plane when the failure occurs. This mechanism could be computed in the data plane with the emergence of programmable data planes. In this paper, we propose a system (called TEL) that contains two FRR mechanisms, namely, TEL-C and TEL-D. The first one computes backup forwarding rules in the control plane, satisfying max-min fair allocation. The second mechanism provides FRR in the data plane. Both algorithms require minimal memory on programmable data planes and are well-suited with modern line rate match-action forwarding architectures (e.g., PISA). We implement both mechanisms on P4 programmable software switches (e.g., BMv2 and Tofino) and measure their performance on various topologies. The obtained results from a datacenter topology show that our FRR mechanism can improve the flow completion time up to 4.6x$-$7.3x (i.e., small flows) and 3.1x$-$12x (i.e., large flows) compared to recirculation-based mechanisms, such as F10, respectively

Comparison of New Solutions in IP Fast Reroute

Currently, network requirements are placed on the efficiency and size of the networks. These conditions can be ensured by modern converged networks that integrate the functions of both data and telecommunication networks. Line or router failures have always been a part of transmission networks, which is no different from converged networks. As a result of outages, which can take from ms to tens of seconds, packets are lost. These outages cause degraded transmission quality, which is undesirable when transmitting real-time multimedia services (Voice over IP, video). To solve the mentioned problems, the IETF organization has developed IP Fast Reroute mechanisms to minimise the time to restore the connection after a line or node failure and, consequently, less packet loss. The article reviews and compares the latest IP Fast Reroute mechanisms deployed in the last three years. First, we have Optimistic Fast Rerouting, which calculates optimistic and fallback scenarios. The second is Post-processing Fast Reroute, which decomposes the network according to metrics such as load and route length. Third, Local Fast Reroute focused on low congestion and random access