期刊文献+

一种新的基于自适应蚁群算法的QOS单播路由策略 被引量:2

A New Policy of QOS Unicast Routing Based on the Adaptive Ant System
下载PDF
导出
摘要 分析现有的路由策略的不足的基础上,提出了一种基于自适应的蚁群算法的新的路由策略,该策略将蚁群算法、带宽和时延波动约束控制结合控制路由选择,仿真结果表明该策略与Static Routing和Session Routing相比具有更优的时延和丢包率。能够有效的提高网络的服务质量。 Ant colony algorithm is one kind of new - type heuristically optimizing , based on ant colony systematic policy , having ability to organize itself. In order to solve the problem that QOS route meets while studying at present ,this paper utilizes the characteristic of ant colony systematic policy that can look for the shortest - path , and proposes an new policy of QOS unicast routing based on ant colony systematic principles ,and used for solving delay and drop. the emulation results prove that this policy is effective ,adaptive , robust , expansible.
出处 《微计算机应用》 2007年第4期386-389,共4页 Microcomputer Applications
基金 重庆市教委科学技术研究项目(KJ050512 KJ050513) 重庆市教委自然科学基金项目(CSTC2005BB2054)
关键词 蚁群算法 QOS 路由策略 ant algorithm, Qos routing, unicast routing,delay, drop
  • 相关文献

参考文献6

二级参考文献30

  • 1娄士波 金小龙 李红翔.图论应用[M].北京:人民邮电出版社,1982..
  • 2Andrew S.Tanenbaum.Computer Networks,3rd ED.,Prentice Hall,1996.
  • 3Baron R J,Shapiro L G.Data Structure and their Implementation.Van Norstrand Reinhold Company,1980.
  • 4Miller Harbey J.Measuring spacing-time accessibility benefits within transportation networks.Geographical Analysis,1999.
  • 5Zhan F B. Three Fastest Shortest Path Algorithms on Real Road Networks. Journal of Geographic Information and Decision Analysis, 1997, 1
  • 6李生红,学位论文,1999年,66页
  • 7Jia X H,Computer Networks,1999年,31卷,101页
  • 8Hwang F K,Networks,1992年,22卷,55页
  • 9Lipperts S, Kreller B. Mobile Agents in Telecommunications Networks --A Simulative Approach to Load Balancing. Proc. 5th Intl. Conf.Information Systems, Analysis and Synthesis, ISAS'99, 1999
  • 10Dijkstra E W. A Note on Two Problems in Connection with Graphs.Numeric Mathematics l, 1959:269-271

共引文献108

同被引文献18

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部