WDM网络中基于多核心的组播路由算法

A multicast routing algorithm with multiple kernels in WDM networks

提出了一种WDM网络中组播的分布式路由算法。该算法是一种基于核心树的算法,其关键是找到一个核心节点集,使得以该核心节点集为树根、包含组中所有节点的树满足延迟时限的要求,同时使树的成本尽量小。算法首先根据目的节点确定组中的核心节点集,并生成核心节点内部的稳定树;然后以核心节点集为树根构造包含所有目的节点的组播核心树。由于采用了分布式的方法建立核心树,并且采用的是多个核心,所以在一定程度上减少了建立组播树所需要的时间,并且有效地解决了系统在核心处的瓶颈问题。

A distributed multicast routing algorithm for WDM networks is brought forward,which is based on core-based tree.The main point of this algorithm is to find a collection of core nodes,which enables the tree to meet the delay bound,meanwhile reduces cost as much as possible.The algorithm first determines core nodes collection through destination nodes and creates stable tree inside the core nodes collection,then it constructs multicast tree containing all destination nodes.The tree's root is the core node collection.The tree with multiple cores is constructed in a distributed way,therefore,to a certain degree,the time of constructing a Multicast Tree is reduced,and meanwhile the bottleneck problem in the dominating part of the system is addressed efficiently.