Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks
Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks
复制标题
DOI：
10.1093/ietcom/e88-b.1.219
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
Johannes Hamonangan Siregar;Yongbing Zhang;H. Takagi
中科院分区：
文献类型：
--
作者：
Johannes Hamonangan Siregar;Yongbing Zhang;H. Takagi
我们考虑大规模波分复用（WDM）光网络的多播路由问题，其中传输请求是由点到多点连接建立的。为了在WDM光网络中实现组播路由，一些节点需要具有分光能力。具有分裂能力的节点可以将传入消息转发到多个输出链路。我们考虑的问题最小化的分裂能力的节点在网络中的一组给定的多播请求的数量。波长的数量是固定的，并且是先验给定的。我们提出了一种遗传算法，利用组合的替代最短路径为给定的组播请求，以尽量减少所需的分裂能力的节点的数量。该算法被检查为两个现实的网络构建的基础上的位置的主要城市在日本茨木县和关东地区。我们的实验结果表明，该算法可以减少10%以上的分裂能力的节点与其他路由算法相比，其中的分裂能力的节点放置的优化是不考虑的。
We consider the multicast routing problem for large-scale wavelength division multiplexing (WDM) optical networks where transmission requests are established by point-to-multipoint connections. To realize multicast routing in WDM optical networks, some nodes need to have light (optical) splitting capability. A node with splitting capability can forward an incoming message to more than one output link. We consider the problem of minimizing the number of split-capable nodes in the network for a given set of multicast requests. The number of wavelengths is fixed and given a priori. We propose a genetic algorithm that exploits the combination of alternative shortest paths for the given multicast requests in order to minimize the number of required split-capable nodes. This algorithm is examined for two realistic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan. Our experimental results show that the proposed algorithm can reduce more than 10% of split-capable nodes compared with other routing algorithms whereby the optimization for the split-capable node placement is not taken into account.