期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Algorithm for multi-constrained path selection based on experimental analysis
1
作者 Qi Xiaogang Liu Lifang Liu Sanyang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2006年第4期931-937,共7页
It is a challenging problem to provide quality-of-service (QoS) guarantees in next generation high-speed network, and the QoS routing is one of the key issues of the problem. For the problem of multi-constrained QoS... It is a challenging problem to provide quality-of-service (QoS) guarantees in next generation high-speed network, and the QoS routing is one of the key issues of the problem. For the problem of multi-constrained QoS routing in high-speed network, especially under the inaccurate link state information, the success ratio of the different constraint combination is analyzed statistically, and a constraint analysis method based on the computer simulation is proposed. Furthermore, the approximately equal loose-tight order relation between each two constraints is constructed, and then an algorithm based on the experimental analysis is presented. Finally, the simulation result demonstrates that the algorithm has the higher success ratio, and the theoretical analysis proves its correctness and universality. 展开更多
关键词 multi-constrained routing quality of service (QoS) path selection computer simulation experimental analysis
在线阅读 下载PDF
Genetic algorithm for pareto optimum-based route selection 被引量:1
2
作者 Cui Xunxue Li Qin Tao Qing 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2007年第2期360-368,共9页
A quality of service (QoS) or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path (MC... A quality of service (QoS) or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path (MCP) problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance. 展开更多
关键词 Route selection Multiobjective optimization Pareto optimum multi-constrained path Genetic algorithm.
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部