期刊文献+

NGI尺度收缩混沌变异QoS组播路由算法

QoS multicast routing algorithm based on shrinking-chaotic-mutation evolutionary algorithm in NGI
在线阅读 下载PDF
导出
摘要 IP/DWDM光Internet是下一代互联网主要组网技术之一,服务质量组播路由算法是其一个研究热点,已经证明它是NP完全的。为此设计了一种非NP类算法,基于尺度收缩混沌变异进化算法,构造一棵带宽、延迟、延迟抖动和出错率受限且费用优化的QoS组播路由树,兼顾网络负载均衡。仿真研究表明,该算法是可行和有效的,较好地克服了传统遗传算法的早熟和收敛性差的问题。 IP/DWDM optical internet is one of the main networking technologies for the NGI (next generation internet). QoS mUltlCaSt routing algorithm is a research focus which is proven to be NP-complete. Thus, a non-NP algorithm is proposed, It is based on the shrinking-chaotic-mutation evolutionary algorithm to find a bandwidth, delay, delay jitter and error rate bounded and cost optimized QoS multicast routing tree. The network load balancing is taken into account at the same time. Simulation results show that the proposed algorithm is both feasible and effective with the improved search ability and convergence speed to the optimal solution over its counterpart based on the traditional genetic algorithm.
出处 《计算机工程与设计》 CSCD 北大核心 2006年第17期3114-3116,3122,共4页 Computer Engineering and Design
基金 国家自然科学基金项目(60473089 60003006 70101006) 辽宁省自然科学基金项目(20032018 20032019) 中国教育科研网格ChinaGrid 教育部现代远程教育工程项目(200403)。
关键词 下一代互联网 IP/DWDM光INTERNET 服务质量 组播 路由 尺度收缩混沌变异进化算法 NGI IP/DWDMopticallnternet QoS multicast routing shrinking-chaotic-mutation evolutionary algorithm
  • 相关文献

参考文献24

  • 1Green P.Progress in optical networking[J].IEEE Communication Magazine,2001,39(1):54-61.
  • 2Ramaswami R,Sivarajan K N.Routing and wavelength assignment in all-optical networks[J].IEEE/ACM Transactions on Networking,1995,3(5):489-500.
  • 3Li J J,Zhang H Y,Zhou B K,et al.A novel fast multicast algorithm with enhanced survivability in WDM optical networks[J].Photonic Network Communications,2004,8 (2):223-232.
  • 4Sheu P R,Chen S T.A fast and efficient heuristic algorithm for the delay and delay variation bound multicast tree problem[C].The 15th International Conference on Information Networking,2001.611-618.
  • 5Shankar M B,Sridhar R,Chandra N S.Multicast routing with delay and delay variation constraints for multimedia applications[Z].LNCS 3079,2004.399-411.
  • 6张素兵,刘泽民.一种新的基于混沌神经网络的组播路由算法[J].计算机学报,2001,24(12):1256-1261. 被引量:7
  • 7Wang Z Y,Shi B X,Zhao E D.Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm[J].Computer Communications,2004,24:685-692.
  • 8王兴伟,程辉,黄敏,于瑞云.下一代互联网中的智能QoS组播路由算法[J].东北大学学报(自然科学版),2004,25(3):235-238. 被引量:10
  • 9王兴伟,程辉,李佳,黄敏.一种IP/DWDM光因特网中的组播路由算法[J].东北大学学报(自然科学版),2003,24(12):1165-1168. 被引量:16
  • 10Haghighat A T,Faez K,Dehghan M,et al.A genetic algotihtm for steiner tree optimization with multiple constraints using Prüfer number[Z].LNCS 2510,2002.272-280.

二级参考文献48

  • 1薛荣俊,张维刚.浅海及港湾中浅层工程地质勘察的有效方法—浅层工程地震折射波法[J].海洋技术,1993,12(2):43-48. 被引量:4
  • 2王梓坤.论混沌与随机[J].北京师范大学学报(自然科学版),1994,30(2):199-202. 被引量:16
  • 3李天岩,井竹君.周期3蕴含浑沌[J].数学译林,1989,8(3):211-218. 被引量:3
  • 4田玉楚,张钟俊.非线性系统中浑沌运动的研究进展[J].上海交通大学学报,1996,30(1):108-116. 被引量:8
  • 5[2]Wang B, Hou J C. A survey on multicast routing and its QoS extensions: problems, algorithms, and protocols[J]. IEEE Network Magazine, 2000,14(1):22-36.
  • 6[3]Hwang F, Richards D. Steiner tree problems[J]. Networks, 1992,22(1):55-89.
  • 7[4]Gen M, Cheng R W. Genetic algorithms and engineering design[M]. New York: John Wiley & Sons, 1996.1-55.
  • 8[5]Mendivil F, Shonkwiler R, Spruill M C. Restarting search algorithms with applications to simulated annealing[J]. Advances in Applied Probability, 2000,33(1):242-259.
  • 9[7]Xin Y. Heuristic algorithms for multi-constrained quality-of-service routing[J]. IEEE/ACM Transaction on Networking, 2002,10(2):244-256.
  • 10[8]Wang X W, Cheng H, Cao J N, et al. QoS-driven multicast tree generation using genetic algorithm[J]. Lecture Notes in Computer Science, 2003,2834:121-131.

共引文献185

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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