Virtual topology reconfiguration problem on survivable WDM networks

研究成果: Conference contribution

摘要

In this paper, the Virtual Topology Reconfiguration Problem (VTRP) on survivable WDM networks with reconfiguration constraint is studied. Given a physical topology, a dedicated path-protected virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure the current virtual topology under the pre-specified reconfiguration constraint such that the objective value can be minimized. The objective value considered in this paper is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical when the reconfiguration constraint is larger. In this paper, a simulated annealing (SA) and a genetic algorithm (GA) are proposed to solve this problem. Experiment results of these algorithms are also given.

原文English
主出版物標題3rd International Conference on Communications and Networking in China, ChinaCom 2008
頁面804-808
頁數5
DOIs
出版狀態Published - 2008 十二月 1
事件3rd International Conference on Communications and Networking in China, ChinaCom 2008 - Hangzhou, China
持續時間: 2008 八月 252008 八月 27

出版系列

名字3rd International Conference on Communications and Networking in China, ChinaCom 2008

Other

Other3rd International Conference on Communications and Networking in China, ChinaCom 2008
國家China
城市Hangzhou
期間08-08-2508-08-27

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

指紋 深入研究「Virtual topology reconfiguration problem on survivable WDM networks」主題。共同形成了獨特的指紋。

  • 引用此

    Din, D. R. (2008). Virtual topology reconfiguration problem on survivable WDM networks. 於 3rd International Conference on Communications and Networking in China, ChinaCom 2008 (頁 804-808). [4685146] (3rd International Conference on Communications and Networking in China, ChinaCom 2008). https://doi.org/10.1109/CHINACOM.2008.4685146