Achieving resource reduction for protecting multicast sessions in WDM mesh networks
Achieving resource reduction for protecting multicast sessions in WDM mesh networks
复制标题
减少资源以保护 WDM 网状网络中的多播会话
DOI：
10.1007/s11107-007-0102-1
复制
发表时间：
2008-04
影响因子：
1.7
通讯作者：
中科院分区：
文献类型：
--
作者：
波分复用（WDM）技术的发展，通过建立以源节点为根节点、包含所有目的节点的光树，使带宽密集型多播应用更加方便。光树对故障敏感，例如，单个光纤切断可能中断到几个目的地节点的信息传输。因此，保护多播会话势在必行。在这项工作中，我们研究的问题，保护动态组播会话在网状WDM网络对单链路故障。我们的目标是最大限度地减少网络资源的使用波长链路提供生存组播会话，并降低组播会话阻塞概率。本文提出了两种有效的组播会话保护算法，即基于最优路径对的剩余链路删除算法（OPP-RRL）和基于源叶路径的剩余链路避免算法（SLP-ARL）。为了评估所提出的算法，我们应用非线性规划（ILP）来生成最优解。我们还比较了所提出的算法与现有的算法，通过仿真。仿真结果表明，提出的两种算法在波长链路需求和网络阻塞率方面都优于现有的算法。此外，所提出的两种算法产生的解决方案是相当接近的解决方案ILP所需的波长链路的数量，当网络规模较小。
The advances in wavelength division multiplexing (WDM) technology are expected to facilitate bandwidth-intensive multicast application by establishing a light-tree, which regards the source node as the root, and involves all the destination nodes. The light-tree is sensitive to failures, e.g., a single fiber cut may disrupt the transmission of information to several destination nodes. Thus, it is imperative to protect multicast sessions. In this work, we investigate the problem of protecting dynamic multicast sessions in mesh WDM networks against single link failures. Our objectives are to minimize the usage of network resources in terms of wavelength links for provisioning survivable multicast session, and to reduce the multicast session blocking probability. We propose two efficient multicast session protecting algorithms, called Optimal Path Pair based Removing Residual Links (OPP-RRL) and Source Leaf Path based Avoiding Residual Links (SLP-ARL), which try to reduce the usage of network resource by removing or avoiding residual links in the topology consisting of light-tree and its backup paths. To evaluate the proposed algorithms, we apply Integer Linear Programming (ILP) to generate an optimal solution. We also compare the proposed algorithms with existing algorithms through simulation. Simulation results indicate that the two proposed algorithms have better performance than other existing algorithms in terms of wavelength links required and network blocking probability. Furthermore, the solutions generated by the two proposed algorithms are quite close to the solutions generated by ILP in terms of the number of wavelength links required, when the network size is small.
登录
查看更多内容
DOI：
10.1109/infcom.1999.751461
发表时间：
1999-03
期刊：
IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)
影响因子：
--
作者：
S. Ramamurthy;B. Mukherjee
通讯作者：
S. Ramamurthy;B. Mukherjee
DOI：
10.1109/icc.1997.605230
发表时间：
1997-06
期刊：
Proceedings of ICC'97 - International Conference on Communications
影响因子：
--
作者：
Cheng-Shong Wu;Steven S. W. Lee;Y. Hou
通讯作者：
Cheng-Shong Wu;Steven S. W. Lee;Y. Hou
DOI：
10.1109/35.747251
发表时间：
1999-02
期刊：
IEEE Commun. Mag.
影响因子：
--
作者：
L. Sahasrabuddhe;B. Mukherjee
通讯作者：
L. Sahasrabuddhe;B. Mukherjee
影响因子：
4.7
作者：
N. Singhal;L. Sahasrabuddhe;B. Mukherjee
通讯作者：
N. Singhal;L. Sahasrabuddhe;B. Mukherjee
DOI：
10.1016/j.comnet.2005.05.024
发表时间：
2006-02
期刊：
Comput. Networks
影响因子：
--
作者：
N. Singhal;Canhui Ou;B. Mukherjee
通讯作者：
N. Singhal;Canhui Ou;B. Mukherjee