填空题RIP（Routing Information Protocol）路由协议是典型的（）算法，而OSPF（Ope nShortes tPath First）是链路状态算法。
填空题
RIP（Routing Information Protocol）路由协议是典型的（）算法，而OSPF（Ope nShortes tPath First）是链路状态算法。
参考解析
解析：
暂无解析
相关考题：
（ 38 ）关于 RIP 与 OSPF 协议的描述中，正确的是A ） RIP 和 OSPF 都采用向量 - 距离算法B ） RIP 和 OSPF 都采用链路 - 状态算法C ） RIP 采用向量 - 距离算法， OSPF 采用链路 - 状态算法D ） RIP 采用链路 - 状态算法， OSPF 采用向量 - 距离算法
(39）关于RIP与OSPF协议的描述中，正确的是( ）。A） RIP和OSPF都采用向量．距离算法B） RIP和OSPF都采用链路一状态算法C） RIP采用向量一距离算法，OSPF采用链路一状态算法D） RIP采用链路一状态算法，OSPF采用向量，距离算法
关于RIP与OSPF协议的描述中，正确的是( )。A．RIP和OSPF都采用向量-距离算法B．RIP和OSPF都采用链路-状态算法C．RIP采用向量-距离算法，OSPF采用链路-状态算法D．RIP采用链路-状态算法，OSPF采用向量-距离算法
Open Shortest Path First (OSPF) was designed as an （ ） gateway protocol, for use in an autonomous system such as a local area network (LAN). It implements Dijkstra's algorithm, also known as the （ ） path first algorithm. As a link-state routing protocol it was based on the link-state algorithm developed for the ARPANET in 1980 and the IS-IS routing protocol. OSPF was first standardised in 1989 as RFC 1131, which is now known as OSPF version 1.Routing protocols like OSPF calculate the shortest route to a destination through the network based on an algorithm. The first routing protocol that was widely implemented, the （请作答此空）, calculated the shortest route based on hops, that is the number of routers that an IP packet had to traverse to reach the destination host. RIP successfully implemented dynamic routing, where routing tables change if the network topology changes. But RIP did not adapt its routing according to changing network conditions, such as data-transfer rate. Demand grew for a dynamic routing protocol that could calculate the fastest route to a destination. （ ） was developed so that the shortest path through a network was calculated based on the cost of the route, taking into account bandwidth, delay and load. Therefore OSPF undertakes route cost calculation on the basis of link-cost parameters, which can be weighted by the administrator. OSPF was quickly adopted because it became known for reliably calculating routes through large and complex local area networks.As a link state routing protocol, OSPF maintains link state （ ）, which are really network topology maps, on every router on which it is implemented. The state of a given route in the network is the cost, and OSPF algorithm allows every router to calculate the cost of the routes to any given reachable destination. Unless the administrator has made a configuration, the link cost of a path connected to a router is determined by the bit rate (1 Gbit/s, 10 Gbit/s, etc) of the interface. A router interface with OSPF will then advertise its link cost to neighbouring routers through multicast, known as the hello procedure. All routers with OSPF implementation keep sending hello packets, and thus changes in the cost of their links become known to neighbouring routers. The information about the cost of a link, that is the speed of a point to point connection between two routers, is then cascaded through the network because OSPF routers advertise the information they receive from one neighbouring router to all other neighbouring routers. This process of flooding link state information through the network is known as synchronisation. Based on this information, all routers with OSPF implementation continuously update their link state databases with information about the network topology and adjust their routing tables.OSPF has become a popular dynamic routing protocol. Other commonly used dynamic routing protocols are the RIP and the Border Gateway Protocol (BGP). Today routers support at least one interior gateway protocol to advertise their routing tables within a local area network. Frequently implemented interior gateway protocols besides OSPF are RIP, IS-IS, and the proprietary Interior Gateway Routing Protocol (IGRP) by Cisco.A.OSPFB.RIPC.IS-ISD.EIGRP
在华为路由器上，直连路由、静态路由、RIP和OSPF的默认协议优先级从高到低的排序是( )。A.直连路由、静态路由、RIP、OSPFB.直连路由、OSPF、静态路由、RIPC.直连路由、OSPF、RIP、静态路由D.直连路由、RIP、静态路由、OSPF
以下关于OSPF路由协议的说法中错误的是（ ）。A.OSPF路由协议是一个链路状态路由协议B.OSPF路由协议属于IGP的一种C.OSPF路由协议使用Dijkstra的最短路径优先算法计算路由表D.OSPF路由协议的收敛速度比RIP路由协议更慢
Open Shortest Path First (OSPF) was designed as an （请作答此空） gateway protocol, for use in an autonomous system such as a local area network (LAN). It implements Dijkstra's algorithm, also known as the （ ） path first algorithm. As a link-state routing protocol it was based on the link-state algorithm developed for the ARPANET in 1980 and the IS-IS routing protocol. OSPF was first standardised in 1989 as RFC 1131, which is now known as OSPF version 1.Routing protocols like OSPF calculate the shortest route to a destination through the network based on an algorithm. The first routing protocol that was widely implemented, the （ ）, calculated the shortest route based on hops, that is the number of routers that an IP packet had to traverse to reach the destination host. RIP successfully implemented dynamic routing, where routing tables change if the network topology changes. But RIP did not adapt its routing according to changing network conditions, such as data-transfer rate. Demand grew for a dynamic routing protocol that could calculate the fastest route to a destination. （ ） was developed so that the shortest path through a network was calculated based on the cost of the route, taking into account bandwidth, delay and load. Therefore OSPF undertakes route cost calculation on the basis of link-cost parameters, which can be weighted by the administrator. OSPF was quickly adopted because it became known for reliably calculating routes through large and complex local area networks.As a link state routing protocol, OSPF maintains link state （ ）, which are really network topology maps, on every router on which it is implemented. The state of a given route in the network is the cost, and OSPF algorithm allows every router to calculate the cost of the routes to any given reachable destination. Unless the administrator has made a configuration, the link cost of a path connected to a router is determined by the bit rate (1 Gbit/s, 10 Gbit/s, etc) of the interface. A router interface with OSPF will then advertise its link cost to neighbouring routers through multicast, known as the hello procedure. All routers with OSPF implementation keep sending hello packets, and thus changes in the cost of their links become known to neighbouring routers. The information about the cost of a link, that is the speed of a point to point connection between two routers, is then cascaded through the network because OSPF routers advertise the information they receive from one neighbouring router to all other neighbouring routers. This process of flooding link state information through the network is known as synchronisation. Based on this information, all routers with OSPF implementation continuously update their link state databases with information about the network topology and adjust their routing tables.OSPF has become a popular dynamic routing protocol. Other commonly used dynamic routing protocols are the RIP and the Border Gateway Protocol (BGP). Today routers support at least one interior gateway protocol to advertise their routing tables within a local area network. Frequently implemented interior gateway protocols besides OSPF are RIP, IS-IS, and the proprietary Interior Gateway Routing Protocol (IGRP) by Cisco.A.exteriorB.interiorC.borderD.routing
以下关于RIP与OSPF的说法中，错误的是_ （28） 。A. RIP 定时发布路由信息，而OSPF在网络拓扑发生变化时发布路由信息B.RIP的路由信息发送给邻居，而OSPF路由信息发送给整个网络路由器C.RIP 采用组播方式发布路由信息，而OSPF以广播方式发布路由信息D.RIP和OSPF均为内部路由协议
Which of the following data structures exist on a router for the OSPF routing protocol？（）A、OSPF topology tableB、OSPF interface tableC、OSPF routing information baseD、OSPF link-state databaseE、OSPF adjacency tableF、OSPF neighbor table
在VRP平台上，直连路由、静态路由、RIP、OSPF的默认协议优先级从高到低的排序是（）。A、直连路由、静态路由、RIP、OSPFB、直连路由、OSPF、静态路由、RIPC、直连路由、OSPF、RIP、静态路由D、直连路由、RIP、静态路由、OSPF
What are three characteristics of the OSPF routing protocol?（）A、It converges quickly.B、OSPF is a classful routing protocol.C、It uses cost to determine the best route.D、It uses the DUAL algorithm to determine the best route.E、OSPF routers send the complete routing table to all directly attached routers.F、OSPF routers discover neighbors before exchanging routing information.
关于RIP与OSPF协议的描述中，正确的是（）A、RIP和OSPF都采用向量-距离算法B、RIP和OSPF都采用链路-状态算法C、RIP采用向量-距离算法，OSPF采用链路-状态算法D、RIP采用链路-状态算法，OSPF采用向量-距离算法
You are a network administrator for your company. The network consists of a single Active Directory domain. All servers run Windows Server 2003. The company’s main office is in Barcelona， and it has branch offices in Paris and London. The company has no immediate plans to expand or relocate the offices. The company wants to connect the office networks by using a frame relay WAN connection and Routing and Remote Access servers that are configured with frame relay WAN adapters. Computers in each office will be configured to use the local Routing and Remote Access server as a default gateway. You are planning the routing configuration for the Routing and Remote Access servers. You need to allow computers in Barcelona， Paris， and London to connect to computers in any office. You want to minimize routing traffic on the WAN connection. What should you do？ （）A、 At each office， add the OSPF routing protocol to Routing and Remote Access， add the WAN adapter to the OSPF routing protocol， and deploy OSPF as a single-area internetwork.B、 At each office， add the RIP version 2 routing protocol to Routing and Remote Access， and configure the WAN adapter to use RIP version 2. Configure the outgoing packet protocol as RIP version 2 broadcast and the incoming packet protocol as RIP version 1 and 2.C、 At each office， add the RIP version 2 routing protocol to Routing and Remote Access， and configure the WAN adapter to use RIP version 2. Configure the outgoing packet protocol as RIP version 2 multicast and the incoming packet protocol as RIP version 2 only.D、 At each office， configure the Routing and Remote Access server with static routes to the local networks at the other two offices.
单选题在VRP平台上，直连路由、静态路由、RIP、OSPF的默认协议优先级从高到低的排序是（）。A直连路由、静态路由、RIP、OSPFB直连路由、OSPF、静态路由、RIPC直连路由、OSPF、RIP、静态路由D直连路由、RIP、静态路由、OSPF
判断题RIP（Routing Information Protocol）是一种内部网关协议，适用于自治系统。A对B错