基于QoS约束的组播路由算法研究
|
摘要
随着网络技术的飞速发展，当前通信网络带宽和处理能力的提高使网络能够提供更多的多媒体业务，也使得支持“点到多点”或“多点到多点”的组播通信方式成为网络支持多媒体业务的必要形式。组播路由是网络层具备的功能，组播问题的关键在于组播路由的确定，寻找简单、高效、健壮的组播路由算法一直是网络界致力研究但未完全解决的问题。另一方面，许多分布式的多媒体应用对时延、时延抖动、带宽以及包丢失率有不同的要求，这需要当前网络能够传送具有这些QoS要求的实时多媒体信息。因此，作为QoS为中心的网络体系结构中不可缺少的组成部分，基于QoS约束的组播路由算法的研究成为网络研究领域的重要内容和热点问题。
本文主要研究基于QoS约束的组播路由算法，针对一些典型的具有NP难度的QoS组播路由问题，提出几种简单、有效、实用的QoS组播路由启发式算法。主要研究工作和取得的成果如下：
(1)实现了一个通用、简单、开放性强的QoS路由仿真器QRSIM，为后续章节提出的几种QoS路由算法的性能测试构建出真实、准确的仿真平台。而且，只要使用者按照规范的接口编写新的QoS路由算法程序，该路由仿真器就能动态加载这些路由算法进行仿真实验；
(2)针对时延约束的最小代价组播路由问题，提出四种时延约束组播源路由算法。其中，LRDLMA算法是基于拉格朗日松弛方法解决该问题，对构建的封闭图采用Prim最小生成树算法，进行拉格朗日松弛，求得高质量的可行解。仿真实验表明LRDLMA算法代价性能较好，接近性能很好的BSMA算法，并具有时延稳定、运行速度快的特点；TSESMA和TSPSMA算法是两种基于禁忌搜索方法的路由算法，但是在邻域解集的构造上有所不同，前者采用基于链路交换的思想，而后者使用路径交换策略。仿真结果表明两种算法的稳定，可靠性高，收敛速度快，有效地降低路由计算时间。TSPSMA代价较低，优于BSMA算法，对提高网络效率，优化网络资源起到很好的作用。LODMA算法是从最小时延树开始，利用链路优化策略来寻求满足条件的组播树，具有快速，时延低的特点，适合于对时延要求比较高的实时多媒体业务；
(3)将模拟退火思想引入组播路由计算中，提出一种基于模拟退火方法的时延及时延抖动约束的最小代价组播路由算法SADVMA。算法采用路径交换策略在可行解范围内构造邻域集，避免了搜索区域的扩大和计算时间的增加。仿真实验表明算法的可行性、有效性和稳定性，具有代价低、
摘要
博士论文
收敛快的特点;
(4)研究多点到多点组播路由问题，根据解决问题的策略不同，提出两种解
决时延约束的多共享组播树问题的算法:SCA算法和分布式算法DISA。
仿真实验表明，SCA算法在保证中心数不增加的条件下，有效地减少运
行时间;与同类算法相比，DJSA算法所获得的中心数较少，显著降低
了共享树的管理开销。
With fast development of network technologies, increase of network bandwidth and processing power makes the network provide more multimedia applications, and also makes the multicast communication that supports "one-to-many" or "many-to-many" become a necessary mode of multimedia services. A fundamental issue in multicast communication is how to determine an efficient multicast routing, and finding simple, effective and robust multicast routing algorithms is unsolved problem in network fields. In addition, many distributed multimedia applications have various demands on delay, delay variation, bandwidth and packet loss, which requires current network to transmit real-time multimedia information with these quality-of-service (QoS) constraints. So, as an indispensable component in a QoS-centric network architecture, research on multicast routing algorithms based on QoS constraint becomes an important part and hotspot issue of network research fields.
This dissertation concentrates on researching multicast routing algorithms with QoS constraints, proposes several simple, effective and practical QoS multicast routing heuristic algorithms to solve some classical multicast routing problems with NP difficulty. Generally, the main achievements in this paper are as follows:
(1) Develop a versatile, simple, and open QoS routing simulator (QRSIM), which provides a real and exact simulator platform for evaluating performance of proposed QoS routing algorithms. Also, as long as user presents new QoS routing algorithms programming according to standard interfaces, QRSIM can dynamically load these routing algorithms to simulate.
(2) Propose four delay-constrained multicast source routing algorithms to solve delay-constrained least-cost multicast routing problem. LRDLMA makes use of the characteristic of Lagrange relaxation method, and finds multicast tree satisfying constraint by constructing closure graph and using Prim algorithm to make relaxation to this graph. A large number of simulations demonstrate that cost performance of the algorithm is close to BSMA algorithm whose performance is best, and it has characteristics of stable delay and quickness. TSESMA and TSPSMA algorithm are two routing algorithms based on Tabu search, and they take different approach to construct neighbors. TSESMA is
based on "edges-switching", and TSPSMA uses "paths-switching" strategy. Simulations show that two algorithms performs stable performance, high reliability, rapid convergence and reduce computing time. TSPSMA performs excellent performance of cost, and its cost is lower than BSMA algorithm's, which can improve network efficiency and optimize network resource. LODMA algorithm begins from a least-delay tree, then gets final multicast tree satisfying delay constraint by using "link optimizing" strategy. This algorithm has faster execution time and lower delay than other heuristics, and it is fit for those real-time multimedia applications with higher delay demands.
(3) Apply the simulated annealing to multicast routing, and propose a multicast routing algorithm (SABDMA) based on simulated annealing to solve delay and delay variation constrained least-cost multicast routing problem. To avoid enlargement of search area and increase of computing time, SABDMA uses "paths-switching" strategy, which constructs neighbor set in the range of feasible solutions according to the relationship between delay and delay variation. Simulations demonstrates that the algorithm has characteristics of feasibility, stability and rapid convergence, and it can effectively construct multicast tree with lower cost according to QoS request, and has better real-time property.
(4) Study many-to-many multicast routing problem and propose two heuristic algorithms to solve delay-constrained multiple-shared multicast tree problem: SCA algorithm and distributed heuristic algorithm DISA. The simulations show SCA algorithm consumed smaller run-time than others, without increasing number of centers. DISA algorithm has the best performance o
本文主要研究基于QoS约束的组播路由算法，针对一些典型的具有NP难度的QoS组播路由问题，提出几种简单、有效、实用的QoS组播路由启发式算法。主要研究工作和取得的成果如下：
(1)实现了一个通用、简单、开放性强的QoS路由仿真器QRSIM，为后续章节提出的几种QoS路由算法的性能测试构建出真实、准确的仿真平台。而且，只要使用者按照规范的接口编写新的QoS路由算法程序，该路由仿真器就能动态加载这些路由算法进行仿真实验；
(2)针对时延约束的最小代价组播路由问题，提出四种时延约束组播源路由算法。其中，LRDLMA算法是基于拉格朗日松弛方法解决该问题，对构建的封闭图采用Prim最小生成树算法，进行拉格朗日松弛，求得高质量的可行解。仿真实验表明LRDLMA算法代价性能较好，接近性能很好的BSMA算法，并具有时延稳定、运行速度快的特点；TSESMA和TSPSMA算法是两种基于禁忌搜索方法的路由算法，但是在邻域解集的构造上有所不同，前者采用基于链路交换的思想，而后者使用路径交换策略。仿真结果表明两种算法的稳定，可靠性高，收敛速度快，有效地降低路由计算时间。TSPSMA代价较低，优于BSMA算法，对提高网络效率，优化网络资源起到很好的作用。LODMA算法是从最小时延树开始，利用链路优化策略来寻求满足条件的组播树，具有快速，时延低的特点，适合于对时延要求比较高的实时多媒体业务；
(3)将模拟退火思想引入组播路由计算中，提出一种基于模拟退火方法的时延及时延抖动约束的最小代价组播路由算法SADVMA。算法采用路径交换策略在可行解范围内构造邻域集，避免了搜索区域的扩大和计算时间的增加。仿真实验表明算法的可行性、有效性和稳定性，具有代价低、
摘要
博士论文
收敛快的特点;
(4)研究多点到多点组播路由问题，根据解决问题的策略不同，提出两种解
决时延约束的多共享组播树问题的算法:SCA算法和分布式算法DISA。
仿真实验表明，SCA算法在保证中心数不增加的条件下，有效地减少运
行时间;与同类算法相比，DJSA算法所获得的中心数较少，显著降低
了共享树的管理开销。
With fast development of network technologies, increase of network bandwidth and processing power makes the network provide more multimedia applications, and also makes the multicast communication that supports "one-to-many" or "many-to-many" become a necessary mode of multimedia services. A fundamental issue in multicast communication is how to determine an efficient multicast routing, and finding simple, effective and robust multicast routing algorithms is unsolved problem in network fields. In addition, many distributed multimedia applications have various demands on delay, delay variation, bandwidth and packet loss, which requires current network to transmit real-time multimedia information with these quality-of-service (QoS) constraints. So, as an indispensable component in a QoS-centric network architecture, research on multicast routing algorithms based on QoS constraint becomes an important part and hotspot issue of network research fields.
This dissertation concentrates on researching multicast routing algorithms with QoS constraints, proposes several simple, effective and practical QoS multicast routing heuristic algorithms to solve some classical multicast routing problems with NP difficulty. Generally, the main achievements in this paper are as follows:
(1) Develop a versatile, simple, and open QoS routing simulator (QRSIM), which provides a real and exact simulator platform for evaluating performance of proposed QoS routing algorithms. Also, as long as user presents new QoS routing algorithms programming according to standard interfaces, QRSIM can dynamically load these routing algorithms to simulate.
(2) Propose four delay-constrained multicast source routing algorithms to solve delay-constrained least-cost multicast routing problem. LRDLMA makes use of the characteristic of Lagrange relaxation method, and finds multicast tree satisfying constraint by constructing closure graph and using Prim algorithm to make relaxation to this graph. A large number of simulations demonstrate that cost performance of the algorithm is close to BSMA algorithm whose performance is best, and it has characteristics of stable delay and quickness. TSESMA and TSPSMA algorithm are two routing algorithms based on Tabu search, and they take different approach to construct neighbors. TSESMA is
based on "edges-switching", and TSPSMA uses "paths-switching" strategy. Simulations show that two algorithms performs stable performance, high reliability, rapid convergence and reduce computing time. TSPSMA performs excellent performance of cost, and its cost is lower than BSMA algorithm's, which can improve network efficiency and optimize network resource. LODMA algorithm begins from a least-delay tree, then gets final multicast tree satisfying delay constraint by using "link optimizing" strategy. This algorithm has faster execution time and lower delay than other heuristics, and it is fit for those real-time multimedia applications with higher delay demands.
(3) Apply the simulated annealing to multicast routing, and propose a multicast routing algorithm (SABDMA) based on simulated annealing to solve delay and delay variation constrained least-cost multicast routing problem. To avoid enlargement of search area and increase of computing time, SABDMA uses "paths-switching" strategy, which constructs neighbor set in the range of feasible solutions according to the relationship between delay and delay variation. Simulations demonstrates that the algorithm has characteristics of feasibility, stability and rapid convergence, and it can effectively construct multicast tree with lower cost according to QoS request, and has better real-time property.
(4) Study many-to-many multicast routing problem and propose two heuristic algorithms to solve delay-constrained multiple-shared multicast tree problem: SCA algorithm and distributed heuristic algorithm DISA. The simulations show SCA algorithm consumed smaller run-time than others, without increasing number of centers. DISA algorithm has the best performance o
引文
[1]Deering S. Multicast Routing in a Datagram Internetwork[D]. PhD thesis, Stanford University, 1991.
[2]Lawton G. Multicast: will it transform the Internet[J]. IEEE Computer, 1998, 31(7): 13-15.
[3]Tanenbaum A S. Computer Network[M]. 3rd ed. Prentice Hall Inc., 1996．熊桂喜，王小虎 译．计算机网络[M]．第3版．北京：清华大学出版社，1999．
[4]Clark D, Shenker S, Zhang L. Support Real-time Applications in an Integrated Service Packet Network: Architecture and Mechanism[A]. In Proceedings of ACM SIGCOMM[C]. Baltimore, MD. 1992: 77-82.
[5]Wang Z, Crowcroft J. Quality of Service for Supporting Multimedia Applications[J]. IEEE Journal on Selected Areas in Communications, 1996, 14(7): 1228-1234.
[6]Eriksson H. MBONE: The Multicast Backbone[J]. Communications of the ACM, 1994, 37(8): 54-60.
[7]Sahasrabuddhe L H, Mukherjee B. Multicast Routing Algorithms and Protocols: ATutorial[J]. IEEE Network. 2000, 14(1): 90-102.
[8]Diot C, Dabbous W, Crowcroft J. Multipoint Communications: A Survey of Protocols, Functions and Mechanisms[J]. IEEE Journal on Selected Areas in Communications, 1997, 15(3): 277-290.
[9]Nader F M. A Survey of Data Multicast Techniques, Architectures, and Algorithms [J]. IEEE Communication Magazine, 2001, 39(9): 164-170.
[10]Vob S. Steiner's Problem in Graphs: Heuristic Methords[J]. Discrete Applied Mathematics, 1992, 40(1): 43-72.
[11]Ballardie A. Core Based Trees (CBT version 2) Multicast Routing[S]. RFC 2189, 1997.
[12]Ballardie A. Core Based Trees (CBT) Multicast Routing Architecture[S]. RFC 2201, 1997.
[13]Waxman B M. Routing of Multipoint Connections[J]. IEEE Journal on Selected Areas in Communications, 1988, 6(9): 1617-1622.
[14]Wang B, Hou J C. Multicast Routing and Its QoS Extension: Problem, Algorithm, and Protocols[J]. IEEE Network, 2000, 14(1): 22-36.
[15]Li L Y, Li C L. QoS-based Routing Algorithms for ATM Networks[J]. Computer Communications, 2001, 24(3): 416-421.
[16]Kompella V P, Pasquale J C, Polyzos G C. Multicasting Routing for Multimedia Communication[J]. IEEE/ACM Transactions on Networking, 1993, 1(3): 286-292.
[17]Q Sun, H Langendoerfer. Efficient Multicast Routing for Delay-Sensitive Applications[A]. In Proceedings of the Second Workshop on Protocols for Multimedia Systems [C]. 1995:452-458.
[18]L Guo, I Matta. QDMR: An Efficient Dependent Multicast Routing Algorithm [A]. In Proceedings of IEEE Real-Time Technology and Applications Symposium [C]. 1999: 213-222.
[19]Zhu Q, Parsa M, Garcia-Luna-Aceves J J. A Source-Based Algorithm for Delay-Constrained Minimum-Cost Multicasting[A]. In Proceedings of IEEE INFOCOM'95[C]. Boston, MA, 1995: 452-458.
[20]Widyono, R. The Design and Evaluation of Routing Algorithms for Real-Time Channels[R]. Technical Report, ICSI TR-94-024, University of California at Berkeley International Computer Science Institute, June 1994.
[21]Zhang B X, Mouftah H T. A Destination-Driven Shortest Path Tree Algorithm[A]. In Proceedings of the IEEE International Conference on Communications 2002 (ICC'2002)[C]. New York: IEEE Communication Society, 2002,4: 2258-2262.
[22]Shaikh A, Shin K G. Destination-Driven Routing for Low-Cost Multicast[J]. IEEE Journal on Selected Areas in Communications, 1997, 15 (3): 373-381.
[23]Rouskas G N, Baldine I. Multicast Routing with End-to-End Delay and Delay Variation Constraints[J]. IEEE Journal on Selected Areas inCommunications, 1997, 15(3): 346-356.
[24]Ravikumar C P, Bajpai R. Source-based Delay-bounded Multicasting in Multimedia Networks[J]. Computer Communications, 1998, 21: 126-132.
[25]Lee H Y, Youn C H. Scalable Multicast Routing Algorithm for Delay-Variation Constrained Minimum-Cost Tree[A]. In Proceedings of IEEE International Conference on Communications [C]. 2000, 3: 1343-1347.
[26]Hac A, Zhou K L. A New Heuristic Algorithm for Finding Minimum-cost Multicast Trees with Bounded Path Dalay[J]. International Journal of Network Management, 1999, 9(3): 265-278.
[27]Low C P. Loop-free Multicast Routing with End-to-End Delay Constraint[J]. Computer Communications, 1999, 22:181-192.
[28]王明中，谢剑英，张敬辕．时延及时延抖动限制的最小代价多播路由策略[J]．计算机学报，2002，25(5)：534-541．
[29]赵键，吴介一，罗军舟，等．一类基于源路由的多约束实时组播路由优化控制算法[J]．电子学报，2001，29(4)：1-5．
[30]石坚，董天临，邹玲，等．一种基于延时及带宽受限的启发式组播路由算法[J]．电子学报，2001，29(8)：1-4．
[31]郭伟，席裕庚．有时延及时延差别约束的最小代价组播路由问题[J]．通信学报，2001，22(6)：13-20．
[32]余燕平，仇佩亮．一种时延和时延抖动受约束的启发式多播路由算法[J]．通信学报，2003，24(2)：132-137．
[33]Zhang Q F. An Orthogonal Genetic Algorithm for Multimedia Multicast Routing[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(1): 53-62.
[34]Gelenbe E. Improved Neural Heuristic for Multicast Routing[J]. IEEE Journal on Selected Areas in Communications, 1997, 15: 147-155.
[35]Leung Y. A Genetic Algorithm for the Multiple Destination Routing Problems[J]. IEEE Transactions on Evolutionary Computation, 1998, 3: 150-161.
[36]Xiang F, Junzhou L, Jieyi W, et al. QoS Routing Based on Genetic Algorithm[J]. Computer Communications, 1999, 22:1392-1399.
[37]Haghighat A T, Faez K, Dehghan M, et al. GA-Based Heuristic Algorithms for QoS Based Multicast Routing[J]. Knowledge-Based Systems, 2003, 16: 305-312.
[38]Zhou X, Chen C, Zhu G. A Genetic Algorithm for Multicast Routing Problem[A]. In Proceedings of ICCT'2000[C]. 2000: 1248-1253.
[39]Lu G, Liu Z. Multicast Routing Based on Ant-Algorithm with Delay and Delay Variation Constriants[A]. In Proceedings of ICCT'2000[C]. 2000: 243-246.
[40]Esbensen H. Computing Near-Optimal Solution to the Steiner Problem in a Graph Using a Genetic Algorithm[J]. Networks, 1995, 26:173-185.
[41]Tsai C W, Tsai C F, Chen C P. A Novel Mutiple-Searching Genetic Algorithm for Multimedia Multicast[A]. In Proceedings of CEC'2002 [C]. 2002, 2:1624-1629.
[42]Youssef H, Mulhem A A, Sait S M, et al. QoS-Driven Multicast Tree Generation Using Tabu Search[J]. Computer Communications, 2002, 25:1140-1149.
[43]王征应，石冰心．基于启发式遗传算法的QoS组播路由问题求解[J]．计算机学报，2001，24(1)：55-61．
[44]张素兵，刘泽民．一种新的基于混沌神经网络的组播路由算法[J]．计算机学报，2001，24(12)：1256-1261．
[45]刘芳，冯小军．免疫组播路由选择算法[J]．计算机学报，2003，26(6)：676-681．
[46]郑彦兴，田菁，窦文华．基于遗传算法的有矢量约束的多播路由计算[J]．计算机学报，2003，26(6)：746-752．
[47]张强，王超，许进．基于暂态混沌神经网络的组播路由算法[J]．计算机研究与发展，2003，40(2)：177-179．
[48]石坚，邹玲，董天临，等．遗传算法在组播路由选择中的应用[J]．电子学报，2000，28(5)：1-2．
[49]王新红，王光兴．基于遗传算法的时延受限最小组播路由选择方法[J]．通信学报，2002，23(3)：112-117．
[50]Bauer F, Varma A. Distributed Algorithms for Multicast Path Setup in Data Networks[J]. IEEE/ACM Transactions on Networking, 1996, 4(2): 181-191.
[51]Kompella V P, Pasquale J, Polyzos G. Two Distributed Algorithms for Multicasting Multimedia Information[A]. In Proceedings of ICCCN'93[C]. 1993: 343-349.
[52]Chen S, Nahrstedt K. Distributed Quality-of-Service Routing in High-Speed Networks Based on Selective Probing[R]. Technical Report, University of Illinois at Urbana-Champaign, Department of Computer Science, 1998.
[53]Jia X H. A Distributed Algorithm of Delay-bounded Multicast Routing for Multimedia Applications in Wide Area Networks[J]. IEEE/ACM Transactions on Networking, 1998, 6(6): 828-837.
[54]Jia X H, Zhang Y C, et al. A Distributed Multicast Routing Protocol for Real-time Multicast Applications[J]. Computer Networks, 1999, 31(1-2): 101-110.
[55]Low C P, Lee Y J. Distributed Multicast Routing, with End-to-End Delay and Delay Variation Constrains[J]. Computer Communications, 2000, 23(9): 848-862.
[56]Wi S, Choi Y. A Delay Constrained Distributed Multicast Routing Algorithm[A]. In Proceedings of the ICCC'95[C]. 1995: 833-838.
[57]Bauer F, Varma A. ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm[J]. IEEE Journal on Selected Areas in Communications, 1997, 15(3): 382-397.
[58]Doar M, Leslie I. How Bad is Naive Multicast Routing[A]. In Proceedings of the IEEE INFOCOM'93[C]. 1993: 82-89.
[59]Lin H, Lai S. VTDM: A Dynamic Multicast Routing Algorithm[A]. In Proceedings of IEEE INFOCOM'98[C]. 1998, 3: 1426-1432.
[60]Sriram R, Manimaran G, Murthy C. A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Tree[J]. IEEE/ACM Transactions on Networking, 1999, 7(4): 514-529.
[61]Hong S, Lee H, Park B H. An Efficient Multicast Routing Algorithm for Delay-Sensitive Applications with Dynamic Membership[A]. In Proceedings of IEEE INFOCOM'98[C]. 1998: 1433-1440.
[62]Biersack E, Nonnenmacher J. WAVE: A New Multicast Routing Algorithm for Static and Dynamic Multicast Groups[A]. In Proceedings of 5th Workshop on Network and Operating System Support for Digital Audio and Video[C]. 1995.
[63]Cormen T H, Leiserson C E, Riverst R L, et al. Introduction to Algorithms[M]. 2nd ed. The MIT Press and McGraw-Hill book company. 2001.
[64]Winter P. Steiner Problem in Networks: A Survey[J]. Networks, 1987, 17: 129-167.
[65]Hwang F K, Richards D S. Steiner Tree Problems[J]. Networks, 1992, 22: 55-89.
[66]Salama H F, Reeves D S, Viniotis Y. Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks[J]. IEEE Journal on Selected Areas in Communications, 1997, 15(3): 332-345.
[67]Deering S, Partridge C, Waitzman D. Distance Vector Multicast Routing Protocol[S]. RFC 1075, 1998.
[68]Malkin G. RIP Version 2[S]. RFC 2453, 1998.
[69]Thyagarajan A, Deering S. Hierarchical Distance-Vector Multicast Routing for the Mbone[A]. In Proceedings of ACM SIGCOMM'95[C]. 1995: 60-66.
[70]Moy J. Multicast Extensions to OSPF[S]. RFC 1584, 1994.
[71]Moy J. OSPF Version 2[S]. RFC 2328, 1998.
[72]Estrin D, Farinacci D, Helmy A, et al. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification[S]. RFC 2362, 1998.
[73]Adams A, Nicholas J, Siadak W. Protocol Independent Multicast - Dense Mode (PIM-DM): Protocol Specification (Revised)[S]. Internet Draft, 2003.
[74]Chan K, Sahita R, Hahn S, et al. Differentiated Services Quality of Service Policy Information Base[S]. RFC 3317, 2003.
[75]Chen S, Nahrstedt K. An Overview of Quality-of-Service Routing for Next-Generation High-Speed Networks: Problems and Solutions[J]. IEEE Network, 1998, 12(6): 64-79.
[76]Crawley E, Nair R, Rajagopalan B, et al. A Framework for QoS-based Routing in the Internet[S]. RFC 2386, 1998.
[77]Chen S, Nahrstedt K. On Finding Multi-Constrained Paths[A]. In Proceedings of IEEE ICC'98[C]. 1998.
[78]Ma Q, Steenkiste P. Quality-of-Service Routing with Performance Guarantees[A]. In Proceedings of the 4th International IFIP Workshop on Quality of Service[C]. 1997.
[79]Wang Z, Crowcroft J. QoS Routing for Supporting Resource Reservation[J]. IEEE Journal on Selected Areas in Communications, 1996, 14(7): 1228-1234.
[80]Guerin R, Orda A. QoS-Based Routing in Networks with Inaccurate Information: Theory and Algorithm[A]. In Proceedings of the IEEE INFORCOM'97[C]. 1997: 75-83.
[81]Jutter A, Szviatovski, Mecs B I, et al. Lagrange Relaxation Based Method for the QoS Routing Problem[A]. In Proceedings of the IEEE INFOCOM 2001[C]. 2001: 859-868.
[82]Korkmaz T, Krunz M. Multi-Constrained Optimal Path Selection[A]. In Proceedings of the IEEE INFOCOM 2001[C]. 2001: 834-843.
[83]De Neve H, Van Mieghem PV. A Multiple Quality of Service Routing Algorithm for PNNI[A]. In Proceedings of the IEEE ATM Workshop[C]. 1998: 324-328.
[84]崔勇，吴建平，徐恪．基于模拟退火的服务质量路由算法[J]．软件学报，2003，14(5)：877-884．
[85]王颖，谢剑英．有时延约束的路由算法研究[J]．计算机研究与发展，2001，38(7)：783-787．
[86]Salama H F, Reeves D S, Viniotis Y. A Distributed Algorithm for Delay-Constrained Unicast Routing[J]. IEEE/ACM Transactions on Networking, 2000, 8(2): 239-250.
[87]Sun Q, Langerdorfer H. A New Distributed Routing Algorithm with End-to-End Delay Guarantee[A]. In Proceedings of the Second Workshop Protocols Multimedia Systems[C]. 1995: 452-458.
[88]Orda A, Sprintson A. QoS Routing: the Precomputation Perspective[A]. In Proceedings of the IEEE INFOCOM 2000[C]. 2000: 128-136.
[89]Orda A. Routing with End-to-End QoS Guarantees in Broadband Networks[J]. IEEE/ACM Transactions on Networking, 1999, 7(3): 365-374.
[90]吕国英，刘泽民，周正．基于蚂蚁算法的分布式QoS路由选择算法[J]．通信学报，2001，22(9)：34-42．
[91]Shacham N. Multipoint Communication by Hierarchically Encoded Data[A]. In Proceedings of IEEE INFOCOM'92[C]. 1992:2107-2114.
[92]Garey 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.
[93]Salama H F. Multicast Routing for Real-Time Communication on High-Speed Networks[D]. PhD thesis, North Carolina State University, Department of Electrical and Computer Engineering, 1996.
[94]Kou L, Markowsky G, Berman. A Fast Algorithm for Steiner Trees[J]. Acta Information, 1981, 15(2): 141-145.
[95]Takahashi H, Matsuyama A. An Approximate Solution for the Steiner Problem in Graphs[J]. Mathematica Japonica, 1980, 24(6): 573-577.
[96]Rayward-Smith V. The Computation of Nearly Minimal Steiner Trees in Graphs[J]. International Journal of Mathematical Education in Science and Technology, 1983, 14(1): 15-23.
[97]Haberman B K, Rouskas G. Cost, Delay, and Delay Variation Conscious Multicast Routing[R]. Technical Report, TR-97-03, NC State University, 1997.
[98]Jia X, Wang L. Group Multicast Routing Algorithm by Using Multiple Minimum Steiner Trees[J]. Computer Communications, 1997, 20(4): 750-758.
[99]Low C P, Wang N. An Efficient Algorithm for Group Multicast Routing with Bandwidth Reservation[J]. Computer Communications, 2000, 23(8): 1740-1746.
[100]Low C P, Song X Y. On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem[J]. IEEE Transactions on Computers, 2002, 51(5): 581-588.
[101]胡光岷，李乐民，安红岩．带宽预留的成组多播快速路由算法[J]．电子学报，2003，31(4)：569-572．
[102]Moh M, Nguyen B. QoS-guaranteed One-to-Many and Many-to-Many Multicast Routing[J]. Computer Communications, 2003, 26(7): 652-669.
[103]Noronha C, Tobagi F. Evaluation of Multicast Routing Algorithms for Multimedia Streams[A]. In Proceedings of the IEEE International Telecommunications Symposium[C]. 1994.
[104]Estrin D. Network Visualization with the VINT Network Animator[R]. Technical Report, 99-703, University of Southern California, 1999.
[105]OPNET Technologies Inc. OPNET[DB/OL]. http://www.mil3.com.
[106]The Network Simulator-ns-2[DB/OL], http://www.isi.edu/nsnam/ns/.
[107]Alaettinoglu C, Dussa-Zieger K, Matta I, et al. MaRS User's Manual[R]. Technical Report UMIACS-TR-91-80, CS-TR-2687, Department of Computer Science, University of Maryland, College Park, 1991.
[108]Zhang P, Kantola R, Ma Z S. Design and Implementation of A New Routing Simulator[A]. In Proceedings of 2000 SCS Symposium on Performance Evaluation of Computer and Telecommunication System(SPECTS'2K)[C]. Vancouver, Canada, 2000.
[109]Zhang P, Kantola R. Designing A New Routing Simulator for DiffServ MPLS Networks[R]. Internal Report, 2000.
[110]The Real-Time Communication Project, QoS Routing (Unicast and Multicast), Software[DB/OL]. http://rtcomm.csc.ncsu.edu/qos.htm.
[111]王征应．高速网络QoS路由技术的研究及路由仿真平台的研制[D]．武汉：华中科技大学，2001．
[112]Doar M. Multicast in the Asynchronous Transfer Mode Environment[D]. PhD thesis, University of Cambridge, 1993.
[113]余燕平．多播路由算法研究[D]．杭州：浙江大学，2002．
[114]Moy J. OSPF Version 2[S]. RFC 2328, 1998.
[115]刑文训，谢金星．现代优化计算方法[M]．北京：清华大学出版社，1999．
[116]Feng G. Neural Network and Algorithmic Methods for Solving Routing Problems in High Speed Networks[D]. PhD thesis, University.of Miami, Florida, 2001.
[117]谢政，李建平．网络算法与复杂性理论[M]．长沙：国防科技大学出版社，1995．
[118]王凌．智能优化算法及其应用[M]．北京：清华大学出版社，施普林格出版社，2001．
[119]Sheu P R, Chen S T. A Fast and Efficient Heuristic Algorithm for the Delay- and Delay Variation Bound Multicast Tree Problem[A]. In Proceedings of the 15th International Conference on Information Networking (ICO1N'01)[C]. 2001: 611-618.
[120]Paul K. A Stability-based Distributed Routing Mechanism to Support Unicast and Multicast Routing in Ad Hoc Wireless Network[J]. Computer Communications, 2001, 24(18): 1828-1845.
[121]Sungjoon A, Shankar A U. Adapting to Route-demand and Mobility in Ad Hoc Network Routing[J]. Computer Networks, 2002, 38(6): 745-764.
[122]Stojmenovic I. Poisition-based Routing in Ad Hoc Networks[J]. IEEE Communications Magazine, 2002, 40(7): 128-134.
[2]Lawton G. Multicast: will it transform the Internet[J]. IEEE Computer, 1998, 31(7): 13-15.
[3]Tanenbaum A S. Computer Network[M]. 3rd ed. Prentice Hall Inc., 1996．熊桂喜，王小虎 译．计算机网络[M]．第3版．北京：清华大学出版社，1999．
[4]Clark D, Shenker S, Zhang L. Support Real-time Applications in an Integrated Service Packet Network: Architecture and Mechanism[A]. In Proceedings of ACM SIGCOMM[C]. Baltimore, MD. 1992: 77-82.
[5]Wang Z, Crowcroft J. Quality of Service for Supporting Multimedia Applications[J]. IEEE Journal on Selected Areas in Communications, 1996, 14(7): 1228-1234.
[6]Eriksson H. MBONE: The Multicast Backbone[J]. Communications of the ACM, 1994, 37(8): 54-60.
[7]Sahasrabuddhe L H, Mukherjee B. Multicast Routing Algorithms and Protocols: ATutorial[J]. IEEE Network. 2000, 14(1): 90-102.
[8]Diot C, Dabbous W, Crowcroft J. Multipoint Communications: A Survey of Protocols, Functions and Mechanisms[J]. IEEE Journal on Selected Areas in Communications, 1997, 15(3): 277-290.
[9]Nader F M. A Survey of Data Multicast Techniques, Architectures, and Algorithms [J]. IEEE Communication Magazine, 2001, 39(9): 164-170.
[10]Vob S. Steiner's Problem in Graphs: Heuristic Methords[J]. Discrete Applied Mathematics, 1992, 40(1): 43-72.
[11]Ballardie A. Core Based Trees (CBT version 2) Multicast Routing[S]. RFC 2189, 1997.
[12]Ballardie A. Core Based Trees (CBT) Multicast Routing Architecture[S]. RFC 2201, 1997.
[13]Waxman B M. Routing of Multipoint Connections[J]. IEEE Journal on Selected Areas in Communications, 1988, 6(9): 1617-1622.
[14]Wang B, Hou J C. Multicast Routing and Its QoS Extension: Problem, Algorithm, and Protocols[J]. IEEE Network, 2000, 14(1): 22-36.
[15]Li L Y, Li C L. QoS-based Routing Algorithms for ATM Networks[J]. Computer Communications, 2001, 24(3): 416-421.
[16]Kompella V P, Pasquale J C, Polyzos G C. Multicasting Routing for Multimedia Communication[J]. IEEE/ACM Transactions on Networking, 1993, 1(3): 286-292.
[17]Q Sun, H Langendoerfer. Efficient Multicast Routing for Delay-Sensitive Applications[A]. In Proceedings of the Second Workshop on Protocols for Multimedia Systems [C]. 1995:452-458.
[18]L Guo, I Matta. QDMR: An Efficient Dependent Multicast Routing Algorithm [A]. In Proceedings of IEEE Real-Time Technology and Applications Symposium [C]. 1999: 213-222.
[19]Zhu Q, Parsa M, Garcia-Luna-Aceves J J. A Source-Based Algorithm for Delay-Constrained Minimum-Cost Multicasting[A]. In Proceedings of IEEE INFOCOM'95[C]. Boston, MA, 1995: 452-458.
[20]Widyono, R. The Design and Evaluation of Routing Algorithms for Real-Time Channels[R]. Technical Report, ICSI TR-94-024, University of California at Berkeley International Computer Science Institute, June 1994.
[21]Zhang B X, Mouftah H T. A Destination-Driven Shortest Path Tree Algorithm[A]. In Proceedings of the IEEE International Conference on Communications 2002 (ICC'2002)[C]. New York: IEEE Communication Society, 2002,4: 2258-2262.
[22]Shaikh A, Shin K G. Destination-Driven Routing for Low-Cost Multicast[J]. IEEE Journal on Selected Areas in Communications, 1997, 15 (3): 373-381.
[23]Rouskas G N, Baldine I. Multicast Routing with End-to-End Delay and Delay Variation Constraints[J]. IEEE Journal on Selected Areas inCommunications, 1997, 15(3): 346-356.
[24]Ravikumar C P, Bajpai R. Source-based Delay-bounded Multicasting in Multimedia Networks[J]. Computer Communications, 1998, 21: 126-132.
[25]Lee H Y, Youn C H. Scalable Multicast Routing Algorithm for Delay-Variation Constrained Minimum-Cost Tree[A]. In Proceedings of IEEE International Conference on Communications [C]. 2000, 3: 1343-1347.
[26]Hac A, Zhou K L. A New Heuristic Algorithm for Finding Minimum-cost Multicast Trees with Bounded Path Dalay[J]. International Journal of Network Management, 1999, 9(3): 265-278.
[27]Low C P. Loop-free Multicast Routing with End-to-End Delay Constraint[J]. Computer Communications, 1999, 22:181-192.
[28]王明中，谢剑英，张敬辕．时延及时延抖动限制的最小代价多播路由策略[J]．计算机学报，2002，25(5)：534-541．
[29]赵键，吴介一，罗军舟，等．一类基于源路由的多约束实时组播路由优化控制算法[J]．电子学报，2001，29(4)：1-5．
[30]石坚，董天临，邹玲，等．一种基于延时及带宽受限的启发式组播路由算法[J]．电子学报，2001，29(8)：1-4．
[31]郭伟，席裕庚．有时延及时延差别约束的最小代价组播路由问题[J]．通信学报，2001，22(6)：13-20．
[32]余燕平，仇佩亮．一种时延和时延抖动受约束的启发式多播路由算法[J]．通信学报，2003，24(2)：132-137．
[33]Zhang Q F. An Orthogonal Genetic Algorithm for Multimedia Multicast Routing[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(1): 53-62.
[34]Gelenbe E. Improved Neural Heuristic for Multicast Routing[J]. IEEE Journal on Selected Areas in Communications, 1997, 15: 147-155.
[35]Leung Y. A Genetic Algorithm for the Multiple Destination Routing Problems[J]. IEEE Transactions on Evolutionary Computation, 1998, 3: 150-161.
[36]Xiang F, Junzhou L, Jieyi W, et al. QoS Routing Based on Genetic Algorithm[J]. Computer Communications, 1999, 22:1392-1399.
[37]Haghighat A T, Faez K, Dehghan M, et al. GA-Based Heuristic Algorithms for QoS Based Multicast Routing[J]. Knowledge-Based Systems, 2003, 16: 305-312.
[38]Zhou X, Chen C, Zhu G. A Genetic Algorithm for Multicast Routing Problem[A]. In Proceedings of ICCT'2000[C]. 2000: 1248-1253.
[39]Lu G, Liu Z. Multicast Routing Based on Ant-Algorithm with Delay and Delay Variation Constriants[A]. In Proceedings of ICCT'2000[C]. 2000: 243-246.
[40]Esbensen H. Computing Near-Optimal Solution to the Steiner Problem in a Graph Using a Genetic Algorithm[J]. Networks, 1995, 26:173-185.
[41]Tsai C W, Tsai C F, Chen C P. A Novel Mutiple-Searching Genetic Algorithm for Multimedia Multicast[A]. In Proceedings of CEC'2002 [C]. 2002, 2:1624-1629.
[42]Youssef H, Mulhem A A, Sait S M, et al. QoS-Driven Multicast Tree Generation Using Tabu Search[J]. Computer Communications, 2002, 25:1140-1149.
[43]王征应，石冰心．基于启发式遗传算法的QoS组播路由问题求解[J]．计算机学报，2001，24(1)：55-61．
[44]张素兵，刘泽民．一种新的基于混沌神经网络的组播路由算法[J]．计算机学报，2001，24(12)：1256-1261．
[45]刘芳，冯小军．免疫组播路由选择算法[J]．计算机学报，2003，26(6)：676-681．
[46]郑彦兴，田菁，窦文华．基于遗传算法的有矢量约束的多播路由计算[J]．计算机学报，2003，26(6)：746-752．
[47]张强，王超，许进．基于暂态混沌神经网络的组播路由算法[J]．计算机研究与发展，2003，40(2)：177-179．
[48]石坚，邹玲，董天临，等．遗传算法在组播路由选择中的应用[J]．电子学报，2000，28(5)：1-2．
[49]王新红，王光兴．基于遗传算法的时延受限最小组播路由选择方法[J]．通信学报，2002，23(3)：112-117．
[50]Bauer F, Varma A. Distributed Algorithms for Multicast Path Setup in Data Networks[J]. IEEE/ACM Transactions on Networking, 1996, 4(2): 181-191.
[51]Kompella V P, Pasquale J, Polyzos G. Two Distributed Algorithms for Multicasting Multimedia Information[A]. In Proceedings of ICCCN'93[C]. 1993: 343-349.
[52]Chen S, Nahrstedt K. Distributed Quality-of-Service Routing in High-Speed Networks Based on Selective Probing[R]. Technical Report, University of Illinois at Urbana-Champaign, Department of Computer Science, 1998.
[53]Jia X H. A Distributed Algorithm of Delay-bounded Multicast Routing for Multimedia Applications in Wide Area Networks[J]. IEEE/ACM Transactions on Networking, 1998, 6(6): 828-837.
[54]Jia X H, Zhang Y C, et al. A Distributed Multicast Routing Protocol for Real-time Multicast Applications[J]. Computer Networks, 1999, 31(1-2): 101-110.
[55]Low C P, Lee Y J. Distributed Multicast Routing, with End-to-End Delay and Delay Variation Constrains[J]. Computer Communications, 2000, 23(9): 848-862.
[56]Wi S, Choi Y. A Delay Constrained Distributed Multicast Routing Algorithm[A]. In Proceedings of the ICCC'95[C]. 1995: 833-838.
[57]Bauer F, Varma A. ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm[J]. IEEE Journal on Selected Areas in Communications, 1997, 15(3): 382-397.
[58]Doar M, Leslie I. How Bad is Naive Multicast Routing[A]. In Proceedings of the IEEE INFOCOM'93[C]. 1993: 82-89.
[59]Lin H, Lai S. VTDM: A Dynamic Multicast Routing Algorithm[A]. In Proceedings of IEEE INFOCOM'98[C]. 1998, 3: 1426-1432.
[60]Sriram R, Manimaran G, Murthy C. A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Tree[J]. IEEE/ACM Transactions on Networking, 1999, 7(4): 514-529.
[61]Hong S, Lee H, Park B H. An Efficient Multicast Routing Algorithm for Delay-Sensitive Applications with Dynamic Membership[A]. In Proceedings of IEEE INFOCOM'98[C]. 1998: 1433-1440.
[62]Biersack E, Nonnenmacher J. WAVE: A New Multicast Routing Algorithm for Static and Dynamic Multicast Groups[A]. In Proceedings of 5th Workshop on Network and Operating System Support for Digital Audio and Video[C]. 1995.
[63]Cormen T H, Leiserson C E, Riverst R L, et al. Introduction to Algorithms[M]. 2nd ed. The MIT Press and McGraw-Hill book company. 2001.
[64]Winter P. Steiner Problem in Networks: A Survey[J]. Networks, 1987, 17: 129-167.
[65]Hwang F K, Richards D S. Steiner Tree Problems[J]. Networks, 1992, 22: 55-89.
[66]Salama H F, Reeves D S, Viniotis Y. Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks[J]. IEEE Journal on Selected Areas in Communications, 1997, 15(3): 332-345.
[67]Deering S, Partridge C, Waitzman D. Distance Vector Multicast Routing Protocol[S]. RFC 1075, 1998.
[68]Malkin G. RIP Version 2[S]. RFC 2453, 1998.
[69]Thyagarajan A, Deering S. Hierarchical Distance-Vector Multicast Routing for the Mbone[A]. In Proceedings of ACM SIGCOMM'95[C]. 1995: 60-66.
[70]Moy J. Multicast Extensions to OSPF[S]. RFC 1584, 1994.
[71]Moy J. OSPF Version 2[S]. RFC 2328, 1998.
[72]Estrin D, Farinacci D, Helmy A, et al. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification[S]. RFC 2362, 1998.
[73]Adams A, Nicholas J, Siadak W. Protocol Independent Multicast - Dense Mode (PIM-DM): Protocol Specification (Revised)[S]. Internet Draft, 2003.
[74]Chan K, Sahita R, Hahn S, et al. Differentiated Services Quality of Service Policy Information Base[S]. RFC 3317, 2003.
[75]Chen S, Nahrstedt K. An Overview of Quality-of-Service Routing for Next-Generation High-Speed Networks: Problems and Solutions[J]. IEEE Network, 1998, 12(6): 64-79.
[76]Crawley E, Nair R, Rajagopalan B, et al. A Framework for QoS-based Routing in the Internet[S]. RFC 2386, 1998.
[77]Chen S, Nahrstedt K. On Finding Multi-Constrained Paths[A]. In Proceedings of IEEE ICC'98[C]. 1998.
[78]Ma Q, Steenkiste P. Quality-of-Service Routing with Performance Guarantees[A]. In Proceedings of the 4th International IFIP Workshop on Quality of Service[C]. 1997.
[79]Wang Z, Crowcroft J. QoS Routing for Supporting Resource Reservation[J]. IEEE Journal on Selected Areas in Communications, 1996, 14(7): 1228-1234.
[80]Guerin R, Orda A. QoS-Based Routing in Networks with Inaccurate Information: Theory and Algorithm[A]. In Proceedings of the IEEE INFORCOM'97[C]. 1997: 75-83.
[81]Jutter A, Szviatovski, Mecs B I, et al. Lagrange Relaxation Based Method for the QoS Routing Problem[A]. In Proceedings of the IEEE INFOCOM 2001[C]. 2001: 859-868.
[82]Korkmaz T, Krunz M. Multi-Constrained Optimal Path Selection[A]. In Proceedings of the IEEE INFOCOM 2001[C]. 2001: 834-843.
[83]De Neve H, Van Mieghem PV. A Multiple Quality of Service Routing Algorithm for PNNI[A]. In Proceedings of the IEEE ATM Workshop[C]. 1998: 324-328.
[84]崔勇，吴建平，徐恪．基于模拟退火的服务质量路由算法[J]．软件学报，2003，14(5)：877-884．
[85]王颖，谢剑英．有时延约束的路由算法研究[J]．计算机研究与发展，2001，38(7)：783-787．
[86]Salama H F, Reeves D S, Viniotis Y. A Distributed Algorithm for Delay-Constrained Unicast Routing[J]. IEEE/ACM Transactions on Networking, 2000, 8(2): 239-250.
[87]Sun Q, Langerdorfer H. A New Distributed Routing Algorithm with End-to-End Delay Guarantee[A]. In Proceedings of the Second Workshop Protocols Multimedia Systems[C]. 1995: 452-458.
[88]Orda A, Sprintson A. QoS Routing: the Precomputation Perspective[A]. In Proceedings of the IEEE INFOCOM 2000[C]. 2000: 128-136.
[89]Orda A. Routing with End-to-End QoS Guarantees in Broadband Networks[J]. IEEE/ACM Transactions on Networking, 1999, 7(3): 365-374.
[90]吕国英，刘泽民，周正．基于蚂蚁算法的分布式QoS路由选择算法[J]．通信学报，2001，22(9)：34-42．
[91]Shacham N. Multipoint Communication by Hierarchically Encoded Data[A]. In Proceedings of IEEE INFOCOM'92[C]. 1992:2107-2114.
[92]Garey 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.
[93]Salama H F. Multicast Routing for Real-Time Communication on High-Speed Networks[D]. PhD thesis, North Carolina State University, Department of Electrical and Computer Engineering, 1996.
[94]Kou L, Markowsky G, Berman. A Fast Algorithm for Steiner Trees[J]. Acta Information, 1981, 15(2): 141-145.
[95]Takahashi H, Matsuyama A. An Approximate Solution for the Steiner Problem in Graphs[J]. Mathematica Japonica, 1980, 24(6): 573-577.
[96]Rayward-Smith V. The Computation of Nearly Minimal Steiner Trees in Graphs[J]. International Journal of Mathematical Education in Science and Technology, 1983, 14(1): 15-23.
[97]Haberman B K, Rouskas G. Cost, Delay, and Delay Variation Conscious Multicast Routing[R]. Technical Report, TR-97-03, NC State University, 1997.
[98]Jia X, Wang L. Group Multicast Routing Algorithm by Using Multiple Minimum Steiner Trees[J]. Computer Communications, 1997, 20(4): 750-758.
[99]Low C P, Wang N. An Efficient Algorithm for Group Multicast Routing with Bandwidth Reservation[J]. Computer Communications, 2000, 23(8): 1740-1746.
[100]Low C P, Song X Y. On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem[J]. IEEE Transactions on Computers, 2002, 51(5): 581-588.
[101]胡光岷，李乐民，安红岩．带宽预留的成组多播快速路由算法[J]．电子学报，2003，31(4)：569-572．
[102]Moh M, Nguyen B. QoS-guaranteed One-to-Many and Many-to-Many Multicast Routing[J]. Computer Communications, 2003, 26(7): 652-669.
[103]Noronha C, Tobagi F. Evaluation of Multicast Routing Algorithms for Multimedia Streams[A]. In Proceedings of the IEEE International Telecommunications Symposium[C]. 1994.
[104]Estrin D. Network Visualization with the VINT Network Animator[R]. Technical Report, 99-703, University of Southern California, 1999.
[105]OPNET Technologies Inc. OPNET[DB/OL]. http://www.mil3.com.
[106]The Network Simulator-ns-2[DB/OL], http://www.isi.edu/nsnam/ns/.
[107]Alaettinoglu C, Dussa-Zieger K, Matta I, et al. MaRS User's Manual[R]. Technical Report UMIACS-TR-91-80, CS-TR-2687, Department of Computer Science, University of Maryland, College Park, 1991.
[108]Zhang P, Kantola R, Ma Z S. Design and Implementation of A New Routing Simulator[A]. In Proceedings of 2000 SCS Symposium on Performance Evaluation of Computer and Telecommunication System(SPECTS'2K)[C]. Vancouver, Canada, 2000.
[109]Zhang P, Kantola R. Designing A New Routing Simulator for DiffServ MPLS Networks[R]. Internal Report, 2000.
[110]The Real-Time Communication Project, QoS Routing (Unicast and Multicast), Software[DB/OL]. http://rtcomm.csc.ncsu.edu/qos.htm.
[111]王征应．高速网络QoS路由技术的研究及路由仿真平台的研制[D]．武汉：华中科技大学，2001．
[112]Doar M. Multicast in the Asynchronous Transfer Mode Environment[D]. PhD thesis, University of Cambridge, 1993.
[113]余燕平．多播路由算法研究[D]．杭州：浙江大学，2002．
[114]Moy J. OSPF Version 2[S]. RFC 2328, 1998.
[115]刑文训，谢金星．现代优化计算方法[M]．北京：清华大学出版社，1999．
[116]Feng G. Neural Network and Algorithmic Methods for Solving Routing Problems in High Speed Networks[D]. PhD thesis, University.of Miami, Florida, 2001.
[117]谢政，李建平．网络算法与复杂性理论[M]．长沙：国防科技大学出版社，1995．
[118]王凌．智能优化算法及其应用[M]．北京：清华大学出版社，施普林格出版社，2001．
[119]Sheu P R, Chen S T. A Fast and Efficient Heuristic Algorithm for the Delay- and Delay Variation Bound Multicast Tree Problem[A]. In Proceedings of the 15th International Conference on Information Networking (ICO1N'01)[C]. 2001: 611-618.
[120]Paul K. A Stability-based Distributed Routing Mechanism to Support Unicast and Multicast Routing in Ad Hoc Wireless Network[J]. Computer Communications, 2001, 24(18): 1828-1845.
[121]Sungjoon A, Shankar A U. Adapting to Route-demand and Mobility in Ad Hoc Network Routing[J]. Computer Networks, 2002, 38(6): 745-764.
[122]Stojmenovic I. Poisition-based Routing in Ad Hoc Networks[J]. IEEE Communications Magazine, 2002, 40(7): 128-134.