中文摘要：

针对如何选择一个优化的P圈来达到最小化空闲容量和较高的计算速度这个问题，提出了一种新的启发式算法HPs—RSC（迭代选择和简化一系列P圈），通过在EON和USA两种网络拓扑图中的仿真结果表明，这种新的算法使冗余度的范围控制在3．5％以内，并且在较大的网络中这种算法的优越性更加明显。

英文摘要：

To select an optimal set of P-Cycle, which can achieve the minimum spare capacity and fast computational time,this paper proposes a newly heuristic algorithm HPS-RSC （ select and refine a set of P-Cycles） o By simulating in EON and USA two topologies,the resuluts show that the proposed algorithm makes the region of redundancy within 3.5% and the superiority of this solution in large networks more obvious.