OSPF路由协议及其实现算法 |
| |
引用本文: | 牟春燕. OSPF路由协议及其实现算法[J]. 杭州电子科技大学学报, 2003, 23(1): 80-84 |
| |
作者姓名: | 牟春燕 |
| |
作者单位: | 杭州电子工业学院软件分院,浙江,杭州,310037 |
| |
摘 要: | 随着网络规模的不断扩大,路由器在沟通子网连接和实现信息交换方面的重要作用逐渐被人们所认知。介绍了OSPF(Open Shortest Path First)路由协议的特征、实现算法和工作原理等内容。OSPF已成为目前Internet广域网和Itranet企业网采用最多,应用最广泛的路由协议之一。OSPF路由协议是由IETF(Internet Engineering Task Force)IGP工作小组提出的,是一种基于SPF算法的路由协议。
|
关 键 词: | OSPF 路由协议 开放式最短路径优先 自治系统 链路状态算法 距离向量 |
文章编号: | 1001-9146(2003)01-0080-05 |
修稿时间: | 2002-10-25 |
Implementation Algorithm of OSPF Protocol |
| |
Abstract: | At present, OSPF routing protocol plays a more and more important role in communicating subnet linking and carring out information exchange with the network scale's expanding.It has become one of the most popular routing protocols in Internet network and Internet enterprise network..OSPF uses the shortest-path-first (SPF) algorithm, also referred to as the Dijkstra algorithm, to determine the route to reach each destination. All routers in an area run this algorithm in parallel, storing the results in their individual topological databases. Routers with interfaces to multiple areas run multiple copies of the algorithm. This section provides a brief summary of how the SPF algorithm works. |
| |
Keywords: | OSPF AS Link-stat algorithm Distance vector |
本文献已被 CNKI 维普 万方数据 等数据库收录! |