摘要
本文针对部分网状网中单条链路故障的完全自愈问题，提出了一种基于部分割集概念和线性规划法的优化算法，用于经济、合理地配置网络中所需的备用资源。将算法运用于一个典型的部分网状网，计算出在不同恢复路由长度的限定下优化配置的备用容量。结果证实，故障链路的成功自愈不仅取决于恢复路由的数量，更依赖于相关链路中备用资源的合理配置。
This paper presents a threestaged algorithm for optimal sparechannel assignment in partiallymeshed networks that are able to fully restore singlelink failures. The algorithm is based on partialcutset in graph theory and linear programming in operations research. Applied to a typical partiallymeshed network, the algorithm performed calculations with respect to different length limits of the restorationroute. The optimal results verify the fact that the successful restoration of a failed link not only depends on the number of restoration routes, but also on the proper configuration of spare capacity in the neighboring links.
出处
《通信学报》
EI
CSCD
北大核心
1998年第8期26-31,共6页
Journal on Communications
基金
国家自然科学基金
高校博士学科点基金
关键词
自愈网
备用容量
优化配置
通信网
selfhealing network optimal sparecapacity assignment
