%0 Journal Article
%T QoS routing algorithm based on growing competitive ant algorithm<br>基于生长竞争蚁群算法的QoS路由算法*
%A ZHU Gang
%A MA Liang
%A <br>朱刚
%A 马良
%J 计算机应用研究
%D 2010
%I 
%X For solving the multiple constrained QoS unicast routing problem, this paper proposed a multi-objective algorithm for QoS routing based on improved ant algorithm.This algorithm used a rule of growing competitive in order to approach to Pareto optimal. The experimental results illustrate that the algorithm is feasible and effective, and it can satisfy the need of the user for bandwidth and delay on the basic of resource reservation.
%K growing competitive ant algorithm
%K unicast routing
%K quality of service
%K multi-objective<br>生长竞争蚁群算法
%K 单播路由
%K 服务质量
%K 多目标
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=E60C775E4E681762BB35B415DED574C5&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=708DD6B15D2464E8&sid=D7E6C02F1A5509F6&eid=A5697288E0499DEE&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=13