论文部分内容阅读
针对多约束QoS路由问题中从资源点到目的点的最大数目的不相交路由,文章给出了一种基于罚函数与整数规划的求满足QoS约束的最大数目的互不相交路由算法。该算法利用了路由模型的结构特性,使整数规划问题转化为线性规划问题,初步的算例表明算法是有效的。
Aiming at the maximum number of disjoint routes from resource points to destination points in the multi-constrained QoS routing problem, this paper presents a maximum number of disjoint routing algorithms that satisfy the QoS constraints based on penalty functions and integer programming. The algorithm takes advantage of the structural characteristics of the routing model to transform the integer programming problem into a linear programming problem. The preliminary examples show that the algorithm is effective.