基于动态规划的QoS多约束路由算法

QoS Multi constraints Routing Algorithm Based on Dynamic Programming

摘要:

基于动态规划的思想，提出一种新的质量服务（QoS）多约束路由算法(QMCRA_DP).对可行路径进行智能分段，并自适应地调整求解各段的线性花费函数.理论分析及实验验证表明：QMCRA_DP算法在保持较低计算开销的同时，较大地提高了求解可行路径的成功率.

Abstract:

In this paper, we propose a quality of service (QoS) multi constraints routing algorithm based on dynamic programming(QMCRA_DP), which adjusts the linear cost function adaptively and segments the feasible path intelligently. The results show that the algorithm not only has a lower computational complexity, but also increases the success rate for finding a feasible path.