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.

中文翻译：

---

使用软件定义网络基于非不相交路径聚合的传输网格中的可靠通信


在输电电网中，可以在某些变电站和控制中心之间建立链路上不相交重叠的冗余通信路径，以保证链路故障时数据包的可靠传输。然而，具有乘法和凹约束的非不相交路径的生成具有 NP 完全复杂性，并且故障转移可能导致数据包乱序。本文提出了一种基于 OpenFlow 的非不相交路径聚合机制，以集中方式启发式计算受约束的非不相交路径，并在边缘交换机重新组织无序数据包。通过对2%链路故障率下的IEEE 30总线网络场景进行仿真评估，结果验证了该方案的有效性：与当前的非不相交和不相交路径算法相比，数据包投递成功率显着提高。通过数据包重新排序，TCP 吞吐量提高了 121.62%。此外，与分布式认知分组网络相比，分组重排序缓冲区的内存使用量减少了76.563%。