You are currently viewing a new version of our website. To view the old version click .
Sensors
  • Article
  • Open Access

1 November 2023

Fast and Reliable Sending of Generic Object Oriented Substation Event Frames between Remote Locations over Loss-Prone Networks

,
,
,
and
CIRCE Technology Center, Avenida Ranillas, 50018 Zaragoza, Spain
*
Author to whom correspondence should be addressed.
This article belongs to the Topic Power System Protection

Abstract

WAMPAC (Wide Area Monitoring Protection and Control) applications are becoming crucial for granting a stable operation of the electricity transmission grid. These systems use a set of sensors distributed between different electrical substations to gather real-time measurements from the field. These sensors are called Phasor Measurement Units (PMUs). Using the gathered data, different monitoring, protection, and control algorithms are run in a Phasor Data Concentrator (PDC) located in a central location. These algorithms close the loop via the generation of remedial commands, which are sent back to the field level with stringent delay, security, and reliability requirements. GOOSE (Generic Object Oriented Substation Events) protocol, defined by IEC 61850 (IEC stands for International Electrotechnical Commission), is used for that aim and also considers the option of sending these commands over IP networks (this option is called Routed-GOOSE). The present article proposes two alternatives for the tunneling of GOOSE frames over IP. Both options allow the decoupling of the transmission and the security aspects, thus increasing flexibility and allowing for easier deployment. The first option, called VX-GOOSE, is a combination of standard protocols, allowing the sending of these frames over UDP/IP tunnels. The tests that have been carried out demonstrate that, under certain network conditions, the transmission of GOOSE frames over UDP may fail, and in some extreme cases, even a whole burst of GOOSEs could be lost. This may have very bad consequences for a distributed electrical system. It should be noted that this limitation affects both VX-GOOSE and Routed-GOOSE. To overcome these limitations, the second option, called Simplemux blast mode, includes a novel mechanism that provides delivery guarantees and a reduced delay, with the counterpart of a certain degree of redundancy. As shown in the experiments, the incurred delays can be significantly reduced when remote locations are connected via unreliable networks, whereas the bandwidth increase caused by redundancy can be kept at reasonable levels. Finally, it should be remarked that although GOOSE is a relevant example use case, this approach can be applied in other fields where flows require very low delay and delivery guarantees.

1. Introduction

Cross-border electricity interconnections are necessary to establish a geographically large market in which major stakeholders of the energy value chain can cooperate. These markets, based on imports and exports of electricity, increase the level of competition, enhance the security of supply, and permit a better integration of renewable energy sources. In this context, the use of WAMPAC (Wide Area Monitoring Protection and Control) [] systems is crucial to grant a stable and seamless integration of the grids of different countries. A WAMPAC integrates different elements: first, a set of sensors called PMUs (Phasor Measurement Units) are distributed in different electrical substations throughout the system. They send their real-time measurements of electrical quantities (usually called synchrophasors) to a remote central controller called PDC (Phasor Data Concentrator), where they feed monitoring, protection, and control algorithms, able to detect any impairment or instability. Depending on the output of these algorithms, remedial actions or actuation orders can be issued back to field-level devices. This “closes the loop” of the system, reacting to potential or detected problems in a fast way.
Cross-border WAMPAC systems [] present some specific challenges that must be addressed properly. First, the geographical distance between the sensors, the central controller, and the actuators produces inevitable delays in the order of some tens, or even cents, of milliseconds. This must be handled properly to ensure that the algorithm actuation times comply with the applicable regulations. In addition, since digital measurements are involved, precise synchronization is required between all the elements.
Many utilities are nowadays connected via dedicated networks, but the trend toward a fully IP smart grid is gaining more traction in terms of cost and bandwidth []. In some use cases, although it would be desirable to avoid the use of IP networks, this may prove unavoidable. Consequently, the protection or control equipment is linked to extensive communication networks, the performance of which cannot be fully controlled or known. This corresponds to the use cases defined in IEC 61850-90-5 [] (IEC stands for International Electrotechnical Commission), stating that IP networks can be used to communicate with receivers outside a substation if the added delays are acceptable for the application. The sending of Ethernet frames over other technologies is defined in IEC/TR 61850-90-1 [].
Some substations that are not connected to a dedicated network may use a 4G wireless one. This happens, for example, in a WAMPAC system under development in the context of the H2020 FARCROSS project [], where the interconnected electrical grids of different countries have been used to test these tools.
The use of a network with a more random behavior (e.g., a wireless one) instead of a dedicated one raises two kinds of concerns: first, cybersecurity is a must in these scenarios, considering the primary importance of continuous electric service. The use of Virtual Private Networks (VPNs) between remote locations can provide a high degree of security. However, substation automation standards define their own security mechanisms, which may require additional implementation and resource effort. Second, the variability of the network parameters (delay, jitter, packet loss, and bandwidth limits) is much higher than that of a dedicated one, and these network impairments will present a more severe profile.
In this context, the contribution of the present paper is focused on exploring two suitable solutions for using tunnels to send event-driven field commands that can fulfill the presented needs in WAMPAC systems. The approach can be summarized as follows:
  • First, the proposal of a novel combination of standard protocols that decouples the security from the transmission of information. It is called VX-GOOSE and uses VXLAN (Virtual Extensible LAN) [] to send tunneled GOOSE (Generic Object Oriented Substation Event) frames (the ones carrying the event-driven commands), allowing the transmission of actuation events between equipment from different vendors via IP networks in a fast and secure way.
  • Second, the proposal of a mechanism called Simplemux blast flavor, based on sending redundant frames, which grants the delivery of every single frame and minimizes the delay caused by packet loss, thus keeping actuation times within acceptable limits. This proposal has been designed after discarding the use of TCP and SCTP (Stream Control Transmission Protocol) as suitable options for this kind of traffic.
  • And third, a set of tests with real hardware, demonstrating and comparing both proposals and measuring the effects of network impairments on their performance.
The added value of this work is that both proposals serve as implementations of the tunneling mechanism for Ethernet frames over IP, proposed by IEC 61850-90-1. In addition, the latter offers another feature: it periodically re-transmits GOOSE messages until an acknowledgment is received, thereby reducing delay in loss-prone networks. This can be an added value in scenarios where these kinds of networks must be used. In addition, these options can be deployed in a fast and simple way. The paper offers an assessment of both proposals using real-world implementations, a crucial step before considering actual deployment.
To prevent unauthorized access, the two proposed approaches should be used in conjunction with one of the robust existing VPN solutions. Since security is separated from transmission, the responsibility of cybersecurity aspects can be lifted from the grid control staff and managed by a specialized team.
The remainder of the paper is organized as follows: the next section summarizes the state of the art regarding protocols for substation automation, also considering security and latency issues; Section 3 explains VX-GOOSE and presents the corresponding evaluation tests; Section 4 does the same with Simplemux, blast flavor, and the paper ends with the Conclusions.

3. VX-GOOSE

In order to send WAMPAC’s remedial actions, it would be convenient to have a widely deployed protocol that can travel through IP networks. However, none of the existing options seems easy to implement. GOOSE is widely deployed, but it is restricted to the LAN level because it travels directly over Ethernet; R-GOOSE, although conceived for traveling over IP, is not yet very popular; finally, proprietary extensions of C37.118 hamper interoperability.

3.1. Description of VX-GOOSE

As a first solution, this paper proposes VX-GOOSE, which consists of using a standard called VXLAN [] in combination with GOOSE (the right column of Figure 1, in which VXLAN would be the tunneling protocol). VXLAN is a protocol for network virtualization over Layer 3, defined by the IETF, originally created to overcome the limitation in the number of VLANs (Virtual Local Area Networks) in data centers. It adopts the MAC-in-UDP packet encapsulation mode, also including a specific 8-byte header with an identifier. This way, the entire network (including switches at different locations) becomes a large Layer-2 virtual switch.
On behalf of clarity, a Wireshark capture of a GOOSE frame traveling over VXLAN over UDP (port 4789) is shown in Figure 2.
Figure 2. Wireshark capture of VX-GOOSE.
The advantages of VXLAN with respect to other tunneling protocols [,,] are its flexibility and speed (no tunnel nor session setup phases are required) and its high scalability, as it was initially conceived for data center hosting thousands of machines in different LANs, the number of locations it can connect is huge.
As illustrated in Figure 3, what is proposed is a new use case for VXLAN. GOOSE travels over Ethernet frames, which are captured at the origin switch (e.g., at the control center) and sent through a tunnel via a WAN (Wide Area Network) IP network (i.e., to the remote substation). This way, the whole Ethernet frame “appears” in the destination switch, making the end device “think” that it has been originated locally. The same happens backward: bidirectional GOOSE can work normally since the tunnel is transparent for both communication ends. In the figure, the RTAC is a Real-Time Automation Controller, i.e., the machine where the protection algorithms run.
Figure 3. Communication and test setup scheme.
Section 11.3.1.3 of IEC 61850-90-5 defines the differences between GOOSE and R-GOOSE data: it recommends that the DataSet elements include a timestamp. It also suggests that the QUALITY for each DataSet element may need to be included. None of these changes is in any way critical for this proposal.
As can be seen, the use of a VXLAN tunnel combines two advantages: First, it has the benefits of R-GOOSE, as all the functionality of GOOSE is maintained, but without the need to implement all the specific features of R-GOOSE. Second, the tunnel can make use of a VPN (which may already exist to secure the connection between remote locations) so security can be decoupled from the transmission of information.

3.2. Tests with VX-GOOSE

A setup with real equipment has been used to validate the proposal (Figure 4): a Real-Time Digital Simulator (RTDS) simulates an electric grid []. A PMU sensor (SEL Axion 2240) obtains the measurements from the simulated grid and sends C37.118 synchrophasors to a Real-Time Automation Controller (RTAC, SEL 3555), where protection algorithms are run []. Using VXLAN, the local (SEL 2730M) and the remote (TP-Link SG108E) switches are connected as if they were in the same LAN. The VXLAN routers are two Raspberry Pi 3B+ (Linux kernel 5.10.17) that capture the traffic and send it through the tunnel to the other end. This way, the very same frame generated by the protection algorithm in one location is released at the destination switch, and it arrives at the destination PMU, where an actuator is triggered.
Figure 4. Laboratory testbed (RTDS not shown).
In this setup, two network impairments must be considered to emulate the network behavior: (a) delay: its effect is direct, i.e., it affects VX-GOOSE packets, adding latency to the execution of the algorithm decision; and (b) packet loss: VX-GOOSE travels on UDP, so there are no retransmissions. GOOSE mitigates this by sending a burst of packets with the same content. If a packet is lost, some of the subsequent ones may arrive, so a lost packet is translated into an additional delay on the protection algorithm. An interesting research question arises: considering the bursty nature of packet loss on IP networks [], can this represent a problem for R- and VX-GOOSE?
A battery of tests was run to answer the question. A wide area protection algorithm is running in the testbed, based on the Zone Integrated Impedance Angle method [], applied to a 400 kV transmission line. Each test consists of 40 faults, forced by the RTDS every 22 s. A burst of GOOSE frames is generated by the RTAC after each fault. Random packet losses are introduced in the network using Linux netem with a Simple Gilbert Model [], which provides a good approximation of losses on the Internet. It has two parameters, p and r, corresponding to the transition probabilities between the bad (all packets are lost) and the good (no packet loss) states (see Figure 5).
Figure 5. Parameters of the Simple Gilbert Model.
The two Raspberries are synchronized via NTP (Network Time Protocol) before the test. Wireshark is used on both sides to capture all the traffic. Once the test is finished, both capture files are cleaned and parsed using a Python script. Then, they are compared in order to obtain the delay of each packet and to identify the ones that have been lost.
On behalf of clarity, Table 4 includes the employed variables and their definitions.
Table 4. Employed variables.
We will use the next two parameters for the graphical representation of the results: first, packet loss probability, obtained as the probability of being in a bad status:
P l o s s = p p + r .
In addition, the Average Burst Error Length (ABEL), which is calculated as
ABEL = 1 r .
Table 5 presents the average results, and Figure 6 shows a test with 10% packet loss and ABEL = 5 packets (a very harsh test setup where the bad effects of the network can be clearly observed).
Table 5. Effect of packet loss on VX-GOOSE (total 40 tests).
Figure 6. Battery of 40 VX-GOOSE tests. Lost rate 10%, ABEL = 5 frames.
During normal operation, GOOSE messages are generated every second (this corresponds to the normal GOOSE frames of the figure). After a fault, a burst of GOOSE frames is generated, which interval is increased at each transmission until the steady periodicity value is reached.
If the first frame of a GOOSE burst is lost, the message will arrive with an additional delay (the time interval between the first and the second GOOSE). If the second frame is also lost, the delay will increase, and so on. Furthermore, if the packet loss probability is high, a whole burst of GOOSE packets can be lost, as has happened with test #35, presented in Figure 6 (highlighted in yellow).
As can be observed from the table, if packet loss does not happen in bursts (ABEL = 1), only minimal delays appear. Even with a 10% loss rate, the average delay is only 0.6 ms. However, if long bursts of lost packets happen (ABEL = 5 or 10), the delays increase up to 24.9 ms. Furthermore, the combination of a high loss rate (about 10%) with long error bursts (ABEL = 5 or 10) can even cause a trip failure.
All in all, the tests have demonstrated that, under certain network conditions, the transmission of GOOSE frames over UDP may fail, and in some cases, even a whole burst of GOOSEs could be lost. This may have very bad consequences for a distributed electrical system. It should be noted that this statement is valid for both VX-GOOSE and R-GOOSE (the standard proposed by the IEC). Therefore, new mechanisms are needed to eliminate this possibility.

4. Simplemux, Blast Flavor

For an electric network operator, it is desirable to have a dedicated connection between the control center and each of the remote locations (substations). However, this is not yet the case in many scenarios where the operators resort to public IP networks or other solutions. Although nowadays’ wireless networks may provide good performance and a high throughput, their loss rate is still not negligible (0.1 to 0.5%). In addition, the bursty nature of packet loss may result in the loss of all the GOOSE frames of a trip, as has been observed in the previous section. This is something that should never happen in a real network since it would prevent a protection algorithm from acting.

4.1. Possibility of Tunneling over TCP or SCTP

A possibility that could be considered to totally avoid packet loss would be to send the GOOSE frames over TCP, a protocol that provides delivery guarantees. However, TCP retransmissions require at least an extra exchange of packets between the sender and the receiver, i.e., a latency equivalent to the RTT (Round-Trip Time), in addition to the timeout expiration.
To test the suitability of using a TCP tunnel, we have resorted to Simplemux [], a protocol able to encapsulate a number of packets/frames belonging to different protocols into a single IP packet. In normal flavor, it just adds a small separator before each of the aggregated packets/frames. The encapsulated packets/frames can travel over IP and UDP.
In the present work, the possibility of traveling over TCP has been added to an existing user space implementation of Simplemux. The implementation is available at https://github.com/simplemux/simplemux (accessed on 30 October 2023). A Wireshark screenshot is shown in Figure 7, obtained with a .lua Simplemux dissector added as a plugin. It can be observed how Simplemux allows the sending of GOOSE frames over TCP packets using port 55557. A GOOSE frame with a size of 242 bytes is now sent inside a 311-byte frame. Ethernet, IP, and TCP add an overhead of 14, 20, and 32 bytes each (the TCP header has some extensions in this case), while Simplemux adds 3 more bytes. It can also be observed that the Simplemux header includes the length and the protocol code 143, which corresponds to Ethernet.
Figure 7. Wireshark capture of GOOSE over Simplemux over TCP.
After some testing in the lab using Simplemux to send GOOSE frames over TCP, it was observed (see Figure 8) that in some cases, the delay incurred was up to 220 or even 455 ms (this happened with a 1% loss rate, ABEL = 1, RTT = 5 ms). In the figure, it can be observed that four trip bursts were seriously affected by these delays (bursts #3, #10, #27, and #35, highlighted in yellow).
Figure 8. Forty trips sent via Simplemux over TCP, loss rate 1%, ABEL = 1, RTT = 5 ms.
Furthermore, if the loss conditions become harder, especially if ABEL is higher, TCP stops working; it disconnects and needs a long reconnection time. Obviously, this is not an acceptable solution in our case since a remote command must be executed in a fast way: if a fault has been detected in the grid, the time to act is critical.
An alternative to UDP and TCP is SCTP, which is also a widely accepted standard with many mature implementations; it was published in 2007 [], and was updated recently []. It has a congestion control mechanism similar to that of TCP (including features such as Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery []). Therefore, the same limitations observed with TCP will apply.
All in all, it can be said that although the retransmission features of both TCP and SCTP make them able to grant that every single packet is delivered, they may add some delays that can be too high for this specific use case. In addition, their congestion control mechanisms may reduce the throughput [], and this is not the desired behavior, considering that certain equipment may be at risk.

4.2. Description of Simplemux, Blast Flavor

Once the use of tunneled GOOSE over TCP or SCTP has been discarded, new options have to be proposed. An interesting fact is that the throughput of a GOOSE flow is quite minimal: some tens of kilobits per second. Therefore, a possibility is to add a certain degree of redundancy, repeatedly sending each frame a number of times until it is acknowledged by the other side.
For that aim, a new flavor, called blast, has been designed and added to the existing Simplemux implementation. It redundantly sends the same packet a number of times. Its protocol stack corresponds to the one in the right column of Figure 1, in which Simplemux would be the Tunneling protocol. For clarity, a Wireshark capture of Simplemux, blast flavor, travelling over UDP port 55558 is shown in Figure 9. In this case, the frame is 277 bytes long; the original GOOSE had 229 bytes, plus 14 bytes of the Ethernet header, 20 of IP, and 8 of UDP. Finally, the Simplemux header adds 6 more bytes. More details about the protocol fields and their values are given in Appendix A.
Figure 9. Wireshark capture of Simplemux, blast flavor.
As shown in Figure 10, a period is defined: each frame sent by the RTAC is stored in the sender router and sent periodically via the tunnel until the first acknowledgment arrives. For that aim, application-level ACKs (Acknowledgements) are used. This increases the required throughput, but it guarantees that every single frame will arrive on the other side. Then, the destination router decapsulates the received frame and forward it to the end node.
Figure 10. Behavior of Simplemux, blast flavor.
It should be noted that since the mechanism works between a pair of intermediate machines, it is totally transparent for the end nodes, which only receive a single copy of the original frame. This is quite different from TCP: the proposed method does not wait for the ACK; it periodically sends a copy of the same frame to the other side. In high RTT networks, this can significantly reduce the incurred delay: instead of waiting for the whole RTT, a copy of any lost frame will soon be available.
As can be observed in Figure 10 (frame #1), if a tunneled frame is lost, a new copy will be available after an interval similar to the defined period. If a number of packets l are lost at the beginning of a burst, the additional delay becomes p e r i o d × l (see frame #2). However, if the lost packet is not the first copy (see frame #3), the loss is not relevant.
To make an analysis of the incurred throughput increase, a parameter called redundancy factor (R) can be defined as
R = n u m b e r   o f   t u n n e l e d   f r a m e s   s e n t n u m b e r   o f   o r i g i n a l   f r a m e s = R T T p e r i o d + E [ l ] .
If a number of packets l is lost at the beginning of a burst, this will be translated into an additional delay:
Additional delay = period × E[l].
To obtain E[l], let Ploss be the loss rate. Let k be the number of packets in a row that are lost. The number of tunneled frames lost at the beginning of a burst will be
E [ l ] = ( 1 P l o s s ) k = 0 k P l o s s k .
The closed form of the sum is
k = 0 n k p k = 1 ( n + 1 ) p n + n p n + 1 ( 1 p ) 2 .
Since Ploss < 1, it can be devised that
E [ l ] = P l o s s 1 P l o s s .
From the analysis, it can be concluded that this method allows a trade-off between the additional delay and the redundancy factor. The trade-off is illustrated in the next figures: from Figure 11, it can be observed that the redundancy factor mainly depends on the ratio RTT/period, and the loss probability does not make any significant difference. From Figure 12, it can be concluded that the loss probability and the period are the two factors that determine the additional delay.
Figure 11. Redundancy factor as a function of RTT/period and loss probability.
Figure 12. Additional delay as a function of loss probability and the period.
A test battery has been conducted using the same testbed of Section 3, with the implementation of Simplemux blast flavor running between the two Raspberry Pi 3B+. As before, the two Raspberries are synchronized via NTP before the test, and two capture files are obtained with Wireshark. The two captures are parsed by a Python script, using the identifier of each packet to calculate the incurred delay.
First, Table 6 gives some results obtained in the testbed, using typical values of the RTT: 20, 50, and 100 ms []. The RTT and the loss probability (Ploss) are determined by the scenario, so the period is the parameter that can be tuned by the network manager: if a very short value is set, the delay caused by packet loss can be kept into very low values (in the order of the period plus 0.05 to 0.22 ms).
Table 6. Examples of R and the additional delay.
As a counterpart, the redundancy can scale up to a ×4, ×5, or even a ×10 factor. This could potentially lead to traffic congestion if not managed appropriately. Besides maintaining the period at an optimal value, another strategy to keep redundancy at acceptable levels involves transmitting only the most critical packets (e.g., the trips) via Simplemux blast, while the rest are sent without confirmation. VLAN tags can be effectively utilized to categorize the packets.
The value of the period will therefore be limited by the redundancy allowed by the available bandwidth. It is clear that the method can be beneficial for loss-prone networks with high RTT: as an example, a copy of the packet would be available 22.22 ms later instead of waiting for the RTT (100 ms, see the last row of Table 6).
Considering that this method always delivers all the frames, the important performance indicator is not the loss rate but the additional delay caused by packet loss, with different burstiness levels. We will first present two detailed examples, and some averaged results will then be reported.
Figure 13 and Figure 14 show two sets of 40 faults, each of them generating a burst of GOOSE frames jointly with periodic ones. The period is set to 10 ms. In the first case (Figure 13), with a low RTT, a low loss rate (1%), and no bursty losses, the additional delay is kept very low: an average of 0.36 ms, up to 10 ms in some few cases (and 16 ms in one case). If compared with TCP (see Figure 8, obtained in the very same network conditions), the advantage in terms of delay is clear: in this case, the maximum delay is 16 ms, whereas with TCP, it was up to 455 ms. The processing delay in the Raspberry is roughly 0.1 ms. In a real deployment, this delay could even be reduced by using more specific hardware.
Figure 13. Forty trips sent via Simplemux, blast flavor. P = 10 ms, loss rate 1%, ABEL = 1, RTT = 5 ms.
Figure 14. Forty trips sent via Simplemux, blast flavor. P = 10 ms, loss rate 10%, ABEL = 10, RTT = 50 ms.
Things become more complicated in Figure 14. Since the loss rate is 10%, packets are lost in bursts (ABEL = 10), and the RTT is higher. In this case, the maximum delay becomes 330 ms, although it is 3.68 ms on average.
The averaged results considering no bursty losses (ABEL = 1) show that the average added delay is usually under 0.5 ms (Table 7). Furthermore, the maximum delay added to a packet was 16.16 ms. The standard deviation remains low.
Table 7. Effect of period and RTT (ABEL = 1).
As reported in Table 8, the effect of bursty losses (ABEL = 10) is noticeable, especially when combined with a high loss rate (10%). In these cases, the variance of the delay grows significantly, with some packets sent more than 30 times (period of 10 ms and delay above 300 ms). However, the average added delay only grows up to 2–3 ms. This can be an interesting improvement, considering that GOOSE frames are sent in bursts, so it is easy for at least one of them to arrive on time.
Table 8. Effect of period and RTT (ABEL = 10).
All in all, the results illustrate the trade-off between the reduction in the added delay and the bandwidth increase. It will be the decision of the network operator to tune the period so the delay is kept to the required limits, always considering the bandwidth limitations imposed by the connection technology and the costs.
In general, it is clear that a profound understanding of the underlying network is essential to make an informed decision between a method without confirmation (such as R-GOOSE or VX-GOOSE) and the Simplemux blast approach, which continues to send the frame until it is received. If the network exhibits bursty packet loss behavior, it would be more advantageous to implement the latter method, bearing in mind the critical importance of maintaining a stable electrical grid.

5. Conclusions

Two proposals for sending tunneled GOOSE frames in a WAMPAC system have been presented and evaluated, and the obtained results illustrate their usefulness. The proposed methods can be convenient for some use cases in which an unreliable network is used for the communications of a WAMPAC system. The ability to decouple communication from security allows an easier integration of the latest security protocols.
Both proposals can be seen as examples of the convergence between IT (Information Technology) and OT (Operational Technology) in the smart grid: VXLAN is a mature IT technology widely used in other fields, published by the IETF, and natively implemented in Linux. Although it was conceived for a very different context (data centers), it can also provide significant advantages in substation automation.
The use of a VXLAN tunnel for sending GOOSE frames (i.e., VX-GOOSE) has two advantages: it has the benefits of R-GOOSE, as all the functionality of GOOSE is maintained, but without the need to implement all the specific features of R-GOOSE. And the tunnel can make use of a VPN, which may already exist to secure the connection between remote locations, so security can be decoupled from the transmission of information.
VX-GOOSE offers two distinct advantages. Like R-GOOSE, it retains all the functionalities of GOOSE but without the necessity to incorporate all its specific features. Additionally, the tunnel can leverage a VPN, which might already be in place, to secure connections between remote locations. This allows for the separation of security measures from the transmission of information. The tests have demonstrated that under normal network conditions, where packet loss does not occur in bursts, only minimal delays are observed. Even with a 10% loss rate, the average delay is a mere 0.6 ms. However, under severe network conditions characterized by bursty loss, the transmission of GOOSE frames over UDP may fail. In some instances, an entire burst of GOOSEs could potentially be lost.
Simplemux blast flavor, although not a standard, is a way to ensure the fast delivery of all the frames. The tests have shown that there is a tradeoff between the delay and the redundancy factor. This tradeoff is governed by the main parameter: the period in which frame copies are dispatched. By selecting an optimal value, the delay can be significantly minimized, potentially to just a few tens of milliseconds. The increased bandwidth resulting from redundancy can be mitigated by applying the method only to pertinent packets. This minor drawback is negligible when considering the stakes: maintaining grid stability and safeguarding valuable equipment.
The sending of GOOSE constitutes a relevant use case for Simplemux blast flavor, but it can also be useful in other fields where flows require very low delay and delivery guarantees. If that is the case, its standardization could be of interest in the near future.

Author Contributions

Conceptualization, J.S. and A.A.P.H.; methodology, J.S. and A.A.P.H.; software, J.S.; validation, all authors; investigation, J.S. and A.A.P.H.; resources, A.A.P.H. and E.M.C.; writing—original draft preparation, J.S.; writing—review and editing, A.A.P.H., E.M.C., Y.G. and J.T.; supervision, J.T. and E.M.C.; project administration, A.A.P.H.; funding acquisition, J.T., Y.G. and E.M.C. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the European Commission H2020 FARCROSS project, G.A. No. 864274, and by the European Commission H Europe eFORT (https://efort-project.eu/) project, G.A. No. 101075665.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

AcronymMeaning
ABELAverage Burst Error Length
ACKAcknowledgment
AESAdvanced Encryption Standard
CIGREInternational Council on Large Electric Systems
GOOSEGeneric Object Oriented Substation Events
GREGeneric Routing Encapsulation
IECInternational Electrotechnical Commission
IEDIntelligent Electronic Device
IEEEInstitute of Electrical and Electronics Engineers
IETFInternet Engineering Task Force
IPInternet Protocol
IPsecInternet Protocol security
ITInformation Technology
L2TPv3Layer Two Tunneling Protocol—Version 3
LANLocal Area Network
MACMedia Access Control
NTPNetwork Time Protocol
OTOperational Technology
PMUPhasor Measurement Unit
R-GOOSERouted GOOSE
R-SVRouted Sampled Values
RTACReal-Time Automation Controller
RTDSReal-Time Digital Simulator
RTTRound-Trip Time
SCTPStream Control Transmission Protocol
SELSchweitzer Engineering Laboratories
SVSampled Values
TCPTransmission Control Protocol
TLSTransport Layer Security
UDPUser Datagram Protocol
VLANVirtual Local Area Network
VPNVirtual Private Network
VX-GOOSEVirtual Extensible GOOSE
VXLANVirtual Extensible LAN
WAMPACWide Area Monitoring Protection and Control
WANWide Area Network

Appendix A

The structure of a Simplemux separator in blast flavor is shown in Figure A1. The size is always 6 bytes.
Figure A1. Structure of a Simplemux separator in Blast flavor.
These are the details of the fields:
  • Length (LEN, 16 bits). The length of the multiplexed packet (in bytes).
  • Protocol (8 bits). It is the Protocol field of the multiplexed packet, according to IANA “Assigned Internet Protocol Numbers.” In the case of GOOSE, as an Ethernet frame is sent, the value will be 143.
  • Identifier (16 bits). It uniquely identifies each packet of a flow (packets in different directions MAY have the same identifier).
  • ACK (8 bits). It may have three values:
    • 0: this packet requires an ACK.
    • 1: the packet is an ACK.
    • 2: the packet is a heartbeat.
The structure of an ACK is the same, but the Length and Protocol fields must always be 0.

References

  1. Castello, P.; Gallus, G.; Muscas, C.; Pegoraro, P.A.; Sitzia, D.; Campisano, L.; Giannuzzi, G.M.; Maiolini, C.; Pau, P. Latency Characterization of a Wide Area Monitoring Protection and Control Application in the Italian Transmission System. In Proceedings of the 2022 IEEE 12th International Workshop on Applied Measurements for Power Systems (AMPS), Cagliari, Italy, 28–30 September 2022; pp. 1–6. [Google Scholar] [CrossRef]
  2. Krommydas, K.F.; Karavas, C.-S.G.; Plakas, K.A.; Melissaris, D.; Dikaiakos, C.N.; Moraitis, I.; Hurtado, A.P.; Sancho, M.B.; Carrasco, E.M.; Saldana, J.; et al. Design of a WAMPAC System for Implementation in the Greek Transmission System. In Proceedings of the 2022 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe), Novi Sad, Serbia, 10–12 October 2022; pp. 1–6. [Google Scholar] [CrossRef]
  3. Laverty, D.M.; O’raw, J.B.; Li, K.; Morrow, D.J. Secure data networks for electrical distribution applications. J. Mod. Power Syst. Clean Energy 2015, 3, 447–455. [Google Scholar] [CrossRef]
  4. IEC 61850-90-5; Communication Networks and Systems for Power Utility Automation-Use of IEC 61850 to Transmit Synchrophasor Information According to IEEE C37.118 Technical Report Edition 1.0. International Electrotechnical Commission: Geneva, Switzerland, 2013.
  5. IEC 61850-90-1; Communication Networks and Systems for Power Utility Automation-Use of IEC 61850 for the Communication between Substations Technical Report Edition 1.0. International Electrotechnical Commission: Geneva, Switzerland, 2013.
  6. Mahalingam, M.; Dutt, D.; Duda, K.; Agarwal, P.; Kreeger, L.; Sridhar, T.; Bursell, M.; Wright, C. Virtual eXtensible Local Area Network (VXLAN): A Framework for Overlaying Virtualized Layer 2 Networks over Layer 3 Networks; RFC 7348; RFC Editor: Wilmington, DE, USA, 2014; pp. 1–22. [Google Scholar] [CrossRef]
  7. C37.118.1-2011; IEEE Standard for Synchrophasor Measurements for Power Systems. IEEE: Piscataway, NJ, USA, 2011; pp. 1–61. [CrossRef]
  8. Carroll, J.R.; Robertson, F.R. A Comparison of Phasor Communications Protocols; No. PNNL-28499; Pacific Northwest National Lab. (PNNL): Richland, WA, USA, 2019. [Google Scholar] [CrossRef]
  9. IEC 61850-9-2; Communication Networks and Systems for Power Utility Automation-Specific Communication Service Mapping (SCSM)-Sampled Values over ISO/IEC 8802-3, 09 2011. International Electrotechnical Commission: Geneva, Switzerland, 2013.
  10. IEC 61869-9:2016; Instrument Transformers—Part 9: Digital Interface for Instrument Transformers. International Electrotechnical Commission: Geneva, Switzerland, 2016.
  11. IEC 61850-8-1; Communication Networks and Systems for Power Utility Automation-Specific Communication Service Mapping (SCSM)-Mappings to MMS (ISO 9506-1 and ISO 9506-2) and to ISO/IEC 8802–3, 06 2011. International Electrotechnical Commission: Geneva, Switzerland, 2011.
  12. Lino, T.S.S.; Guerrero, C.A.V.; da Silveira, P.M. Practical analysis of teleprotection schemes based on IEC 61850-90-1 using real-time simulation. In Proceedings of the 2019 IEEE PES Innovative Smart Grid Technologies Conference-Latin America (ISGT Latin America), Gramado, Brazil, 15–18 September 2019; IEEE: Piscataway, NJ, USA, 2019. [Google Scholar] [CrossRef]
  13. Aftab, M.A.; Roostaee, S.; Hussain, S.S.; Ali, I.; Thomas, M.S.; Mehfuz, S. Performance evaluation of IEC 61850 GOOSE-based inter-substation communication for accelerated distance protection scheme. IET Gener. Transm. Distrib. 2018, 12, 4089–4098. [Google Scholar] [CrossRef]
  14. Farinacci, D.; Li, T.; Hanks, S.; Meyer, D.; Traina, P. Generic Routing Encapsulation (GRE); RFC 2784; RFC Editor: Wilmington, DE, USA, 2000; pp. 1–8. [Google Scholar] [CrossRef]
  15. Jafary, P.; Raipala, O.; Repo, S.; Salmenpera, M.; Seppala, J.; Koivisto, H.; Horsmanheimo, S.; Kokkoniemi-Tarkkanen, H.; Tuomimaki, L.; Alvarez, A.; et al. Secure layer 2 tunneling over IP for GOOSE-based logic selectivity. In Proceedings of the 2017 IEEE International Conference on Industrial Technology (ICIT), Toronto, ON, Canada, 22–25 March 2017. [Google Scholar] [CrossRef]
  16. Lau, J.; Goyret, I. Layer Two Tunneling Protocol—Version 3 (L2TPv3); RFC 3931; RFC Editor: Wilmington, DE, USA, 2005; pp. 1–94. [Google Scholar] [CrossRef]
  17. Firouzi, S.R.; Vanfretti, L.; Ruiz-Alvarez, A.; Hooshyar, H.; Mahmood, F. Interpreting and implementing IEC 61850-90-5 Routed-Sampled Value and Routed-GOOSE protocols for IEEE C37.118.2 compliant wide-area synchrophasor data transfer. Electr. Power Syst. Res. 2017, 144, 255–267. [Google Scholar] [CrossRef]
  18. Hussain, S.S.; Ustun, T.S.; Kalam, A. A review of IEC 62351 security mechanisms for IEC 61850 message exchanges. IEEE Trans. Ind. Inform. 2019, 16, 5643–5654. [Google Scholar] [CrossRef]
  19. Rodríguez, M.; Lázaro, J.; Bidarte, U.; Jiménez, J.; Astarloa, A. A Fixed-Latency Architecture to Secure GOOSE and Sampled Value Messages in Substation Systems. IEEE Access 2021, 9, 51646–51658. [Google Scholar] [CrossRef]
  20. Abbas, H.; Emmanuel, N.; Amjad, M.F.; Yaqoob, T.; Atiquzzaman, M.; Iqbal, Z.; Shafqat, N.; Bin Shahid, W.; Tanveer, A.; Ashfaq, U. Security Assessment and Evaluation of VPNs: A Comprehensive Survey. ACM Comput. Surv. 2023, 55, 1–47. [Google Scholar] [CrossRef]
  21. Donenfeld, J.A. Wireguard: Next generation kernel network tunnel. In Proceedings of the NDSS Symposium, San Diego, CA, USA, 26 February–1 March 2017; pp. 1–12. [Google Scholar]
  22. Feilner, M. OpenVPN: Building and Integrating Virtual Private Networks; Packt Publishing Ltd.: Birmingham, UK, 2006. [Google Scholar]
  23. Kent, S.; Seo, K. Security Architecture for the Internet Protocol; RFC, Ed.; RFC 4301; RFC Editor: Wilmington, DE, USA, 2005. [Google Scholar] [CrossRef]
  24. Osswald, L.; Haeberle, M.; Menth, M. Performance Comparison of VPN Solutions; University of Tuebingen: Tuebingen, Germany, 2020. [Google Scholar] [CrossRef]
  25. Abdulazeez, A.; Salim, B.; Zeebaree, D.; Doghramachi, D. Comparison of VPN Protocols at Network Layer Focusing on Wire Guard Protocol. Int. Assoc. Online Eng. 2020, 14, 157–177. [Google Scholar] [CrossRef]
  26. Ford, M. Workshop report: Reducing internet latency, 2013. ACM SIGCOMM Comput. Commun. Rev. 2014, 44, 80–86. [Google Scholar] [CrossRef]
  27. Cigré SC34 WG 34-35.11; Protection Using Telecommunications, TB 13. International Council on Large Electric Systems (CIGRE): Paris, France, 2000.
  28. Verizon, IP Latency Statistics. Available online: https://www.verizon.com/business/terms/latency/ (accessed on 30 August 2023).
  29. Sidwall, K.; Forsyth, P. A Review of Recent Best Practices in the Development of Real-Time Power System Simulators from a Simulator Manufacturer’s Perspective. Energies 2022, 15, 1111. [Google Scholar] [CrossRef]
  30. Prada, A.A.; Carrasco, E.M.; Martínez, M.T.V.; Oliván Monge, M.A.; Dikaiakos, C.N.; Korkmaz, Y.Z. Laboratory-Scaled DEMO possibilities for testing WAMPAC solutions before field implementation. In Proceedings of the 2021 IEEE Madrid PowerTech, Madrid, Spain, 28 June–2 July 2021; pp. 1–6. [Google Scholar] [CrossRef]
  31. Ellis, M.; Pezaros, D.P.; Kypraios, T.; Perkins, C. A two-level Markov model for packet loss in UDP/IP-based real-time video applications targeting residential users. Comp. Netw. 2014, 70, 384–399. [Google Scholar] [CrossRef]
  32. Prada Hurtado, A.A.; Carrasco, E.M.; Martínez, M.T.V.; Saldana, J. Application of IIA Method and Virtual Bus Theory for Backup Protection of a Zone Using PMU Data in a WAMPAC System. Energies 2022, 15, 3470. [Google Scholar] [CrossRef]
  33. Hasslinger, G.; Hohlfeld, O. The Gilbert-Elliott Model for Packet Loss in Real Time Services on the Internet. In Proceedings of the Measuring, Modelling and Evaluation of Computer and Communication Systems (MMB), 14th GI/ITG Conference, Dortmund, Germany, 31 March–2 April 2008; pp. 1–15. [Google Scholar]
  34. Saldana, J.; Forcen, I.; Fernandez-Navajas, J.; Ruiz-Mas, J. Improving network efficiency with Simplemux. In Proceedings of the IEEE International Conference on Computer and Information Technology, Liverpool, UK, 26–28 October 2015; IEEE: Piscataway, NJ, USA, 2015. [Google Scholar] [CrossRef]
  35. Stewart, R. RFC 4960: Stream Control Transport Protocol; RFC Editor: Wilmington, DE, USA, 2007. [Google Scholar] [CrossRef]
  36. Stewart, R.; Tüxen, M.; Nielsen, K. RFC 9260: Stream Control Transmission Protocol; RFC Editor: Wilmington, DE, USA, 2022. [Google Scholar] [CrossRef]
  37. Islam, S.; Welzl, S.; Fladby, T. Real-Life Implementation and Evaluation of Coupled Congestion Control for WebRTC Media and Data Flows. IEEE Access 2022, 10, 95046–95066. [Google Scholar] [CrossRef]
  38. Syam Kumar, S.; Sumesh, T.A. A New Congestion Control Algorithm for SCTP. In Proceedings of the Advances in Machine Learning and Computational Intelligence, ICMLCI, Aldershot, UK, 22–24 August 2019; Springer: Singapore, 2021. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.