摘要
多约束QoS路由是下一代互联网的核心问题之一.为解决QoS路由算法容易陷入局部最优的问题,将模拟退火方法与路由计算结合起来,提出一种新的组合优化算法.该算法可以及时从无效的迭代中跳出到其他空间,提高搜索效率,具有全局收敛性,可在有限次数迭代中快速找到可行路径.实验表明,该算法性能高,同时对网络规模和多约束个数具有很好的可扩展性.
Multi-constrained QoS routing is one of the challenging problems of the upcoming next-generation networks. Taking into account the local optimization of some QoS routing algorithms, this paper introduced a new combinatorial optimization algorithm, which combines the simulated annealing and k-shortest path algorithm. It is a good method to jump out to other useful space, and find the feasible paths. It can achieve good convergence. The simulation shows that the algorithm is efficient and has a good scalability in both network scale and weight number.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2005年第4期585-589,共5页
Journal of Shanghai Jiaotong University
关键词
多约束
服务质量
路由
全局优化
multiple constraint
quality of service (QoS)
route
global optimization
