OSPF协议的QoS扩展及算法研究
|
摘要
传统Internet仅提供“尽力而为”的数据报发送服务,面对网络上日益增长的多媒体应用,现有路由机制已经逐渐不能满足新的需求。如何实现路由协议的扩展,使其提供有效的服务质量路由(QoSR),是现代网络必须考虑和值得研究的问题。
本文研究了开放式最短路径优先(OSPF)协议工作机制,实现了基于遗传-蚁群融合算法的OSPF协议上的QoS扩展。
论文分析了QoS路由机制研究现状,详细讨论了现有各种QoSR算法及其存在的问题,将遗传-蚁群融合算法应用于解决多约束QoSR。该算法以基本遗传算法和蚁群算法为基础,克服各自缺陷,通过二者的“融合”——即以遗传算法所得优化解初始化蚁群算法的信息素值,循环迭代,求得多约束QoSR问题的最优解。
为了实现OSPF协议上的QoSR扩展,论文还详细探讨了OSPF协议的工作过程及其使用的路由算法,作为一种典型的链路状态协议,OSPF基于Dijkstra算法,但是该算法要求以某一固定的链路状态信息来计算,这就使得当前的OSPF协议不支持多约束QoSR机制,本文的任务就是实现OSPF-QoSR。
论文提出了OSPF-QoSR的具体实施方案,其基本思路是在对当前OSPF协议报文格式和工作机制做最小改动的前提下,最大程度地支持多约束QoSR,实现基于遗传-蚁群融合算法的OSPF-QoSR。本文路由算法是控制在一个自治域(AS)范围内的OSPF网络中,使用分布式路由策略,采用预先计算的方式,扩展OSPF报文格式使其包含网络资源信息,改进LSA发送机制,利用融合算法进行最优路径选择。
论文最后利用网络仿真软件OPNET构造了一个支持QoS的OSPF网络,模拟仿真实现本文所提出的基于融合算法的OSPF-QoSR机制,并将其在某些网络性能上与RFC2676所推荐的扩展Bellman-Ford算法进行比较,说明本文算法是可行的、有一定优越性的,为今后大型OSPF网络中多约束QoSR机制的研究提供了新的思路,并指出了下一步研究的工作方向和重点。
Traditional Internet only provides“Best-Effort”services for data transmission. Facing to the increasingly growing up of multimedia applications, existing routing mechanisms gradually can’t satisfy new demands. How to extend routing protocols in order to provide effective QoSR is becoming a considerable and investigable problem for modern Internet.
This dissertation studies the working mechanisms of OSPF Protocol and implements the QoS routing extensions based on Genetic-Ant Combination Algorithm of OSPF.
The dissertation gives a survey about the current researching situation of QoS routing mechanisms, bats around the existing QoSR algorithms, discusses the main problems of them and applies the Genetic-Ant Combination Algorithm to solve multi-constrained QoSR. The Combination Algorithm is based on basic Genetic Algorithm and Ant Algorithm,overcomes respective disfigurement of them. Synoptically, it initializes the pheromone value of Ant Algorithm through the optimization results of Genetic Algorithm and accordingly figures out the multi-constrained QoSR problems by iterative loop to get the best result.
In order to achieve the QoSR extension of OSPF, the dissertation detailedly probe into the working process and routing algorithms of OSPF. As a typical link-state protocol, OSPF is based on Dijkstra Algorithm, which requests a certain fixed link state to compute the shortest path. This brings the result that the current OSPF Protocol can’t support multi-constrained QoSR mechanism. And the mission of this dissertation is to implement OSPF-QoSR.
The dissertation puts forward the idiographic implementary scheme of OSPF-QoSR. It furthest implements multi-constrained QoSR on the basis of Genetic-Ant Combination Algorithm by improving the current OSPF message format and work mechanism with minimal modification. This routing algorithm is operating in an Autonomous System, makes use of distributing routing strategy, adopts pre-computation method, extends OSPF message format to append network resource information inclusively, ameliorates LSA transmission mechanism and utilizes combination algorithm to choose the best routing path.
Lastly, an OSPF network supporting QoS is constructed by OPNET Modeler to simulate the OSPF-QoSR mechanism based on the Combination Algorithm which is presented in the dissertation. The Genetic-Ant Combination Algorithm is compared in some network capabilities with the Extended Bellman-Ford Algorithm which is recommended by RFC2676. The simulation results show that Combination Algorithm is feasible and superior in contrast with the RFC-recommended algorithm. All these offer some new thoughts of multi-constrained QoSR research in large-scale OSPF networks and indicate further research orientations and emphases.
本文研究了开放式最短路径优先(OSPF)协议工作机制,实现了基于遗传-蚁群融合算法的OSPF协议上的QoS扩展。
论文分析了QoS路由机制研究现状,详细讨论了现有各种QoSR算法及其存在的问题,将遗传-蚁群融合算法应用于解决多约束QoSR。该算法以基本遗传算法和蚁群算法为基础,克服各自缺陷,通过二者的“融合”——即以遗传算法所得优化解初始化蚁群算法的信息素值,循环迭代,求得多约束QoSR问题的最优解。
为了实现OSPF协议上的QoSR扩展,论文还详细探讨了OSPF协议的工作过程及其使用的路由算法,作为一种典型的链路状态协议,OSPF基于Dijkstra算法,但是该算法要求以某一固定的链路状态信息来计算,这就使得当前的OSPF协议不支持多约束QoSR机制,本文的任务就是实现OSPF-QoSR。
论文提出了OSPF-QoSR的具体实施方案,其基本思路是在对当前OSPF协议报文格式和工作机制做最小改动的前提下,最大程度地支持多约束QoSR,实现基于遗传-蚁群融合算法的OSPF-QoSR。本文路由算法是控制在一个自治域(AS)范围内的OSPF网络中,使用分布式路由策略,采用预先计算的方式,扩展OSPF报文格式使其包含网络资源信息,改进LSA发送机制,利用融合算法进行最优路径选择。
论文最后利用网络仿真软件OPNET构造了一个支持QoS的OSPF网络,模拟仿真实现本文所提出的基于融合算法的OSPF-QoSR机制,并将其在某些网络性能上与RFC2676所推荐的扩展Bellman-Ford算法进行比较,说明本文算法是可行的、有一定优越性的,为今后大型OSPF网络中多约束QoSR机制的研究提供了新的思路,并指出了下一步研究的工作方向和重点。
Traditional Internet only provides“Best-Effort”services for data transmission. Facing to the increasingly growing up of multimedia applications, existing routing mechanisms gradually can’t satisfy new demands. How to extend routing protocols in order to provide effective QoSR is becoming a considerable and investigable problem for modern Internet.
This dissertation studies the working mechanisms of OSPF Protocol and implements the QoS routing extensions based on Genetic-Ant Combination Algorithm of OSPF.
The dissertation gives a survey about the current researching situation of QoS routing mechanisms, bats around the existing QoSR algorithms, discusses the main problems of them and applies the Genetic-Ant Combination Algorithm to solve multi-constrained QoSR. The Combination Algorithm is based on basic Genetic Algorithm and Ant Algorithm,overcomes respective disfigurement of them. Synoptically, it initializes the pheromone value of Ant Algorithm through the optimization results of Genetic Algorithm and accordingly figures out the multi-constrained QoSR problems by iterative loop to get the best result.
In order to achieve the QoSR extension of OSPF, the dissertation detailedly probe into the working process and routing algorithms of OSPF. As a typical link-state protocol, OSPF is based on Dijkstra Algorithm, which requests a certain fixed link state to compute the shortest path. This brings the result that the current OSPF Protocol can’t support multi-constrained QoSR mechanism. And the mission of this dissertation is to implement OSPF-QoSR.
The dissertation puts forward the idiographic implementary scheme of OSPF-QoSR. It furthest implements multi-constrained QoSR on the basis of Genetic-Ant Combination Algorithm by improving the current OSPF message format and work mechanism with minimal modification. This routing algorithm is operating in an Autonomous System, makes use of distributing routing strategy, adopts pre-computation method, extends OSPF message format to append network resource information inclusively, ameliorates LSA transmission mechanism and utilizes combination algorithm to choose the best routing path.
Lastly, an OSPF network supporting QoS is constructed by OPNET Modeler to simulate the OSPF-QoSR mechanism based on the Combination Algorithm which is presented in the dissertation. The Genetic-Ant Combination Algorithm is compared in some network capabilities with the Extended Bellman-Ford Algorithm which is recommended by RFC2676. The simulation results show that Combination Algorithm is feasible and superior in contrast with the RFC-recommended algorithm. All these offer some new thoughts of multi-constrained QoSR research in large-scale OSPF networks and indicate further research orientations and emphases.
引文
[1] E. Crawley, R. Nair, B. Rajagopalan, H. Sandick. A Framework for QoS-based Routing in the Internet[S]. RFC2386, Aug. 1998
[2] Quality of Service-Glossary of Terms[EB/OL]. May 1999, http://www.qosforum.com/ white-papers/qos-glossary-v4.pdf
[3] Z. Wang and J. Crowcroft. QoS Routing for Supporting Multimedia Applications[J]. IEEE Journal on Selected Areas in Communications, Vol. 14, No.7, September 1996, pp: 1228~1234
[4] M. S. Garey, D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness[A], W. H. Freeman, New York, 1979
[5] J. M. Jaffe. Algorithms for Finding Paths with Multiple Constrains[J]. Networks, vol.14, pp: 95~116, 1984
[6] R. Widyono. The Design and Evaluation of Routing Algorithms for Real-time Channels [A]. TR-94~024, International Computer Science Institute[C], UC Berkeley, 1994
[7] S. Chen and K. Nahrstedt. On Finding Multi-Constrained Paths[C]. In Proceeding of IEEE ICC, 1998
[8] X. Yuan. On the Extended Bellman-Ford Algorithm to Solve Two-Constrained Quality of Service Routing Problems[C]. In Proceedings of the English International Conference on Computer Communications and Networks, October 1999
[9] X. Yuan, X. Liu. Heuristic Algorithms for Multi-Path Routing Combined with Resource Reservation[C]. In Proceedings of IEEE INFOCOM, 2001
[10] Orda and A. Sprintson, QoS Routing: the Pre-computation Prspective[C]. In Proceedings of IEEE INFOCOM, 2000
[11] H. F. Salama, D. S. Reeves and Y. Viniotis. A Distributed Algorithm for Delay- Constrained Unicast Routing[C]. In Proceedings of IEEE INFOCOM, April 1997
[12] T. Kormaz, M. Krunz. Multi-Constrained Optimal Path Selection[C]. In Proceedings of IEEE INFOCOM, 2001
[13] Funda Ergun, Rakesh Sinha, Lisa Zhang. QoS Routing with Performance-Dependent Costs[C]. In Proceedings of IEEE INFOCOM, March 2000
[14] Juttner, B. Szviatovski, I. Mecs et al. Lagrange Relaxation Based Method for the QoS Routing Problem[C]. In Proceedings of IEEE INFOCOM, 2001
[15] Bernard Fortz, Mikkel Thorup. Optimizing OSPF/IS-IS Weights in a Changing World[J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2002, 20(4): 756-767
[16] David Watson, Farnam Jahanian, Craig Labovitz. Experiences with Monitoring OSPF on a Regional Service Provider Network[C]. Proceedings of the 23rd International Conference on Distributed Computing Systems, 2003
[17]牟春燕. OSPF路由协议及其实现算法[J].杭州电子工业学院学报, 2003, 23(1): 80～84
[18]张静,冉晓旻,胡捍英.一种基于OSPF扩展的预计算QoS路由算法研究[J].计算机科学, 2006, 33(7): 47~51
[19]华晏,钱松荣.支持QoS路由机制的OSPF扩展的研究[J].计算机工程与设计2006, 27(3): 415~417
[20]丁建立,陈增强,袁著祉.遗传算法与蚂蚁算法的融合[J].计算机研究与发展, 2003, 40(9): 1351～1356
[21]徐恪,吴建平,徐明伟.高等计算机网络——体系结构、协议机制、算法设计与路由器技术[M].北京:机械工业出版社, 2003: 231
[22] Zhang, S. Deering, D. Estrin, S. Shenker and D. Zappala. RSVP: A New Resource ReSerVation Protocol[S]. IEEE Network, September 1993
[23] Cindon, R. Rom, and Y. Shavitt. Multi-Path Routing Combined with Resource Reservation[C]. In Proceedings of IEEE INFOCOM, April 1997
[24] Awerbuch, Y. Azar, S. Plotkin and O. Waarts. Throughput-Competitive On-line Routing[C]. In Proceedings of 34th Annual Symposium on Foundations of Computer Science, 1993
[25] IETF Internet Traffic Engineering working group(TEWG)[EB/OL], http://www.ietf.org/html.charters/tewg-charter.html
[26] [0]Rosen, A. Viswanathan, R. Callon. Multiprotocol Label Switching Architecture[S]. RFC 3031, January 2001
[27] IETF Integrated Services (intserv) working group[EB/OL],http://www.ietf.ogr/html.charters/intserv-charter.html
[28] IETF Differentiated Services (intserv) working group[EB/OL], http://www.ietf.ogr/html.charters/diffserv-charter.html
[29] X. Xiao and L. M. Ni. Internet QoS: A Big Picture[J]. IEEE Network, Vol.13, No.2, March/April 1999
[30] S. Chen and K. Nahrstedt. An Overview of Quality-of-Service Routing for Next-generation High-speed Networks: Problems and Solutions[J]. IEEE Network, Vol. 12, No.6, November 1998, pp: 64~79
[31]徐恪,吴建平,徐明伟.高等计算机网络——体系结构、协议机制、算法设计与路由器技术[M].北京:机械工业出版社, 2003: 215～216
[32] B. Wang, J. C. Hou. Multicast Routing and Its QoS Extension:Problems, Algorithms, and Protocols[J]. IEEE Network, Vol: 14, No.1, Jan/Feb 2000, pp: 22~36
[33] R. Guerin and A. Orda. Networks with Advance Reservations: The Routing Perspective [C]. In Proceedings of IEEE INFOCOM, 2000
[34] Raz, Y. Shavitt, Danny Raz and Yuval Shavitt. Optional Partition of QoS requirements with Discrete Cost Functions[C]. In Proceedings of IEEE INFOCOM, 2000
[35] H. Lorenz, Ariel Orda, Danny Raz and Yuval Shavitt. Efficient QoS Partition and Routing of Unicast and Multicast[C]. In Proceedings of IEEE International Workshop on QoS, 2000
[36] Shaikh, J. Rexford, K. G. Shin. Evaluating the Impact of Stale Link State on Quality-of-Service Routing IEEE/ACM Transactions on Networking[J], Vol.9, No.2, April 2001, pp: 162~176
[37] Q. Sun and H. Landgendorfer. A New Distributed Routing Algorithm with End-to-End Delay Guarantee[A]. Unpublished paper, 1997
[38] L. Sobrinho. Algebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet[C]. In Proceedings of IEEE INFOCOM, 2001
[39] Holland Jh. Adaptation in Nature and Artificial Systems[D]. The University of Michigan Press, 1975, MIT Press, 1992
[40]陈国良,王煦法,庄镇泉等.遗传算法及其应用(第一版)[M].北京:人民邮电出版社, 1996
[41]李敏强,徐博艺,寇纪淞.遗传算法与神经网络的结合[J].系统工程理论与实践, 1999, 19(2): 65~69
[42] Colorni A, Dorigo M, Maniezzo V. Distributed Optimization by Ant Colonies[A]. Proceedings of the 1st European Conference on Artificial Life, 1991, 134~142
[43]吴斌,史忠植.一种基于蚁群算法TSP问题分段求解算法[J].计算机学报, 2001, 24(12): 1328～1333
[44]段海滨.蚁群算法原理及其应用[M].北京:科学出版社, 2005
[45]陈骏坚,李腊元.用新型蚂蚁算法求解QoSR问题[J].武汉理工大学学报(交通科学与工程版), 2005, 29(3): 342～345
[46]黄晓雯,贺细平,唐贤英.基于遗传算法的QoS路由选择与仿真[J].计算机仿真, 2003, 20(6): 43～45
[47] Marco Dorigo, Eric Bonabeau, Theraulaz Guy. Ant algorithms and stigmergy[J]. Future Generation Computer System, 2000, 16(8): 851~871
[48]吴庆洪,张纪会,徐心和.具有变异特征的蚁群算法[J].计算机研究与发展, 1999, 36(10): 1240~1245
[49] Marcus Randall, Andrew Lewis. A parallel implementation of ant colony optimization[J]. Journal of Parallel and Distributed Computing, 2002, 62(9): 1421~1432
[50]徐恪,吴建平,徐明伟.高等计算机网络——体系结构、协议机制、算法设计与路由器技术[M].北京:机械工业出版社, 2003: 180～181
[51]关国利.基于QoS的OSPF的预先计算算法[J].郑州大学学报(理学版), 2005, (12): 46~48
[52]樊明,马跃,蒋砚军.一种支持QoS的OSPF扩展算法(按需计算)[J].北京邮电大学学报, 2001, (2):65~68
[53] R. A. Guerin, A. Orda, Williams. QoS Routing Mechanisms and OSPF Extensions[C]. In Proceedings of IEEE GLOBECOM, 1997
[54]赵世鑫,潘雪增,平玲娣. OSPF路由协议上的服务质量扩展[J].计算机应用, 2003, 23(9): 31~34
[55] Moy J. OSPF Version 2[S]. STD 54, RFC 2328,April 1998
[56] D. Williams, S. Kamat, R. Guerin etc. QoS Routing Mechanisms and OSPF Extensions[S] (RFC2676), The Internet Society, 1999.8
[2] Quality of Service-Glossary of Terms[EB/OL]. May 1999, http://www.qosforum.com/ white-papers/qos-glossary-v4.pdf
[3] Z. Wang and J. Crowcroft. QoS Routing for Supporting Multimedia Applications[J]. IEEE Journal on Selected Areas in Communications, Vol. 14, No.7, September 1996, pp: 1228~1234
[4] M. S. Garey, D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness[A], W. H. Freeman, New York, 1979
[5] J. M. Jaffe. Algorithms for Finding Paths with Multiple Constrains[J]. Networks, vol.14, pp: 95~116, 1984
[6] R. Widyono. The Design and Evaluation of Routing Algorithms for Real-time Channels [A]. TR-94~024, International Computer Science Institute[C], UC Berkeley, 1994
[7] S. Chen and K. Nahrstedt. On Finding Multi-Constrained Paths[C]. In Proceeding of IEEE ICC, 1998
[8] X. Yuan. On the Extended Bellman-Ford Algorithm to Solve Two-Constrained Quality of Service Routing Problems[C]. In Proceedings of the English International Conference on Computer Communications and Networks, October 1999
[9] X. Yuan, X. Liu. Heuristic Algorithms for Multi-Path Routing Combined with Resource Reservation[C]. In Proceedings of IEEE INFOCOM, 2001
[10] Orda and A. Sprintson, QoS Routing: the Pre-computation Prspective[C]. In Proceedings of IEEE INFOCOM, 2000
[11] H. F. Salama, D. S. Reeves and Y. Viniotis. A Distributed Algorithm for Delay- Constrained Unicast Routing[C]. In Proceedings of IEEE INFOCOM, April 1997
[12] T. Kormaz, M. Krunz. Multi-Constrained Optimal Path Selection[C]. In Proceedings of IEEE INFOCOM, 2001
[13] Funda Ergun, Rakesh Sinha, Lisa Zhang. QoS Routing with Performance-Dependent Costs[C]. In Proceedings of IEEE INFOCOM, March 2000
[14] Juttner, B. Szviatovski, I. Mecs et al. Lagrange Relaxation Based Method for the QoS Routing Problem[C]. In Proceedings of IEEE INFOCOM, 2001
[15] Bernard Fortz, Mikkel Thorup. Optimizing OSPF/IS-IS Weights in a Changing World[J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2002, 20(4): 756-767
[16] David Watson, Farnam Jahanian, Craig Labovitz. Experiences with Monitoring OSPF on a Regional Service Provider Network[C]. Proceedings of the 23rd International Conference on Distributed Computing Systems, 2003
[17]牟春燕. OSPF路由协议及其实现算法[J].杭州电子工业学院学报, 2003, 23(1): 80～84
[18]张静,冉晓旻,胡捍英.一种基于OSPF扩展的预计算QoS路由算法研究[J].计算机科学, 2006, 33(7): 47~51
[19]华晏,钱松荣.支持QoS路由机制的OSPF扩展的研究[J].计算机工程与设计2006, 27(3): 415~417
[20]丁建立,陈增强,袁著祉.遗传算法与蚂蚁算法的融合[J].计算机研究与发展, 2003, 40(9): 1351～1356
[21]徐恪,吴建平,徐明伟.高等计算机网络——体系结构、协议机制、算法设计与路由器技术[M].北京:机械工业出版社, 2003: 231
[22] Zhang, S. Deering, D. Estrin, S. Shenker and D. Zappala. RSVP: A New Resource ReSerVation Protocol[S]. IEEE Network, September 1993
[23] Cindon, R. Rom, and Y. Shavitt. Multi-Path Routing Combined with Resource Reservation[C]. In Proceedings of IEEE INFOCOM, April 1997
[24] Awerbuch, Y. Azar, S. Plotkin and O. Waarts. Throughput-Competitive On-line Routing[C]. In Proceedings of 34th Annual Symposium on Foundations of Computer Science, 1993
[25] IETF Internet Traffic Engineering working group(TEWG)[EB/OL], http://www.ietf.org/html.charters/tewg-charter.html
[26] [0]Rosen, A. Viswanathan, R. Callon. Multiprotocol Label Switching Architecture[S]. RFC 3031, January 2001
[27] IETF Integrated Services (intserv) working group[EB/OL],http://www.ietf.ogr/html.charters/intserv-charter.html
[28] IETF Differentiated Services (intserv) working group[EB/OL], http://www.ietf.ogr/html.charters/diffserv-charter.html
[29] X. Xiao and L. M. Ni. Internet QoS: A Big Picture[J]. IEEE Network, Vol.13, No.2, March/April 1999
[30] S. Chen and K. Nahrstedt. An Overview of Quality-of-Service Routing for Next-generation High-speed Networks: Problems and Solutions[J]. IEEE Network, Vol. 12, No.6, November 1998, pp: 64~79
[31]徐恪,吴建平,徐明伟.高等计算机网络——体系结构、协议机制、算法设计与路由器技术[M].北京:机械工业出版社, 2003: 215～216
[32] B. Wang, J. C. Hou. Multicast Routing and Its QoS Extension:Problems, Algorithms, and Protocols[J]. IEEE Network, Vol: 14, No.1, Jan/Feb 2000, pp: 22~36
[33] R. Guerin and A. Orda. Networks with Advance Reservations: The Routing Perspective [C]. In Proceedings of IEEE INFOCOM, 2000
[34] Raz, Y. Shavitt, Danny Raz and Yuval Shavitt. Optional Partition of QoS requirements with Discrete Cost Functions[C]. In Proceedings of IEEE INFOCOM, 2000
[35] H. Lorenz, Ariel Orda, Danny Raz and Yuval Shavitt. Efficient QoS Partition and Routing of Unicast and Multicast[C]. In Proceedings of IEEE International Workshop on QoS, 2000
[36] Shaikh, J. Rexford, K. G. Shin. Evaluating the Impact of Stale Link State on Quality-of-Service Routing IEEE/ACM Transactions on Networking[J], Vol.9, No.2, April 2001, pp: 162~176
[37] Q. Sun and H. Landgendorfer. A New Distributed Routing Algorithm with End-to-End Delay Guarantee[A]. Unpublished paper, 1997
[38] L. Sobrinho. Algebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet[C]. In Proceedings of IEEE INFOCOM, 2001
[39] Holland Jh. Adaptation in Nature and Artificial Systems[D]. The University of Michigan Press, 1975, MIT Press, 1992
[40]陈国良,王煦法,庄镇泉等.遗传算法及其应用(第一版)[M].北京:人民邮电出版社, 1996
[41]李敏强,徐博艺,寇纪淞.遗传算法与神经网络的结合[J].系统工程理论与实践, 1999, 19(2): 65~69
[42] Colorni A, Dorigo M, Maniezzo V. Distributed Optimization by Ant Colonies[A]. Proceedings of the 1st European Conference on Artificial Life, 1991, 134~142
[43]吴斌,史忠植.一种基于蚁群算法TSP问题分段求解算法[J].计算机学报, 2001, 24(12): 1328～1333
[44]段海滨.蚁群算法原理及其应用[M].北京:科学出版社, 2005
[45]陈骏坚,李腊元.用新型蚂蚁算法求解QoSR问题[J].武汉理工大学学报(交通科学与工程版), 2005, 29(3): 342～345
[46]黄晓雯,贺细平,唐贤英.基于遗传算法的QoS路由选择与仿真[J].计算机仿真, 2003, 20(6): 43～45
[47] Marco Dorigo, Eric Bonabeau, Theraulaz Guy. Ant algorithms and stigmergy[J]. Future Generation Computer System, 2000, 16(8): 851~871
[48]吴庆洪,张纪会,徐心和.具有变异特征的蚁群算法[J].计算机研究与发展, 1999, 36(10): 1240~1245
[49] Marcus Randall, Andrew Lewis. A parallel implementation of ant colony optimization[J]. Journal of Parallel and Distributed Computing, 2002, 62(9): 1421~1432
[50]徐恪,吴建平,徐明伟.高等计算机网络——体系结构、协议机制、算法设计与路由器技术[M].北京:机械工业出版社, 2003: 180～181
[51]关国利.基于QoS的OSPF的预先计算算法[J].郑州大学学报(理学版), 2005, (12): 46~48
[52]樊明,马跃,蒋砚军.一种支持QoS的OSPF扩展算法(按需计算)[J].北京邮电大学学报, 2001, (2):65~68
[53] R. A. Guerin, A. Orda, Williams. QoS Routing Mechanisms and OSPF Extensions[C]. In Proceedings of IEEE GLOBECOM, 1997
[54]赵世鑫,潘雪增,平玲娣. OSPF路由协议上的服务质量扩展[J].计算机应用, 2003, 23(9): 31~34
[55] Moy J. OSPF Version 2[S]. STD 54, RFC 2328,April 1998
[56] D. Williams, S. Kamat, R. Guerin etc. QoS Routing Mechanisms and OSPF Extensions[S] (RFC2676), The Internet Society, 1999.8