群集智能算法在网络策略中的研究及其应用
|
摘要
在Internet中,由于多媒体通信和网络视频的增长,网络资源和网络需求之间的矛盾越来越突出,网络路由和网络流量的平衡成为制约网络发展的瓶颈。抑制网络拥塞,提高网络的质量,使网络达到动态均衡,已成为Internet相关技术的研究热点。
网络单播、组播路由是检验网络性能的重要指标,在网络研究中的作用越来越重要。特别是在多约束网络中,采用QoS指标讨论网络的质量性能,使网络达到动态均衡;并对网络的延时、延时抖动、带宽、丢包率、业务代价等多个参数同时提出性能要求,这些参数相互独立时,选择满足多个参数限制的路由就成为NP完全问题。
在研究网络单播、组播路由的同时,国内外许多学者对网络流量展开研究,主要集中在流量工程(Traffic Engineering,即TE),而流量工程的热点问题又集中在多约束路由。在网络满足多约束的条件下,根据网络流量与资源的状态,通过实施合理的控制,使流量均衡地分布在现有的网络中,从而优化网络的运行性能。本文主要包含网络单播路由、组播路由、网络流量均衡等几个方面的内容,利用群集智能算法的特点,对单播路由优化、组播路由优化、网络流量控制等方面进行系统的研究,同时对算法的收敛性和网络安全等方面进行较为系统分析。本文的主要研究成果包括:
1.对QoS网络的路由优化改进技术的深入研究,第一,提出了基于粒子融合的QoS蚁群优化路由算法,使用粒子群算法生成初始解,避免了蚁群算法在局部最优化,拓展了蚁群算法的求解范围,提高了算法的自适应能力和优化精度。第二,提出了基于混沌算子的蚁群优化改进多约束QoS路由算法,利用混沌“随机性”、“遍历性”及“规律性”,能够快速获得全局最优解的优点,采用混沌因子改进蚁群算法,提高了搜索性能,算法搜索到的结果总体要明显好于基本ACO算法。仿真结果表明,两种改进算法具有较高的优化性能。
2.结合组播路由网络的特点,对多约束条件在组播网络展开分析,在此基础上提出了基于克隆粒子群融合的约束QoS组播树算法。在提出新的播路由算法中,通过粒子的速度和位置变化查找组播树,并且利用免疫克隆算法混合搜索,从而减少了局部搜索和全局搜索的时间。通过克隆算子的引入,增加了克隆复制、克隆变异、克隆选择等3个环节,在克隆变异阶段,利用变化后的个体以一定的概率具有更高的适应性能,然后利用克隆选择环节,避免了种群易经常出现的退化,而且提高了算法收敛速度和全局搜索能力。仿真结果表明,该算法具有更好的优化性能。
3.通过对网络流量和网络路由之间的关系进行了深入分析,提出了基于带宽受限模糊权重的蚁群优化控制算法(Fuzzy-ACO)。在基于带宽受限的蚁群优化控制算法中,利用模糊控制网络流量权重,建立网络流量的数学模型,降低了大量的探测分组带来了网络开销;并通过采用时间顺序输入不同流量,可以动态及时的反映网络性能,对网络性能进行实时监控,从而使网络流量和网络路径达到动态平衡。同时将系统流量权重融入信息素中,利用信息素动态地控制在多条路径中选择最佳路径,提高了蚁群算法全局搜索能力。仿真结果表明,算法优化效果明显,运行速度快,并显著加快了传统算法网络流量的探索收敛速度。
4.对于多约束条件的蚁群优化算法,往往约束条件的取舍及函数的设计尤为重要,针对QoS条件下蚁群算法的收敛性展开讨论,重新定义其信息素的选取,从理论上证明该算法的收敛性;并且还论证在带QoS约束条件的蚁群算法中,信息素发生变化的时间点,以及信息素的取值范围,从而证明该类蚁群优化算法收敛的可控制性,通过实验仿真说明该算法的实用性。对该算法局部和全局收敛性展开研究,提出了普遍意义下的收敛条件,为这一类约束条件下的蚁群算法进一步研究奠定了良好的基础。
5.通过对网络安全的分析,借助生物聚类的机理,防范网络入侵的危害,提出了一种基于交叉融合粒子群优化算法的聚类分析,由粒子群算法形成初步的聚类中心,再由蚁群算法进行二次优化,仿真实验表明,该算法与基本聚类算法相比较,聚类组合方法能够明显改善聚类质量。
论文对网络单播路由、组播路由、网络流量均衡做了较为全面深入的分析和讨论,提出了多种有效的改进措施,并证明了算法的收敛性,提出了网络安全聚类分析的方法,实现了群集智能算法在网络分析上的应用。最后对所做工作进行了总结,并提出了进一步研究的方向。
In the Internet, with the increasing of multimedia communications and network video, the conflict between resource and demand of network is more and more remarkable. The balance of routing and flux in the network is most important factor in the development of network. How to restrain the congestion of network and improve the quality of network, which makes the network dynamic balance, is the focus technique research in the network.
The unicast and multicast routing of network is importance capability inspection of network, which is paid more attention by people these days, especially in the multiple constrained condition of network. The quality-of-service(QoS)is adopted in the quality of network mostly. For the dynamic balance in the network, the demands of network character parameter such as delay, delay-jitter, bandwidth, packet-loss and cost are considered at the same time, which are independent each other. The routing, which are content the multi-parameter limit, is NP-complete problems in the network.
In the research of the unicast and multicast routing of network simultaneously, many scholar are studied to investigate into flux of network at home and abroad presently, which are all focus on traffic engineering(TE). Recently the emphases questions of the traffic engineering focus on multiple constrained condition of routing. Considering of the multiple constrained condition, this dissertation makes the flux distributing in the network uniformity and optimizes the dynamic capability of network based on flux of network and state of resource through carrying out reasonable control.
The dissertation contains the several parts content of unicast routing, multicast routing and balance of traffic network. By uses of character of intelligence algorithm, a new measure is studied by the research of unicast routing, multicast routing and control of traffic engineering as a whole. At the same time, the convergence analysis of algorithm and the safety of network are analyzed totally. The main achievements of this dissertation include:
1.How to solve QoS optimizing routing problem was researched deeply by improvement technique. Firstly, A new algorithm was brought forward by multiple constraint optimization based on particle swarm amalgamation combination of ant colony algorithm, which adopts particle swarm optimization to get initialization a new solution by searching routing and avoided to be trapped into local seeking solution only by ant colony algorithm. This algorithm increased the scope of searching better routing, advanced self-adaptable capability and accurate optimizing. Secondly, a multiple constrained QoS algorithm based on chaos and ant colony optimization was proposed. By using of the properties of randomicity, regularity and ergodicity of chaos, the mixed algorithms found out the whole seeking solution quickly. Then, the mixed means improved ant colony algorithms by chaos factor and improved the searching capability. The result of searching had the advantage over the base ant colony algorithm remarkably. The experimental results show that these two new improved algorithms have high efficiency.
2.Linking to the character of multicast routing in network, combination of clone and particle swarm optimization based on multiple constrained multicast routing algorithms was put forward though analyzing of multiple-constrain in the multicast routing network. The new multicast routing algorithm was studied by the change of speed and location finding multicast tree and by the Immunity Clone algorithm to search best route, which decreased the time of the local and global searching. The clone algorithm added process of clone copy,clone mutation and clone selection. In the course of clone mutation, the algorithm was high adaptability with the definite probability by changing. Then, in the course of clone selection, the algorithm avoided the degeneracy of genus regularly and enhanced the speed of convergence algorithm and the global searching capability. The simulation experimental results show that the improved algorithms have better optimization performance.
3.By analyzing the relation between networks of traffic and routing deeply, the fuzzy weight value of routing controlled ant colony optimization algorithm based limited bandwidths(Fuzzy-ACO)were proposed based on the research. In the ant colony optimization algorithm based limited bandwidths, networks of traffic was controlled in the weight value by fuzzy. Since the mathematics model was founded with networks of traffic, spending of networks was decreased by large numbers of detector with grouping. By means of inspecting content of network with real time, the networks of traffic and routing were balanced dynamically. Simultaneously, the networks of traffic with the weight value were connected with pheromone, which dynamically adjusts optimal routing selected among multiple paths. The ant colony algorithm achieves globally searching ability. The simulation results show that the given algorithm was effective and high speed,in which it dramatically improved the exploring speed of convergence in network traffic by traditional networks traffic algorithm.
4.For the multiple constrained condition ant-colony-optimization(ACO) algorithms, the making choice of constrained condition and designing function was very importance. The convergence of ant colony algorithm under the quality-of-service(QoS)condition was studied. By redefining the selection of pheromone, the convergence of algorithm was demonstrated by applying theory. Through the changing time of pheromone and scope of value of pheromone was analyzed in the ant colony algorithm with QoS condition, the controllability of ACO was also proved theoretically. The simulation results show that the given algorithm was practicable, by making the algorithm converge both locally and globally under a general convergence condition. This works may provide a foundation for further theoretical studies on the multiple-constrain QoS of ACO.
5.By analyzing the network's security, the threat of the intrusion on line was detected with theory of biology clustering. The clustering analysis way by combination of particle-swarm-optimization(PSO)and ant-colony-optimization(ACO)algorithm was discussed. Firstly, the center and number of clustering are determined by using the PSO, and then the above clustering results are optimized by the K-means algorithm combining with ACO. The simulated experiments show that the combining algorithm is obviously superior to some common clustering algorithms since it has obvious advantage in optimization capacity.
In the dissertation, the unicast routing, multicast routing and balance of traffic network was analyzed and discussed completely. Some effective improvement methods were proposed and the convergence of the algorithm was demonstrated in this dissertation. The Cluster Analysis in the safety of network was proposed. Those all swarm intelligence algorithms were realized the application of analysis in the network. Lastly, the work of this dissertation is summarized, and further research directions were indicated.
网络单播、组播路由是检验网络性能的重要指标,在网络研究中的作用越来越重要。特别是在多约束网络中,采用QoS指标讨论网络的质量性能,使网络达到动态均衡;并对网络的延时、延时抖动、带宽、丢包率、业务代价等多个参数同时提出性能要求,这些参数相互独立时,选择满足多个参数限制的路由就成为NP完全问题。
在研究网络单播、组播路由的同时,国内外许多学者对网络流量展开研究,主要集中在流量工程(Traffic Engineering,即TE),而流量工程的热点问题又集中在多约束路由。在网络满足多约束的条件下,根据网络流量与资源的状态,通过实施合理的控制,使流量均衡地分布在现有的网络中,从而优化网络的运行性能。本文主要包含网络单播路由、组播路由、网络流量均衡等几个方面的内容,利用群集智能算法的特点,对单播路由优化、组播路由优化、网络流量控制等方面进行系统的研究,同时对算法的收敛性和网络安全等方面进行较为系统分析。本文的主要研究成果包括:
1.对QoS网络的路由优化改进技术的深入研究,第一,提出了基于粒子融合的QoS蚁群优化路由算法,使用粒子群算法生成初始解,避免了蚁群算法在局部最优化,拓展了蚁群算法的求解范围,提高了算法的自适应能力和优化精度。第二,提出了基于混沌算子的蚁群优化改进多约束QoS路由算法,利用混沌“随机性”、“遍历性”及“规律性”,能够快速获得全局最优解的优点,采用混沌因子改进蚁群算法,提高了搜索性能,算法搜索到的结果总体要明显好于基本ACO算法。仿真结果表明,两种改进算法具有较高的优化性能。
2.结合组播路由网络的特点,对多约束条件在组播网络展开分析,在此基础上提出了基于克隆粒子群融合的约束QoS组播树算法。在提出新的播路由算法中,通过粒子的速度和位置变化查找组播树,并且利用免疫克隆算法混合搜索,从而减少了局部搜索和全局搜索的时间。通过克隆算子的引入,增加了克隆复制、克隆变异、克隆选择等3个环节,在克隆变异阶段,利用变化后的个体以一定的概率具有更高的适应性能,然后利用克隆选择环节,避免了种群易经常出现的退化,而且提高了算法收敛速度和全局搜索能力。仿真结果表明,该算法具有更好的优化性能。
3.通过对网络流量和网络路由之间的关系进行了深入分析,提出了基于带宽受限模糊权重的蚁群优化控制算法(Fuzzy-ACO)。在基于带宽受限的蚁群优化控制算法中,利用模糊控制网络流量权重,建立网络流量的数学模型,降低了大量的探测分组带来了网络开销;并通过采用时间顺序输入不同流量,可以动态及时的反映网络性能,对网络性能进行实时监控,从而使网络流量和网络路径达到动态平衡。同时将系统流量权重融入信息素中,利用信息素动态地控制在多条路径中选择最佳路径,提高了蚁群算法全局搜索能力。仿真结果表明,算法优化效果明显,运行速度快,并显著加快了传统算法网络流量的探索收敛速度。
4.对于多约束条件的蚁群优化算法,往往约束条件的取舍及函数的设计尤为重要,针对QoS条件下蚁群算法的收敛性展开讨论,重新定义其信息素的选取,从理论上证明该算法的收敛性;并且还论证在带QoS约束条件的蚁群算法中,信息素发生变化的时间点,以及信息素的取值范围,从而证明该类蚁群优化算法收敛的可控制性,通过实验仿真说明该算法的实用性。对该算法局部和全局收敛性展开研究,提出了普遍意义下的收敛条件,为这一类约束条件下的蚁群算法进一步研究奠定了良好的基础。
5.通过对网络安全的分析,借助生物聚类的机理,防范网络入侵的危害,提出了一种基于交叉融合粒子群优化算法的聚类分析,由粒子群算法形成初步的聚类中心,再由蚁群算法进行二次优化,仿真实验表明,该算法与基本聚类算法相比较,聚类组合方法能够明显改善聚类质量。
论文对网络单播路由、组播路由、网络流量均衡做了较为全面深入的分析和讨论,提出了多种有效的改进措施,并证明了算法的收敛性,提出了网络安全聚类分析的方法,实现了群集智能算法在网络分析上的应用。最后对所做工作进行了总结,并提出了进一步研究的方向。
In the Internet, with the increasing of multimedia communications and network video, the conflict between resource and demand of network is more and more remarkable. The balance of routing and flux in the network is most important factor in the development of network. How to restrain the congestion of network and improve the quality of network, which makes the network dynamic balance, is the focus technique research in the network.
The unicast and multicast routing of network is importance capability inspection of network, which is paid more attention by people these days, especially in the multiple constrained condition of network. The quality-of-service(QoS)is adopted in the quality of network mostly. For the dynamic balance in the network, the demands of network character parameter such as delay, delay-jitter, bandwidth, packet-loss and cost are considered at the same time, which are independent each other. The routing, which are content the multi-parameter limit, is NP-complete problems in the network.
In the research of the unicast and multicast routing of network simultaneously, many scholar are studied to investigate into flux of network at home and abroad presently, which are all focus on traffic engineering(TE). Recently the emphases questions of the traffic engineering focus on multiple constrained condition of routing. Considering of the multiple constrained condition, this dissertation makes the flux distributing in the network uniformity and optimizes the dynamic capability of network based on flux of network and state of resource through carrying out reasonable control.
The dissertation contains the several parts content of unicast routing, multicast routing and balance of traffic network. By uses of character of intelligence algorithm, a new measure is studied by the research of unicast routing, multicast routing and control of traffic engineering as a whole. At the same time, the convergence analysis of algorithm and the safety of network are analyzed totally. The main achievements of this dissertation include:
1.How to solve QoS optimizing routing problem was researched deeply by improvement technique. Firstly, A new algorithm was brought forward by multiple constraint optimization based on particle swarm amalgamation combination of ant colony algorithm, which adopts particle swarm optimization to get initialization a new solution by searching routing and avoided to be trapped into local seeking solution only by ant colony algorithm. This algorithm increased the scope of searching better routing, advanced self-adaptable capability and accurate optimizing. Secondly, a multiple constrained QoS algorithm based on chaos and ant colony optimization was proposed. By using of the properties of randomicity, regularity and ergodicity of chaos, the mixed algorithms found out the whole seeking solution quickly. Then, the mixed means improved ant colony algorithms by chaos factor and improved the searching capability. The result of searching had the advantage over the base ant colony algorithm remarkably. The experimental results show that these two new improved algorithms have high efficiency.
2.Linking to the character of multicast routing in network, combination of clone and particle swarm optimization based on multiple constrained multicast routing algorithms was put forward though analyzing of multiple-constrain in the multicast routing network. The new multicast routing algorithm was studied by the change of speed and location finding multicast tree and by the Immunity Clone algorithm to search best route, which decreased the time of the local and global searching. The clone algorithm added process of clone copy,clone mutation and clone selection. In the course of clone mutation, the algorithm was high adaptability with the definite probability by changing. Then, in the course of clone selection, the algorithm avoided the degeneracy of genus regularly and enhanced the speed of convergence algorithm and the global searching capability. The simulation experimental results show that the improved algorithms have better optimization performance.
3.By analyzing the relation between networks of traffic and routing deeply, the fuzzy weight value of routing controlled ant colony optimization algorithm based limited bandwidths(Fuzzy-ACO)were proposed based on the research. In the ant colony optimization algorithm based limited bandwidths, networks of traffic was controlled in the weight value by fuzzy. Since the mathematics model was founded with networks of traffic, spending of networks was decreased by large numbers of detector with grouping. By means of inspecting content of network with real time, the networks of traffic and routing were balanced dynamically. Simultaneously, the networks of traffic with the weight value were connected with pheromone, which dynamically adjusts optimal routing selected among multiple paths. The ant colony algorithm achieves globally searching ability. The simulation results show that the given algorithm was effective and high speed,in which it dramatically improved the exploring speed of convergence in network traffic by traditional networks traffic algorithm.
4.For the multiple constrained condition ant-colony-optimization(ACO) algorithms, the making choice of constrained condition and designing function was very importance. The convergence of ant colony algorithm under the quality-of-service(QoS)condition was studied. By redefining the selection of pheromone, the convergence of algorithm was demonstrated by applying theory. Through the changing time of pheromone and scope of value of pheromone was analyzed in the ant colony algorithm with QoS condition, the controllability of ACO was also proved theoretically. The simulation results show that the given algorithm was practicable, by making the algorithm converge both locally and globally under a general convergence condition. This works may provide a foundation for further theoretical studies on the multiple-constrain QoS of ACO.
5.By analyzing the network's security, the threat of the intrusion on line was detected with theory of biology clustering. The clustering analysis way by combination of particle-swarm-optimization(PSO)and ant-colony-optimization(ACO)algorithm was discussed. Firstly, the center and number of clustering are determined by using the PSO, and then the above clustering results are optimized by the K-means algorithm combining with ACO. The simulated experiments show that the combining algorithm is obviously superior to some common clustering algorithms since it has obvious advantage in optimization capacity.
In the dissertation, the unicast routing, multicast routing and balance of traffic network was analyzed and discussed completely. Some effective improvement methods were proposed and the convergence of the algorithm was demonstrated in this dissertation. The Cluster Analysis in the safety of network was proposed. Those all swarm intelligence algorithms were realized the application of analysis in the network. Lastly, the work of this dissertation is summarized, and further research directions were indicated.
引文
[1]段海滨.蚁群算法原理及其应用[M].北京:科学出版社,2006.
[2]吴启迪,汪镭.智能微粒群算法研究及应用[M].南京:江苏教育出版社,2005.
[3]高尚,杨静宇.群体智能算法及其应用[M].北京:中国水利水电出版社,2006.
[4] Karaboga D.An idea based on honey bee swarm for numerical optimization[M]. Kayseri:Erciyes University,2005.
[5] Duan H B, Xu C F,Xing Z H.A hybrid artificial bee colony optimization and quantum evolutionary algorithm for continuous optimization problem[J]. International Journal of Neural Systems,2010,20(1):39-50.
[6] Xu C F,Duan H B.Artificial bee colony(ABC) optimized edge potential function (EPF) approach to target recognition for low-altitude aircraft[J].Pattern Recognition Letters,2010,31(13):1759-1772.
[7]李晓磊.一种新型的智能优化方法—人工鱼群算法[D].杭州:浙江大学博士论文,2003
[8]李晓磊,路飞,田国会等.组合优化问题的人工鱼群算法应用[J].山东大学学报,2004,34(5):64-67.
[9] Cheng Y.M.,Liang L.,Chi S.C.,Wei W.B.. Determination of the critical slip surface using artificial fish swarms algorithm[J].Journal of Geotechnical and Geoenvironmental Engineering, 2008,134(2):244-251.
[10] Chan ShiGang.Klara Nahrstedt.An overview of quality of service routing for next-generation high-speed networks:Problems and solutions[J].IEEE Network,1998,3(6):64-79.
[11] Hedrick C.Routing information Protocol[S].RFC1058,1988.
[12] Moy J.OSPF Version 2[S]. IETF RFC 2328, April 1998.
[13] Callon R W. Use of OSI IS-IS for routing in TCP/IP and dual environments[S]. IETF RFC 1195, Dec, 1990.
[14] http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/igrp.htm.
[15] http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/en_igrp.htm.
[16] Rosen E.Exterior gateway protocol[S].RFC827,October 1982.
[17] Rekhter Y,Li T.A border gateway protocol4(BGP-4)[S].RFC1771,1995.
[18] Wang Z,Crowcroft J.QoS routing for supposing resource reservation[J].IEEE JSAC,1996,14(7):1228-1234.
[19] Salama H F,Reeves D S,Viniotis Y.A distributed algorithm for delay-constrainedunicast routing[C]. In :Proceedings of IEEE INFO-COM‘97,Japan,1997. 84-91.
[20] Srihari Nelakuditi,Zhang Zhili.A localized adaptive proportioning approach to QoS routing[J].IEEE Communications Magazine,2002,40(6):66-71.
[21] Wang Bin,Hou J C.Muhicast Routing and its Extension: Problems,Algorithms, Protocols[C].IEEE Network,January 2000(1):22-36.
[22] Estrin D,Farinacci D,Helmy A,et a1.Protocol independent muhicast-spare mode(PIM-SM)[S].Protocol Specification,Proposed Experimental RFC.Sep.1996.
[23] Bates T,Chandra R,Katz D,et a1.Multiprotocol extensions for BGP-4[S]. RFC2283,Feb.1998.
[24] Farinacci D,Bekhter Y,Meyer D,et a1.Muhicast source discovcry protocol(MSDP)[S].Internet-draft:draft-ietf-msdp-spec-06.txt,July 2000.
[25] Thaler D,Deborah E,Meyer D.Border gateway multicast protocol(BGMP)[S]. Protocol Specification,Internet-draft:draft-ietf-bgmp-spec-01.txt.March 2000.
[26] Kompella V P,Pasquale J C,Polyzos G C.Multicasting for multimedia applications[C].In: Proceedings of the 11th Annual Joint Conference of the IEEE Computer and Communications Societies ( INFOCOM’92 ). Florence Italy: IEEE Press,1992:2078-2085.
[27] Kompella V P,Pasquale J C,Polyzos G C.Multicast routing for multimedia communication[J]. IEEE ACM Transactions on Networking(TON),1993,1 (3):286-292.
[28] Wang Xingwei,Cao Jiannong,Cheng Hui,et al.QoS multicast routing for multimedia group communications using intelligent computational methods[J]. Computer Communications,2006,29(12):2217-2229.
[29] Sun Q,Langendoefer H.Efficient multicast routing for delay sensitive applications [C].In:Proceedings of the 2nd Workshop on Protocols for Multimedia Systems (PROM’95).Salzburg,Austria : [s.n.],1995:452-458.
[30] Zhu Qing,Parsa M,Garcialunaaxeves J J.A source-based algorithm for delay-constrained minimal cost multicasting[C].In:Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies ( INFOCOM’95). Washington,DC,USA: IEEE Computer Society,1995:377-384.
[31] Rouskas N G,Baldine I.Multicast routing with end-to-end delay and delay variation constraints [J]. IEEE Journal on Selected Area in Communications,1997, 15(3):346-356.
[32] Sheu P,Chen Shantai.A fast and efficient heuristic algorithm for the delay and delay variation bounded multicast tree problem[J].Computer Communications,2001,25 (8):825-833.
[33]王兴伟,李善林,黄敏.一种双种群进化集成QoS组播路由算法[J].东北大学学报(自然科学版),2007,28(6):789-792.
[34]吴传信,倪明放,陈鸣.路由选择的一种新遗传算法[J].电子科技大学学报,2008,34(13):200-203.
[35]黄伯虎,段振华.量子遗传算法在Web服务选择中的应用[J].西安电子科技大学学报,2010,37(1):56-61.
[36] Koyama A,Nishie T,Arai J,et al.A GA-based QoS multicast routing algorithm for large-scale networks[J].International Journal of High Performance Computing and Networking,2008,5(6):381-387.
[37]来卫国,李鸥,冉崇森.组播最优QoS划分问题及其混合遗传算法[J].系统仿真学报,2007,19(20):4731-4733.
[38]岳承君,井元伟,李庆奎.链路优化时延约束组播路由的遗传算法[J].东北大学学报(自然科学版),2007,28(4):457-460.
[39]邓亮,赵进,王新.基于遗传算法的网络编码优化[J].软件学报,2008,19(8): 2269-2279.
[40]蒲汛,何为,卢显良.基于改进遗传算法的多QoS约束网格任务调度[J].电子科技大学学报,2010,39(4)Ⅰ:54-56.
[41]王江睛,覃俊.一种基于免疫原理的多目标组播路由算法[J].计算机工程与应用,2007,43(13):130-131.
[42]赵秀平,谭冠政.基于免疫遗传算法的多约束QoS组播路由选择方法[J].计算机应用,2008,28(3):591-595.
[43] Huang Lin,Han Haishan,Hou Jian. Multicast routing based on the ant system[J]. Applied Mathematical Science,2007,1(57):2827-2838.
[44] Wang Hua,Shi Zhao,Ge Anfeng,et al. An optimized ant colony algorithm based on the gradual changing orientation factor for multi-constraint QoS routing[J]. Computer Communications,2009,32(4):586-593.
[45]王兴伟,蔡淑降,黄敏.NGI中一种智能预防式容错QoS组播路由模式[J].东北大学学报(自然科学版),2007,28(4):497-500.
[46]张舜,许毅.基于蚁群算法的多QoS约束的多播路由优化算法[J].武汉理工大学(交通科学与工程版),2007,31(5):939-942.
[47]陈岩,杨华江,朱华勇,等.基于配队蚁群算法的QoS组播路由方法[J].系统仿真学报,2008,20(5):1361-1365.
[48]王兴伟,侯美佳,易秀双,等.NGI中的一种禁忌-递阶遗传QoS组播路由算法[J].东北大学学报(自然科学版),2006,27(5):493-496.
[49]王军伟,王兴伟,黄敏.一种基于禁忌人工鱼群算法的智能QoS组播路由算法[J].小型微型计算机系统,2009,30(9):1720-1723.
[50]刘世栋,张顺颐,周井泉.基于双层递归神经网络模型求解最优组播路由[J].南京邮电大学学报(自然科学版),2007,27(6):7-13.
[51]张慧档,贺昱曜,姜文.基于混沌控制量的QoS组播路由算法[J].计算机工程,2008,34(9):130-132.
[52]聂仁灿,周冬明,赵东风,等.竞争型脉冲耦合神经网络及用于多约束QoS路由求解[J].通信学报,2010,31(1):65-72.
[53]范一鸣,余建军,方智敏.融合小生境机制的QoS多播路由遗传模拟退火算法[J].通信学报,2008,29(5):65-71.
[54] Liu Qing,Zhang Shilong,Yang Rui,et al.Web services composition with QoS bound based on simulated annealing algorithm[J].Journal of Southeast University, 2008,24(3):308-311.
[55]刘莉平,陈志刚,刘爱心.基于粒子群算法的Web服务组合研究[J].计算机工程,2008,34(5):104-106.
[56]祁超,张璟,马君亮.网格中执行SLA的并行多群体协作PSO框架[J].计算机工程,2008,34(21):190-192.
[57]赵永辉,史浩山,董相均.一种新的求解移动Agent路由问题优化算法[J].西北工业大学学报,2009,27(5):612-617.
[58]刘金明,王新生,梁清梅.基于遗传模拟退火算法的QoS组播路由算法[J].计算机工程,2007,33(9):212-215.
[59]傅鹏,张德运,马兆丰,等.Ad Hoc网络中基于模拟退火-蚁群算法的QoS路由发现方法[J].西安交通大学学报,2007,35(4):705-711.
[60]成兰,崔亚量,鲍雅萍.基于粒子群和博弈论的QoS组播路由算法[J].计算机工程,2008,34(14):92-94.
[61] Awduche D,Malcolm J,et al.Requirements for traffic engineering over MPLS[S].RFC2702.Sep.1999.
[62]程时端,刘斌.异步传递方式[M].北京:人民邮电出版社,1996.
[63]石晶林,丁炜等.MPLS宽带网络互联技术[M].北京:人民邮电出版社,2001.
[64] Awduche D O.MPLS and traffic engineering in IP networks[J].IEEE Communication Magazine,1999,37(12):42-47.
[65] Xiao X,Hanna A,Bailey B,et a1.Traffic engineering with MPLS in the Internet[J].IEEE Network Magazine,2000,14(2):28-33.
[66] Guerin R A,Orda A,Williams D.QoS routing mechanisms and OSPF extensions[A].In:Proceedings of IEEE Global Comunications Conference[C].New York,1997:1903-1908.
[67] Ma Q,Steenkiste P.On path selection for traffic with bandwidth guarantees[A]. In:Proceedings of International Conference on Network Protocols[C].Los Alamitos,1997:19l-202.
[68] Kamei S,Kimura T.Evaluation of muting algorithms and network topologies for MPLS traffic enginering[A].In:Proceedings of IEEE Global Comunications Conference[C].Piscataway,2001:25-29.
[69] Kodialarn M,Lakshman T V.Minimum interference muting with applications to MPLS traffic enginering[A].In:Proceedings of IEEE Computer and Communications Societies[C].Piscataway,2000:884-893.
[70] Kumar D,Kuri J,Kumar A.Routing guaranteed bandwidth virtual paths with simultaneous maximization of additional flows[A].In:Proceedings of the IEEE International Conference on Communications 2003[C].Washington, USA, 2003: 1759-1764.
[71] Szeto W,Boutaba R,Iraqi Y.Dynamic online routing algorithm for MPLS traffic engineering.Proceedings of the networking 2002[C]. In:Pisa,Italy,2002:936-946.
[72] Bagula A B,Botha M,Krzesinski A E.Online traffic engineering:the least interference optimization algorithm[C].In:IEEE International Conference on Communications(ICC2004).2004:1232-1236.
[73] Bagula A B.Online traffic engineering:A hybrid IGP+MPLS routing approach[C]. In:Proc.of the 5th Quality of Future Interact Services Conference,QoFIS 2004.LNCS 3266,2004:134-143.
[74] Figueixedo G B,Fonseca D N,Monteiro J.A minimum interference routing algorithm[C].In:IEEE International Conference on Communications(ICC 2004). 2004,4:1942-1947.
[75] Kar K,Kodialam M,Lakshman T V.MPLS traffic engineering using enhanced minimum interference routing:An approach based on lexicographic maxflow[C]. In:Proceedings of the 8th Intemational Workshop on Quality of Service 2000.Pittsburgh,USA,2000:105-114.
[76] Wang S X,Philip B,Chen C L.A new bandwidth guaranteed routing algorithm for MPLS traffic engineering[A].In:Proceedings of the IEEE International Conference on Communications 2002[C].New York,USA,2002:1001-1005.
[77]岳承君,井元伟.不确定信息QoS路由的概率遗传算法的研究[J].系统仿真学报,2006,18(2)Ⅰ:935-936.
[78] Xing Huanlai,Ji Yuefeng,Bai Lin,et a1.An Adaptive-Evolution-based QuantumGenetic Algorithm for QoS Multicast Routing Problem[J].Chinese Journal of Electronic,2009,18(3):525-529.
[79]张成文,苏森,陈俊亮.基于遗传算法的QoS感知的Web服务选择[J].计算机学报,2006,29(7):1029-1037.
[80]余荣,贾志鹏,梅顺良.NDPS:一种无线多媒体网络分组调度算法[J].计算机工程,2008,34(12):70-72.
[81]石文孝,范绍帅,王柟,等.基于模糊神经网络的异构无线网络接入选择算法[J].通信学报,2010,31(9):151-156.
[82]张健沛,马骏,杨静,等.文化算法求解移动Agent路由规划问题[J].哈尔滨工程大学学报,2009,30(8):913-917.
[83]赵永辉,史浩山,董相均.一种新的求解移动Agent路由问题优化算法[J].西北工业大学学报,2009,27(5):612-617.
[84] Oommen B J,Misra S,Granmo O C.A Stochastic Random Races Algorithm for Routing in MPLS Traffic Engineering[C].In:IEEE Infocom 2006;2006.
[85] Oommen B J,Misra S,Oranmo O C.Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering:A Multiple Race Track Learning Approach[J].IEEE Transactions on Computers. 2007,56(7):959-976.
[86]孙学胜,曹玖新,刘波,等.基于多目标粒子群优化的服务选择算法[J].东南大学学报(自然科学版),2009,39(4):684-689.
[87]夏虹,李增智.粒子群算法求解Web服务组合中基于QoS的服务选择[J].北京邮电大学学报,2009,32(4):63-67.
[88] Wang Jietai,Xu Jiadong,Xiang Mantian.EAQR:An Energy-efficient ACO Based QoS Routing Algorithm in Wireless Sensor Networks[J].Chinese Journal of Electronic,2009,18(1):113-116.
[89]崔梦天,钟勇,赵海军.ACOGA算法的多媒体网络QoS路由实现[J].电子科技大学学报,2009,38(2):266-269.
[90]齐小刚,刘立芳,刘三阳.基于距离向量深度的多约束路径选择算法[J].电子学报,2009,37(1):175-179.
[91]庄健,杨清宇,杜海峰,等.一种高效的复杂系统遗传算法[J].软件学报,2010, 21(11):2790-2801.
[92]聂仁灿,周冬明,赵东风,等.竞争型脉冲耦合神经网络及用于多约束QoS路由求解[J].通信学报,2010,31(1):65-71.
[93]孙岩,马华东,刘亮.一种基于蚁群优化的多媒体传感器网络服务感知路由算法[J].电子学报,2007,35(4):705-711.
[94]郑啸,罗军舟,宋爱波.基于Agent和蚁群算法的分布式服务发现[J].软件学报,2010,21(8):1795-1809.
[95]刘永广,叶梧,冯穗力,等.基于蚁群算法的无线Mesh网公平路由算法术[J].华南理工大学学报(自然科学版),2009,37(1):119-123.
[96]陈延军,潘泉,耶刚强,等.基于蚁群-遗传的无线传感器网络路由算法[J].湖南大学学报(自然科学版),2009,36(7):46-51.
[97]张晓东,王茜.多目标服务工作流混合粒子群调度算法[J].东南大学学报(自然科学版),2010,40(3):491-495.
[98]邢杰,萧德云.混合粒子群优化算法及其应用[J].化工学报,2009,59(7): 1707-1710.
[99]李娟,饶妮妮,廖瑞华,等.基于改进粒子群算法的Ad Hoc网络移动模型研究[J].电子学报,2010,38(1):222-227.
[100]夏虹,李增智.粒子群算法求解Web服务组合中基于QoS的服务选择[J].北京邮电大学学报,2009,32(4):63-67.
[101]刘安丰,吴贤佑,陈志刚.一种基于PSO的有效能量空洞避免的无线传感器路由算法[J].计算机研究与发展,2009,64(4):575-582.
[102]袁君,陈贝,朱光灿.采用混沌粒子群优化算法的水质模型参数辨识[J].东南大学学报(自然科学版)计算机学报,2009,39(5):1018-1022.
[103]吴光强,盛云.混沌理论在汽车非线性系统中的应用进展[J].机械工程学报,2010,46(10):81-87.
[104]杨海东,鄂加强.自适应变尺度混沌免疫优化算法及其应用[J].控制理论与应用,2009,26(10):1069-1074.
[105]谭良,吴波,刘震,等.一种基于混沌和小波变换的大容量音频信息隐藏算法[J].电子学报,2009,38(8):1812-1818.
[106]左斌,胡云安,李静.基于混沌退火的参数扰动递归神经网络极值搜索算法及其应用研究[J].电子学报,2009,37(12):2651-2656.
[107]王仲民,戴怡,赵辉.混沌遗传混合算法及其在弹簧剪应力校核中的应用[J].兵工学报,2009,30(8):1143-1146.
[108]聂方彦,高潮,郭永彩.基于模糊Havrda-Charvat熵与混沌PSO算法的红外人体图像分割[J].计算机辅助设计与图形学学报,2010,22(1):129-135.
[109]曲志坚,纪越峰,柏琳,等.基于网络编码的双路径组播树生成算法[J].电子学报,2010,38(10):2456-2459.
[110]左克,王怀民,史殿习,等.普适环境下带宽自适应的组播策略[J].电子学报,2009, 37(4):7-11.
[111]姜山,郑庆华,刘晓.一种支持大规模应用层组播的混合拓扑覆盖网络[J].西安交通大学学报,2010,44(2):11-30.
[112]刘星宝,蔡自兴,王勇,等.用于全局优化问题和混合免疫进化算法[J].西安电子科技大学学报,2010,37(5):971-980.
[113]王磊,刘小勇.协同人工免疫计算模型的研究[J].电子学报,2009,37(8): 1739-1745.
[114]何钦象,柯芬蓉,杨智春.周期变异概率的免疫克隆算法[J].控制理论与应用,2009,26(12):1449-1451.
[115]陆锦军,王执铨.基于量子粒子群优化的网络拥塞控制新策略[J].东南大学学报(自然科学版),2008,38(2):101-106.
[116]蒋哲远,韩江洪,王钊.动态的QoS感知Web服务选择和组合优化模型[J].计算机学报,2009,32(5):1014-1025.
[117]Riedl A.Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics[A].In:IEEE Workshop on IP Operations and Management(IPOM’02) [C].Dallas,USA,2002.
[118]王兴伟,邹荣珠,黄敏.基于蚂蚁算法的ABC支持型QoS组播路由机制[J].东北大学学报:自然科学版,2009,30(7):959-963.
[119]Sim Kwangmong,Sun Wenghong.Ant Colony Optimization for Routing and Load-Balancing:Survey and New Directions[J].IEEE Transactions on Systems, Man and Cybernetics,Part A:Systems and Humans.2003,33(5):560-572.
[120]Awduche D,Berger L,Gan D,et a1.RSVP-TE: Extensions to RSVP for LSP Tunnels[S].IETF RFC 3209,Dec,2001.
[121]Ashwood S P,Berger L.GMPLS signaling constraint based routed label distribution protocol (CR-LDP)extensions[S].IETF RFC3472,Jan,2003.
[122]Waxman B M. Routing of multipoint connections[J].IEEE Journal on Selected Area in Communications,1988,6(9):1617-1622.
[123]葛连升,王华,王海洋.求解度约束组播路由的新型蚁群算法[J].电子学报,2009,37(7):1447-1451.
[124]Gutjahr W J.A Graph-Based Ant System and Its Convergence[J].Future Generation Computer Systems,2000,16(8):873-888.
[125]Badr A,Fahmy A.A Proof of Convergence for Ant Algorithms[J].International Journal of Intelligent Computing and Information,2003,3(1):22-32.
[126]Gutjahr W J.ACO Algorithms with Guaranteed Convergence to the Optimal Solution[J].Information Processing Letters,2002,82(3):145-153.
[127]Stutzle T,Dorigo M.A Short Convergence Proof for a Class of Ant Colony Optimization Algorithm[J].IEEE Trans on Evolutionary Computions,2002,6(4): 358-365.
[128]段海滨,王道波.蚁群算法的全局收敛性研究及改进[J].系统工程与电子技术,2004,26(10):1506-1509.
[129]段海滨,王道波,于秀芬.基本蚁群算法的A.S.收敛性研究[J].应用基础与工程科学学报,2006,14(2):297-301.
[130]石立宝,郝晋.随机摄动蚁群算法的收敛性及其数值特性分析[J].系统仿真学报,2004,16(11):2421-2424.
[131]孙焘,王秀坤,刘业欣,等.一种简单蚂蚁算法及其收敛性分析[J].小型微型计算机系统,2003,24(8):1524-1527.
[132]Tou J T,Gonzalez R C.Pattern recognition principle[M].Addison Wesley, Reading,1974.
[133]李军华,黎明,袁丽华.基于聚类的伪并行遗传算法[J].模式识别与人工智能,2009,22(2):188-194.
[134]马超,练继建.基于聚类遗传算法的梯级水利枢纽短期电力调度优化[J].天津大学学报,2010,43(1):1-8.
[135]刘秋妍,钟章队,艾渤.基于粗糙集灰色聚类理论的GSM-R系统频率规划研究[J].铁道学报,2010,32(5):53-58.
[136]曾依灵,许洪波,吴高巍,白硕.一种基于语料特性的聚类算法[J].软件学报,2009,21(11):2802-2813.
[137]Eberhart R C,Shi Y.Particle swarm optimization: developments,applications and resources[A].In:Proceedings Congress on Evoutionary Computation 2001[C]. Piscataway,NJ: IEEE Press,2001:81-86.
[138]高尚,杨静宇.一种新的基于粒子群算法的聚类方法[J].南京航空航天大学学报,2006,38(6):62-64.
[139]Blake CL,Merz CJ. UCI Machine Learning repository of machine learning databases,1998. http: / /www. ics. uci.edu /mlearn / MLSummary.html.
[140]Ayad H,Kamel M. Topic discovery from text using aggregation of different clustering methods[A].In:Cohen R,Spencer B ed. Advances in artificial intelligence : 15th conference of the Canadian society for computational studies of intelligence[C].Calgary,2002:161-175.
[2]吴启迪,汪镭.智能微粒群算法研究及应用[M].南京:江苏教育出版社,2005.
[3]高尚,杨静宇.群体智能算法及其应用[M].北京:中国水利水电出版社,2006.
[4] Karaboga D.An idea based on honey bee swarm for numerical optimization[M]. Kayseri:Erciyes University,2005.
[5] Duan H B, Xu C F,Xing Z H.A hybrid artificial bee colony optimization and quantum evolutionary algorithm for continuous optimization problem[J]. International Journal of Neural Systems,2010,20(1):39-50.
[6] Xu C F,Duan H B.Artificial bee colony(ABC) optimized edge potential function (EPF) approach to target recognition for low-altitude aircraft[J].Pattern Recognition Letters,2010,31(13):1759-1772.
[7]李晓磊.一种新型的智能优化方法—人工鱼群算法[D].杭州:浙江大学博士论文,2003
[8]李晓磊,路飞,田国会等.组合优化问题的人工鱼群算法应用[J].山东大学学报,2004,34(5):64-67.
[9] Cheng Y.M.,Liang L.,Chi S.C.,Wei W.B.. Determination of the critical slip surface using artificial fish swarms algorithm[J].Journal of Geotechnical and Geoenvironmental Engineering, 2008,134(2):244-251.
[10] Chan ShiGang.Klara Nahrstedt.An overview of quality of service routing for next-generation high-speed networks:Problems and solutions[J].IEEE Network,1998,3(6):64-79.
[11] Hedrick C.Routing information Protocol[S].RFC1058,1988.
[12] Moy J.OSPF Version 2[S]. IETF RFC 2328, April 1998.
[13] Callon R W. Use of OSI IS-IS for routing in TCP/IP and dual environments[S]. IETF RFC 1195, Dec, 1990.
[14] http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/igrp.htm.
[15] http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/en_igrp.htm.
[16] Rosen E.Exterior gateway protocol[S].RFC827,October 1982.
[17] Rekhter Y,Li T.A border gateway protocol4(BGP-4)[S].RFC1771,1995.
[18] Wang Z,Crowcroft J.QoS routing for supposing resource reservation[J].IEEE JSAC,1996,14(7):1228-1234.
[19] Salama H F,Reeves D S,Viniotis Y.A distributed algorithm for delay-constrainedunicast routing[C]. In :Proceedings of IEEE INFO-COM‘97,Japan,1997. 84-91.
[20] Srihari Nelakuditi,Zhang Zhili.A localized adaptive proportioning approach to QoS routing[J].IEEE Communications Magazine,2002,40(6):66-71.
[21] Wang Bin,Hou J C.Muhicast Routing and its Extension: Problems,Algorithms, Protocols[C].IEEE Network,January 2000(1):22-36.
[22] Estrin D,Farinacci D,Helmy A,et a1.Protocol independent muhicast-spare mode(PIM-SM)[S].Protocol Specification,Proposed Experimental RFC.Sep.1996.
[23] Bates T,Chandra R,Katz D,et a1.Multiprotocol extensions for BGP-4[S]. RFC2283,Feb.1998.
[24] Farinacci D,Bekhter Y,Meyer D,et a1.Muhicast source discovcry protocol(MSDP)[S].Internet-draft:draft-ietf-msdp-spec-06.txt,July 2000.
[25] Thaler D,Deborah E,Meyer D.Border gateway multicast protocol(BGMP)[S]. Protocol Specification,Internet-draft:draft-ietf-bgmp-spec-01.txt.March 2000.
[26] Kompella V P,Pasquale J C,Polyzos G C.Multicasting for multimedia applications[C].In: Proceedings of the 11th Annual Joint Conference of the IEEE Computer and Communications Societies ( INFOCOM’92 ). Florence Italy: IEEE Press,1992:2078-2085.
[27] Kompella V P,Pasquale J C,Polyzos G C.Multicast routing for multimedia communication[J]. IEEE ACM Transactions on Networking(TON),1993,1 (3):286-292.
[28] Wang Xingwei,Cao Jiannong,Cheng Hui,et al.QoS multicast routing for multimedia group communications using intelligent computational methods[J]. Computer Communications,2006,29(12):2217-2229.
[29] Sun Q,Langendoefer H.Efficient multicast routing for delay sensitive applications [C].In:Proceedings of the 2nd Workshop on Protocols for Multimedia Systems (PROM’95).Salzburg,Austria : [s.n.],1995:452-458.
[30] Zhu Qing,Parsa M,Garcialunaaxeves J J.A source-based algorithm for delay-constrained minimal cost multicasting[C].In:Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies ( INFOCOM’95). Washington,DC,USA: IEEE Computer Society,1995:377-384.
[31] Rouskas N G,Baldine I.Multicast routing with end-to-end delay and delay variation constraints [J]. IEEE Journal on Selected Area in Communications,1997, 15(3):346-356.
[32] Sheu P,Chen Shantai.A fast and efficient heuristic algorithm for the delay and delay variation bounded multicast tree problem[J].Computer Communications,2001,25 (8):825-833.
[33]王兴伟,李善林,黄敏.一种双种群进化集成QoS组播路由算法[J].东北大学学报(自然科学版),2007,28(6):789-792.
[34]吴传信,倪明放,陈鸣.路由选择的一种新遗传算法[J].电子科技大学学报,2008,34(13):200-203.
[35]黄伯虎,段振华.量子遗传算法在Web服务选择中的应用[J].西安电子科技大学学报,2010,37(1):56-61.
[36] Koyama A,Nishie T,Arai J,et al.A GA-based QoS multicast routing algorithm for large-scale networks[J].International Journal of High Performance Computing and Networking,2008,5(6):381-387.
[37]来卫国,李鸥,冉崇森.组播最优QoS划分问题及其混合遗传算法[J].系统仿真学报,2007,19(20):4731-4733.
[38]岳承君,井元伟,李庆奎.链路优化时延约束组播路由的遗传算法[J].东北大学学报(自然科学版),2007,28(4):457-460.
[39]邓亮,赵进,王新.基于遗传算法的网络编码优化[J].软件学报,2008,19(8): 2269-2279.
[40]蒲汛,何为,卢显良.基于改进遗传算法的多QoS约束网格任务调度[J].电子科技大学学报,2010,39(4)Ⅰ:54-56.
[41]王江睛,覃俊.一种基于免疫原理的多目标组播路由算法[J].计算机工程与应用,2007,43(13):130-131.
[42]赵秀平,谭冠政.基于免疫遗传算法的多约束QoS组播路由选择方法[J].计算机应用,2008,28(3):591-595.
[43] Huang Lin,Han Haishan,Hou Jian. Multicast routing based on the ant system[J]. Applied Mathematical Science,2007,1(57):2827-2838.
[44] Wang Hua,Shi Zhao,Ge Anfeng,et al. An optimized ant colony algorithm based on the gradual changing orientation factor for multi-constraint QoS routing[J]. Computer Communications,2009,32(4):586-593.
[45]王兴伟,蔡淑降,黄敏.NGI中一种智能预防式容错QoS组播路由模式[J].东北大学学报(自然科学版),2007,28(4):497-500.
[46]张舜,许毅.基于蚁群算法的多QoS约束的多播路由优化算法[J].武汉理工大学(交通科学与工程版),2007,31(5):939-942.
[47]陈岩,杨华江,朱华勇,等.基于配队蚁群算法的QoS组播路由方法[J].系统仿真学报,2008,20(5):1361-1365.
[48]王兴伟,侯美佳,易秀双,等.NGI中的一种禁忌-递阶遗传QoS组播路由算法[J].东北大学学报(自然科学版),2006,27(5):493-496.
[49]王军伟,王兴伟,黄敏.一种基于禁忌人工鱼群算法的智能QoS组播路由算法[J].小型微型计算机系统,2009,30(9):1720-1723.
[50]刘世栋,张顺颐,周井泉.基于双层递归神经网络模型求解最优组播路由[J].南京邮电大学学报(自然科学版),2007,27(6):7-13.
[51]张慧档,贺昱曜,姜文.基于混沌控制量的QoS组播路由算法[J].计算机工程,2008,34(9):130-132.
[52]聂仁灿,周冬明,赵东风,等.竞争型脉冲耦合神经网络及用于多约束QoS路由求解[J].通信学报,2010,31(1):65-72.
[53]范一鸣,余建军,方智敏.融合小生境机制的QoS多播路由遗传模拟退火算法[J].通信学报,2008,29(5):65-71.
[54] Liu Qing,Zhang Shilong,Yang Rui,et al.Web services composition with QoS bound based on simulated annealing algorithm[J].Journal of Southeast University, 2008,24(3):308-311.
[55]刘莉平,陈志刚,刘爱心.基于粒子群算法的Web服务组合研究[J].计算机工程,2008,34(5):104-106.
[56]祁超,张璟,马君亮.网格中执行SLA的并行多群体协作PSO框架[J].计算机工程,2008,34(21):190-192.
[57]赵永辉,史浩山,董相均.一种新的求解移动Agent路由问题优化算法[J].西北工业大学学报,2009,27(5):612-617.
[58]刘金明,王新生,梁清梅.基于遗传模拟退火算法的QoS组播路由算法[J].计算机工程,2007,33(9):212-215.
[59]傅鹏,张德运,马兆丰,等.Ad Hoc网络中基于模拟退火-蚁群算法的QoS路由发现方法[J].西安交通大学学报,2007,35(4):705-711.
[60]成兰,崔亚量,鲍雅萍.基于粒子群和博弈论的QoS组播路由算法[J].计算机工程,2008,34(14):92-94.
[61] Awduche D,Malcolm J,et al.Requirements for traffic engineering over MPLS[S].RFC2702.Sep.1999.
[62]程时端,刘斌.异步传递方式[M].北京:人民邮电出版社,1996.
[63]石晶林,丁炜等.MPLS宽带网络互联技术[M].北京:人民邮电出版社,2001.
[64] Awduche D O.MPLS and traffic engineering in IP networks[J].IEEE Communication Magazine,1999,37(12):42-47.
[65] Xiao X,Hanna A,Bailey B,et a1.Traffic engineering with MPLS in the Internet[J].IEEE Network Magazine,2000,14(2):28-33.
[66] Guerin R A,Orda A,Williams D.QoS routing mechanisms and OSPF extensions[A].In:Proceedings of IEEE Global Comunications Conference[C].New York,1997:1903-1908.
[67] Ma Q,Steenkiste P.On path selection for traffic with bandwidth guarantees[A]. In:Proceedings of International Conference on Network Protocols[C].Los Alamitos,1997:19l-202.
[68] Kamei S,Kimura T.Evaluation of muting algorithms and network topologies for MPLS traffic enginering[A].In:Proceedings of IEEE Global Comunications Conference[C].Piscataway,2001:25-29.
[69] Kodialarn M,Lakshman T V.Minimum interference muting with applications to MPLS traffic enginering[A].In:Proceedings of IEEE Computer and Communications Societies[C].Piscataway,2000:884-893.
[70] Kumar D,Kuri J,Kumar A.Routing guaranteed bandwidth virtual paths with simultaneous maximization of additional flows[A].In:Proceedings of the IEEE International Conference on Communications 2003[C].Washington, USA, 2003: 1759-1764.
[71] Szeto W,Boutaba R,Iraqi Y.Dynamic online routing algorithm for MPLS traffic engineering.Proceedings of the networking 2002[C]. In:Pisa,Italy,2002:936-946.
[72] Bagula A B,Botha M,Krzesinski A E.Online traffic engineering:the least interference optimization algorithm[C].In:IEEE International Conference on Communications(ICC2004).2004:1232-1236.
[73] Bagula A B.Online traffic engineering:A hybrid IGP+MPLS routing approach[C]. In:Proc.of the 5th Quality of Future Interact Services Conference,QoFIS 2004.LNCS 3266,2004:134-143.
[74] Figueixedo G B,Fonseca D N,Monteiro J.A minimum interference routing algorithm[C].In:IEEE International Conference on Communications(ICC 2004). 2004,4:1942-1947.
[75] Kar K,Kodialam M,Lakshman T V.MPLS traffic engineering using enhanced minimum interference routing:An approach based on lexicographic maxflow[C]. In:Proceedings of the 8th Intemational Workshop on Quality of Service 2000.Pittsburgh,USA,2000:105-114.
[76] Wang S X,Philip B,Chen C L.A new bandwidth guaranteed routing algorithm for MPLS traffic engineering[A].In:Proceedings of the IEEE International Conference on Communications 2002[C].New York,USA,2002:1001-1005.
[77]岳承君,井元伟.不确定信息QoS路由的概率遗传算法的研究[J].系统仿真学报,2006,18(2)Ⅰ:935-936.
[78] Xing Huanlai,Ji Yuefeng,Bai Lin,et a1.An Adaptive-Evolution-based QuantumGenetic Algorithm for QoS Multicast Routing Problem[J].Chinese Journal of Electronic,2009,18(3):525-529.
[79]张成文,苏森,陈俊亮.基于遗传算法的QoS感知的Web服务选择[J].计算机学报,2006,29(7):1029-1037.
[80]余荣,贾志鹏,梅顺良.NDPS:一种无线多媒体网络分组调度算法[J].计算机工程,2008,34(12):70-72.
[81]石文孝,范绍帅,王柟,等.基于模糊神经网络的异构无线网络接入选择算法[J].通信学报,2010,31(9):151-156.
[82]张健沛,马骏,杨静,等.文化算法求解移动Agent路由规划问题[J].哈尔滨工程大学学报,2009,30(8):913-917.
[83]赵永辉,史浩山,董相均.一种新的求解移动Agent路由问题优化算法[J].西北工业大学学报,2009,27(5):612-617.
[84] Oommen B J,Misra S,Granmo O C.A Stochastic Random Races Algorithm for Routing in MPLS Traffic Engineering[C].In:IEEE Infocom 2006;2006.
[85] Oommen B J,Misra S,Oranmo O C.Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering:A Multiple Race Track Learning Approach[J].IEEE Transactions on Computers. 2007,56(7):959-976.
[86]孙学胜,曹玖新,刘波,等.基于多目标粒子群优化的服务选择算法[J].东南大学学报(自然科学版),2009,39(4):684-689.
[87]夏虹,李增智.粒子群算法求解Web服务组合中基于QoS的服务选择[J].北京邮电大学学报,2009,32(4):63-67.
[88] Wang Jietai,Xu Jiadong,Xiang Mantian.EAQR:An Energy-efficient ACO Based QoS Routing Algorithm in Wireless Sensor Networks[J].Chinese Journal of Electronic,2009,18(1):113-116.
[89]崔梦天,钟勇,赵海军.ACOGA算法的多媒体网络QoS路由实现[J].电子科技大学学报,2009,38(2):266-269.
[90]齐小刚,刘立芳,刘三阳.基于距离向量深度的多约束路径选择算法[J].电子学报,2009,37(1):175-179.
[91]庄健,杨清宇,杜海峰,等.一种高效的复杂系统遗传算法[J].软件学报,2010, 21(11):2790-2801.
[92]聂仁灿,周冬明,赵东风,等.竞争型脉冲耦合神经网络及用于多约束QoS路由求解[J].通信学报,2010,31(1):65-71.
[93]孙岩,马华东,刘亮.一种基于蚁群优化的多媒体传感器网络服务感知路由算法[J].电子学报,2007,35(4):705-711.
[94]郑啸,罗军舟,宋爱波.基于Agent和蚁群算法的分布式服务发现[J].软件学报,2010,21(8):1795-1809.
[95]刘永广,叶梧,冯穗力,等.基于蚁群算法的无线Mesh网公平路由算法术[J].华南理工大学学报(自然科学版),2009,37(1):119-123.
[96]陈延军,潘泉,耶刚强,等.基于蚁群-遗传的无线传感器网络路由算法[J].湖南大学学报(自然科学版),2009,36(7):46-51.
[97]张晓东,王茜.多目标服务工作流混合粒子群调度算法[J].东南大学学报(自然科学版),2010,40(3):491-495.
[98]邢杰,萧德云.混合粒子群优化算法及其应用[J].化工学报,2009,59(7): 1707-1710.
[99]李娟,饶妮妮,廖瑞华,等.基于改进粒子群算法的Ad Hoc网络移动模型研究[J].电子学报,2010,38(1):222-227.
[100]夏虹,李增智.粒子群算法求解Web服务组合中基于QoS的服务选择[J].北京邮电大学学报,2009,32(4):63-67.
[101]刘安丰,吴贤佑,陈志刚.一种基于PSO的有效能量空洞避免的无线传感器路由算法[J].计算机研究与发展,2009,64(4):575-582.
[102]袁君,陈贝,朱光灿.采用混沌粒子群优化算法的水质模型参数辨识[J].东南大学学报(自然科学版)计算机学报,2009,39(5):1018-1022.
[103]吴光强,盛云.混沌理论在汽车非线性系统中的应用进展[J].机械工程学报,2010,46(10):81-87.
[104]杨海东,鄂加强.自适应变尺度混沌免疫优化算法及其应用[J].控制理论与应用,2009,26(10):1069-1074.
[105]谭良,吴波,刘震,等.一种基于混沌和小波变换的大容量音频信息隐藏算法[J].电子学报,2009,38(8):1812-1818.
[106]左斌,胡云安,李静.基于混沌退火的参数扰动递归神经网络极值搜索算法及其应用研究[J].电子学报,2009,37(12):2651-2656.
[107]王仲民,戴怡,赵辉.混沌遗传混合算法及其在弹簧剪应力校核中的应用[J].兵工学报,2009,30(8):1143-1146.
[108]聂方彦,高潮,郭永彩.基于模糊Havrda-Charvat熵与混沌PSO算法的红外人体图像分割[J].计算机辅助设计与图形学学报,2010,22(1):129-135.
[109]曲志坚,纪越峰,柏琳,等.基于网络编码的双路径组播树生成算法[J].电子学报,2010,38(10):2456-2459.
[110]左克,王怀民,史殿习,等.普适环境下带宽自适应的组播策略[J].电子学报,2009, 37(4):7-11.
[111]姜山,郑庆华,刘晓.一种支持大规模应用层组播的混合拓扑覆盖网络[J].西安交通大学学报,2010,44(2):11-30.
[112]刘星宝,蔡自兴,王勇,等.用于全局优化问题和混合免疫进化算法[J].西安电子科技大学学报,2010,37(5):971-980.
[113]王磊,刘小勇.协同人工免疫计算模型的研究[J].电子学报,2009,37(8): 1739-1745.
[114]何钦象,柯芬蓉,杨智春.周期变异概率的免疫克隆算法[J].控制理论与应用,2009,26(12):1449-1451.
[115]陆锦军,王执铨.基于量子粒子群优化的网络拥塞控制新策略[J].东南大学学报(自然科学版),2008,38(2):101-106.
[116]蒋哲远,韩江洪,王钊.动态的QoS感知Web服务选择和组合优化模型[J].计算机学报,2009,32(5):1014-1025.
[117]Riedl A.Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics[A].In:IEEE Workshop on IP Operations and Management(IPOM’02) [C].Dallas,USA,2002.
[118]王兴伟,邹荣珠,黄敏.基于蚂蚁算法的ABC支持型QoS组播路由机制[J].东北大学学报:自然科学版,2009,30(7):959-963.
[119]Sim Kwangmong,Sun Wenghong.Ant Colony Optimization for Routing and Load-Balancing:Survey and New Directions[J].IEEE Transactions on Systems, Man and Cybernetics,Part A:Systems and Humans.2003,33(5):560-572.
[120]Awduche D,Berger L,Gan D,et a1.RSVP-TE: Extensions to RSVP for LSP Tunnels[S].IETF RFC 3209,Dec,2001.
[121]Ashwood S P,Berger L.GMPLS signaling constraint based routed label distribution protocol (CR-LDP)extensions[S].IETF RFC3472,Jan,2003.
[122]Waxman B M. Routing of multipoint connections[J].IEEE Journal on Selected Area in Communications,1988,6(9):1617-1622.
[123]葛连升,王华,王海洋.求解度约束组播路由的新型蚁群算法[J].电子学报,2009,37(7):1447-1451.
[124]Gutjahr W J.A Graph-Based Ant System and Its Convergence[J].Future Generation Computer Systems,2000,16(8):873-888.
[125]Badr A,Fahmy A.A Proof of Convergence for Ant Algorithms[J].International Journal of Intelligent Computing and Information,2003,3(1):22-32.
[126]Gutjahr W J.ACO Algorithms with Guaranteed Convergence to the Optimal Solution[J].Information Processing Letters,2002,82(3):145-153.
[127]Stutzle T,Dorigo M.A Short Convergence Proof for a Class of Ant Colony Optimization Algorithm[J].IEEE Trans on Evolutionary Computions,2002,6(4): 358-365.
[128]段海滨,王道波.蚁群算法的全局收敛性研究及改进[J].系统工程与电子技术,2004,26(10):1506-1509.
[129]段海滨,王道波,于秀芬.基本蚁群算法的A.S.收敛性研究[J].应用基础与工程科学学报,2006,14(2):297-301.
[130]石立宝,郝晋.随机摄动蚁群算法的收敛性及其数值特性分析[J].系统仿真学报,2004,16(11):2421-2424.
[131]孙焘,王秀坤,刘业欣,等.一种简单蚂蚁算法及其收敛性分析[J].小型微型计算机系统,2003,24(8):1524-1527.
[132]Tou J T,Gonzalez R C.Pattern recognition principle[M].Addison Wesley, Reading,1974.
[133]李军华,黎明,袁丽华.基于聚类的伪并行遗传算法[J].模式识别与人工智能,2009,22(2):188-194.
[134]马超,练继建.基于聚类遗传算法的梯级水利枢纽短期电力调度优化[J].天津大学学报,2010,43(1):1-8.
[135]刘秋妍,钟章队,艾渤.基于粗糙集灰色聚类理论的GSM-R系统频率规划研究[J].铁道学报,2010,32(5):53-58.
[136]曾依灵,许洪波,吴高巍,白硕.一种基于语料特性的聚类算法[J].软件学报,2009,21(11):2802-2813.
[137]Eberhart R C,Shi Y.Particle swarm optimization: developments,applications and resources[A].In:Proceedings Congress on Evoutionary Computation 2001[C]. Piscataway,NJ: IEEE Press,2001:81-86.
[138]高尚,杨静宇.一种新的基于粒子群算法的聚类方法[J].南京航空航天大学学报,2006,38(6):62-64.
[139]Blake CL,Merz CJ. UCI Machine Learning repository of machine learning databases,1998. http: / /www. ics. uci.edu /mlearn / MLSummary.html.
[140]Ayad H,Kamel M. Topic discovery from text using aggregation of different clustering methods[A].In:Cohen R,Spencer B ed. Advances in artificial intelligence : 15th conference of the Canadian society for computational studies of intelligence[C].Calgary,2002:161-175.