%0 Journal Article
%T An ant colony system algorithm rooted in Dijkstra strategy<br>一种仿Dijkstra的蚂蚁算法
%A WEI Sui-xian
%A HUANG Sheng-hua
%A <br>韦绥线
%A 黄胜华
%J 计算机应用
%D 2005
%I 
%X To find out QoS routing quickly and reliably, an new ant colony system algorithm rooted in Dijkstra strategy was suggested out. The source code flooded searching ants to all its adjoining and QoS-satisfied nodes . Every adjoining node selected out the best-performance one due to an early-setted judgmental function from all the arrived ants, then copied and flooded it again. The ants went on flooding until it got to the aim node at last. After searching all the possible routs between the source node and the aim node, this algorithm must be able to find out the QoS routing fitted for request. As proved in example followed, this algorithm has virtue of briefness, efficiency and strong convergence.
%K Dijkstra
%K QoS
%K ant colony system algorithm<br>最短路径
%K 服务质量保证
%K 蚂蚁算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=0C9A995EF1D0CBFA&yid=2DD7160C83D0ACED&vid=C5154311167311FE&iid=59906B3B2830C2C5&sid=6F6DB7E6345096DE&eid=A80CE4DB8B5C89CD&journal_id=1001-9081&journal_name=计算机应用&referenced_num=2&reference_num=5