互联网 qkzz.net
全刊杂志网:首页 > 女性 > 文章正文
刊社推荐

一种基于非线性长度的多约束路由算法


□ 刘永广 叶 梧 冯穗力

   (1.华南理工大学 电子与信息学院, 广州 510640;2.广东轻工职业技术学院 管理系, 广州 510300) 

  摘要:满足多个约束的qos路由问题已经被证明是np完全问题。在分析了多种路由算法的基础上,设计了一种高效的多约束路由算法。该算法采用非线性路径长度计算方法。为提高算法的成功率,在节点的松弛过程中设计了节点动态路径长度计算,允许节点作多次松弛。为提高算法的执行效率,在节点正向松弛和反向估计过程中引入了受控路径的思想,使算法得到了优化。大量仿真表明,该算法在最短路径获取和路由发现成功率方面都有高效的表现。

  

  关键词:服务质量路由;多约束;非线性路径长度

  中图分类号:tp393文献标志码:a

  文章编号:1001-3695(2008)11-3408-04

  

  algorithm for multi-constrained routing based on nonlinear path length

  

  liu yong-guang1,2,ye wu1, feng sui-li1

  (1.school of electronic & information engineering, south china university of technology, guangzhou 510640, china;2.dept. of management, guangdong industry technical college, guangzhou 510300, china)abstract:the problem of finding a path that satisfies multiple constraints has been proved a np-complete problem.based on the analysis of some algorithms in this field,proposed an efficient multi-constrained routing algorithm.the new algorithm adopted the idea of nonlinear path length. in order to improve the success ratio,designed a dynamic path selection method for nodes, which demanded that nodes be relaxed for more times.for the reason of improving algorithm efficiently,addedthe concept of dominated path to the process of selecting more weights sum for path calculation. large simulations prove that the new algorithm has high efficiency in success ratio and finding the shorter path.

......
很抱歉,暂无全文,若需要阅读全文或喜欢本刊物请联系《计算机应用研究》杂志社购买。
欢迎作者提供全文,请点击编辑
分享:
 

了解更多资讯,请关注“木兰百花园”
分享:
 
精彩图文


关键字
支持中国杂志产业发展,请购买、订阅纸质杂志,欢迎杂志社提供过刊、样刊及电子版。
关于我们 | 网站声明 | 刊社管理 | 网站地图 | 联系方式 | 中图分类法 | RSS 2.0订阅 | IP查询
全刊杂志赏析网 2017