基于IP网络QoS多播路由技术的研究
|
摘要
随着计算机网络技术的发展,视频会议、视频点播(VoD)和远程教学等实时多媒体应用已大量涌现,它们的共同特点是需要从一个源节点或多个源节点将信息传输到多个目的节点。由于这些实时业务对网络传输中的时延、时延抖动、带宽、包丢失率和代价等较为敏感,当突发性较高的FTP或含有图象文件的HTTP等业务在网络上传输时,实时业务的传输将会受到影响,这样就需要服务质量(QoS:Quality of Service)技术的支持,以确保实时业务的通信质量。传统的Internet路由协议,如开放最短路径优先(OSPF)和路由信息协议(RIP)是基于“最短路径”算法的路由技术,即路由是在单个特征值下的优化,只提供“尽力而为”服务,不能提供QoS保证。同时,随着移动网络和全光网络等高性能网络技术的不断发展及其应用领域的日益扩大,基于QoS约束的多播路由算法和协议的理论研究与实现,已成为网络领域中研究的重要课题。
QoS路由就是寻找满足特定QoS约束的一条可行路径(QoS单播路径)或一棵多播树(QoS多播路由),它与传统的尽力传输不同,QoS路由一般有多个约束条件,通常是一个NP-完全问题。而多播路由是网络层具备的功能,多播问题的关键在于多播路径的确定,实现多播的最常用的方法就是建立多播树,多播路由算法主要用来建立一棵性能好的多播树,并使它满足各种业务的服务质量(QoS)的需求。
目前提出的大多数QoS路由算法是启发式算法,有些算法由于计算的复杂性而无法满足实际应用的要求;有些算法因缺乏全局的观点,扩展性较差,难以适应有动态成员加入的大型群组。本文在总结这些算法的基础上,提出了解决QoS多播路由的相关方法,主要集中在多QoS约束的多播路由算法和协议、蚂蚁算法和移动代理在IP网络中路由的优化研究,具体包括以下几方面:
1)论文从研究QoS多播路由的现状出发,分析了IP网络中QoS路由的策略和QoS多播路由的问题;从IPQoS的定义和机制出发,研究了综合服务模型(IntServ)、资源预留协议(RSVP)、差分业务模型(DiffServ)、多协议标签交换(MPLS)、IPQoS的综合实现策略以及IPQoS在Linux中的实现;研究了QoS的多播路由机制,提出了在NS2下实现QoS约束的多播路由算法
With the development of computer network technology, multimedia is enormously applied to real time video conference, VoD and long-distance teaching, etc. Their common feature is to transmit information from one or multiple source nodes to multiple destination nodes. As these real-time operations are sensitive to delay, delay-jitter, packet-loss and cost in the network transmission, they are liable to be affected by the operation portfolios of FTP and HTTP, and thus demand QoS to assure real time communications. Traditional internet routing protocols, such as OSPF and RIP, are routing technology based on "shortest path algorithm" in which the route is optimized with a single metric, and just offer "best-effort" service rather than QoS. Meanwhile, the theoretic research and realization of the multicast routing algorithms and protocols based on QoS have become a major research topic with the rapid development of such high-powered network technologies as mobile networks and AON All Optical Network and the progressive expansion of the scopes of their applications.QoS routing is how to select network routes with sufficient resources for the requested QoS parameters. In comparison with best-effort routing, QoS routing has some constraints and mostly is NP complete problem. Multicast routing is a network-layer function. A fundamental issue in multicast communication is how to determine an effcient message route (multicast routing). Tree construction is a commonly used approach in solving the multicast routing prolem. multicast routing algorithms are used to compute multicast trees that satisfy QoS requirements.Now, the propsed heuristic algorithms can't meet the QoS requirements for computation complexity, and adapt to large groups with member join dynamically for their expansibility. A method for the QoS multicast routing is presented based on the summary of the algorithms and protocols proposed in the past. The research mainly concentrates on the algorithms and protocols of QoS multicast routing, ant algorithms and the mobile agent optimization routing in IP networks. In detail, the contributions of this paper include the following.1)Firstly, the analysis on the strategy of QoS routing and QoS multicast routing problem in IP networks are done by studying the status quo of QoS multicast routing. Secondly, based on the definition and mechanism of IP QoS , the research on the IntServ, RSVP, DiffSer, MPLS, the comprehensive implementation strategy of QoS in IP network and the implementation of IP QoS in Linux are conducted. Finally, an approach to QoS multicast routing algorithms
and protocols in NS2 is presented by studying QoS multicast routing mechanism.2)It discusses multicast routing problem with multiple QoS constraints of delay, delay jitter, bandwidth and cost metrics, describes a network model for researching the routing problem, and presents a dynamic multicast routing algorithm with multiple QoS constraints (DMRAQoS). In DMRAQoS, a multicast group member can dynamically join or leave a multicast session with no disruption of the multicast tree. Simulation results demonstrate that DMRAQoS provides an effective path for the research on multicast routing with multiple QoS constraints.3)The objective of multicast routing optimization is to make network resources utilization more effective by a connected mode to find an algorithm or strategy in the case of given network and multicast request. In this paper, firstly, genetic algorithms, simulated annealing and neural network are discussed and a globally optimal multicast routing algorithm (MROAQoS) is presented based on the ant colony ability of finding a shortcut between their nest and food sources in the process of hunting for food. Secondly the MROAQoS is modified according to application demand. Lastly, a mobile agent multicast routing algorithm with multiple QoS constraints (MAMRQoS) is presented, the mobile agent model in NS2 is designed and the validity and effectiveness of the MAMROoS is demonstrated.4)It presents a multicast routing protocol with multiple QoS constraints (MRPMQoS) based on the analysis on the protocols of YAM, QoSMIC and QMRP. The MRPMQoS does not maintain global network state but only requires the local state information of the link (or node). The MRPMQoS effectively decreases the overhead for constructing a multicast tree, diminishes the delay of the nodes join, and improves the success ratio of seeking links by combining single-branch search and multi-branch search. Simulation results show that the MRPMQoS provides an available means to implement multicast routing, and can adapt to all kinds of the topology networks and has good expansibility.5)It describes a network model for the hierarchical multicast routing with multiple QoS constraints, persents a QoS-based on hierarchical multicast routing protocol(HMRPQoS), which is based on the analysis on hierarchical routing and hierarchical QoS multicast routing algorithms. HMRPQoS solves the expansibility of the large scale networks.This paper is supported by Natioal Natural Science Foundation of China(90304018,60172035).
QoS路由就是寻找满足特定QoS约束的一条可行路径(QoS单播路径)或一棵多播树(QoS多播路由),它与传统的尽力传输不同,QoS路由一般有多个约束条件,通常是一个NP-完全问题。而多播路由是网络层具备的功能,多播问题的关键在于多播路径的确定,实现多播的最常用的方法就是建立多播树,多播路由算法主要用来建立一棵性能好的多播树,并使它满足各种业务的服务质量(QoS)的需求。
目前提出的大多数QoS路由算法是启发式算法,有些算法由于计算的复杂性而无法满足实际应用的要求;有些算法因缺乏全局的观点,扩展性较差,难以适应有动态成员加入的大型群组。本文在总结这些算法的基础上,提出了解决QoS多播路由的相关方法,主要集中在多QoS约束的多播路由算法和协议、蚂蚁算法和移动代理在IP网络中路由的优化研究,具体包括以下几方面:
1)论文从研究QoS多播路由的现状出发,分析了IP网络中QoS路由的策略和QoS多播路由的问题;从IPQoS的定义和机制出发,研究了综合服务模型(IntServ)、资源预留协议(RSVP)、差分业务模型(DiffServ)、多协议标签交换(MPLS)、IPQoS的综合实现策略以及IPQoS在Linux中的实现;研究了QoS的多播路由机制,提出了在NS2下实现QoS约束的多播路由算法
With the development of computer network technology, multimedia is enormously applied to real time video conference, VoD and long-distance teaching, etc. Their common feature is to transmit information from one or multiple source nodes to multiple destination nodes. As these real-time operations are sensitive to delay, delay-jitter, packet-loss and cost in the network transmission, they are liable to be affected by the operation portfolios of FTP and HTTP, and thus demand QoS to assure real time communications. Traditional internet routing protocols, such as OSPF and RIP, are routing technology based on "shortest path algorithm" in which the route is optimized with a single metric, and just offer "best-effort" service rather than QoS. Meanwhile, the theoretic research and realization of the multicast routing algorithms and protocols based on QoS have become a major research topic with the rapid development of such high-powered network technologies as mobile networks and AON All Optical Network and the progressive expansion of the scopes of their applications.QoS routing is how to select network routes with sufficient resources for the requested QoS parameters. In comparison with best-effort routing, QoS routing has some constraints and mostly is NP complete problem. Multicast routing is a network-layer function. A fundamental issue in multicast communication is how to determine an effcient message route (multicast routing). Tree construction is a commonly used approach in solving the multicast routing prolem. multicast routing algorithms are used to compute multicast trees that satisfy QoS requirements.Now, the propsed heuristic algorithms can't meet the QoS requirements for computation complexity, and adapt to large groups with member join dynamically for their expansibility. A method for the QoS multicast routing is presented based on the summary of the algorithms and protocols proposed in the past. The research mainly concentrates on the algorithms and protocols of QoS multicast routing, ant algorithms and the mobile agent optimization routing in IP networks. In detail, the contributions of this paper include the following.1)Firstly, the analysis on the strategy of QoS routing and QoS multicast routing problem in IP networks are done by studying the status quo of QoS multicast routing. Secondly, based on the definition and mechanism of IP QoS , the research on the IntServ, RSVP, DiffSer, MPLS, the comprehensive implementation strategy of QoS in IP network and the implementation of IP QoS in Linux are conducted. Finally, an approach to QoS multicast routing algorithms
and protocols in NS2 is presented by studying QoS multicast routing mechanism.2)It discusses multicast routing problem with multiple QoS constraints of delay, delay jitter, bandwidth and cost metrics, describes a network model for researching the routing problem, and presents a dynamic multicast routing algorithm with multiple QoS constraints (DMRAQoS). In DMRAQoS, a multicast group member can dynamically join or leave a multicast session with no disruption of the multicast tree. Simulation results demonstrate that DMRAQoS provides an effective path for the research on multicast routing with multiple QoS constraints.3)The objective of multicast routing optimization is to make network resources utilization more effective by a connected mode to find an algorithm or strategy in the case of given network and multicast request. In this paper, firstly, genetic algorithms, simulated annealing and neural network are discussed and a globally optimal multicast routing algorithm (MROAQoS) is presented based on the ant colony ability of finding a shortcut between their nest and food sources in the process of hunting for food. Secondly the MROAQoS is modified according to application demand. Lastly, a mobile agent multicast routing algorithm with multiple QoS constraints (MAMRQoS) is presented, the mobile agent model in NS2 is designed and the validity and effectiveness of the MAMROoS is demonstrated.4)It presents a multicast routing protocol with multiple QoS constraints (MRPMQoS) based on the analysis on the protocols of YAM, QoSMIC and QMRP. The MRPMQoS does not maintain global network state but only requires the local state information of the link (or node). The MRPMQoS effectively decreases the overhead for constructing a multicast tree, diminishes the delay of the nodes join, and improves the success ratio of seeking links by combining single-branch search and multi-branch search. Simulation results show that the MRPMQoS provides an available means to implement multicast routing, and can adapt to all kinds of the topology networks and has good expansibility.5)It describes a network model for the hierarchical multicast routing with multiple QoS constraints, persents a QoS-based on hierarchical multicast routing protocol(HMRPQoS), which is based on the analysis on hierarchical routing and hierarchical QoS multicast routing algorithms. HMRPQoS solves the expansibility of the large scale networks.This paper is supported by Natioal Natural Science Foundation of China(90304018,60172035).
引文
[1] J. Moy. OSPF Version2. RFC 2328, April 1998
[2] C. L. Hedrick. Routing Information Protocol. RFC 1058, Jun 1988
[3] M. Garey, D. John son. Computer and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979
[4] Salama H. F. Multicast Routing for Real-Time Communication on High-Speed Networks. [Ph. D dissertation], Dept of Electronic and Computer Engineering, North Cralina State University, 1996
[5] Li Layuan, Li ChunLin. The QoS routing algorithm for ATM networks. Computer Communications, 2001, 24(3): 416-421
[6] Li Layuan. The routing protocol for dynamic and large computer networks. Journal of computers, 1998, 11(2): 137-144
[7] Moy J. Multicast Extension to OSPF. RFC 1584, March 1994
[8] Waitzman D, Partridge C. Distance vector multicast routing protocol. RFC 1075, 1988
[9] S. Deering, D. Estrin, D. Farincci Protocol independent multicast dense mode(PIM-DM): protocol specification. Internet Draft(draft-pim-dm. txt), 1997
[10] Tony Ballardie. Core Based Trees(CBT): An Architecture for Scaleable InterDomain Multicast Routing. Comp. Commun. Rev., 1993, 23(4): 85-95
[11] Estrin D, Farinacci D. Protocol independent multicast sparse mode (PIM-SM): Protocol specification. RFC 2362, 1998
[12] Carlberg K, Crowcroft J. Building shared trees using a one-to-many joining mech anism. ACM Computer Communication Review, 1997, 27(1): 5-11
[13] M. Faloutsos, A. Banerjea, R. Pankaj. QoSMIC: Quality of Service sensitive multicast internet protocol. ACM SIGCOMM Compurter Communication Review, 1998, 28(4):144-153
[14] Dijkstra E. W. A note on two problems in connection with graphs, Number. Math., 1995, 36(1): 1389-1401
[15] 谢金星,邢文训.网络优化.北京:清华大学出版社,2000.80～160
[16] Zhu Q, Parse M, Garcia Luna Aceves J. A source based algorithm for delay constrained minimum cost multicasting. Proc. IEEE, INFOCOM '95, 1995, 1: 377～385
[17] Kompella V P, Pasquale J C, Polyzo G C. Multicast routing for multimedia communication. IEEE/ACM Transations on Networking, 1993, 1(3): 286-292
[18] Hong S P, Lee H, Park B H. An efficient multicast routing algorithm for delay sensitive applications with dynamic membership. In: Proceedings of IEEE INFOCOM, San Francisco, 1998, 3: 1433～1440
[19] J. Behrens, J. J. Carcia-Luna-Aceves. Hierarchical routing using link vectors. In: proc. IEEE INFOCOM '98, 1998, 2: 702～710
[20] A. S. Thyagarajan, S. Deering. Hierarchical Distance-Vector multicast routing. ACM SIGCOMM '95, 1995. 63～69
[21] Stefan Vob. Steiner's problem in graphs: heuristic methods. Discrete Applied Mathematics. 1992, 40(1): 43～72
[22] Awerbuch B, Bar-Noy A, Gopal M. Approximate distributed Bellman-Ford algorithm. Communications, IEEE Transactions, 1994, 42(8): 1208～1213
[23] R. Braden. Integrated Services in the internet Architecture: an Overview, IETF RFC1633, June 1994
[24] S. Blake, D. Black, M. Carlson, E. Davies, et al. An Architecture for Differentiated Services. IETF, RFC2475, DEC, 1998
[25] S. Yadav, R. Yavatkar, R. Pabbati, et al. Identity Representation for RSVP. RFC 3182, October 2001
[26] J. Heinanen. Differentiated Services in MPLS Networks. Internet Draft draft-heinanen-diffserv-mpls-00.txt, June 1999
[27] R Yavatkar. SBM: A Protocol for RSVP-based Admission Control over IEEE 802-style networks. Internet Draft draft-ietf-rap-rsvp-05.txt, 1999
[28] ShenLker S, Partridge C, Guerin R. Specification of Guaranteed Quality of Service. RFC 2212, September 1997
[29] 李峰,曹明翠等著.IP网络中的QoS保证.电讯技术,2001(6):9～12
[30] Y. Bernet. Interoperation RSVP/lntsServ and Diffserv Networks. Internet Dralf dralf-ietf-dillserv-rsvp-02.txt, February 1999
[31] 区海翔著.端到端IP QoS体系结构及实现.广东通信技术,2001,21(9):15～20
[32] Moon B, Aghvami H. RSVP extensions for real-time services in wireless mobile networks. Communications Magazine, IEEE, 2001, 39(12): 52-59
[33] 丰勇,李方伟著.移动IP上的QoS保证.研究与设计,2002(1):10～12
[34] D Awduche. RSVP-TE: Extensions for RSVP for LSP tunnels. RDC 3209, 2001
[35] 戴军,薛宏.层次型IP QoS结构模型.冶金动力,2001(6):63～66
[36] Almesberger W. Linux Traffic Control. Proceedings of the 9th International Linux System Technology Conference(Linux Congress 2002), 2002. 95～103
[37] 李锐著.Linux系统QoS原理与应用.安徽大学学报,2003.6,27(2):35～41
[38] 陈蓓,蔡淮著.基于Linux系统的IP服务质量(QoS)管理.计算机应用,2003.12,23:17～20
[39] Rejaie Reza, Handley Mark, Estrin Deborah. Quality adaptation for congestion controlled video playback over the Internet. In: Proceedings of ACM SIGCOMM, Cambridge, MA, USA, 1999. 51～62
[40] Z. Wang. on the Complexity of Quality of Server Routing. Information processing Letters, 1999, 69(3): 112～114
[41] 杨云,徐永红,李千目等.一种QOS路由多目标遗传算法.通信学报,2004,25(1):43～52
[42] R. Guerin, A. orda. QoS routing in networks with inaccurate information: theory and algorithms. IEEE/ACM Trans, On Networking, 1999, 7(3): 350～364
[43] Bernard M. Waxman. Routing of Multipoint Connections. IEEE Journal On Selected Areas Communications, December 1988, 8(9): 1617～1622
[44] B. M. Waxman. Performance Evaluation of Multicast Routing Algorithms. IEEE INFOCOM, 1996. 980～986
[45] http://www.isi.edu/nsnam/ns/ns.pdf
[46] kou L, Markowsky, Berman. A fast algorithm for Steiner trees. Act a Information, 1981, 14: 141～145
[47] B. K. Haberman, G. Rouska. Cost, delay, and delay variation conscious multicasting. Technical Report, TR-97-03, NC State Univ, 1997
[48] V P Kompella, J c Pasquale, G C Polyzo. Two distributed algorithms for multicasting multimedia information. In: Proceeding of ICCn93, 1993. 343～349
[49] X. Jia. A distributed algorithm of delay bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Transactions on Networking, 1998, 6(6): 828～837
[50] H. Lin, S. Lai. VTDM-A dynamic muiticast routing algorithm. IEEE INFOCOM'98, San Francisco, California, USA, 1998, 3: 1426～1432
[51] M. Doar, I. Leslie. How Bad is Naive Multicast Routing. In: Proc. IEEE INFOCOM'93, 1993, 1(1): 82～89
[52] M. Imase, B. Waxman. Dynamic Steiner Tree Problems. SIAM J. Disc. Math., 1991, 4(3): 369～384
[53] J. Kadirire, G. Knight. Comparison of Dynamic Multicast Routing Algorithm for Wide-area Packet Switched (Asynchronous Transfer Mode) Networks. Proc. of IEEE INFOCOM, 1995, 1: 212～219
[54] F. Bauer, A. Varma. ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm. IEEE J. Select. Areas Commun., 1997, 15(3): 382～397
[55] S. Raghavan, G. Manimaran, C. Siva Ram Murthy. A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees. IEEE/ACM Trans. Networking, 1999, 7(4): 514～529
[56] HWANG F K, RICHARDS D S. Steiner tree problems[J]. IEEE Networks, 1992, 22(1): 55～89
[57] WINTER P. Steiner problem in networks: a survey. Networks, 1987, 17(2): 129～167
[58] BAUER F, VARMA A. Distributed algorithms for multicast path setup in data networks[J]. IEEE/ACM Trans networking, 1996, 4(2): 181～190
[59] ROUSKAS G N, BALDINE I. Multicast routing with end to end delay and delay variation constraints[J]. IEEE Journal on Selected Areas in communications, 1997, 15(3): 346～356
[60] SRIRAM R, MANIMARAN G, SIVA RAM MURTHY C. Algorithms for delay constrained low cost multicast tree construction[J]. Computer Communications, 1998, 21(18): 1693～1706
[61] 余燕平,仇佩亮.一种时延和时延抖动受约束的启发式多播路由算法.通信学报,2003,24(2):132～138
[62] 余燕平,仇佩亮.时延和时延抖动约束的低费用多播路由算法.电路与系统学报,2001,4(4):65～69
[63] 余燕平.博士论文题目.多播路由算法的研究.杭州:浙江大学,2002
[64] Rouskas G N, BaldineI. Multicast routing with end-to-end delay and delay variation constraints.IEEE Journal on Selected Areas in Communications, 1997, 15(3): 346-356
[65] Low C P, Lee Y J. Distributed multicast routing, with end-to-end delay and delay variation constrains. Computer Communications, 2000, 23(9): 848-862
[66] Lee H Y, Youn C H. Scalable multicast routing algorithm for delay-variation constrained minimum-cost tree. In: Proc IEEE International Conference on Communications, 2000, 3: 1343-1347
[67] 王明中,谢剑英,张敬辕.时延及时延抖动限制的最小代价多播路由策略.计算机学报,2002,25(5):534～542
[68] CHEN S G, KLARA N. An overview of quality service routing for next-generation high-speed networks: problems and solutions[J]. IEEE Network. 1998, 12(6): 64～79
[69] Schoute F, McQuillan J. A Comparison of Information Policies for Minimum Delay Routing Algorithms. Communications, IEEE Transactions, 2001, 26(8): 1266～1271
[70] DEERING S, ESTRIN D, FARINACCI D, et al. The PIM architecture for wide-area multicast routing[J]. IEEE/ACM Transaction on Networking, 1996, 4(2): 153～162
[71] CHO J, BREEN J. Analysis of the performance of dynamic multicast rooting algorithms [J]. Computer Communications, 1999, 22: 667～674
[72] 石坚,董天临,石漠.基于QoS的动态组播路由算法.通信学报,2001,8(8):14～22
[73] 李腊元,李春林.动态QoS多播路由协议.电子学报,2003,9(9):1345～1453
[74] 孔令山,丁炜.一种多约束QoS多播路由算法.通信学报,2003,24(7):30～36
[75] S. Deering. Host extensings for IP multicasting. Internet Draft: IETF RFC 1112, 1989
[76] 徐宁,李春光,张健等.几种现代优化算法的比较研究.系统工程与电子技术,2002,24(12):100～104
[77] 刑文训,谢金星.现代优化计算方法。北京:消华大学出版社,1999.88～203
[78] Xiang F, Junzhou L, Jieyi W, Guanqun G. QoS Routing based on genetic algorithm [J]. Computer ommunications, 1999, 22(9): 1394 - 1399.
[79] Ravikumar C P, Bajpai R. Source based delay bouned multicasting in multimedia networks [J]. Computer communications, 1998, 21 (2): 126 - 132
[80] 王征应,石冰心.基于启发式遗传算法的QoS组播路由问题求解.计算机学报,2001,24(1):55～16
[81] 黄晓雯,贺细平,唐贤英.基于遗传算法的QoS路由选择与仿真.计算机仿真,2003,20(6):43～47
[82] 王新红,王光兴.基于遗传算法的时延受限代价最小组播路由选择方法.通信学报,2002,23(3):112～118
[83] 孙艳丰,戴春荣.几种随机搜索算法的比较研究.系统工程与电子技术,1998,20(2):43～48
[84] 胡世余,谢剑英.模拟退火的QoS路由算法.计算机工程,2004,30(5):109～121
[85] 崔勇,吴建平,徐恪.基于模拟退火的服务质量路由算法.软件学报,2003,14(5):876～884
[86] Kirkpatrick S. Optimization by simulated annealing. Science 1983, 220(498): 671～680
[87] 乌云高娃.人工神经网络的发展.福建电脑,2004(4):16～17
[88] 袁曾任.人工神经元网络及其应用.北京:清华大学出版社,1999.102～108
[89] HOPFIELD J J, TAN K D W. Neural computation of decisions of optimization problem s [J]. Biological Cybernetics, 198, 52(3):141～152
[90] HOPFIELD J J. Neurons with graded response have collective computational properties like those of two state eurons [J]. Proc Nat Academy SciUSA, 1984, 81(10):3088～3092
[91] WANG CJ, PAUL NW. The use of artificial neural networks for optimal message routing [J]. IEEE Network, 1995, 9(2): 16～24
[92] LEE SL, CHANG SY. Neural networks for routing of communication networks with unreliable components [J]. IEEE Trans On Neural Networks, 1993, 4(5):854～863
[93] MU STA FA KM A, FAOU ZI K. Neural networks for shortest path computation and routing in computer networks[J]. IEEE Trans On Neural Networks, 1993, 4(6): 941～953
[94] 米志超,汪泽焱,倪明放等.一种基于Hopfield神经网络的Ad hoc网络QoS路由选择算法.解放军理工大学学报,2003,4(5):11～15
[95] 申金媛,王立常,胜江.一种高速通信网络中多限制路由选择的新方法.光电子·激光,2005,16(6):575～579
[96] 孙文生,刘泽民.组播路由调度的神经网络方法.通信学报,1998,19(11):1-6
[97] Rutenbar R A. Simulated annealing algorithms: An overview. IEEE Circuit Devices Magazine, 1989, 5(6): 19～26
[98] Tan Y, Deng C, He Z Y. Chaotic annealing neural network sand its application to direction estimation of spatial signal sources. In:Proc. IEEE Work shop on Neural Networks for Signal Processing, Florida, USA, 1997. 541～550
[99] 张素兵,刘泽民.一种新的基于混沌神经网络的组播路由算法.计算机学报,2001,24(12):1256～1262
[100] Dorigo M, Gambardella L M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans Evolutionary Computation, 1997, 1(1):53- 65
[101] Stutzl T, Hoos H H. The MAX-MIN ant system and local search for the traveling salesm an problem. In: Proc IEEE International Conference on Evolutionary Computation(ICEC'97), Indianapolis, USA, 1997. 309- 314
[102] 李生红,潘理,诸鸿文等.基于蚂蚁算法的组播路由调度方法.计算机工程,2001,27(4):63～66
[103] 曹浪财,罗键,李天成.智能蚂蚁算法--蚁群算法的改进.计算机应用研究,2003,20(10):62～64
[104] Gianni Di Caro, Mario Dorigo. AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research, 1998, 9: 317～365
[105] 张素兵,吕国英,刘泽民等.基于蚂蚁算法的QoS路由调度方法.电路与系统学报,2000,5(1):1～5
[106] 张素兵,刘泽民.基于蚂蚁算法的时延受限分布式多播路由研究.通信学报,2001,22(3):70～75
[107] Dorigo M, Caro G, Gambardella L. Ant algorithms for discrete optimization. Artificial Life, 1999, 5(2):137～172
[108] 张纪会,徐心和.具有变异特征的蚁群算法.计算机研究与发展,1999,36(10):1240～1245
[109] 吴斌,史忠植.一种基于蚁群算法的TSP问题分段求解算法.计算机学报,2001,24(12):1328～1334
[110] Marco Dorigo. Ant colonies for thetravelling salem an problem, luca Maria Gam bardella Bio Systems, 1997. 73～81
[111] Colorni A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies(J). In: Proc1st European Conf Artificial Life. Pans, France:Elsevier, 1991. 134～142
[112] Marco Dorigo, Eric Bonabeau. Ant algorithms and stigmergy(J). Guy Theraulaz Future Generation Computer Systems, 2000.85～871
[113] Vittorio Maniezzot. An ANTS heuristic for the frequency assignment problem(J). Antonella Carbonaro Future Generation Computer Systems, 2000. 927～935
[114] Schoonderwoerd R, Holland O, Bruten J. Ant based Load Balancing in Telecommuni cations Networks. Adaptive Behavior, 1996, 5(2): 169～207
[115] 孙焘,王秀坤,刘业欣等.一种简单蚂蚁算法及其收敛性分析.2003,24(8):1524～1528
[116] 吕国英,刘泽民,周正.基于蚂蚁算法的分布式QoS路由选择算法.2001,22(9):34～41
[117] 李勇,段正澄.动态蚁群算法求解TSP问题.计算机工程与应用,2003(17):103～107
[118] Colorni A, Dorigo M, Maniezzo. Ant system for job shop scheduling. Belg. J.Oper. Res., Stat. and Comput. Sci., 1993. 39～53
[119] G. Di Caro and M. Dorigo. Ant colonies for adaptive routing in packet switched communications networks. Proc. International Conference on Parallel Problem Solving from Nature, Amsterdam, Holland, 1998. 27～30,
[120] Colorni A, Dorigo M. Heuristics from nature for hard combinatorial optimization problems. International Trans Operational Research, 1996, 3(1): 1～21
[121] 董红斌,石纯一.一个多Agent系统模型.小型微型计算机系统,2000,21(7):40～744
[122] 杨云,徐永红,曹立鑫等.一种面向Agent的分布式路由算法.计算机工程与应用,2003(12):20～23
[123] 兰少华,李艳秋,顾一禾等.基于移动Agent的分布式QoS路由研究.计算机工程,2000.28(12):41～43
[124] Appleby S, Steward S. Mobile software agents for control in telecommunications networks. Technology Journal, 1994, 12(2): 104～113
[125] A. Bieszczad, B. Pagurek, T. White. Mobile Agents for Network Management. IEEE CommunicationSurveys, 1998, 1(1):2～9
[126] Bonabeau E. Routing in telecommunications networks with "smart" ant-like agents. Intelligent Agents for Telecommunications Applications, January 1998. 56～64
[127] G. Di Caro, M. Dorigo. An adaptive multi-agent routing algorithm inspired by ants behavior. Proc. PART98 - Fifth Annual Australasian Conference on Parallel and Real-Time Systems, Adelaide, Australia, September 1998.28～29,
[128] K. Oida, M. Sekido, An agent-based routing system for QoS guarantees. Proc. IEEE International Conference on Systems, Man, and Cybernetics, 1999, 3: 833～838
[129] B. E. Helvik, O. Wittner. Using the Cross Entropy Method to Guide/Govern Mobile Agents Path Finding in Networks. in Proceedings of 3rd International Workshop on Mobile Agents for Telecommunication Applications, Springer Verlag, August 2001. 14～16
[130] O. Wittner, B. E. Helvik. Cross-Entropy Guided Ant-like Agents Finding Cyclic Paths in Scarcely Meshed Networks, in The Third International Workshop on Ant Algorithms, ANTS'2002, (Brussels, Belgium), 2002. 82～88
[131] 王洪波,张尧学,郭国强等.一种可选择最佳带宽的多路路由算法.软件学报,2002,13(4):928～937
[132] 刘巧勇,王丽萍,邱飞岳.蚂蚁路由算法中agent分析.中国有线电视,2004(3):21～24
[133] 张素兵,刘泽民.基于代理的QoS组播路由算法.高技术通讯,2001(1):32～36
[134] 马常霞.基于移动Agent的改进蚊群算法.淮海工学院学报,2004,13(1):29～31
[135] Pham V.A., Karmouch A. Mobile Software Agents: An Overview, IEEE Communications, 1996, 36(7):26～37
[136] Sosa, R. Improved AntNet Algorithm for data routing based on mobile agents. Science and Technology Faculty, Asuncion Catholic University, 2000. 47～79
[137] Kuntz P, Layzell, P Snyers D. A colony of ant like agents for partitioning in VLSI technology. In: Proc.of 4th European Conference on Artificial Life, MIT Press, Cambridge, 1997. 417～424
[138] T. White A. Bieszczad, B. Pagurek. Distributed Fault Location in Networks Using Mobile Agents. In Proceedings of the 3rd International Workshop on Agents in Telecommunication Applications IATA'98, Paris, France, 1998.106～112
[139] A. Bieszczad, B. Pagurek, T. White. Mobile agents for network management. IEEE Communication Surveys, Fourth Quarter 1998, 1(1):45～50
[140] http://www.item.ntnu.no/- wittner/mata01_foil.pdf
[141] Reuven Y. Rubinstein. Stochastic Optimization: Algorithms and Applications, chapter Combinatorial Optimization, Cross-Entropy, Ants and Rare Events Section 7: Noisy Networks. Kluwer Academic Publishers, 2001. 461～523
[142] Reuven Y. Rubinstein. The Cross-Entropy Method for Combinatorial and Continuous Optimization. Methodology and Computing in Applied Probability, 1999. 127～190
[143] O. Wittner, B. E. Helvik. Cross Entropy Guided Ant-like Agents Finding Dependable Primary/Backup Path Patterns in Networks. Proceedings of Congress on Evolutionary Computation, 2002, 2:1528～1533
[144] O. Wittner, P. E. Heegaard, B. E. Heivik, Swarm based distributed search in the amigos environment. AVANTEL Technical Report, Department of Telematics, Norwegian University of Science and Technology, 2003. 1503～4097
[145] O. Wittner, B. E. Helvik. Simulating mobile agent based network management using network simulator. Poster in Forth International Symposium on Mobile Agent System (ASA/MA 2000), 2000. 82～91
[146] 李建枫,糜正琨,成际镇.NS-2移动代理网络仿真功能扩展设计和实现.系统真学报,2004,16(1):85～91
[147] 徐雷鸣,庞博,赵耀.NS与网络模拟.北京:人民邮电出版社,2003.30～160
[148] David kotz, Guofei Jiang, Robert Gray. Performance Analysis of Mobile Agents for Filtering Data Streams on Wireless Networks [J]. Mobile Networks and Applications, 2002. 163～174
[149] Liotta A, Ragusa C, Pavlou G. Running Mobile Agent Code over Simulated Internetworks: an Extra Gear Towards Distributed System Evaluation [C]. Proceedings of the 2nd WSEAS International Conference on Simulation, Modeling and Optimization, Skiathos Island, Greece, 2002. 447～392
[150] Jae Chung, Mark Claypool. NS by Example [R]. Technical Report WPI- CS- TR- 99-25, Computer Science Department, Worcester Polytechnic Institute, September 1999
[151] David Wetherall, Christopher J. Lindblad. Extending Tcl for Dynamic Object Oriented Programming [C]. Proceedings of the Tcl/Tk Workshop, 1995. 134～168
[152] 陈尚兵,赵均,何小燕等.一种支持QoS的拓扑自适应动态组播路由算法.电路与系统学报,2002,7(3):1～7
[153] Deering S. Protocol Independent Multicast Version 2, Dense Mode Specification. Work in Progress, Aug. 1997
[154] Carberg K, Crowcroft J. Yet another multicast (YAM)routing protocol specification. Version 1. unpublished manuscript, 1997
[155] Yah SQ, Faloutsos M, Banerjea A. QoS-Aware multieast routing for the Internet: The design and evaluation of QoSMIC. IEEE/ACM Trans, on Networking, 2002, 10(1): 54～56
[156] Chen S, Nahrstedt K, Shavitt Y. A QoS-aware multicast routing protocol. In: Proceedings of IEEE NFOCOM, 2000, 18(12):2580～2592
[157] 李腊元,李春林.多QoS约束的多播路由协议.软件学报,2004,15(2):286-291
[158] Femando Kuipers, Turgay Korkmaz. An overview of Constraint Based Path Selection Algorithms for QoS Routing[J]. IEEE Communications Magazine, 2002, 40(12):50～55
[159] Handley M, Jacobson V. SDP: Session Directory Protocol. RFC2327, 1998
[160] 高茜,李勇,罗军舟.一种新的QoS约束的多播路由协议.计算机学报,2003,26(11):1441-1449
[161] Roumani A M, Hassanein H A. A scheme for QoS-based dynamic multicast routing. In: Proceedings of Computers and Communications, 2001. 132～138
[162] Lui King-Shan, Nahrstedt Klara. Routing with topology aggregation in delaybandwidth sensitive networks. Networking, IEEE/ACM Transactions, 2004, 12(1):17～29
[163] Hao Fang, Zegura Ellen W. On Scalable QoS Routing: Performance Evaluation of Topology Aggregation. Proceedings. IEEE, INFOCOM'2000, 2000, 1:147～156
[164] Awerbueh Baruch, Shavit Yuval. Topology Aggregation for Directed Graphs. IEEE/ACM Transactions on Networking, 2001, 9(1):82～90
[165] Korkmaz T, Krunz M. Source-Oriented Topology Aggregation with Multiple QoS Parameters in hierarchical ATM Networks. Quality of Service. In, IWQoS '99, 1999. 137～146
[166] W. T. Tsai, C. V. Ramamoorthy, W. K. Tsai. An adaptive hierarchical routing protocol. IEEE TRANSACTIONS ON COMPUTERS, 1989, 38(8):1059-1074
[167] Cohen R, Felstaine E, Emek R. Framework for Multicast in Hierarchical Networks, Proceedings. IEEE.INFOCOM'2000, 2000, 3:1673～1682
[168] Kakemizu M, Murata K, Wakamoto M. PNNI internetworking architecture over ATM public networks. IEEE Proceedings, ATM Workshop, 1999. 355～360
[169] Ragozini A, Rougier J, Gravey A. Analysis of the performance of a hierarchical PNNI network. ICATM '99, International Conference, 1999. 365～374
[170] Atari G, Datta A, Derby J et al. Fault Tolerant Hierarchical Routing. Performance Computer and Communications Conference, IEEE International 1997. 159～165
[171] Shree Murthy, J.J.Garcia-Luna-Aceves. A Loop-free Routing Protocol for Large scale Internets Using Distance Vectors. Computer Communications, 1998, 21(6): 147～161
[172] Jochen Behrens. Distributed Routing for Very Large Networks Based on Link Vectors. [Ph.D thesis], Computer Science College, University of California, Santa Cruz, 1997
[173] D G.Thaler, C V. Ravishankar. Distributed Top-Down Hierarchy Construction. INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, 1998, 2:693～701
[174] Dean H. Lorenz, Ariel Orda. QoS Routing in Networks with Uncertain Parameters. In: Proc. Of IEEE INFOCOM'98, 1998, 1(1):3～10
[175] R.Ramanathan, M.Steenstrup. Hierarchically-organized, multihop mobile wireless networks for quality-of-service support. ACM/Baltzer Mobile Network and Applications, 1998, 3(1):101～109
[176] Moh W, Xiang L. Extending BGMP for QoS-based inter-domain multicasting over the Internet. Communications, IEEE International Conference, 2000, 2:728～734
[177] C.Shields, Garcia-Luna-Aceves. The HIP protocol for hierarchical multicast routing protocol. In Proc. ofACM MOBICOM, 1999. 207～218
[178] Lee W. C. Spanning tree method for link state aggregation in large communication networks, IEEE INFOCOM'95, 1995. 297～302
[179] Pradhan Satyabrata, Li Yi, Maheswaran Muthucumaru. QoS-Aware Hierarchical Multicast Routing on Next Generation Internetworks. IEEE International Conference on Performance Computing;and Communications, 2001.9～16
[180] 张素兵,刘泽民.基于蚂蚁算法的分级QoS路由调度方法.北京邮电大学学报,2000,23(4):11～17
[181] 陆慧梅,向勇,史美林.支持QoS的层次组播路由算法框架QHMR.计算机学报.2004,27(6):772～782
[182] S.Chen K.-S. Lui, K.Nahrstedt. Hierarchical QoS Routing in Delay-Bandwidth Sensitive Networks. Local Computer Networks, Proceedings. 25th Annual IEEE Conference, 2000. 579～588
[183] Li Layuan, Li Chunlin. A Hierarchical QoS Multicast Routing Protocol for Mobile Ad-Hoc Networks. http://www.paper.edu.cn/lilayuanl.pdf
[184] LU Hui-Mei, XIANG Yong, SHI Mei-Lin. A QoS-Based Dynamic Multicast Routing Algorithm for Streaming Layered Data. Journal of Software.2004, 15(6):928～940
[185] S.Chen, K.Nahrstedt. An overview of Qulity of Service Routing for the Next Generation High-SPeed Networks: Problems and Solutions. IEEE Network, Special Issue on Transmission and Distribution of Digital Video, Dec.1998, 12(6): 64～79
[186] M.B. Doar. A Better Model for Generating Test Networks. Proceedings of IEEE Global Internet, 1996, 11: 86～93
[187] 李腊元,李春林.计算机网络技术第二版.北京:国防工业出版社,2004.123～234
[188] 王兴伟,程辉,黄敏等.下一代互联网中的智能QoS组播路由算法.东北大学学报,2004,25(3):235～239
[2] C. L. Hedrick. Routing Information Protocol. RFC 1058, Jun 1988
[3] M. Garey, D. John son. Computer and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979
[4] Salama H. F. Multicast Routing for Real-Time Communication on High-Speed Networks. [Ph. D dissertation], Dept of Electronic and Computer Engineering, North Cralina State University, 1996
[5] Li Layuan, Li ChunLin. The QoS routing algorithm for ATM networks. Computer Communications, 2001, 24(3): 416-421
[6] Li Layuan. The routing protocol for dynamic and large computer networks. Journal of computers, 1998, 11(2): 137-144
[7] Moy J. Multicast Extension to OSPF. RFC 1584, March 1994
[8] Waitzman D, Partridge C. Distance vector multicast routing protocol. RFC 1075, 1988
[9] S. Deering, D. Estrin, D. Farincci Protocol independent multicast dense mode(PIM-DM): protocol specification. Internet Draft(draft-pim-dm. txt), 1997
[10] Tony Ballardie. Core Based Trees(CBT): An Architecture for Scaleable InterDomain Multicast Routing. Comp. Commun. Rev., 1993, 23(4): 85-95
[11] Estrin D, Farinacci D. Protocol independent multicast sparse mode (PIM-SM): Protocol specification. RFC 2362, 1998
[12] Carlberg K, Crowcroft J. Building shared trees using a one-to-many joining mech anism. ACM Computer Communication Review, 1997, 27(1): 5-11
[13] M. Faloutsos, A. Banerjea, R. Pankaj. QoSMIC: Quality of Service sensitive multicast internet protocol. ACM SIGCOMM Compurter Communication Review, 1998, 28(4):144-153
[14] Dijkstra E. W. A note on two problems in connection with graphs, Number. Math., 1995, 36(1): 1389-1401
[15] 谢金星,邢文训.网络优化.北京:清华大学出版社,2000.80～160
[16] Zhu Q, Parse M, Garcia Luna Aceves J. A source based algorithm for delay constrained minimum cost multicasting. Proc. IEEE, INFOCOM '95, 1995, 1: 377～385
[17] Kompella V P, Pasquale J C, Polyzo G C. Multicast routing for multimedia communication. IEEE/ACM Transations on Networking, 1993, 1(3): 286-292
[18] Hong S P, Lee H, Park B H. An efficient multicast routing algorithm for delay sensitive applications with dynamic membership. In: Proceedings of IEEE INFOCOM, San Francisco, 1998, 3: 1433～1440
[19] J. Behrens, J. J. Carcia-Luna-Aceves. Hierarchical routing using link vectors. In: proc. IEEE INFOCOM '98, 1998, 2: 702～710
[20] A. S. Thyagarajan, S. Deering. Hierarchical Distance-Vector multicast routing. ACM SIGCOMM '95, 1995. 63～69
[21] Stefan Vob. Steiner's problem in graphs: heuristic methods. Discrete Applied Mathematics. 1992, 40(1): 43～72
[22] Awerbuch B, Bar-Noy A, Gopal M. Approximate distributed Bellman-Ford algorithm. Communications, IEEE Transactions, 1994, 42(8): 1208～1213
[23] R. Braden. Integrated Services in the internet Architecture: an Overview, IETF RFC1633, June 1994
[24] S. Blake, D. Black, M. Carlson, E. Davies, et al. An Architecture for Differentiated Services. IETF, RFC2475, DEC, 1998
[25] S. Yadav, R. Yavatkar, R. Pabbati, et al. Identity Representation for RSVP. RFC 3182, October 2001
[26] J. Heinanen. Differentiated Services in MPLS Networks. Internet Draft draft-heinanen-diffserv-mpls-00.txt, June 1999
[27] R Yavatkar. SBM: A Protocol for RSVP-based Admission Control over IEEE 802-style networks. Internet Draft draft-ietf-rap-rsvp-05.txt, 1999
[28] ShenLker S, Partridge C, Guerin R. Specification of Guaranteed Quality of Service. RFC 2212, September 1997
[29] 李峰,曹明翠等著.IP网络中的QoS保证.电讯技术,2001(6):9～12
[30] Y. Bernet. Interoperation RSVP/lntsServ and Diffserv Networks. Internet Dralf dralf-ietf-dillserv-rsvp-02.txt, February 1999
[31] 区海翔著.端到端IP QoS体系结构及实现.广东通信技术,2001,21(9):15～20
[32] Moon B, Aghvami H. RSVP extensions for real-time services in wireless mobile networks. Communications Magazine, IEEE, 2001, 39(12): 52-59
[33] 丰勇,李方伟著.移动IP上的QoS保证.研究与设计,2002(1):10～12
[34] D Awduche. RSVP-TE: Extensions for RSVP for LSP tunnels. RDC 3209, 2001
[35] 戴军,薛宏.层次型IP QoS结构模型.冶金动力,2001(6):63～66
[36] Almesberger W. Linux Traffic Control. Proceedings of the 9th International Linux System Technology Conference(Linux Congress 2002), 2002. 95～103
[37] 李锐著.Linux系统QoS原理与应用.安徽大学学报,2003.6,27(2):35～41
[38] 陈蓓,蔡淮著.基于Linux系统的IP服务质量(QoS)管理.计算机应用,2003.12,23:17～20
[39] Rejaie Reza, Handley Mark, Estrin Deborah. Quality adaptation for congestion controlled video playback over the Internet. In: Proceedings of ACM SIGCOMM, Cambridge, MA, USA, 1999. 51～62
[40] Z. Wang. on the Complexity of Quality of Server Routing. Information processing Letters, 1999, 69(3): 112～114
[41] 杨云,徐永红,李千目等.一种QOS路由多目标遗传算法.通信学报,2004,25(1):43～52
[42] R. Guerin, A. orda. QoS routing in networks with inaccurate information: theory and algorithms. IEEE/ACM Trans, On Networking, 1999, 7(3): 350～364
[43] Bernard M. Waxman. Routing of Multipoint Connections. IEEE Journal On Selected Areas Communications, December 1988, 8(9): 1617～1622
[44] B. M. Waxman. Performance Evaluation of Multicast Routing Algorithms. IEEE INFOCOM, 1996. 980～986
[45] http://www.isi.edu/nsnam/ns/ns.pdf
[46] kou L, Markowsky, Berman. A fast algorithm for Steiner trees. Act a Information, 1981, 14: 141～145
[47] B. K. Haberman, G. Rouska. Cost, delay, and delay variation conscious multicasting. Technical Report, TR-97-03, NC State Univ, 1997
[48] V P Kompella, J c Pasquale, G C Polyzo. Two distributed algorithms for multicasting multimedia information. In: Proceeding of ICCn93, 1993. 343～349
[49] X. Jia. A distributed algorithm of delay bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Transactions on Networking, 1998, 6(6): 828～837
[50] H. Lin, S. Lai. VTDM-A dynamic muiticast routing algorithm. IEEE INFOCOM'98, San Francisco, California, USA, 1998, 3: 1426～1432
[51] M. Doar, I. Leslie. How Bad is Naive Multicast Routing. In: Proc. IEEE INFOCOM'93, 1993, 1(1): 82～89
[52] M. Imase, B. Waxman. Dynamic Steiner Tree Problems. SIAM J. Disc. Math., 1991, 4(3): 369～384
[53] J. Kadirire, G. Knight. Comparison of Dynamic Multicast Routing Algorithm for Wide-area Packet Switched (Asynchronous Transfer Mode) Networks. Proc. of IEEE INFOCOM, 1995, 1: 212～219
[54] F. Bauer, A. Varma. ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm. IEEE J. Select. Areas Commun., 1997, 15(3): 382～397
[55] S. Raghavan, G. Manimaran, C. Siva Ram Murthy. A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees. IEEE/ACM Trans. Networking, 1999, 7(4): 514～529
[56] HWANG F K, RICHARDS D S. Steiner tree problems[J]. IEEE Networks, 1992, 22(1): 55～89
[57] WINTER P. Steiner problem in networks: a survey. Networks, 1987, 17(2): 129～167
[58] BAUER F, VARMA A. Distributed algorithms for multicast path setup in data networks[J]. IEEE/ACM Trans networking, 1996, 4(2): 181～190
[59] ROUSKAS G N, BALDINE I. Multicast routing with end to end delay and delay variation constraints[J]. IEEE Journal on Selected Areas in communications, 1997, 15(3): 346～356
[60] SRIRAM R, MANIMARAN G, SIVA RAM MURTHY C. Algorithms for delay constrained low cost multicast tree construction[J]. Computer Communications, 1998, 21(18): 1693～1706
[61] 余燕平,仇佩亮.一种时延和时延抖动受约束的启发式多播路由算法.通信学报,2003,24(2):132～138
[62] 余燕平,仇佩亮.时延和时延抖动约束的低费用多播路由算法.电路与系统学报,2001,4(4):65～69
[63] 余燕平.博士论文题目.多播路由算法的研究.杭州:浙江大学,2002
[64] Rouskas G N, BaldineI. Multicast routing with end-to-end delay and delay variation constraints.IEEE Journal on Selected Areas in Communications, 1997, 15(3): 346-356
[65] Low C P, Lee Y J. Distributed multicast routing, with end-to-end delay and delay variation constrains. Computer Communications, 2000, 23(9): 848-862
[66] Lee H Y, Youn C H. Scalable multicast routing algorithm for delay-variation constrained minimum-cost tree. In: Proc IEEE International Conference on Communications, 2000, 3: 1343-1347
[67] 王明中,谢剑英,张敬辕.时延及时延抖动限制的最小代价多播路由策略.计算机学报,2002,25(5):534～542
[68] CHEN S G, KLARA N. An overview of quality service routing for next-generation high-speed networks: problems and solutions[J]. IEEE Network. 1998, 12(6): 64～79
[69] Schoute F, McQuillan J. A Comparison of Information Policies for Minimum Delay Routing Algorithms. Communications, IEEE Transactions, 2001, 26(8): 1266～1271
[70] DEERING S, ESTRIN D, FARINACCI D, et al. The PIM architecture for wide-area multicast routing[J]. IEEE/ACM Transaction on Networking, 1996, 4(2): 153～162
[71] CHO J, BREEN J. Analysis of the performance of dynamic multicast rooting algorithms [J]. Computer Communications, 1999, 22: 667～674
[72] 石坚,董天临,石漠.基于QoS的动态组播路由算法.通信学报,2001,8(8):14～22
[73] 李腊元,李春林.动态QoS多播路由协议.电子学报,2003,9(9):1345～1453
[74] 孔令山,丁炜.一种多约束QoS多播路由算法.通信学报,2003,24(7):30～36
[75] S. Deering. Host extensings for IP multicasting. Internet Draft: IETF RFC 1112, 1989
[76] 徐宁,李春光,张健等.几种现代优化算法的比较研究.系统工程与电子技术,2002,24(12):100～104
[77] 刑文训,谢金星.现代优化计算方法。北京:消华大学出版社,1999.88～203
[78] Xiang F, Junzhou L, Jieyi W, Guanqun G. QoS Routing based on genetic algorithm [J]. Computer ommunications, 1999, 22(9): 1394 - 1399.
[79] Ravikumar C P, Bajpai R. Source based delay bouned multicasting in multimedia networks [J]. Computer communications, 1998, 21 (2): 126 - 132
[80] 王征应,石冰心.基于启发式遗传算法的QoS组播路由问题求解.计算机学报,2001,24(1):55～16
[81] 黄晓雯,贺细平,唐贤英.基于遗传算法的QoS路由选择与仿真.计算机仿真,2003,20(6):43～47
[82] 王新红,王光兴.基于遗传算法的时延受限代价最小组播路由选择方法.通信学报,2002,23(3):112～118
[83] 孙艳丰,戴春荣.几种随机搜索算法的比较研究.系统工程与电子技术,1998,20(2):43～48
[84] 胡世余,谢剑英.模拟退火的QoS路由算法.计算机工程,2004,30(5):109～121
[85] 崔勇,吴建平,徐恪.基于模拟退火的服务质量路由算法.软件学报,2003,14(5):876～884
[86] Kirkpatrick S. Optimization by simulated annealing. Science 1983, 220(498): 671～680
[87] 乌云高娃.人工神经网络的发展.福建电脑,2004(4):16～17
[88] 袁曾任.人工神经元网络及其应用.北京:清华大学出版社,1999.102～108
[89] HOPFIELD J J, TAN K D W. Neural computation of decisions of optimization problem s [J]. Biological Cybernetics, 198, 52(3):141～152
[90] HOPFIELD J J. Neurons with graded response have collective computational properties like those of two state eurons [J]. Proc Nat Academy SciUSA, 1984, 81(10):3088～3092
[91] WANG CJ, PAUL NW. The use of artificial neural networks for optimal message routing [J]. IEEE Network, 1995, 9(2): 16～24
[92] LEE SL, CHANG SY. Neural networks for routing of communication networks with unreliable components [J]. IEEE Trans On Neural Networks, 1993, 4(5):854～863
[93] MU STA FA KM A, FAOU ZI K. Neural networks for shortest path computation and routing in computer networks[J]. IEEE Trans On Neural Networks, 1993, 4(6): 941～953
[94] 米志超,汪泽焱,倪明放等.一种基于Hopfield神经网络的Ad hoc网络QoS路由选择算法.解放军理工大学学报,2003,4(5):11～15
[95] 申金媛,王立常,胜江.一种高速通信网络中多限制路由选择的新方法.光电子·激光,2005,16(6):575～579
[96] 孙文生,刘泽民.组播路由调度的神经网络方法.通信学报,1998,19(11):1-6
[97] Rutenbar R A. Simulated annealing algorithms: An overview. IEEE Circuit Devices Magazine, 1989, 5(6): 19～26
[98] Tan Y, Deng C, He Z Y. Chaotic annealing neural network sand its application to direction estimation of spatial signal sources. In:Proc. IEEE Work shop on Neural Networks for Signal Processing, Florida, USA, 1997. 541～550
[99] 张素兵,刘泽民.一种新的基于混沌神经网络的组播路由算法.计算机学报,2001,24(12):1256～1262
[100] Dorigo M, Gambardella L M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans Evolutionary Computation, 1997, 1(1):53- 65
[101] Stutzl T, Hoos H H. The MAX-MIN ant system and local search for the traveling salesm an problem. In: Proc IEEE International Conference on Evolutionary Computation(ICEC'97), Indianapolis, USA, 1997. 309- 314
[102] 李生红,潘理,诸鸿文等.基于蚂蚁算法的组播路由调度方法.计算机工程,2001,27(4):63～66
[103] 曹浪财,罗键,李天成.智能蚂蚁算法--蚁群算法的改进.计算机应用研究,2003,20(10):62～64
[104] Gianni Di Caro, Mario Dorigo. AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research, 1998, 9: 317～365
[105] 张素兵,吕国英,刘泽民等.基于蚂蚁算法的QoS路由调度方法.电路与系统学报,2000,5(1):1～5
[106] 张素兵,刘泽民.基于蚂蚁算法的时延受限分布式多播路由研究.通信学报,2001,22(3):70～75
[107] Dorigo M, Caro G, Gambardella L. Ant algorithms for discrete optimization. Artificial Life, 1999, 5(2):137～172
[108] 张纪会,徐心和.具有变异特征的蚁群算法.计算机研究与发展,1999,36(10):1240～1245
[109] 吴斌,史忠植.一种基于蚁群算法的TSP问题分段求解算法.计算机学报,2001,24(12):1328～1334
[110] Marco Dorigo. Ant colonies for thetravelling salem an problem, luca Maria Gam bardella Bio Systems, 1997. 73～81
[111] Colorni A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies(J). In: Proc1st European Conf Artificial Life. Pans, France:Elsevier, 1991. 134～142
[112] Marco Dorigo, Eric Bonabeau. Ant algorithms and stigmergy(J). Guy Theraulaz Future Generation Computer Systems, 2000.85～871
[113] Vittorio Maniezzot. An ANTS heuristic for the frequency assignment problem(J). Antonella Carbonaro Future Generation Computer Systems, 2000. 927～935
[114] Schoonderwoerd R, Holland O, Bruten J. Ant based Load Balancing in Telecommuni cations Networks. Adaptive Behavior, 1996, 5(2): 169～207
[115] 孙焘,王秀坤,刘业欣等.一种简单蚂蚁算法及其收敛性分析.2003,24(8):1524～1528
[116] 吕国英,刘泽民,周正.基于蚂蚁算法的分布式QoS路由选择算法.2001,22(9):34～41
[117] 李勇,段正澄.动态蚁群算法求解TSP问题.计算机工程与应用,2003(17):103～107
[118] Colorni A, Dorigo M, Maniezzo. Ant system for job shop scheduling. Belg. J.Oper. Res., Stat. and Comput. Sci., 1993. 39～53
[119] G. Di Caro and M. Dorigo. Ant colonies for adaptive routing in packet switched communications networks. Proc. International Conference on Parallel Problem Solving from Nature, Amsterdam, Holland, 1998. 27～30,
[120] Colorni A, Dorigo M. Heuristics from nature for hard combinatorial optimization problems. International Trans Operational Research, 1996, 3(1): 1～21
[121] 董红斌,石纯一.一个多Agent系统模型.小型微型计算机系统,2000,21(7):40～744
[122] 杨云,徐永红,曹立鑫等.一种面向Agent的分布式路由算法.计算机工程与应用,2003(12):20～23
[123] 兰少华,李艳秋,顾一禾等.基于移动Agent的分布式QoS路由研究.计算机工程,2000.28(12):41～43
[124] Appleby S, Steward S. Mobile software agents for control in telecommunications networks. Technology Journal, 1994, 12(2): 104～113
[125] A. Bieszczad, B. Pagurek, T. White. Mobile Agents for Network Management. IEEE CommunicationSurveys, 1998, 1(1):2～9
[126] Bonabeau E. Routing in telecommunications networks with "smart" ant-like agents. Intelligent Agents for Telecommunications Applications, January 1998. 56～64
[127] G. Di Caro, M. Dorigo. An adaptive multi-agent routing algorithm inspired by ants behavior. Proc. PART98 - Fifth Annual Australasian Conference on Parallel and Real-Time Systems, Adelaide, Australia, September 1998.28～29,
[128] K. Oida, M. Sekido, An agent-based routing system for QoS guarantees. Proc. IEEE International Conference on Systems, Man, and Cybernetics, 1999, 3: 833～838
[129] B. E. Helvik, O. Wittner. Using the Cross Entropy Method to Guide/Govern Mobile Agents Path Finding in Networks. in Proceedings of 3rd International Workshop on Mobile Agents for Telecommunication Applications, Springer Verlag, August 2001. 14～16
[130] O. Wittner, B. E. Helvik. Cross-Entropy Guided Ant-like Agents Finding Cyclic Paths in Scarcely Meshed Networks, in The Third International Workshop on Ant Algorithms, ANTS'2002, (Brussels, Belgium), 2002. 82～88
[131] 王洪波,张尧学,郭国强等.一种可选择最佳带宽的多路路由算法.软件学报,2002,13(4):928～937
[132] 刘巧勇,王丽萍,邱飞岳.蚂蚁路由算法中agent分析.中国有线电视,2004(3):21～24
[133] 张素兵,刘泽民.基于代理的QoS组播路由算法.高技术通讯,2001(1):32～36
[134] 马常霞.基于移动Agent的改进蚊群算法.淮海工学院学报,2004,13(1):29～31
[135] Pham V.A., Karmouch A. Mobile Software Agents: An Overview, IEEE Communications, 1996, 36(7):26～37
[136] Sosa, R. Improved AntNet Algorithm for data routing based on mobile agents. Science and Technology Faculty, Asuncion Catholic University, 2000. 47～79
[137] Kuntz P, Layzell, P Snyers D. A colony of ant like agents for partitioning in VLSI technology. In: Proc.of 4th European Conference on Artificial Life, MIT Press, Cambridge, 1997. 417～424
[138] T. White A. Bieszczad, B. Pagurek. Distributed Fault Location in Networks Using Mobile Agents. In Proceedings of the 3rd International Workshop on Agents in Telecommunication Applications IATA'98, Paris, France, 1998.106～112
[139] A. Bieszczad, B. Pagurek, T. White. Mobile agents for network management. IEEE Communication Surveys, Fourth Quarter 1998, 1(1):45～50
[140] http://www.item.ntnu.no/- wittner/mata01_foil.pdf
[141] Reuven Y. Rubinstein. Stochastic Optimization: Algorithms and Applications, chapter Combinatorial Optimization, Cross-Entropy, Ants and Rare Events Section 7: Noisy Networks. Kluwer Academic Publishers, 2001. 461～523
[142] Reuven Y. Rubinstein. The Cross-Entropy Method for Combinatorial and Continuous Optimization. Methodology and Computing in Applied Probability, 1999. 127～190
[143] O. Wittner, B. E. Helvik. Cross Entropy Guided Ant-like Agents Finding Dependable Primary/Backup Path Patterns in Networks. Proceedings of Congress on Evolutionary Computation, 2002, 2:1528～1533
[144] O. Wittner, P. E. Heegaard, B. E. Heivik, Swarm based distributed search in the amigos environment. AVANTEL Technical Report, Department of Telematics, Norwegian University of Science and Technology, 2003. 1503～4097
[145] O. Wittner, B. E. Helvik. Simulating mobile agent based network management using network simulator. Poster in Forth International Symposium on Mobile Agent System (ASA/MA 2000), 2000. 82～91
[146] 李建枫,糜正琨,成际镇.NS-2移动代理网络仿真功能扩展设计和实现.系统真学报,2004,16(1):85～91
[147] 徐雷鸣,庞博,赵耀.NS与网络模拟.北京:人民邮电出版社,2003.30～160
[148] David kotz, Guofei Jiang, Robert Gray. Performance Analysis of Mobile Agents for Filtering Data Streams on Wireless Networks [J]. Mobile Networks and Applications, 2002. 163～174
[149] Liotta A, Ragusa C, Pavlou G. Running Mobile Agent Code over Simulated Internetworks: an Extra Gear Towards Distributed System Evaluation [C]. Proceedings of the 2nd WSEAS International Conference on Simulation, Modeling and Optimization, Skiathos Island, Greece, 2002. 447～392
[150] Jae Chung, Mark Claypool. NS by Example [R]. Technical Report WPI- CS- TR- 99-25, Computer Science Department, Worcester Polytechnic Institute, September 1999
[151] David Wetherall, Christopher J. Lindblad. Extending Tcl for Dynamic Object Oriented Programming [C]. Proceedings of the Tcl/Tk Workshop, 1995. 134～168
[152] 陈尚兵,赵均,何小燕等.一种支持QoS的拓扑自适应动态组播路由算法.电路与系统学报,2002,7(3):1～7
[153] Deering S. Protocol Independent Multicast Version 2, Dense Mode Specification. Work in Progress, Aug. 1997
[154] Carberg K, Crowcroft J. Yet another multicast (YAM)routing protocol specification. Version 1. unpublished manuscript, 1997
[155] Yah SQ, Faloutsos M, Banerjea A. QoS-Aware multieast routing for the Internet: The design and evaluation of QoSMIC. IEEE/ACM Trans, on Networking, 2002, 10(1): 54～56
[156] Chen S, Nahrstedt K, Shavitt Y. A QoS-aware multicast routing protocol. In: Proceedings of IEEE NFOCOM, 2000, 18(12):2580～2592
[157] 李腊元,李春林.多QoS约束的多播路由协议.软件学报,2004,15(2):286-291
[158] Femando Kuipers, Turgay Korkmaz. An overview of Constraint Based Path Selection Algorithms for QoS Routing[J]. IEEE Communications Magazine, 2002, 40(12):50～55
[159] Handley M, Jacobson V. SDP: Session Directory Protocol. RFC2327, 1998
[160] 高茜,李勇,罗军舟.一种新的QoS约束的多播路由协议.计算机学报,2003,26(11):1441-1449
[161] Roumani A M, Hassanein H A. A scheme for QoS-based dynamic multicast routing. In: Proceedings of Computers and Communications, 2001. 132～138
[162] Lui King-Shan, Nahrstedt Klara. Routing with topology aggregation in delaybandwidth sensitive networks. Networking, IEEE/ACM Transactions, 2004, 12(1):17～29
[163] Hao Fang, Zegura Ellen W. On Scalable QoS Routing: Performance Evaluation of Topology Aggregation. Proceedings. IEEE, INFOCOM'2000, 2000, 1:147～156
[164] Awerbueh Baruch, Shavit Yuval. Topology Aggregation for Directed Graphs. IEEE/ACM Transactions on Networking, 2001, 9(1):82～90
[165] Korkmaz T, Krunz M. Source-Oriented Topology Aggregation with Multiple QoS Parameters in hierarchical ATM Networks. Quality of Service. In, IWQoS '99, 1999. 137～146
[166] W. T. Tsai, C. V. Ramamoorthy, W. K. Tsai. An adaptive hierarchical routing protocol. IEEE TRANSACTIONS ON COMPUTERS, 1989, 38(8):1059-1074
[167] Cohen R, Felstaine E, Emek R. Framework for Multicast in Hierarchical Networks, Proceedings. IEEE.INFOCOM'2000, 2000, 3:1673～1682
[168] Kakemizu M, Murata K, Wakamoto M. PNNI internetworking architecture over ATM public networks. IEEE Proceedings, ATM Workshop, 1999. 355～360
[169] Ragozini A, Rougier J, Gravey A. Analysis of the performance of a hierarchical PNNI network. ICATM '99, International Conference, 1999. 365～374
[170] Atari G, Datta A, Derby J et al. Fault Tolerant Hierarchical Routing. Performance Computer and Communications Conference, IEEE International 1997. 159～165
[171] Shree Murthy, J.J.Garcia-Luna-Aceves. A Loop-free Routing Protocol for Large scale Internets Using Distance Vectors. Computer Communications, 1998, 21(6): 147～161
[172] Jochen Behrens. Distributed Routing for Very Large Networks Based on Link Vectors. [Ph.D thesis], Computer Science College, University of California, Santa Cruz, 1997
[173] D G.Thaler, C V. Ravishankar. Distributed Top-Down Hierarchy Construction. INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, 1998, 2:693～701
[174] Dean H. Lorenz, Ariel Orda. QoS Routing in Networks with Uncertain Parameters. In: Proc. Of IEEE INFOCOM'98, 1998, 1(1):3～10
[175] R.Ramanathan, M.Steenstrup. Hierarchically-organized, multihop mobile wireless networks for quality-of-service support. ACM/Baltzer Mobile Network and Applications, 1998, 3(1):101～109
[176] Moh W, Xiang L. Extending BGMP for QoS-based inter-domain multicasting over the Internet. Communications, IEEE International Conference, 2000, 2:728～734
[177] C.Shields, Garcia-Luna-Aceves. The HIP protocol for hierarchical multicast routing protocol. In Proc. ofACM MOBICOM, 1999. 207～218
[178] Lee W. C. Spanning tree method for link state aggregation in large communication networks, IEEE INFOCOM'95, 1995. 297～302
[179] Pradhan Satyabrata, Li Yi, Maheswaran Muthucumaru. QoS-Aware Hierarchical Multicast Routing on Next Generation Internetworks. IEEE International Conference on Performance Computing;and Communications, 2001.9～16
[180] 张素兵,刘泽民.基于蚂蚁算法的分级QoS路由调度方法.北京邮电大学学报,2000,23(4):11～17
[181] 陆慧梅,向勇,史美林.支持QoS的层次组播路由算法框架QHMR.计算机学报.2004,27(6):772～782
[182] S.Chen K.-S. Lui, K.Nahrstedt. Hierarchical QoS Routing in Delay-Bandwidth Sensitive Networks. Local Computer Networks, Proceedings. 25th Annual IEEE Conference, 2000. 579～588
[183] Li Layuan, Li Chunlin. A Hierarchical QoS Multicast Routing Protocol for Mobile Ad-Hoc Networks. http://www.paper.edu.cn/lilayuanl.pdf
[184] LU Hui-Mei, XIANG Yong, SHI Mei-Lin. A QoS-Based Dynamic Multicast Routing Algorithm for Streaming Layered Data. Journal of Software.2004, 15(6):928～940
[185] S.Chen, K.Nahrstedt. An overview of Qulity of Service Routing for the Next Generation High-SPeed Networks: Problems and Solutions. IEEE Network, Special Issue on Transmission and Distribution of Digital Video, Dec.1998, 12(6): 64～79
[186] M.B. Doar. A Better Model for Generating Test Networks. Proceedings of IEEE Global Internet, 1996, 11: 86～93
[187] 李腊元,李春林.计算机网络技术第二版.北京:国防工业出版社,2004.123～234
[188] 王兴伟,程辉,黄敏等.下一代互联网中的智能QoS组播路由算法.东北大学学报,2004,25(3):235～239