A New Heuristic for Monitoring Trail Allocation in All-Optical WDM Networks
A New Heuristic for Monitoring Trail Allocation in All-Optical WDM Networks
复制标题
DOI：
10.1109/glocom.2010.5683217
复制
发表时间：
2010-12
期刊：
影响因子：
--
通讯作者：
Yangming Zhao;Shizhong Xu;Xiong Wang;Sheng Wang
中科院分区：
文献类型：
--
作者：
Yangming Zhao;Shizhong Xu;Xiong Wang;Sheng Wang
研究了全光WDM网状网中的m-trail（monitoring trail）分配问题，以实现快速、明确的链路故障定位。现有的ILP算法在大规模网络中不适用。启发式RCA+RCS算法可以在较短的运行时间内找到可行解，但它是一种随机算法。更重要的是，RCA+RCS遭受不相交的线索问题，这大大增加了大型网络中所需的监视器的数量。在本文中，我们提出了一个新的启发式MTA（监控路径分配）来解决这个问题。MTA避免了RCA+RCS中的这些问题，并实现了监视器成本和带宽成本之间的有效权衡。与RCA+RCS相比，MTA大大缩短了运行时间，获得了更高的解质量。我们还表明，MTA提供了一个灵活的框架，使未来的研究多种可能的变化。
We study the m-trail (monitoring trail) allocation problem in all-optical WDM mesh networks for achieving fast and unambiguous link failure localization. The existing ILP is not feasible for solving the problem in large-size networks. A heuristic RCA+RCS can find feasible solutions in a shorter running time, but it is a randomized algorithm. More importantly, RCA+RCS suffers from the disjoint trail problem which dramatically increases the number of required monitors in large-size networks. In this paper, we propose a new heuristic MTA (Monitoring Trail Allocation) to solve the problem. MTA avoids those issues in RCA+RCS, and achieves an efficient tradeoff between monitor cost and bandwidth cost. Compared with RCA+RCS, MTA greatly shortens the running time and achieves a much higher solution quality. We also show that MTA provides a flexible framework to enable multiple possible variations for future study.