Reliable and flexible communications for power systems: Fault-tolerant multicast with SDN/OpenFlow
Authors:
- 1 July 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21574952,p. 1-6
Abstract
Our work evaluates the use of software-defined networking (SDN) for reliable communication. Reliable communication has become an important topic in many areas, including energy communication networks or, more generally, automation control networks. Electrical grids are developing into smart grids, which depend heavily on reliability, robustness and optimized resource usage. On the other side, the separation of communication and network control proposed by SDN opens new possibilities for reliable and flexible networks. In this work, we show how OpenFlow, the leading SDN framework, could be used to solve the problem of robust multicast better than existing technologies used by substations. Our solution uses the fast-failover groups feature of OpenFlow to provide one-link fault tolerance with little packet loss and can provide routes that use resources efficiently and are less likely to fail. Robust shortest path routing and minimum spanning tree broadcast routing come as special cases. We also show how this solution can be extended to handle more link failures (even an arbitrary number of them) or to provide more efficient routes.Keywords
This publication has 10 references indexed in Scilit:
- Recovery from link failures in a Smart Grid communication network using OpenFlow2014
- Evaluation of software-defined networking for power systems2014
- Software-defined energy communication networks: From substation automation to future smart grids2013
- FatTire2013
- A Design and Implementation of OpenFlow Controller Handling IP Multicast with Fast Tree Switching2012
- A network in a laptop2010
- An improved LP-based approximation for steiner tree2010
- Multicast routing for multimedia communicationIEEE/ACM Transactions on Networking, 1993
- A faster approximation algorithm for the Steiner problem in graphsInformation Processing Letters, 1988
- Reducibility among Combinatorial Problems1972