全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

A Heuristic Algorithm for Delay-constrained Least-cost Unicast Routing
一种时延约束最小代价路由选择算法

Keywords: QoS Routing,Delay-constrained,Least-cost,Tabu Search,k th Shortest Path Algorithm
QoS路由
,时延约束,代价最小,禁忌搜索,k条最短路径

Full-Text   Cite this paper   Add to My Lib

Abstract:

Makes use of the tabu search method to get the optimized solution. It starts with an initial least delay path, generates neighborhood structure based on the kth shortest path algorithm, and finds the optimized route satisfying constraint. A large number of simulations demonstrate that the algorithm has advantages of nice cost performance, high reliability, and fast convergence speed.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133