Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks
Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks
复制标题
DOI：
10.1109/jlt.2003.819550
复制
发表时间：
2003-11
影响因子：
4.7
通讯作者：
N. Singhal;L. Sahasrabuddhe;B. Mukherjee
中科院分区：
文献类型：
--
作者：
N. Singhal;L. Sahasrabuddhe;B. Mukherjee
在本文中，我们研究了在网状网络中建立多播会话的方法和算法，同时保护会话免受任何单个链路故障的影响，例如，在光网络中切断的光纤。首先，我们研究这些方法和算法，以保护一个单一的多播树在网状网络中，然后将其扩展到动态提供生存的多播连接（连接来和去）在光波分复用（WDM）网络。我们提出了两种新的和有效的方法来保护组播会话：1）段保护，我们分别保护主树中的每个段（而不是整个树），并允许这些备份段与其他现有的主要和备份段共享边缘，以及2）路径对保护，其中我们找到路径对（不相交的主路径和备用路径）到每个目的地，并允许新的路径对与已经找到的路径对共享边缘。与以前的方案，如寻找链路不相交树和弧不相交树，我们的新方案1）保证解决方案，以前的计划失败，2）找到一个有效的解决方案，需要更少的网络资源。我们系统地研究这些方法和算法，从现有的方法，如完全链路不相交和弧不相交树，然后提出我们的新的和有效的建议的方法，如段不相交和路径不相交的计划，保护组播连接。我们最有效的算法，基于路径对保护方案，称为最优路径对为基础的共享不相交路径（OPP-SDP）算法，找到一个解决方案，如果这样的解决方案存在，并优于所有其他计划的网络成本。我们还表明，OPP-SDP执行接近的最佳解决方案，通过解决一个整数线性规划表示的问题的数学公式。建立在保护一棵树的研究，我们进行模拟，采用上述保护方案，研究动态供应的生存组播会话（会话来和去）在WDM网状网络。我们的模拟结果表明，最有效的方案，OPP-SDP，具有最小的阻塞概率。
In this paper, we investigate approaches and algorithms for establishing a multicast session in a mesh network while protecting the session against any single link failure, e.g., a fiber cut in an optical network. First, we study these approaches and algorithms to protect a single multicast tree in a mesh network and then extend it to dynamically provision survivable multicast connections (where connections come and go) in an optical wavelength-division multiplexing (WDM) network. We propose two new and efficient approaches for protecting a multicast session: 1) segment protection in which we protect each segment in the primary tree separately (rather than the entire tree) and allow these backup segments to share edges with the other existing primary and backup segments and 2) the path-pair protection in which we find a path-pair (disjoint primary and backup paths) to each destination and allow a new path pair to share edges with already-found path pairs. Unlike previous schemes, such as finding link-disjoint trees and arc-disjoint trees, our new schemes 1) guarantee a solution where previous schemes fail and 2) find an efficient solution requiring less network resources. We study these approaches and algorithms systematically, starting with the existing approaches such as fully link-disjoint and arc-disjoint trees and then presenting our new and efficient proposed approaches, such as segment-disjoint and path-disjoint schemes for protecting multicast connections. Our most efficient algorithm, based on the path-pair protection scheme, called optimal path-pair-based shared disjoint paths (OPP-SDP) algorithm, finds a solution if such a solution exists and outperforms all the other schemes in terms of network cost. We also show that OPP-SDP performs close to the optimal solution obtained by solving a mathematical formulation of the problem expressed as an integer linear program. Building upon the study on protecting a single tree, we perform simulations, employing the above protection schemes, to study dynamic provisioning of survivable multicast sessions (where sessions come and go) in a WDM mesh network. Our simulations show that the most efficient scheme, OPP-SDP, has minimum blocking probability.