期刊文献+

蚁群分区算法在QoS单播路由中的应用研究 被引量:1

Application Research of the Ant Colonies Classify Optimization Algorithm in QoS Unicast Routing
下载PDF
导出
摘要 随着网络技术的高速发展,新型的多媒体业务应运而生,对网络服务质量(QoS)的要求也更高,如何解决多个约束QoS路由问题,成为新关注的热点,在解决这一问题时,路由算法的选择又是其中的一个核心问题,并且带宽、延时、访问花费是决定选择路径的关键因素.论文针对这一状况构建了带有QoS参数的网络模型,并用基于蚁群算法的邻域分区优化算法对QoS单播路由选择进行仿真实验,该方法改善了蚁群算法在求解大规模网络路由选择的算法复杂度和搜索最优路径的时间. With the high- Speed development of the network technology, the new- type multimedia business arises at the historic moment, expecting too much to service quality of the network (QoS). How to solve a lot of QoS route problems, becomes the focus. While solving this problem, the choice of the route algorithm is a key question, and bandwidth, delay time and visit cost are the key factors to choose the route. The thesis structures the network model with QoS parameter to this state, and goes on the artificial experiment to QoS unicast touting to use the Ant Colonies Classify Optimization Algorithm, which improves the Complexity of the algorithm and the time to search the optimum route.
出处 《曲靖师范学院学报》 2006年第3期45-49,共5页 Journal of Qujing Normal University
关键词 路由算法 咽单播路由 蚁群算法 邻域分区 Route algorithm QoS form sows the route Ant colony algorithms neighborhood dividing area
  • 相关文献

参考文献3

二级参考文献22

  • 1EComer 林瑶 等.用TCP/IP进行网际互连,第1卷:原理、协议和体系结构[M].北京:电子工业出版社,1998..
  • 2S Chen,et al. On Finding Multi-Constrained Paths[ C ]. International Conference on Communications, ICC' 98, IEEE, 1998. 874-879.
  • 3T H Cormen, et al. Introduction to Algorithms [ M ]. The Mrr Press and McGraw-Hill Book Company,2001.
  • 4J M Jaffe. Algorithms for Finding Paths with Multiple Constraints[ J].Networks, 1984,14:95-116.
  • 5T Korkmaz, M Krunz. A Randomized Algorithm for Finding a Path Subject to Multiple QoS Requirements[ J]. Computer Networks: The International Journal of Computer and Telecommunications Networking, 2001,36(2) :251-268.
  • 6H De Neve,et al. A Muhiple Quality of Service Routing Algorithm for PNNI [ C ]. Proc of the ATM Workshop, IEEE, 1998. 324- 328.
  • 7S Chen,et al. On Finding Multi-Constrained Paths[C].International Conference on Communications,ICC'98,IEEE, 1998.874-879.
  • 8T H Cormen,et al. Introduction to Algorithms[M]. The MIT Press and McGraw-Hill Book Company,2001.
  • 9J M Jaffe. Algorithms for Finding Paths with Multiple Constraints[J]. Networks,1984,14:95-116.
  • 10T Korkmaz,M Krunz. A Randomized Algorithm for Finding a Path Subject to Multiple QoS Requirements[J]. Computer Networks: The International Journal of Computer and Telecommunications Networking, 2001,36(2):251-268.

共引文献18

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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