Multicast routing with power consideration in sparse splitting WDM networks

Multicast routing with power consideration in sparse splitting WDM networks
复制标题

DOI:
10.1109/icc.2001.936993
复制
发表时间:
2001
期刊:
ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240)
影响因子:
--
通讯作者:
Kun-da Wu;Jieh-Chian Wu;Chu-Sing Yang
Kun-da Wu;Jieh-Chian Wu;Chu-Sing Yang
中科院分区:
其他
文献类型:
--
作者:
Kun-da Wu;Jieh-Chian Wu;Chu-Sing Yang

文献摘要

被引文献

相似文献

在WDM网络中支持组播通信已成为一个重要而有吸引力的课题。我们研究了WDM网络中考虑功率的受限多播路由,其中功率衰减是由于(I)级联扇出(分裂)的数目,以及(Ii)从源节点到任何多播成员的传播。我们提出了一种称为集中式分裂算法的启发式算法来重构由仅成员算法建立的多播路由路径,该算法能够在具有稀疏分裂约束的多播路由构造中提供最佳的带宽和波长利用率。与仅成员算法相比,集中式分裂算法(I)没有显著增加时间复杂度,特别是在组播组规模较大的情况下;(Ii)在保持适当的带宽、波长使用和时延要求的同时,平均可以降低高达17%的功率损耗。
Supporting multicast communications in WDM networks has become an important and attractive topic. We study constrained multicast routing with power consideration in WDM networks, where power is attenuated due to (i) the number of concatenated fanouts (splitting), and (ii) the propagation from source node to any multicast member. We propose a heuristic algorithm called centralized-splitting algorithm to re-construct the multicast routing paths established by the member-only algorithm, which can provide the best bandwidth and wavelength usage in the multicast routing construction with sparse splitting constraint. In comparison to the member-only algorithm, the centralized-splitting algorithm (i) does not increase the time complexity significantly, especially when the size of multicast group is large; (ii) can reduce the power loss up to 17% in average, while it still maintains proper bandwidth, wavelength usage and delay requirements.