下一代互联网动态路由协议机制分析与改进策略
|
摘要
随着互联网应用需求方式、种类及各种性能的不断涌现,现在的Internet正在向下一代互联网发展和过渡。作为互联网体系结构的关键层次——网际层,其核心组成部分之一的动态路由协议协议现已成为园区网、城域网、广域网等设计组建中广泛使用和首选的进行路由选择和转发功能的协议,并且也处于不断更新和发展的过程中。本论文阐述了动态路由协议中基于Dijkstra提出的最短路径优先算法的设计思想并对协议本身进行了较为深入的分析和动态示例。最后,对在新一代互联网中该协议在算法复杂度、消息传递复杂度以及IPv6的适应性方面进行了部分优化与改进的设想。
With the growing demand for Internet applications, types and performance, Internet is developing and transferring to the next generation of Internet. As the key layer of the Internet Architecture-the Internet layer, the dynamic routing protocol, one of the core components of the Internet, has now become a widely used and preferred protocol for routing and forwarding functions in the design and establishment of park, man, and wide area network, and is also in the process of continuous updating and development. This paper describes the design idea of the shortest path priority algorithm based on Dijkstra in dynamic routing protocol and carries out a more in-depth analysis and dynamic example of the protocol itself. Finally, some optimization and improvement are made for the complexity of the algorithm, the complexity of message transfer and the adaptability of IPv6 in the new generation of Internet.
With the growing demand for Internet applications, types and performance, Internet is developing and transferring to the next generation of Internet. As the key layer of the Internet Architecture-the Internet layer, the dynamic routing protocol, one of the core components of the Internet, has now become a widely used and preferred protocol for routing and forwarding functions in the design and establishment of park, man, and wide area network, and is also in the process of continuous updating and development. This paper describes the design idea of the shortest path priority algorithm based on Dijkstra in dynamic routing protocol and carries out a more in-depth analysis and dynamic example of the protocol itself. Finally, some optimization and improvement are made for the complexity of the algorithm, the complexity of message transfer and the adaptability of IPv6 in the new generation of Internet.
引文
[1]张春青,张宏科.OSPF动态路由协议中的路由计算北方交通大学学报,2003,(3):100-103.
[2]康威.OSPF路由协议安全性分析与研究北京邮电大学,2010.
[3]张芳.OSPF路由协议的研究与实现学位论文,北京邮电大学,2004.
[4]倪勇,史怀洲,朱培栋.基于OSPF链路状态数据库构建网络拓扑[J].计算机技术与发展,2009(3):1-4.
[5]周集良.基于OSPF路由协议的动态配置技术[D].国防科学技术大学,2003.
[6]郭伟,柯汉波.多区域OSPF校园网路由设计与实现[J].计算机系统应用,2003(8):48-50.
[7]张春青,张宏科.OSPF动态路由协议中的路由计算[J].北方交通大学学报,2003(3):100-103.
[8]林琴强.OSPF剖析及其链路状态数据库的实现[D].四川大学,2003.
[9]严斌宇,卢苇,黄锐.OSPF路由选择协议的研究[J].四川大学学报(自然科学版),2002(3):460-464.
[2]康威.OSPF路由协议安全性分析与研究北京邮电大学,2010.
[3]张芳.OSPF路由协议的研究与实现学位论文,北京邮电大学,2004.
[4]倪勇,史怀洲,朱培栋.基于OSPF链路状态数据库构建网络拓扑[J].计算机技术与发展,2009(3):1-4.
[5]周集良.基于OSPF路由协议的动态配置技术[D].国防科学技术大学,2003.
[6]郭伟,柯汉波.多区域OSPF校园网路由设计与实现[J].计算机系统应用,2003(8):48-50.
[7]张春青,张宏科.OSPF动态路由协议中的路由计算[J].北方交通大学学报,2003(3):100-103.
[8]林琴强.OSPF剖析及其链路状态数据库的实现[D].四川大学,2003.
[9]严斌宇,卢苇,黄锐.OSPF路由选择协议的研究[J].四川大学学报(自然科学版),2002(3):460-464.