摘要
针对H_MCOP算法在QoS多约束最优路径选择中存在产生累积误差,搜索范围不全面 的缺点,提出了一种改进的算法LMS,使用BFS算法双向搜索网络拓扑,在每个节点实时监测最优路 径。最优路径成功率的仿真实验表明,该算法有更低的时间复杂度和更高的性能表现。
Aiming at the shortcomings of H_MCOP 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 H_MCOP.
出处
《计算机应用》
CSCD
北大核心
2005年第4期900-902,共3页
journal of Computer Applications
基金
国家自然科学基金资助项目(90204008)
关键词
多约束
路径选择
QOS路由
最小花费
multi-constrained
path selection
QoS route
the least cost
