Abstract
In this paper, we propose a path restoration algorithm for a single fiber fault in the WDM network equipped with wavelength conversion. The Integer Linear Programming (ILP) formulas for minimizing the path recovery cost can yield the optimum solution but it is NP-complete. Our heuristic algorithm relaxes the complexity by two steps. In the off-line step, the node-link topology is replaced by the node-wavelength topology, the alternate paths for source-destination node pairs are listed, and the wavelengths in each link are assigned by maximum matching. In the on-line step, traffics going through the failed link are split into subtraffics and are restored according to their priorities. The performance analysis and the simulation results indicate that our heuristic algorithm is practical for WDM networks restoration.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1423-1427 |
| Number of pages | 5 |
| Journal | IEEE International Conference on Communications |
| Volume | 2 |
| State | Published - 2003 |
| Event | 2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States Duration: May 11 2003 → May 15 2003 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Electrical and Electronic Engineering