arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1012.0027cs.NI
收藏

WDM网络中组播路由中避免不能组播的分支节点

Avoidance of multicast incapable branching nodes for multicast routing in WDM networks

Fen Zhou, Miklos Molnar, Bernard Cousin

摘要:

本文研究了全光波分复用网络中的多播路由问题。为了实现多播会话,由于网络节点的有限扇出,可能必须使用若干光树。虽然已经提出了许多多播路由算法,以减少用于多播会话的波长信道的总数(总成本),在一个光纤链路中所需的波长的最大数量(链路应力)和端到端的延迟是两个参数,这并不总是考虑。最短路径树(SPT)可以得到最优的端到端时延,但它不能直接用于稀疏分光WDM网络中的组播路由。因此,我们提出了一种新的波长路由算法,它试图避免多播不能分支节点(MIB,没有分裂能力的分支节点)在最短路径为基础的组播树,以减少链路压力。该算法保留了最短路径树的好的部分,以减少端到端的延迟。该算法由三个步骤组成:(1)采用DijkstraPro优先级分配算法和节点选择算法,在NSF拓扑中生成的SPT的MIB节点数减少了38%,在USA Longhaul拓扑中减少了46%。(2)采用临界连接和最深分支连接算法对MIB节点进行处理,(3)提出了一种基于距离的光树重连算法来生成多播光树。大量的仿真表明,该算法的效率方面的链路压力和端到端的延迟。

英文摘要:

In this articlewestudy themulticast routing problem in all-opticalWDMnetworks under the spare light splitting constraint. To implement a multicast session, several light-trees may have to be used due to the limited fanouts of network nodes. Although many multicast routing algorithms have been proposed in order to reduce the total number of wavelength channels used (total cost) for a multicast session, the maximum number of wavelengths required in one fiber link (link stress) and the end-to-end delay are two parameters which are not always taken into consideration. It is known that the shortest path tree (SPT) results in the optimal end-to-end delay, but it can not be employed directly for multicast routing in sparse light splitting WDM networks. Hence, we propose a novel wavelength routing algorithm which tries to avoid the multicast incapable branching nodes (MIBs, branching nodes without splitting capability) in the shortest-path-based multicast tree to diminish the link stress. Good parts of the shortest-path-tree are retained by the algorithm to reduce the end-to-end delay. The algorithm consists of tree steps: (1) aDijkstraPro algorithmwith priority assignment and node adoption is introduced to produce a SPT with up to 38% fewer MIB nodes in the NSF topology and 46% fewerMIB nodes in the USA Longhaul topology, (2) critical articulation and deepest branch heuristics are used to process the MIB nodes, (3) a distance-based light-tree reconnection algorithm is proposed to create the multicast light-trees. Extensive simulations demonstrate the algorithm's efficiency in terms of link stress and end-to-end delay.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑