基于链路容量有限的启发式p圈容量分配算法
A link-capacity limited heuristic p-cycle capacity allocation algorithm
摘要
针对以往启发式p圈容量分配算法未考虑容量有限的问题,提出一种新的启发式算法。该算法以空闲容量为基础,将最大工作容量作为扩张标准来构造p圈,利用构造的p圈进行容量分配。用COST239网络拓扑对算法进行了仿真,结果表明,该算法能利用更少的空闲容量来保护更多的工作容量,且配置p圈数减少。
Abstract
As previous heuristic p-cycle capacity allocation algorithms fail to consider the limitation of link capacity, we propose a new heuristic algorithm. On the basis of spare capacity, this algorithm constructs a p-cycle by taking the maximum working capacity as the expansion standard and uses the constructed p-cycle for capacity allocation and uses COST239 network topology for algorithm simulation. The simulation results show that this algorithm can use less spare capacity to protect more working capacity and reduce the number of p-cycles.
丁玉龙, 吴雯婷, 徐荣青. 基于链路容量有限的启发式p圈容量分配算法[J]. 光通信研究, 2014, 40(1): 9. Ding Yulong, Wu Wenting, Xu Rongqing. A link-capacity limited heuristic p-cycle capacity allocation algorithm[J]. Study On Optical Communications, 2014, 40(1): 9.