基于共享备份路径保护的以太网鲁棒QoT保证资源分配
Robust QoT Assured Resource Allocation in Shared Backup Path Protection Based EONs
摘要：
弹性光网络（EON）承载着大量的数据，生存性是其关键任务。在本文中，我们考虑的问题，设计共享备份路径保护（SBPP）的EON，有利于最低的传输质量（QoT）保证分配对物理层损伤（PLIs）下的任何单一链路/共享风险链路组（SRLG）的静态和动态流量的情况下失败。一般来说，PLI对光路的影响会因链路故障的位置而异，因为它会引入不同的活动工作路径和备用路径。为了解决这些问题的SBPP EON的设计，我们制定了一个基于混合整数线性规划（MILP）的鲁棒优化框架的静态流量的目标是最大限度地减少整体碎片。在这个过程中，我们使用有效的比特加载技术的频谱分配的第一次生存的EONs。此外，我们提出了一种新的SBPP损伤感知（SBPP-IA）算法考虑MILP的局限性，为大型网络。为此，我们引入了一种新的排序技术命名为最拥挤的工作，最不拥挤的备份第一（MCW-LCBF）排序给定的静态请求集。接下来，我们采用我们的SBPP-IA算法的动态流量的情况下，并比较它与现有的算法在不同的QoT参数。我们通过模拟证明，我们的研究提供了比现有的多40%的QoT保证请求。
英文摘要：
Survivability is mission-critical for elastic optical networks (EONs) as they are expected to carry an enormous amount of data. In this paper, we consider the problem of designing shared backup path protection (SBPP) based EON that facilitates the minimum quality-of-transmission (QoT) assured allocation against physical layer impairments (PLIs) under any single link/shared risk link group (SRLG) failure for static and dynamic traffic scenarios. In general, the effect of PLIs on lightpath varies based on the location of failure of a link as it introduces different active working and backup paths. To address these issues in the design of SBPP EON, we formulate a mixed integer linear programming (MILP) based robust optimization framework for static traffic with the objective of minimizing overall fragmentation. In this process, we use the efficient bitloading technique for spectrum allocation for the first time in survivable EONs. In addition, we propose a novel SBPP-impairment aware (SBPP-IA) algorithm considering the limitations of MILP for larger networks. For this purpose, we introduce a novel sorting technique named most congested working-least congested backup first (MCW-LCBF) to sort the given set of static requests. Next, we employ our SBPP-IA algorithm for dynamic traffic scenario and compare it with existing algorithms in terms of different QoT parameters. We demonstrated through simulations that our study provides around 40% more QoT guaranteed requests compared to existing ones.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
