As the previous heuristic P-cycle capacity assignment algorithms are inefficient in resource utilization and ill-balanced in capacity assignment

this paper presents a novel heuristic algorithm

which first constructs a set of optional cycles in line with the network topology and the unprotected working capacity

then chooses the P-cycle with the maximum protection efficiency to be assigned to the network.A distinguished feature of this algorithm is to take the unprotected working capacity as one of the key factors for the construction of the optional cycles.The simulation results show that the new heuristic algorithm brings about better resource utilization and more balanced resource capacity assignment than the previous ones.