一种基于P圈的启发式构造算法的研究

Research on heuristic generating algorithm based on P-cycle

针对P圈的Grow构造算法在圈扩张时没有考虑到边的扩张顺序,从而失去一些先验效率高的圈,提出了一种改进的Grow算法。该算法是通过调节参数K在每次扩张时选择前K个先验效率最高的圈,并对每个选择的P圈进行相同的扩张,同时还考虑了跳数受限时算法的性能。通过仿真,结果表明该算法可以有效地增加先验效率,减少配置P圈的个数,提高资源利用率。

Since the P-cycle generating algorithm named Grow did not consider the expanding order of cycle-link,thus losing some efficient cycles,this paper proposes a newly-improved Grow algorithm,which selects the K cycles with the highest priori efficiency by adjusting the parameter K, expends each selected cycle in the same way, and takes into consideration the hop-constrain.Through simulating, the results show that the algo- rithm can efficiently add priori efficiency, decrease the number of equipped P-cycles,and achieve better capacity utilization.