基于蚁群算法的QoS组播路由研究
|
摘要
网络技术的飞速发展远远不能满足媒体业务发展的需求。网络传输的业务不仅包括文本数据信息,还包括语音、图形、图像、视频、动画这些类型的多媒体信息。QoS(Qualityof Service)的概念被用来描述服务提供者和用户应用程序之间的性能约定。QoS需求体现为一系列网络约束条件,如链路约束,路径约束或树约束。因此QoS路由问题可以归结为寻找路径或树在满足约束条件的同时,优化某种特定的代价函数。
本文的主要工作和成果如下:
1.针对QoS组播路由的选择与优化问题,提出了一种基于蚁群算法寻找最优组播树的策略,即通过使用最小生成树导向的蚁群算法求解到各个目的节点的单播QoS路由问题时,巧妙地利用多个蚂蚁的全部爬行线路创建备选路径集,利用基于备选路径集的编码方式建立组播路由问题的整数规划模型,然后利用蚁群算法求解出最优组播树,并通过仿真实验加以了证实。
2.本文首先从QoS的概念出发,详细阐述了目前在QOS组播路由中存在的问题,研究了基于QoS的路由算法,提出了蚁群优化是一种用于求解复杂组合优化问题的启发式方法。本文对几种常见的蚁群优化算法进行了比较、分析和研究,对该几种算法进行了性能比较。而且总结了各蚁群优化算法中普遍存在的两个缺陷,即算法容易停滞和算法收敛速度较慢。基于现有蚁群算法提出了一种新的解决QoS组播路由问题的思路,新算法在寻找较优解和提高算法收敛速度两方面取得了较好的效果,仿真实验结果表明新算法的求解性能较优。
3.本文所述算法尽管是在随机生成的网络上进行了的QOS组播路由的应用,仍然与实际相距甚远,在以后还有大量的工作需要完成,需要继续更深入的研究蚁群优化算法及其最新的发展,通过与其他算法法的组合,来更好地解决QOS组播路由的优化问题。
The rapid development of the network technology is far from satisfying the tremendous demands of multimedia businesses. Network not only transmits data messages, but also kinds of multimedia messages like sound, graphics, video, animation. The notion of Quality of Service (QoS) has been proposed to describe the quality defined performance contract between the service provider and the user appilcations. The QoS requirement of a connection is given as a set of constraints, which can be link constraints, path constraints, or tree constraints. So the QoS routing problem can be attributed to the construction of path or tree which satisfies the end-to-end QoS constraints at the same time optimizes somes pecial cost function.
In this paper, the main work and achievements are as follows:
1. About the selection and optimization problems of QoS multicast routing ,this paper proposed to find the optimal strategy for multicast tree which is based on ant colony algorithm, namely, through the use of minimum spanning tree-oriented ant colony algorithm to each destination node unicast QoS Road by the issue, the clever use of multiple lines of ants crawling all set to create alternative paths, using alternative paths based on the set coded approach to building multicast routing problem in integer programming model, and then use ant colony algorithm for the optimal group of multicast tree, and through simulation experiments to be confirmed.
2. In this paper, starting from the concept of QoS in detail at the current Qos Multicast Routing Problems, research-based QoS routing algorithm, ant colony optimization is used for solving a complex combinatorial optimization problem inspired approach. Ant Colony Optimization (ACO) is a metaheuristic approach for solving hard combinatorial optimization problems.This thesis introduces the general development of ACO. Some analyses and remarks are made to compare the performance of some typical ACO algorithms. Additionaly, Two main disadvantages of ACO are also concluded, that is, stagnation and slow-convergence. An adaptive ant colony system algorithm is proposed to solve the QoS routing is proposed. Through dynamically adjusting the interaction among ant colonies, the stagnation of the new algorithm is effectively mitigated.The analysis and the experimental results show that the new algorithm can achieve better performance.
3. Algorithm described in this article, albeit in a randomly generated network carried out the QOS multicast routing applications, remained far away from the actual, in the future there is a lot of work to do, need to continue more in-depth study of ant colony optimization algorithm and its latest developments, through a combination of law and other algorithms to better address the QOS multicast routing optimization problem.
本文的主要工作和成果如下:
1.针对QoS组播路由的选择与优化问题,提出了一种基于蚁群算法寻找最优组播树的策略,即通过使用最小生成树导向的蚁群算法求解到各个目的节点的单播QoS路由问题时,巧妙地利用多个蚂蚁的全部爬行线路创建备选路径集,利用基于备选路径集的编码方式建立组播路由问题的整数规划模型,然后利用蚁群算法求解出最优组播树,并通过仿真实验加以了证实。
2.本文首先从QoS的概念出发,详细阐述了目前在QOS组播路由中存在的问题,研究了基于QoS的路由算法,提出了蚁群优化是一种用于求解复杂组合优化问题的启发式方法。本文对几种常见的蚁群优化算法进行了比较、分析和研究,对该几种算法进行了性能比较。而且总结了各蚁群优化算法中普遍存在的两个缺陷,即算法容易停滞和算法收敛速度较慢。基于现有蚁群算法提出了一种新的解决QoS组播路由问题的思路,新算法在寻找较优解和提高算法收敛速度两方面取得了较好的效果,仿真实验结果表明新算法的求解性能较优。
3.本文所述算法尽管是在随机生成的网络上进行了的QOS组播路由的应用,仍然与实际相距甚远,在以后还有大量的工作需要完成,需要继续更深入的研究蚁群优化算法及其最新的发展,通过与其他算法法的组合,来更好地解决QOS组播路由的优化问题。
The rapid development of the network technology is far from satisfying the tremendous demands of multimedia businesses. Network not only transmits data messages, but also kinds of multimedia messages like sound, graphics, video, animation. The notion of Quality of Service (QoS) has been proposed to describe the quality defined performance contract between the service provider and the user appilcations. The QoS requirement of a connection is given as a set of constraints, which can be link constraints, path constraints, or tree constraints. So the QoS routing problem can be attributed to the construction of path or tree which satisfies the end-to-end QoS constraints at the same time optimizes somes pecial cost function.
In this paper, the main work and achievements are as follows:
1. About the selection and optimization problems of QoS multicast routing ,this paper proposed to find the optimal strategy for multicast tree which is based on ant colony algorithm, namely, through the use of minimum spanning tree-oriented ant colony algorithm to each destination node unicast QoS Road by the issue, the clever use of multiple lines of ants crawling all set to create alternative paths, using alternative paths based on the set coded approach to building multicast routing problem in integer programming model, and then use ant colony algorithm for the optimal group of multicast tree, and through simulation experiments to be confirmed.
2. In this paper, starting from the concept of QoS in detail at the current Qos Multicast Routing Problems, research-based QoS routing algorithm, ant colony optimization is used for solving a complex combinatorial optimization problem inspired approach. Ant Colony Optimization (ACO) is a metaheuristic approach for solving hard combinatorial optimization problems.This thesis introduces the general development of ACO. Some analyses and remarks are made to compare the performance of some typical ACO algorithms. Additionaly, Two main disadvantages of ACO are also concluded, that is, stagnation and slow-convergence. An adaptive ant colony system algorithm is proposed to solve the QoS routing is proposed. Through dynamically adjusting the interaction among ant colonies, the stagnation of the new algorithm is effectively mitigated.The analysis and the experimental results show that the new algorithm can achieve better performance.
3. Algorithm described in this article, albeit in a randomly generated network carried out the QOS multicast routing applications, remained far away from the actual, in the future there is a lot of work to do, need to continue more in-depth study of ant colony optimization algorithm and its latest developments, through a combination of law and other algorithms to better address the QOS multicast routing optimization problem.
引文
[1]Newman P.IP Switching and Gigabit Routers[J].IEEC ommunications Magazine.1997,35(1):68-81.
[2]Guerin R,Peris V.Quality-of-Service in Packet Networks:basic mechanis and directions[J].Computer Networks.1999,3:169-189.
[3]Xipengxiao and NiLionel M.Intenret QoS:a big picture[J].IEEE Network,1999,13(2):8-18.
[4]Hobbes.R.Zakon.Intenret Timeline[S].IEYFRFC2235,1997.
[5]Boulevard W.Arlin Intenret Protocol[S].IETF RFC791.1981.
[6]Postel J,Nagle J.Transmission Contorl Portocol[S].IETF RFC793,1981.
[7]Nagle J.Congestion Contorl in IP/TCP Internetworks[S].IETF RFC896,1984.
[8]Crawley E,Nair R,Rajagopalan B,and Sandick H.A framework for QoS-based Routing in the Intenret[S].Technical Report RFC 2386,IETF,August 1998.
[9]Bernet Y,Ford P,Yavatkar R,Baker F,Zhang L,Speer M,Braden R,Davie B,Wroclawski J,Felstaine E.A Framework for Integrated Services Operation over Diffserv Networks[S],RFC 2998,November 2000.
[10]Wroclawski J.The Use of RSVP with IETF Integrated Services[S],RFC2210,September 1997.
[11]Nichols K,Jacobson V,Zhang L.A Two-bit Differentiated Services Architecture for the Internet[S],RFC 2638,July 1999.
[12]Rosen E,Viswanathan A,Callon R.Multiprotocol Label Switching Architecture[S],RFC 3031,January 2001.
[13]Crawley E,Nair R,Rajagopalan B.et al.A framework for QoS-based routing in the Internet[S].RFC 2386,1998.
[14]Wang B,Hou J C.Muliticast routing and its Qos Extension:Problem,Algorithm,and protocols[J].1EEE Network,2000,14(1):22-36
[15]Chen S and Nalustedt K.An overview of quality-of-service routing for the next generation high-speed networks:Problems and solutions[J].IEEE Network,1998,12(6):64 -79.
[16]崔勇,吴建平,徐烙,徐明伟,互联网服务质量路由算法研究综述[J],软件学报,2002,13(11):205-207.
[17]Mieghem P.Van,Kuipers F.A,Korkmaz T,Krunz M,Curado M,Monteiro E,Masip-Bruin X,Sole-Pareta J,and Sanchez-Lopez S.Quality of Service Routing[S].Springer LNCS 2856,2003.
[18]Kuipers F.A,Korkmaz T,Krunz M and Mieghem P.A review of constraint-based routing algorithms[R].Technical report,2002.
[19]Kuipers F.A,Korkmaz T,Krunz M,and Mieghem P Van.Performance evaluation of constraint-based path selection algorithms[J].IEEE Network,2004.
[20]Guo Y,Kuipers F A,and Mieghem P Van.A link-disjoint paths algorithm for reliable qos routing[J].International Journal of Communication Systems,2003,16(9):779-798.
[21]闵应骅.计算机网络路由研究综述[J].计算机学报.2003,26(6):641-649.
[22]朱惠玲,杭大明,马正新,曹志刚,李安国.Qos路由选择:问题与解决方法综述[J].电子学报,2003,31(1):109-116.
[23]Chen S and Nahrstedt K.On finding multi-constrained paths[A].In Proceedings of the ICC '98Conference[C].IEEE,1998,874-879.
[24]王晰.基于QoS约束的组播路由算法研究[D].南京:南京理工大学,2004.
[25]Deering S,Partridge C,Waitzman D.Distance Vector Multicast Routing Protocol[S].RFC 1075,1998.
[26]Eriksson H.MBONE:The Multicast Backbone[J].Communications of the ACM,1994,37(8):54-60.
[27]Malkin G.RIP Version 2[S].RFC 2453,1998
[28]Thyagarajan A,Deering S.Hierarchical Distance-Vector Multicast Routing for the Mbone[A].In Proceedings of ACM SIGCOMM'95[C].1995:60-66.
[29]Estrin D,Farinacci D,Helmy A,et al.Protocol Independent Multicast-Sparse Mode(PIM-SM):Protocol Specification[S].RFC 2362,1998.
[30]Adams A,Nicholas J,Siadak W.Protocol Independent Multicast -Dense Mode(PIM-DM):Protocol Specification(Revised)[S].Internet Draft,2003.
[31]Moy J.Multicast Extensions to OSPF[S].RFC 1584,1994.
[32]Moy J.OSPF Version 2[S].RFC 2328,1998.
[33]Ballardie A.Core Based Trees(CBT) Multicast Routing Architecture[S].RFC 2201,1997.
[34]Cormen T H,Leiserson C E,Riverst R L,et al.Introduction to Algorithms[M].2nd ed.The MIT Pressand McGraw-Hill book company.2001.
[35]Chen S,Nahrstedt K.On Finding Multi-Constrained Paths[A].In Proeeedings of IEEEICC' 98[C],1998.
[36]Wang B,Hou J C.Multicast Routing and Its QoS Extension:Problem,algorithm,and Protocols[J].IEEE Network,2000,14(1):22-36.
[37]Wang Z,Crowcroft J.QoS Routing for Supporting Resource Reservation[J].IEEE Journal and Selected Areas in Communications,1996,14(7):1228-1234.
[38]Shacham N.Multipoint Communication by Hierarchically Encoded Data[A].In Proceedings of IEEE INFOCOM'92[C],1992:2107-2114.
[39]Carey M R,Johnson D S.Computers and Intractability:A Guide to the Theory of NP- Completeness[M].New York:W.H.Freeman and Co,1979.
[40]Kou L,Markowsky G,Berman L.A fast algorithm for steiner trees in graph[J].Acta Informatic,1981,15:141-145.
[41]Kompella V P,Pasquale J C,Polyzos G C.Multicast routing for multimedia communications[J].IEEE/ACM Transactions on Networking,1993,1(3):286-292.
[42]Sun Q.and Langendorfer H.A New Distributed Routing Algorithm with End-to-End Delay Guarantee[A].The 2nd WKsp.Protocols Multimedia SystemiC],1995,452-458.
[43]Fred B and Anujan V.Degree-constrained multicasting in point-to-point networks[A].Proc.IEEE INFOCOM'95[C],Boston,Massachusetts,1995,369-376.
[44]Parsa M,Zhu Q,Garcia-Luna-Aceves J J.An iterative algorithm for delay-constrained minimum-cost multicasting[J].IEEE/ACM Tracsactions on Networking,1998,6(4):461-474.
[45]Asaka T and Miyoshi T.Dynamic Multicast Routing Algorithm Using Predetermined Path Search[A].IEICE TRANS.COMMUN[C].2000,E83-B(5):1128-1134.
[46]Kompella V P,Pasquale J C,and Polyzos G C.Two Distributed Algorithms for Multicasting Multimedia Information[A].ICCCN'93[C],San Diego,CA,1993,343-349.
[47]Esbensen H,Computing heal-optimal solution to the Steiner problem in a graph using a genetic algorithm[J].Networks,1995,26(1):173-185.
[48]张素兵,刘泽民.基于蚂蚁算法的时延受限公布式多播路由研究[J].通信学报,2001,24(3):70-74.
[49]陈杰,张洪伟.基于自适应蚁群算法的QoS组播路由算法[J].计算机工程,2008,34(13):200-203.
[50]Dorigo M,Gambardella L M.Ant colony system:a cooperative learning approach to the traveling salesman problem[J].IEEE Transactions on Evolutionary Computation,1997,1(1):53-66
[51]St(u|¨)tzle T,Hoos H.The MAX-MIN ant system and local search for the traveling salesman problem[A].Proc.IEEE International Conference on Evolutionary Computation[C],1997,309-314.
[52]Bullnheimer B,Hartl R F and Strauss C.A new rank-based version of the Ant System:A computational study[J].Central European Journal for Operations Research and Economics,1999,7(1):25-38.
[53]Dorigo M,Maniezzo V,Colomi A.The Any System:Optimization by a colony of cooperating agents[J].IEEE Transactions on System,Man,and Cybernetics-Part B,1996,26(1):29-41.
[54]吴斌,史忠植.一种基于蚁群算法的TSP问题分段求解算法[J].计算机学报,2001,24(12):1328-1333.
[55]秦玲.蚁群算法的改进与应用[D].扬州大学,2004.
[56]孙勇,何培舟,张恒,温向明.一种基于蚁群算法的动态组播QOS路由算法[J].重庆邮电大学学报(自然科学版),2007,增刊(6):92-95.
[57]王颖,谢剑英.一种自适应蚁群算法及其仿真研究[J].系统仿真学报,2002,14(1):31-33.
[58]陈立,朱志勇,姚丹霖.基于蚁群优化算法的QoS多播路由算法改进及实证[J].湘潭大学自然科学学报,2009,31(6):155-159.
[59]李开荣,陈宏建,陈崚.一种动态自适应蚁群算法[J].计算机工程与应用,2004,40(29):149-152.
[60]吕勇,赵光宙,苏凡军.基于蚁群算法的自适应动态路由算法[J].浙江大学学报(工学版),2005,39(10):1537-1540.
[61]陈峻,沈洁,秦玲,陈宏建,基于分布均匀度的自适应蚁群算法[J].软件学报,2003,14(08):1379-1386.
[62]高坚,基于自适应蚁群算法的多受限网络Qos路由优化[J].计算机工程,2003,29(19):40-41.
[63]赵宝江,李士勇,金俊,基于自适应路径选择和信息素更新的蚁群算法[J].计算机工程与应用,2007,43(3):12-15.
[64]吴超,钟一文.基于蚁群优化算法的QoS组播路由问题的研究[J].福建电脑,2009,28(1):15-17.
[65]邵志伟,浦小祥,基于蚁群算法的自适应QoS路由优化[J].信息技术,2002,12:41-43.
[66]Bernard M.Waxman.Routing of Multipoint connection.IEEE Journal on selected Areas in communi cation,1988,6(9):1617-1622.
[67]Salama H.F.Multicast Routing for Real-Time Communication on High-Speed Networks[D].PhD thesis,Noah Carolina State University,Department of Electrical and Computer Engineering,1996.
[68]黄晓雯,贺细平,良贤英.基于遗传算法的QoS路由选择与仿真[J].计算机仿真,2003,20(6):43-46.
[69]Genui Zhou,Mitsuo Gem,Tianzu Wu,A New Approach to The Degree-Constrained Minimun Spanning Tree Problem Using Genetic Algorithm.IEEE International Conference on.Systems,Man and Cybernetics,1996,4:2683-2688.
[2]Guerin R,Peris V.Quality-of-Service in Packet Networks:basic mechanis and directions[J].Computer Networks.1999,3:169-189.
[3]Xipengxiao and NiLionel M.Intenret QoS:a big picture[J].IEEE Network,1999,13(2):8-18.
[4]Hobbes.R.Zakon.Intenret Timeline[S].IEYFRFC2235,1997.
[5]Boulevard W.Arlin Intenret Protocol[S].IETF RFC791.1981.
[6]Postel J,Nagle J.Transmission Contorl Portocol[S].IETF RFC793,1981.
[7]Nagle J.Congestion Contorl in IP/TCP Internetworks[S].IETF RFC896,1984.
[8]Crawley E,Nair R,Rajagopalan B,and Sandick H.A framework for QoS-based Routing in the Intenret[S].Technical Report RFC 2386,IETF,August 1998.
[9]Bernet Y,Ford P,Yavatkar R,Baker F,Zhang L,Speer M,Braden R,Davie B,Wroclawski J,Felstaine E.A Framework for Integrated Services Operation over Diffserv Networks[S],RFC 2998,November 2000.
[10]Wroclawski J.The Use of RSVP with IETF Integrated Services[S],RFC2210,September 1997.
[11]Nichols K,Jacobson V,Zhang L.A Two-bit Differentiated Services Architecture for the Internet[S],RFC 2638,July 1999.
[12]Rosen E,Viswanathan A,Callon R.Multiprotocol Label Switching Architecture[S],RFC 3031,January 2001.
[13]Crawley E,Nair R,Rajagopalan B.et al.A framework for QoS-based routing in the Internet[S].RFC 2386,1998.
[14]Wang B,Hou J C.Muliticast routing and its Qos Extension:Problem,Algorithm,and protocols[J].1EEE Network,2000,14(1):22-36
[15]Chen S and Nalustedt K.An overview of quality-of-service routing for the next generation high-speed networks:Problems and solutions[J].IEEE Network,1998,12(6):64 -79.
[16]崔勇,吴建平,徐烙,徐明伟,互联网服务质量路由算法研究综述[J],软件学报,2002,13(11):205-207.
[17]Mieghem P.Van,Kuipers F.A,Korkmaz T,Krunz M,Curado M,Monteiro E,Masip-Bruin X,Sole-Pareta J,and Sanchez-Lopez S.Quality of Service Routing[S].Springer LNCS 2856,2003.
[18]Kuipers F.A,Korkmaz T,Krunz M and Mieghem P.A review of constraint-based routing algorithms[R].Technical report,2002.
[19]Kuipers F.A,Korkmaz T,Krunz M,and Mieghem P Van.Performance evaluation of constraint-based path selection algorithms[J].IEEE Network,2004.
[20]Guo Y,Kuipers F A,and Mieghem P Van.A link-disjoint paths algorithm for reliable qos routing[J].International Journal of Communication Systems,2003,16(9):779-798.
[21]闵应骅.计算机网络路由研究综述[J].计算机学报.2003,26(6):641-649.
[22]朱惠玲,杭大明,马正新,曹志刚,李安国.Qos路由选择:问题与解决方法综述[J].电子学报,2003,31(1):109-116.
[23]Chen S and Nahrstedt K.On finding multi-constrained paths[A].In Proceedings of the ICC '98Conference[C].IEEE,1998,874-879.
[24]王晰.基于QoS约束的组播路由算法研究[D].南京:南京理工大学,2004.
[25]Deering S,Partridge C,Waitzman D.Distance Vector Multicast Routing Protocol[S].RFC 1075,1998.
[26]Eriksson H.MBONE:The Multicast Backbone[J].Communications of the ACM,1994,37(8):54-60.
[27]Malkin G.RIP Version 2[S].RFC 2453,1998
[28]Thyagarajan A,Deering S.Hierarchical Distance-Vector Multicast Routing for the Mbone[A].In Proceedings of ACM SIGCOMM'95[C].1995:60-66.
[29]Estrin D,Farinacci D,Helmy A,et al.Protocol Independent Multicast-Sparse Mode(PIM-SM):Protocol Specification[S].RFC 2362,1998.
[30]Adams A,Nicholas J,Siadak W.Protocol Independent Multicast -Dense Mode(PIM-DM):Protocol Specification(Revised)[S].Internet Draft,2003.
[31]Moy J.Multicast Extensions to OSPF[S].RFC 1584,1994.
[32]Moy J.OSPF Version 2[S].RFC 2328,1998.
[33]Ballardie A.Core Based Trees(CBT) Multicast Routing Architecture[S].RFC 2201,1997.
[34]Cormen T H,Leiserson C E,Riverst R L,et al.Introduction to Algorithms[M].2nd ed.The MIT Pressand McGraw-Hill book company.2001.
[35]Chen S,Nahrstedt K.On Finding Multi-Constrained Paths[A].In Proeeedings of IEEEICC' 98[C],1998.
[36]Wang B,Hou J C.Multicast Routing and Its QoS Extension:Problem,algorithm,and Protocols[J].IEEE Network,2000,14(1):22-36.
[37]Wang Z,Crowcroft J.QoS Routing for Supporting Resource Reservation[J].IEEE Journal and Selected Areas in Communications,1996,14(7):1228-1234.
[38]Shacham N.Multipoint Communication by Hierarchically Encoded Data[A].In Proceedings of IEEE INFOCOM'92[C],1992:2107-2114.
[39]Carey M R,Johnson D S.Computers and Intractability:A Guide to the Theory of NP- Completeness[M].New York:W.H.Freeman and Co,1979.
[40]Kou L,Markowsky G,Berman L.A fast algorithm for steiner trees in graph[J].Acta Informatic,1981,15:141-145.
[41]Kompella V P,Pasquale J C,Polyzos G C.Multicast routing for multimedia communications[J].IEEE/ACM Transactions on Networking,1993,1(3):286-292.
[42]Sun Q.and Langendorfer H.A New Distributed Routing Algorithm with End-to-End Delay Guarantee[A].The 2nd WKsp.Protocols Multimedia SystemiC],1995,452-458.
[43]Fred B and Anujan V.Degree-constrained multicasting in point-to-point networks[A].Proc.IEEE INFOCOM'95[C],Boston,Massachusetts,1995,369-376.
[44]Parsa M,Zhu Q,Garcia-Luna-Aceves J J.An iterative algorithm for delay-constrained minimum-cost multicasting[J].IEEE/ACM Tracsactions on Networking,1998,6(4):461-474.
[45]Asaka T and Miyoshi T.Dynamic Multicast Routing Algorithm Using Predetermined Path Search[A].IEICE TRANS.COMMUN[C].2000,E83-B(5):1128-1134.
[46]Kompella V P,Pasquale J C,and Polyzos G C.Two Distributed Algorithms for Multicasting Multimedia Information[A].ICCCN'93[C],San Diego,CA,1993,343-349.
[47]Esbensen H,Computing heal-optimal solution to the Steiner problem in a graph using a genetic algorithm[J].Networks,1995,26(1):173-185.
[48]张素兵,刘泽民.基于蚂蚁算法的时延受限公布式多播路由研究[J].通信学报,2001,24(3):70-74.
[49]陈杰,张洪伟.基于自适应蚁群算法的QoS组播路由算法[J].计算机工程,2008,34(13):200-203.
[50]Dorigo M,Gambardella L M.Ant colony system:a cooperative learning approach to the traveling salesman problem[J].IEEE Transactions on Evolutionary Computation,1997,1(1):53-66
[51]St(u|¨)tzle T,Hoos H.The MAX-MIN ant system and local search for the traveling salesman problem[A].Proc.IEEE International Conference on Evolutionary Computation[C],1997,309-314.
[52]Bullnheimer B,Hartl R F and Strauss C.A new rank-based version of the Ant System:A computational study[J].Central European Journal for Operations Research and Economics,1999,7(1):25-38.
[53]Dorigo M,Maniezzo V,Colomi A.The Any System:Optimization by a colony of cooperating agents[J].IEEE Transactions on System,Man,and Cybernetics-Part B,1996,26(1):29-41.
[54]吴斌,史忠植.一种基于蚁群算法的TSP问题分段求解算法[J].计算机学报,2001,24(12):1328-1333.
[55]秦玲.蚁群算法的改进与应用[D].扬州大学,2004.
[56]孙勇,何培舟,张恒,温向明.一种基于蚁群算法的动态组播QOS路由算法[J].重庆邮电大学学报(自然科学版),2007,增刊(6):92-95.
[57]王颖,谢剑英.一种自适应蚁群算法及其仿真研究[J].系统仿真学报,2002,14(1):31-33.
[58]陈立,朱志勇,姚丹霖.基于蚁群优化算法的QoS多播路由算法改进及实证[J].湘潭大学自然科学学报,2009,31(6):155-159.
[59]李开荣,陈宏建,陈崚.一种动态自适应蚁群算法[J].计算机工程与应用,2004,40(29):149-152.
[60]吕勇,赵光宙,苏凡军.基于蚁群算法的自适应动态路由算法[J].浙江大学学报(工学版),2005,39(10):1537-1540.
[61]陈峻,沈洁,秦玲,陈宏建,基于分布均匀度的自适应蚁群算法[J].软件学报,2003,14(08):1379-1386.
[62]高坚,基于自适应蚁群算法的多受限网络Qos路由优化[J].计算机工程,2003,29(19):40-41.
[63]赵宝江,李士勇,金俊,基于自适应路径选择和信息素更新的蚁群算法[J].计算机工程与应用,2007,43(3):12-15.
[64]吴超,钟一文.基于蚁群优化算法的QoS组播路由问题的研究[J].福建电脑,2009,28(1):15-17.
[65]邵志伟,浦小祥,基于蚁群算法的自适应QoS路由优化[J].信息技术,2002,12:41-43.
[66]Bernard M.Waxman.Routing of Multipoint connection.IEEE Journal on selected Areas in communi cation,1988,6(9):1617-1622.
[67]Salama H.F.Multicast Routing for Real-Time Communication on High-Speed Networks[D].PhD thesis,Noah Carolina State University,Department of Electrical and Computer Engineering,1996.
[68]黄晓雯,贺细平,良贤英.基于遗传算法的QoS路由选择与仿真[J].计算机仿真,2003,20(6):43-46.
[69]Genui Zhou,Mitsuo Gem,Tianzu Wu,A New Approach to The Degree-Constrained Minimun Spanning Tree Problem Using Genetic Algorithm.IEEE International Conference on.Systems,Man and Cybernetics,1996,4:2683-2688.