计算机应用 ›› 2005, Vol. 25 ›› Issue (04): 900-902.DOI: 10.3724/SP.J.1087.2005.0900

• 网络技术 • 上一篇    下一篇

QoS多约束优化路径选择算法

陈立家,周建国,江昊,晏蒲柳   

  1. 武汉大学电子信息学院
  • 发布日期:2005-04-01 出版日期:2005-04-01
  • 基金资助:

    国家自然科学基金资助项目(90204008)

Multi-constrained optimal path selection of QoS

CHEN Li-jia,ZHOU Jian-guo,JIANG Hao,YAN Pu-liu   

  1. School of Electronics Information,Wuhan University
  • Online:2005-04-01 Published:2005-04-01

摘要:

针对HMCOP算法在QoS多约束最优路径选择中存在产生累积误差,搜索范围不全面 的缺点,提出了一种改进的算法LMS,使用BFS算法双向搜索网络拓扑,在每个节点实时监测最优路 径。最优路径成功率的仿真实验表明,该算法有更低的时间复杂度和更高的性能表现。

关键词: 多约束, 路径选择, QoS路由, 最小花费

Abstract:

Aiming at the shortcomings of HMCOP algorithm that produces cumulate error and searches network only partly in multi-constrained optimal path selection of QoS, a improved heuristic algorithm LMS was put forward, which searches network from two directions using BFS algorithm and supervises the optimal path at each node.The simulation experiment of success rate of finding optimal path indicates that LMS has lower time complexity and upper performance than HMCOP.

Key words: multi-constrained, path selection, QoS route, the least cost

中图分类号: