English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6507/11669
造訪人次 : 29946292      線上人數 : 628
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/9933

題名: A Genetic Algorithm for Solving Virtual Topology Configuration Transition Problem in WDM Network
作者: Din, Der-Rong
貢獻者: 資訊工程系
關鍵詞: Genetic algorithm;Virtual topology reconfiguration;Wavelength-division multiplexing (WDM)
日期: 2007-02
上傳時間: 2012-04-30T04:32:25Z
出版者: Elsevier BV
摘要: Wavelength-division multiplexing (WDM) technology has emerged as a promising technology for backbone networks. The set of all-optical communication channels (lightpaths) in the optical layer defines the virtual topology for the upper layer applications. Since the traffic demand of upper layer applications fluctuates from time to time, it is required to reconfigure the underlying virtual topology in the optical layer accordingly. However, the reconfiguration for the virtual topology is reluctantly disruptive to the network since some lightpaths should be torn down and some traffic has to be buffered or rerouted during the reconfiguration process. Therefore, it needs to have an efficient transition method to shift the current virtual topology to the new one so as to minimize the effect of the reconfiguration on the upper layer traffic.

In this paper, the WDM virtual topology configuration transition problem (WVTCTP) which minimizes the average weighted hop distance is studied. Since the WVTCTP is NP-hard, a genetic algorithm (GA) is proposed to solve it. Simulated results show that the proposed GA can get better performance than heuristic, simulated annealing, and iterative improving methods.
關聯: Computer Communications, 30(4): 767-781
顯示於類別:[資訊工程學系] 期刊論文

文件中的檔案:

檔案 大小格式瀏覽次數
index.html0KbHTML641檢視/開啟


在NCUEIR中所有的資料項目都受到原著作權保護.

 


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