Loading...
|
Please use this identifier to cite or link to this item:
http://ir.ncue.edu.tw/ir/handle/987654321/9933
|
| Title: | A Genetic Algorithm for Solving Virtual Topology Configuration Transition Problem in WDM Network |
| Authors: | Din, Der-Rong |
| Contributors: | 資訊工程系 |
| Keywords: | Genetic algorithm;Virtual topology reconfiguration;Wavelength-division multiplexing (WDM) |
| Date: | 2007-02
|
| Issue Date: | 2012-04-30T04:32:25Z
|
| Publisher: | Elsevier BV |
| Abstract: | 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. |
| Relation: | Computer Communications, 30(4): 767-781 |
| Appears in Collections: | [資訊工程學系] 期刊論文
|
Files in This Item:
| File |
Size | Format | |
|---|
| index.html | 0Kb | HTML | 449 | View/Open |
|
All items in NCUEIR are protected by copyright, with all rights reserved.
|
