Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
