动态流量多约束优化路径算法

Dynamic flow constrains optimal path algorithm

基于多重上联链路网络,建立一个考虑多服务质量(QoS)度量约束限制的网络路径寻优调度模型,并针对时延和剩余带宽提出动态流量多约束优化路径算法(MOPA).基于MOPA和最短路径约束,给出了具有一个多重上联链路的确定性网络拓扑中实现优化流量费用的工程方法.通过分析网络资源现状及目标作用的重要程度,以主次目标形式考虑,建立目标之间的关联,简化多目标之间关系,使用迭代方法求解非线性约束条件下的流量和代价的优化解,动态选择最优路径使流量费用比最优化并实现工程应用.实验表明,该算法适用于多链路网络各种负载下的流量优化.

An optimal network path searching scheduling model with multiple quility of serivice （QoS） constraints in multiple uplinks network was built, and the optimization algorithm of dynamic traffic MOPA （multi-constraints optimal path algorithm） was given by contraposing to network delay and residual bandwidth. An engineering method for optimal-traffic-cost in determinate network of multiple was uplink implemented by analyzing the current situation of network resources, the importance of the multiple objects effect was evaluated. Multiple objects were considered in primary and secondary objects form to establish and simplify relationship between them. An optimized solution for traffic flow and price under non-linear constraint was solved by alternative manner. Flow to price ratio was optimized with dynamic selection of optimal path. Experiment showed that this algorithm is suitable for the traffic flow optimization under different traffic-loads in a multi-links network.