題名: A genetic algorithm for multicast routing under delay constraint in WDM network with different light splitting
作者: M. T. Chen;S. S. Tseng
貢獻者: Department of Information Science and Applications 關鍵詞: genetic algorithm;multicast routing;WDM network;delay
constraint;splitting degree;NP-hard 日期: 2005-01
上傳時間: 2009-11-30T08:03:23Z 出版者: Asia University
摘要: Because optical WDM networks will become a realistic choice for buildings backbones, multicasting in the WDM network should be supported for various network applications. In this paper, a new multicast problem, Multicast Routing under Delay Constraint Problem (MRDCP), routing a request with delay bound to all destinations in a WDM network with different light splitting is solved by genetic
algorithms (GAs), where different light splitting means that nodes in the network can transmit one copy or multiple copies to other nodes by using the same wavelength. The MRDCP can be reduced to the Minimal Steiner Tree Problem (MSTP) which has been shown to be NP-Complete.
We propose a destination-oriented representation to represent chromosomes, three general genetic operators (selection, crossover, and mutation), four types of operators (Chromosome Crossover, Individual Crossover, Chromosome Mutation, and Individual Mutation).
Four mutation heuristics (Random Mutation (RM), Cost First Mutation (CFM), Delay First Mutation (DFM), and Hybrid Mutation (HM)) are employed in the GA method. Finally, experimental results show that our solution model can obtain a near optimal solution.
