一种带约束的多目标服务质量路由算法

A Constrained Quality of Service Routing Algorithm with Multiple Objectives

多约束服务质量 (QoS)路由是要求在多个约束条件下计算满足所有独立限制条件的可行路径 将这种NPC问题转化为一种带约束条件的多目标优化问题 ,根据多目标遗传算法的智能优化原理 ,提出一种多目标QoS路由算法来产生一组最优非劣路由 理论分析和实验结果表明 ,使用带约束的多目标遗传算法是解决多约束QoS路由的有效途径 。

Providing quality of service (QoS) guarantees in packet networks gives rise to several challenging issues. One of them is how to determine a feasible path that satisfies a set of constraints while maintaining high utilization of network resources. Multi-constrained QoS routing finds a feasible route in the network that satisfies multiple independent constraints. In general, multi-constrained path selection is an NP-complete problem that cannot be exactly solved in polynomial time. This NP-complete problem is converted into a multiobjective optimization problem with constraints. The background of multi-constrained optimal path selection is introduced first. A multiobjective QoS routing algorithm is then proposed to produce a set of nondominated optimal route based on the intelligent optimization principle of multiobjective genetic algorithms. The theoretic analysis and experiment results show that the genetic algorithm with multiple criteria is effective for multi-constrained QoS routing, and can play an important role in the performance of networks.