基于逻辑保护圈的网络空闲容量规划方法  

A Method for Planning Spare Capacity Based on Virtual Protection Cycles

作　　者：陆捷[1] 谭贤四[2] 翟宏涛[1] 王红[3] 

机构地区：[1]空军雷达学院研究生队,湖北武汉430019 [2]空军雷达学院雷达系统工程系,湖北武汉430019 [3]华中科技大学电子与信息工程系,湖北武汉430074

出　　处：《空军雷达学院学报》2004年第4期11-14,共4页Journal of Air Force Radar Academy

基　　金：国家自然科学基金项目(62022005)

摘　　要：为优化设计网络空闲资源,基于逻辑保护圈的共享链路保护,以最小化最大超额订购值为优化准则,针对一定的链路资源,提出了一种通过步进迭代求解线性规划方程优化解的启发式算法,以确定网络100%故障保护的次优保护圈集.仿真结果表明,该算法可以快速得到逻辑保护圈集,优化配置网络空闲资源.For the purpose of planning spare network resources, based on the sharing link protection in virtual protection cycles and the majorizing criterion of changing the minimum into maximum excess ordering value , this paper proposes a heuristic algorithm for a certain link resources by using step max iteration to find the majorizing solution of the linear planning equation, to determine the sub-optimum protection cycles of the network where 100% fault protection can be carried out. Simulation results show that the set of virtual protection cycles can be obtained fast by using the proposed algorithm, and the spare network resource can be planned in majorization.

关 键 词：逻辑保护圈 超额订购比 空闲容量 启发式算法 

分 类 号：TN929.11[电子电信—通信与信息系统]