English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 12216480      Online Users : 680
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/18873


    Title: Ant Colony Optimization for Dynamic Routing and Wavelength Assignment in WDM Networks with Sparse Wavelength Conversion
    Authors: 曾憲雄;Tseng, Shian-Shyong
    Contributors: 資訊多媒體應用學系
    Keywords: Routing and wavelength assignment;Communication cost;Delay bound;Approximate solution;Ant colony optimization
    Date: 2010
    Issue Date: 2012-11-26 15:09:59 (UTC+8)
    Abstract: Since optical WDM networks are becoming one of the alternatives for building up backbones, dynamic routing, and wavelength assignment with delay constraints (DRWA-DC) in WDM networks with sparse wavelength conversions is important for a communication model to route requests subject to delay bounds. Since the NP-hard minimum Steiner tree problem can be reduced to the DRWA-DC problem, it is very unlikely to derive optimal solutions in a reasonable time for the DRWA-DC problem. In this paper, we circumvent to apply a meta-heuristic based upon the ant colony optimization (ACO) approach to produce approximate solutions in a timely manner. In the literature, the ACO approach has been successfully applied to several well-known combinatorial optimization problems whose solutions might be in the form of paths on the associated graphs. The ACO algorithm proposed in this paper incorporates several new features so as to select wavelength links for which the communication cost and the transmission delay of routing the request can be minimized as much as possible subject to the specified delay bound. Computational experiments are designed and conducted to study the performance of the proposed algorithm. Comparing with the optimal solutions found by an ILP formulation, numerical results evince that the ACO algorithm is effective and robust in providing quality approximate solutions to the DRWA-DC problem.
    Relation: ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE,24(2):295–305.
    Appears in Collections:[行動商務與多媒體應用學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML312View/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