A new heuristic routing algorithm with Hamiltonian Cycle Protection in survivable networks

In high speed backbone networks, the survivability is a very important issue since the networks carry a lot of traffic. In this paper, we study the protection method with Hamiltonian Cycle in meshed survivable backbone networks, and proposed a new heuristic routing algorithm called Enhanced Hamiltonian Cycle Protection (EHCP) to tolerate the single failure. In EHCP, for each connection request the working path can be effectively selected based on the presented link-cost functions that consider the different affection for backup resources from on-cycle links and straddling links so that the backup resources on the protecting Hamiltonian Cycle can be reduced. The simulation results show that, compared with the conventional Hamiltonian Cycle Protection algorithm, EHCP can obtain significant improvement in resource utilization ratio.