Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Optical networks: a practical perspective
Optical networks: a practical perspective
On optiml converter placement in wavelength-routed networks
IEEE/ACM Transactions on Networking (TON)
An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques
IEEE Transactions on Parallel and Distributed Systems
An Expanded Graph Model for MCRWA Problem in WDM Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
Virtual source based multicast traffic routing in IP-over-WDM networks
Journal of High Speed Networks
IEICE - Transactions on Information and Systems
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Light trees: optical multicasting for improved performance in wavelength routed networks
IEEE Communications Magazine
Multipoint communication: a survey of protocols, functions, and mechanisms
IEEE Journal on Selected Areas in Communications
Performance and resource cost comparisons for the CBT and PIM multicast routing protocols
IEEE Journal on Selected Areas in Communications
Optimization of splitting node placement in wavelength-routed optical networks
IEEE Journal on Selected Areas in Communications
QoS-based cooperative algorithm for integral multi-commodity flow problem
Computer Communications
Hi-index | 0.24 |
As WDM technology matures and multicast applications become increasingly popular, supporting multicast at the WDM layer becomes an important and yet challenging topic. In order to reduce the number of wavelength channels to achieve the multicast effectively, switching nodes with light-splitting and wavelength-converting capabilities denoted as virtual source (VS) nodes are developed. In this paper, given a WDM network, a positive integer k and a set of multicast requests, the VS placement (VSP) problem on WDM networks is studied; the goal is to determine the locations of the VS nodes, the multicast routing and assigned wavelengths of multicast requests so as to minimize the number of used wavelength channels. Since the VSP problem is a hard problem, a genetic algorithm (GA) is proposed to solve it. In the proposed GA, a binary-bit array is used to represent the locations of the VS nodes on network. For a given locations of VS nodes, three multicast routing methods: core-based tree (CBT), link-disjoint CBT (LDCBT), and layered graph (LG) are proposed and used to construct the shared tree for multicast requests. In the CBT and LDCBT methods, a multicast tree constructing (MTC) algorithm is used to construct the multicast tree of a given multicast, and a segment-based wavelength assignment (SBWA) algorithm is proposed and used to determine the assigned wavelength of the multicast tree. Moreover, in the proposed GA, several crossover and mutation operators are developed and used to generate offspring. Simulation results show that the proposed GA together with LG or CBT multicast method can get better results.