A novel heuristic P-cycle capacity assignment algorithm

Gan Baobao; Xu Rongqing; Jiang Hongliang; Sun Xiaoyin

doi:10.13756/j.gtxyj.2009.05.003

您当前的位置：

首页 >

文章列表页 >

A novel heuristic P-cycle capacity assignment algorithm

- A novel heuristic P-cycle capacity assignment algorithm
- Study on Optical communication Issue 5, Pages: 1-3(2009)
- 作者机构：
  
  南京邮电大学光电工程学院
- 作者简介：
- 基金信息：
- DOI：10.13756/j.gtxyj.2009.05.003
  CLC： TN929.1
- Published：2009，
扫描看全文
[1]甘宝宝,徐荣青,蒋红亮,孙小寅.一种新的启发式P圈容量分配算法[J].光通信研究,2009(05):1-3+7.

Gan Baobao, Xu Rongqing, Jiang Hongliang, et al. A novel heuristic P-cycle capacity assignment algorithm. [J]. (5):1-3(2009)
[1]甘宝宝,徐荣青,蒋红亮,孙小寅.一种新的启发式P圈容量分配算法[J].光通信研究,2009(05):1-3+7. DOI： 10.13756/j.gtxyj.2009.05.003.

Gan Baobao, Xu Rongqing, Jiang Hongliang, et al. A novel heuristic P-cycle capacity assignment algorithm. [J]. (5):1-3(2009) DOI： 10.13756/j.gtxyj.2009.05.003.

摘要

文章针对以往启发式P圈容量分配算法资源利用率低和分配不均衡的问题

提出了一种新的启发式算法

该算法首先根据网络拓扑和未保护的工作容量构造一组备选圈

然后再选出保护效率最大的圈分配到网络中。该算法的特点是将未保护的工作容量作为构造备选圈的关键因素之一。仿真结果表明

新算法比以往启发式算法具有更好的资源利用率

同时资源分配更均衡。

Abstract

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.

关键词

光网络保护生存性预置圈

Keywords

optical networkprotectionsurvivabilitypreconfiguration cycle

references

更多指标>

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A fast heuristic p-cycle capacity assignment algorithm

Study on a novel heuristic algorithm for P-cycle-based single link failures

Survivability Research on Optical Networks based on Quantum Key Distribution

A link-capacity limited heuristic p-cycle capacity allocation algorithm

Study on reconfigurable P-cycle model in WDM networks

Related Author

No data

Related Institution

School of Opto-Electronic Engineering,Nanjing University of Posts and Telecommunications

Information Communication Branch, State Grid Liaoning Electric Power Co., Ltd.

Information Communication Branch, State Grid Eastern Inner Mongolia Electric Power Co., Ltd.

State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications

State Grid Laboratory of Electric Power Communication Network Technology, Global Energy Interconnection Research Institute Co., Ltd.

Postal code：430205
Technical support is provided by Beijing Founder electronics co., LTD 鄂ICP备2022010197 鄂公网安备 42011202002092号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.
Total Visits：75842 Visits Today：30

⁰