In smart grid, power grid and communication network are interdependent. With this interdependence, a failure in one network may lead to a cascade of failures across the networks. Considering such failures, we develop a model to determine communication route failure probability and quantify its impact in term of lost load. We formulate an optimization to find the set of optimal routes that minimize the impact triggered by an initial route failure. Unfortunately, the optimization is NP-hard and relies on a non-trivial algorithm to calculate the amount of lost load. We further transform the optimization into a dynamic programming problem using the Bellman’s optimality equation. We propose a Gauss-Seidel value iteration algorithm to solve the dynamic programming problem. Simulation results confirm that the proposed algorithm can accurately find the set of optimal routes. For a network configuration with 7 power nodes and 22 routers, the algorithm can efficiently find optimal routes in 2.4 seconds while solving the original optimization takes more than 48 hours.

中文翻译：

---

具有相互依存电网的通信网络中的路由

在智能电网中，电网和通信网络是相互依存的。由于这种相互依存关系，一个网络中的故障可能会导致整个网络上的一系列故障。考虑到此类故障，我们开发了一个模型来确定通信路由故障概率，并根据负载损失来量化其影响。我们制定了一种优化措施，以找到最佳路线集，以将初始路线故障触发的影响降至最低。不幸的是，该优化是NP难的，并且依赖于非平凡的算法来计算损失的负载量。我们使用Bellman最优性方程将优化进一步转化为动态规划问题。我们提出了一种Gauss-Seidel值迭代算法来解决动态规划问题。仿真结果表明，该算法可以准确地找到最优路径集。对于具有7个电源节点和22个路由器的网络配置，该算法可以在2.4秒内有效地找到最佳路由，同时解决原始优化需要48小时以上的时间。