Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Algorithms for Delay Bounded Multicast Tree Generation for Multimedia Applications
HiPC '99 Proceedings of the 6th International Conference on High Performance Computing
Virtual Source Based Multicast Routing in WDM Optical Networks
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
A novel algorithm for multimedia multicast routing in a large scale network
Journal of Systems and Software
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
A hybrid method for solving ARWA problem on WDM network
Computer Communications
A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm
Expert Systems with Applications: An International Journal
Group multicast routing problem: A genetic algorithms based approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Traffic Engineered Multicast Content Delivery Without MPLS Overlay
IEEE Transactions on Multimedia
An orthogonal genetic algorithm for multimedia multicast routing
IEEE Transactions on Evolutionary Computation
Genetic algorithms for multiple multicast on WDM ring network
Computer Communications
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
A survey of optical multicast over WDM networks
Computer Communications
IEEE Journal on Selected Areas in Communications
Optimal routing and wavelength assignment in WDM ring networks
IEEE Journal on Selected Areas in Communications
Advances in the management and control of optical Internet
IEEE Journal on Selected Areas in Communications
QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms
Journal of Network and Computer Applications
Hi-index | 0.00 |
Wavelength division multiplexing (WDM) is an important technique to make use of the large amount of bandwidth in optical fibers to meet the bandwidth requirements of applications. Multicast is the transmission of information from one source to multiple destinations simultaneously. Given a multicast request in a WDM network, the goal is to find a set of light trees, the assigned wavelengths of light trees, and construct a light forest. In this paper, the minimal cost multicast routing problem (MCMRP) on WDM networks with tap-and-continue (TaC) nodes is defined and studied. A new cost model which consists of the wavelength usage and communication cost is defined. The objective is to minimize the sum of the cost of used wavelengths and the communication cost of the light forest. Specifically, the formulation for the WDM multicast routing problem is given. Because the MCMRP is NP-hard, two genetic algorithms (GAs) are proposed to solve this problem. In the proposed GAs, a path-oriented encoding chromosome is used to represent the routing paths. These routing paths are used to construct source-based light forests to represent a feasible solution to the multicast request. Moreover, to speed up the convergence of GAs, a farthest-first greedy heuristic algorithm is proposed and used to generate one of the initial chromosomes. Simulation results demonstrate that the proposed GAs can run efficiently.