English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 12115839      Online Users : 743
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/4748


    Title: A genetic algorithm for multicast routing under delay constraint in WDM network with different light splitting
    Authors: M. T. Chen;S. S. Tseng
    Contributors: Department of Information Science and Applications
    Keywords: genetic algorithm;multicast routing;WDM network;delay constraint;splitting degree;NP-hard
    Date: 2005-01
    Issue Date: 2009-11-30 16:03:23 (UTC+8)
    Publisher: Asia University
    Abstract: 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.
    Relation: Journal of Information Science and Engineering 21:85-108
    Appears in Collections:[行動商務與多媒體應用學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    0KbUnknown288View/Open
    310904400-4748.doc40KbMicrosoft Word321View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback