一种新的启发式P圈容量分配算法

A novel heuristic P-cycle capacity assignment algorithm

文章针对以往启发式P圈容量分配算法资源利用率低和分配不均衡的问题,提出了一种新的启发式算法,该算法首先根据网络拓扑和未保护的工作容量构造一组备选圈,然后再选出保护效率最大的圈分配到网络中。该算法的特点是将未保护的工作容量作为构造备选圈的关键因素之一。仿真结果表明,新算法比以往启发式算法具有更好的资源利用率,同时资源分配更均衡。

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.