全光网络中跨段故障的子图p-圈形成
Sub-Graph p-cycle formation for span failures in all-Optical Networks
摘要：
p-Cycles提供环形交换速度和网状备用容量效率，以保护网络免受链路故障的影响。这使得它们成为非常有效和高效的保护技术。p-Cycles还可以保护网络中的所有链路，防止多个链路同时发生故障。但目前研究的多是单链路故障情况下的网络，目标是在100%可扩展性的条件下最小化空闲容量。对于大型网络，使用p-圈是困难的，因为它们的优化需要大量的时间，因为相应的线性规划（ILP）中的变量数量随着网络规模的增加而增加。在实时网络环境下，快速建立高效的保护是非常必要的，为此，本文提出了一种网络子图方法，该方法根据网络属性将网络划分为若干个小的部分。然后，为每个子图找到最优解。最后，将所有子图的解组合起来，得到整个网络的次优解。我们取得了更好的计算效率的边际备用容量增加的代价与这种方法。
英文摘要：
p-Cycles offer ring-like switching speed and mesh-like spare capacity efficiency for protecting network against link failures. This makes them extremely efficient and effective protection technique. p-Cycles can also protect all the links in a network against simultaneous failures of multiple links. But it has been mostly studied for single link failure scenarios in the networks with the objective to minimize spare capacity under the condition of100% restorability. For large networks, use of p-cycles is difficult because their optimization requires an excessive amount of time as the number of variables in the corresponding Integer Linear Program (ILP) increase with the increase in the network size. In a real-time network situation,setting up a highly efficient protection in a short time is essential.Thus, we introduce a network sub-graphing approach, in which a network is segmented into smaller parts based on certain network attributes. Then, an optimal solution is found for each sub-graph. Finally, the solutions for all the sub-graphs is combined to get a sub-optimal solution for the whole network. We achieved better computational efficiency at the expense of marginal spare capacity increases with this approach.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
