English  |  正體中文  |  简体中文  |  Items with full text/Total items : 92472/107769 (86%)
Visitors : 19029780      Online Users : 578
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/4760

    Title: Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities
    Authors: M. T. Chen;S. S. Tseng;B. M. T. Lin
    Contributors: Department of Information Science and Applications
    Keywords: RWA;Multicast request;WDM network;Delay bound;Light splitting capacity;Multicast cost
    Date: 2005-05
    Issue Date: 2009-11-30 16:03:27 (UTC+8)
    Publisher: Asia University
    Abstract: Because optical WDM networks will be realized as network backbone in the near future, multicasting in WDM networks needs to be supported for various network applications. In this paper, we propose a new dynamic multicast routing problem under delay constraints (DMR-DC) for finding an optimal light-forest with the minimum multicast cost from these links with available wavelengths for routing a multicast request that arrives in random with a given delay bound in a WDM network with heterogeneous light splitting capabilities, where a light-forest is a set of light-trees used to set up switches to route the request. Multicast cost is defined by communication cost ratio and wavelength consumption ratio. The problem is to determine a light-forest with less wavelength consumption and less communication cost. This problem is NP-hard because it can be reduced from the minimum Steiner tree problem. In this paper, we propose an efficient three-phase (generation, refinement, and conversion) solution model to find approximate solutions in a reasonable time.
    Relation: Computer Communications 29(9):1492-1503
    Appears in Collections:[行動商務與多媒體應用學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    310904400-4760.doc40KbMicrosoft Word279View/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