Algorithm for protecting light-trees in survivable mesh wavelength-division-multiplexing networks
Algorithm for protecting light-trees in survivable mesh wavelength-division-multiplexing networks
复制标题
DOI：
10.1364/jon.5.001071
复制
发表时间：
2006-12
影响因子：
--
通讯作者：
Hongbin Luo;Le Min Li;Hongfang Yu
中科院分区：
文献类型：
--
作者：
Hongbin Luo;Le Min Li;Hongfang Yu
波分复用（WDM）技术有望促进带宽密集型多播应用，如高清晰度电视。然而，WDM网状网络中的单根光纤切断可能会破坏基于光树的多播会话上到多个目的地的信息传播。因此，通过预留冗余资源来保护组播会话是非常必要的。提出了一种新的有效的光树保护算法。该算法被称为基于段的保护与姐妹节点优先（SSNF），其基本思想是使用一组具有较高优先级的备份段来保护从分支点到其子节点（姐妹节点）的段。SSNF算法与文献中提出的段保护方案的不同之处在于如何识别和保护段。我们的目标是最小化用于保护每个主要光树的网络资源，从而可以最小化阻塞概率。为了验证SSNF算法的有效性，我们进行了大量的仿真实验。仿真结果表明，SSNF算法优于现有的算法相同的问题。
Wavelength-division-multiplexing (WDM) technology is expected to facilitate bandwidth-intensive multicast applications such as high-definition television. A single fiber cut in a WDM mesh network, however, can disrupt the dissemination of information to several destinations on a light-tree based multicast session. Thus it is imperative to protect multicast sessions by reserving redundant resources. We propose a novel and efficient algorithm for protecting light-trees in survivable WDM mesh networks. The algorithm is called segment-based protection with sister node first (SSNF), whose basic idea is to protect a light-tree using a set of backup segments with a higher priority to protect the segments from a branch point to its children (sister nodes). The SSNF algorithm differs from the segment protection scheme proposed in the literature in how the segments are identified and protected. Our objective is to minimize the network resources used for protecting each primary light-tree such that the blocking probability can be minimized. To verify the effectiveness of the SSNF algorithm, we conduct extensive simulation experiments. The simulation results demonstrate that the SSNF algorithm outperforms existing algorithms for the same problem.