### 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.

Original language | English |
---|---|

Pages (from-to) | 767-781 |

Number of pages | 15 |

Journal | Computer Communications |

Volume | 30 |

Issue number | 4 |

DOIs | |

Publication status | Published - 2007 Feb 26 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Networks and Communications
- Electrical and Electronic Engineering

### Cite this

}

**A genetic algorithm for solving virtual topology configuration transition problem in WDM network.** / Din, Der-Rong.

Research output: Contribution to journal › Article

TY - JOUR

T1 - A genetic algorithm for solving virtual topology configuration transition problem in WDM network

AU - Din, Der-Rong

PY - 2007/2/26

Y1 - 2007/2/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33846575081&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846575081&partnerID=8YFLogxK

U2 - 10.1016/j.comcom.2006.09.009

DO - 10.1016/j.comcom.2006.09.009

M3 - Article

AN - SCOPUS:33846575081

VL - 30

SP - 767

EP - 781

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 4

ER -