%0 Journal Article
%T A Heuristic Algorithm for Delay-constrained Least-cost Unicast Routing<br>一种时延约束最小代价路由选择算法
%A FANG Jie
%A WANG Heng
%A SUN Ya-min
%A <br>房颉
%A 王珩
%A 孙亚民
%J 计算机应用研究
%D 2005
%I 
%X 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.
%K QoS Routing
%K Delay-constrained
%K Least-cost
%K Tabu Search
%K k th Shortest Path Algorithm<br>QoS路由
%K 时延约束
%K 代价最小
%K 禁忌搜索
%K k条最短路径
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=CFA870475E3D8DEF&yid=2DD7160C83D0ACED&vid=BC12EA701C895178&iid=B31275AF3241DB2D&sid=CEC789B3C68C3BB3&eid=AD16A18DBD734D13&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=9