A New Survivable Heuristic Algorithm Based on Hamiltonian Cycle Protection in Multi-Domain Optical Networks
Source: International Association of Computer Science & Information Technology (IACSIT)
This paper proposes a new algorithm, Multi-domain Hamiltonian Cycle Protection (MHCP) to tolerate single-fiber link failure in multi-domain optical networks. In MHCP, the authors develop Local Hamiltonian Cycle (LHC) in each single-domain and Globe Hamiltonian Cycle (GHC) in multi-domains to protect the intra-link and inter-link failures, respectively. Simulation results show that, compared to previous algorithm, MHCP can obtain better resource utilization ratio and lower blocking probability. In WDM optical networks, a wavelength channel has the transmission rate of several gigabits per second, so that the failures may lead to a lot of traffic blocked.
| Format: | Size: | 575.00 | |
| Date: | Jan 2012 |



