Constraint routing and regenerator site concentration in ROADM networks
Constraint routing and regenerator site concentration in ROADM networks
复制标题
DOI：
10.1364/jocn.5.001202
复制
发表时间：
2013-11
期刊：
影响因子：
--
通讯作者：
B. Bathula;R. Sinha;A. Chiu;M. Feuer;Guangzhi Li;S. Woodward;Weiyi Zhang;R. Doverspike;P. Magill;K. Bergman
中科院分区：
文献类型：
--
作者：
B. Bathula;R. Sinha;A. Chiu;M. Feuer;Guangzhi Li;S. Woodward;Weiyi Zhang;R. Doverspike;P. Magill;K. Bergman
无色和非定向可重构光分插复用器（ROADM）的发展进步使未来光网络中的光电再生器（整形，重定时和重放大，称为3R）的灵活预部署成为可能。与目前仅在电路需要时安装再生器的做法相比，在特定站点预先部署再生器将使服务提供商能够实现快速供应，例如按需带宽服务和快速恢复。将再生器的预部署集中在ROADM站点的子集中将实现高利用率并降低网络运营成本。我们证明了由此产生的优化问题是NP难的，并提供了证明。我们提出了一个有效的启发式考虑到单独的电路（再生器成本和传输线系统成本）和再生器站点的数量的成本为这个问题。我们验证了我们的启发式方法与整数线性规划（ILP）配方的一个小网络。使用特定的网络示例，我们表明，我们的启发式算法在大多数研究的场景和成本模型下具有接近最佳的性能。我们进一步增强了启发式，将每个电路的需求的概率。这使得再生器站点的数量减少，允许电路使用成本较高的路径，如果他们有较低的概率被需要。我们还评估的启发式，以确定额外的再生器网站需要支持不同的路由。在本文中，我们提供了详细的分析，伪代码，并证明了我们以前的工作中提出的模型[国家光纤工程师会议，2012，NW3F.6; 9 th Int. Conf. on Design of Reliable Communication Networks（DRCN），2013，139]，并将启发式结果与小规模网络拓扑的ILP进行比较。
Advances in the development of colorless and nondirectional reconfigurable optical add-drop multiplexers (ROADMs) enable flexible predeployment of optoelectronic regenerators (reshaping, retiming, and reamplifying known as 3R) in future optical networks. Compared to the current practice of installing a regenerator only when a circuit needs them, predeployment of regenerators in specific sites will allow service providers to achieve rapid provisioning such as bandwidth-on-demand service and fast restoration. Concentrating the predeployment of regenerators in a subset of ROADM sites will achieve high utilization and reduces the network operational costs. We prove the resulting optimization problem is NP-hard and provide the proof. We present an efficient heuristic for this problem that takes into account both the cost of individual circuits (regenerator cost and transmission line system cost) and the number of regenerator sites. We validate our heuristic approach with integer linear programming (ILP) formulations for a small network. Using specific network examples, we show that our heuristic has near-optimal performance under most studied scenarios and cost models. We further enhance the heuristic to incorporate the probability of demand for each circuit. This enables a reduction in the number of regenerator sites by allowing circuits to use costlier paths if they have lower probability of being needed. We also evaluate the heuristic to determine the extra regenerator sites required to support diverse routing. In this paper, we provide detailed analysis, pseudocodes, and proofs for the models presented in our previous work [Nat. Fiber Optic Engineers Conf., 2012, NW3F.6; 9th Int. Conf. on Design of Reliable Communication Networks (DRCN), 2013, 139] and compare the heuristic results with ILP for a small-scale network topology.