欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了满足网络新应用提出的服务质量保证和业务不受故障影响的新要求,分析了可分离的QoS路由算法。针对寻找优化某个QoS参数且另一个QoS参数满足约束条件的可分离路由问题,建立了问题的数学模型,利用拉格朗日松驰算子将问题分解为两个受限最短路问题,给出了求解的拉格朗日松驰算法,并从迭代方向和迭代步长两方面对算法中的次梯度技术进行了改进。算例表明,改进后的算法具有较快的收敛性能。
英文摘要：
In order to satisfy the needs of QoS（quality of service） and survivability of the network, an algorithm for disjoint QoS routing was studied. It is a NP problem to find two disjoint paths that satisfy one QoS meter and optimize another QoS meter. The mathematics model of the problem was established which could be divided into two restricted shortest paths by Lagrangean multipliers. The Lagrangean relaxation algorithm was presented to solve the mathematics model. A modified iteration direction and step length were proposed to improve the computational efficiency of subgradient technology in the algorithm. Finally the examples demonstrated the validity of the algorithm.
同期刊论文项目
同项目期刊论文
An interactive approach to multiple attribute group decision making with multi-granular uncertain li
Minimizing deviations models for solving MADM problems with preference information on alternatives i
A practical procedure for group decision making under incomplete multiplicative linguistic preferenc
Multiple-attribute group decision making with different formats of preference information on attribu
An interactive procedure for linguistic multiple attribute decision making with incomplete weight in
Some similarity measures of intuitionistic fuzzy sets and their applications to multiple attribute d
期刊信息
位置：