Reliable Communication in Transmission Grids based on Nondisjoint Path Aggregation Using Software-Defined Networking

In electrical transmission grids, the redundant communication paths nondisjointly overlapping at links can be established between certain substations and the control center to guarantee reliable packet delivery under link failures. However, the generation of nondisjoint paths with multiplicative and concave constraints is with the NP-complete complexity and the failovers can lead to out-of-order packets. This paper presents an OpenFlow-based nondisjoint path aggregation mechanism to heuristically compute the constrained nondisjoint paths in a centralized fashion and reorganize the out-of-order packets at edge switches. The solution is evaluated through simulations of the IEEE 30-bus network scenario under 2% link failure rate and the result confirms its effectiveness: the packet delivery success rate is significantly improved in comparison with the current nondisjoint and disjoint path algorithms. TCP throughput is improved by 121.62% with the packet reordering. Also, the memory usage for the packet reordering buffer is reduced by 76.563% compared with the distributed cognitive packet network.

[1]  Stelios Timotheou,et al.  The Random Neural Network: A Survey , 2010, Comput. J..

[2]  Erol Gelenbe,et al.  An End-to-End Approach to the Resequencing Problem , 1984, JACM.

[3]  G. Manimaran,et al.  Reliability constrained routing in QoS networks , 2005, IEEE/ACM Transactions on Networking.

[4]  Eduardo Jacob,et al.  Availability Improvement of Layer 2 Seamless Networks Using OpenFlow , 2015, TheScientificWorldJournal.

[5]  Taskin Koçak,et al.  A Survey on Smart Grid Potential Applications and Communication Requirements , 2013, IEEE Transactions on Industrial Informatics.

[6]  Erol Gelenbe.  Self-aware Networks: The Cognitive Packet Network and Its Performance , 2017, Self-Aware Computing Systems.

[7]  David Eppstein,et al.  K-Best Enumeration , 2014, Bull. EATCS.

[8]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[9]  Jean Maeght,et al.  AC Power Flow Data in MATPOWER and QCQP Format: iTesla, RTE Snapshots, and PEGASE , 2016, 1603.01533.

[10]  R D Zimmerman,et al.  MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education , 2011, IEEE Transactions on Power Systems.

[11]  Hamid Farhadi,et al.  Software-Defined Networking: A survey , 2015, Comput. Networks.

[12]  Subhash Suri,et al.  Finding the k shortest simple paths , 2007, ALENEX.

[13]  Saleh Soltan,et al.  Generation of synthetic spatially embedded power grid networks , 2015, 2016 IEEE Power and Energy Society General Meeting (PESGM).

[14]  Fernando A. Kuipers,et al.  Disjoint Paths in Networks , 2015 .

[15]  Anoop Ghanwani,et al.  Improved Neural Heuristics for Multicast Routing , 1997, IEEE J. Sel. Areas Commun..

[16]  Liam Roditty,et al.  An Experimental Study on Approximating K Shortest Simple Paths , 2011, ESA.

[17]  David Erickson,et al.  The beacon openflow controller , 2013, HotSDN '13.

[18]  Erol Gelenbe,et al.  Steps toward self-aware networks , 2009, CACM.

[19]  Victor O. K. Li,et al.  An Overview of Packet Reordering in Transmission Control Protocol (TCP): Problems, Solutions, and Challenges , 2007, IEEE Transactions on Parallel and Distributed Systems.

[20]  Aaron Bernstein.  A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs , 2010, SODA '10.

[21]  Xin Wang,et al.  FMTCP: A Fountain Code-Based Multipath Transmission Control Protocol , 2012, ICDCS 2012.

[22]  B. Bellur,et al.  Quality-of-service routing using maximally disjoint paths , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[23]  George F. Riley,et al.  The ns-3 Network Simulator , 2010, Modeling and Tools for Network Simulation.

[24]  Jianping Pan,et al.  Enduring Node Failures through Resilient Controller Placement for Software Defined Networks , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[25]  Erol Gelenbe,et al.  Cognitive Packet Network for Bilateral Asymmetric Connections , 2014, IEEE Transactions on Industrial Informatics.

[26]  Christian Wietfeld,et al.  Software-defined networking for Smart Grid communications: Applications, challenges and advantages , 2014, 2014 IEEE International Conference on Smart Grid Communications (SmartGridComm).

[27]  Erol Gelenbe,et al.  Optimizing Secure SDN-Enabled Inter-Data Centre Overlay Networks through Cognitive Routing , 2016, 2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS).

[28]  Bin Wang,et al.  Multicast routing and its QoS extension: problems, algorithms, and protocols , 2000 .

[29]  Miroslav Popovic,et al.  iPRP—The Parallel Redundancy Protocol for IP Networks: Protocol Design and Operation , 2016, IEEE Transactions on Industrial Informatics.

[30]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[31]  Wanlin Pang,et al.  A Graph Based Backtracking Algorithm for Solving General CSPs , 2003, Canadian Conference on AI.

[32]  Thoshitha T. Gamage,et al.  Analyzing the Cyber-Physical Impact of Cyber Events on the Power Grid , 2015, IEEE Transactions on Smart Grid.

[33]  Subhash Suri,et al.  Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[34]  Erol Gelenbe,et al.  Real-Time Traffic over the Cognitive Packet Network , 2016, CN.