Robust regenerator allocation in nonlinear flexible-grid optical networks with time-varying data rates
Robust regenerator allocation in nonlinear flexible-grid optical networks with time-varying data rates
复制标题
DOI：
10.1364/jocn.10.000823
复制
发表时间：
2018-09
期刊：
影响因子：
--
通讯作者：
Li Yan;Yuxin Xu;M. Brandt-Pearce;Nishan Dharmaweera;E. Agrell
中科院分区：
文献类型：
--
作者：
Li Yan;Yuxin Xu;M. Brandt-Pearce;Nishan Dharmaweera;E. Agrell
在选定的网络节点子集中预部署再生器使服务提供商能够实现流量需求的快速配置、高利用率和降低的网络运营成本，同时仍然保证光路传输质量。在灵活网格光网络中的带宽可变收发器的支持下，光通道带宽不再是固定的，而是根据实时通信要求不断变化。因此，由于复杂的网络状态，数据速率可变的流量以及灵活网格网络引入的其他新网络特征将使再生器分配变得非常困难。在本文中，我们研究了当流量需求的数据速率是随机变量时如何在灵活网格光网络中稳健地分配再生器以对抗物理层损伤。使用高斯噪声模型和改进的统计网络评估过程框架来表征每个需求的物理层损伤的概率分布，在此基础上提出一种启发式算法来选择一组具有最小阻塞概率的再生站点。与贪婪约束路由再生器分配方法相比，我们的方法以平均少 10% 的再生器站点实现相同的阻塞概率，并且在相同再生器站点数量的情况下，获得的阻塞概率比路由到达方法低两个数量级。
Predeployment of regenerators in a selected subset of network nodes allows service providers to achieve rapid provisioning of traffic demands, high utilization, and reduced network operational costs, while still guaranteeing lightpath quality of transmission. Enabled by bandwidth-variable transceivers in flexible-grid optical networks, optical channel bandwidths are no longer fixed but constantly changing according to real-time communication requirements. Consequently, the data-rate-variable traffic together with other new network features introduced by flexible-grid networks will render the regenerator allocation very difficult due to the complicated network states. In this paper, we investigate how to allocate regenerators robustly in flexible-grid optical networks to combat physical-layer impairments when the data rates of traffic demands are random variables. The Gaussian noise model and a modified statistical network assessment process framework are used to characterize the probabilistic distributions of physical-layer impairments for each demand, based on which a heuristic algorithm is proposed to select a set of regenerator sites with minimum blocking probabilities. Our method achieves the same blocking probabilities with on average 10% less regenerator sites compared with the greedy constrained-routing regenerator allocation method, and obtains blocking probabilities two orders of magnitude lower than that of the routing and reach method with the same number of regenerator sites.