一种快速的启发式p圈容量分配算法  

A fast heuristic p-cycle capacity assignment algorithm

作　　者：李可可[1] 徐荣青[1] 王凯[1] 

机构地区：[1]南京邮电大学光电工程学院,江苏南京210046

出　　处：《光通信研究》2013年第2期12-14,共3页Study on Optical Communications

基　　金：国家自然科学基金资助项目(60778007)

摘　　要：针对经典的启发式p圈容量分配算法计算时间比较长的问题,提出了一种快速的启发式算法。该算法以p圈的保护效率增大作为圈扩张标准来构造p圈,进而进行容量分配,由于不需要预先构造一组候选圈,因此可以降低冗余度和算法耗时。用泛欧COST239网络拓扑对算法进行了仿真,结果表明,该算法能提高资源利用率,且算法耗时也大为减少。In view of the long time taken in using the classical p-cycle capacity assignment algorithms, this paper presents a fast heuristic one. Which constructs the p-cycle by taking the improvement of the protection efficiency of the p-cycle as the standard for its expansion and then carries out capacity assignment. As it is not necessary to construct in advance a candidate cycle, it can reduce redundancy and calculation time. The results of simulation on the basis of the pan-European COST239 network to-pology show that this algorithm can raise the network resource utilization ratio and greatly cut clown the running time.

关 键 词：光网络 保护 生存性 P圈 容量分配 

分 类 号：TN915[电子电信—通信与信息系统]