Survivable network design using restricted P-Cycle

Abstract

We propose a new method to provide network survivability using the Restricted P-Cycle by Hamiltonian cycle (RPC), which is the improved version of p-cycle. Because p-cycle has some problem files, it is not applied to dynamic traffic or varying QoS in real time circumstance. However, RPC can significantly reduce complexity in finding proper patterns restricted by Hamiltonian cycle, which has minimal spare links to provide protection. Moreover, it can guarantee the almost same restoration performance as that of p-cycle.