Abstract
In a Wavelength Division Multiplexing (WDM) network, the performance of the virtual topology designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration. Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability and reconfiguration is an important issue in WDM networks. In this paper, the Virtual Topology Reconfiguration Problem (VTRP) on WDM networks with a reconfiguration constraint is studied. Given the physical topology, dedicated path-protection virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure current virtual topology under the pre-specified reconfiguration constraint (r, a positive integer) so that the objective value can be minimized. The objective cost of VTRP 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 r is larger, two heuristic algorithms are proposed to solve this problem. They are Positive Reconfiguration Heuristic Algorithm (PRHA) and Conservative Reconfiguration Heuristic Algorithm (CRHA). Experimental results of these algorithms are also given.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009 |
| Pages | 211-218 |
| Number of pages | 8 |
| DOIs | |
| Publication status | Published - 2009 Nov 19 |
| Event | 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009 - Chengdu, Sichuan, China Duration: 2009 Aug 9 → 2009 Aug 12 |
Publication series
| Name | Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009 |
|---|
Other
| Other | 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009 |
|---|---|
| Country | China |
| City | Chengdu, Sichuan |
| Period | 09-08-09 → 09-08-12 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Software
Cite this
}
Survivable virtual topology reconfiguration problem on WDM networks with reconfiguration constraint. / Din, Der-Rong; Chiu, Yu Sheng.
Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009. 2009. p. 211-218 5207931 (Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Survivable virtual topology reconfiguration problem on WDM networks with reconfiguration constraint
AU - Din, Der-Rong
AU - Chiu, Yu Sheng
PY - 2009/11/19
Y1 - 2009/11/19
N2 - In a Wavelength Division Multiplexing (WDM) network, the performance of the virtual topology designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration. Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability and reconfiguration is an important issue in WDM networks. In this paper, the Virtual Topology Reconfiguration Problem (VTRP) on WDM networks with a reconfiguration constraint is studied. Given the physical topology, dedicated path-protection virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure current virtual topology under the pre-specified reconfiguration constraint (r, a positive integer) so that the objective value can be minimized. The objective cost of VTRP 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 r is larger, two heuristic algorithms are proposed to solve this problem. They are Positive Reconfiguration Heuristic Algorithm (PRHA) and Conservative Reconfiguration Heuristic Algorithm (CRHA). Experimental results of these algorithms are also given.
AB - In a Wavelength Division Multiplexing (WDM) network, the performance of the virtual topology designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration. Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability and reconfiguration is an important issue in WDM networks. In this paper, the Virtual Topology Reconfiguration Problem (VTRP) on WDM networks with a reconfiguration constraint is studied. Given the physical topology, dedicated path-protection virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure current virtual topology under the pre-specified reconfiguration constraint (r, a positive integer) so that the objective value can be minimized. The objective cost of VTRP 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 r is larger, two heuristic algorithms are proposed to solve this problem. They are Positive Reconfiguration Heuristic Algorithm (PRHA) and Conservative Reconfiguration Heuristic Algorithm (CRHA). Experimental results of these algorithms are also given.
UR - http://www.scopus.com/inward/record.url?scp=70449486828&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449486828&partnerID=8YFLogxK
U2 - 10.1109/ISPA.2009.8
DO - 10.1109/ISPA.2009.8
M3 - Conference contribution
AN - SCOPUS:70449486828
SN - 9780769537474
T3 - Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009
SP - 211
EP - 218
BT - Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009
ER -