摘要
为了满足网络新应用提出的服务质量保证和业务不受故障影响的新要求,分析了可分离的QoS路由算法。针对寻找优化某个QoS参数且另一个QoS参数满足约束条件的可分离路由问题,建立了问题的数学模型,利用拉格朗日松驰算子将问题分解为两个受限最短路问题,给出了求解的拉格朗日松驰算法,并从迭代方向和迭代步长两方面对算法中的次梯度技术进行了改进。算例表明,改进后的算法具有较快的收敛性能。
In order to satisfy the needs of QoS（quality of service） and survivability of the network, an algorithm for disjoint QoS routing was studied. It is a NP problem to find two disjoint paths that satisfy one QoS meter and optimize another QoS meter. The mathematics model of the problem was established which could be divided into two restricted shortest paths by Lagrangean multipliers. The Lagrangean relaxation algorithm was presented to solve the mathematics model. A modified iteration direction and step length were proposed to improve the computational efficiency of subgradient technology in the algorithm. Finally the examples demonstrated the validity of the algorithm.
出处
《解放军理工大学学报（自然科学版）》
EI
2008年第2期119-123,共5页
Journal of PLA University of Science and Technology(Natural Science Edition)
基金
国家自然科学基金资助项目(70571087)
关键词
可分离路由
服务质量保证
拉格朗日松驰算法
次梯度
disjoint route
QoS（quality of service）
Lagrangean relaxation algorithm
subgradient
