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

题目

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.OSPF
B.RIP
C.IS-IS
D.EIGRP

如果没有搜索结果或未解决您的问题，请直接联系老师获取答案。

相似问题和答案

第1题：

●Border Gateway Protocol(BGP) is inter-autonomous system (71) protocol. BGP is based on a routing method called path vector routing. Distance vector routing is not a good candidate for inter-autonomous system routing because there are occasions on which the route with the smallest (72) count is not the preferred route. For example, we may not want a packet through an not secure even though it is the shortest route. Also, distance vector routing is unstable due to the fact that the routers announce only the number of hop counts to the destination without actually defining the path that leads to that (73) ．A router that recevives a distance vector advertisement packet may be fooled if the shortest path is actually calculated through the receiving router itself. Link (74) routing is also not a good candidate for inter-autonomous system routing because an Internet is usually too big for this routing method. To use link state routing for the whole internet would require each routex to have a huge link state database. It would also take a long time for each router to calculate its rousting (75) using the Dijkstra algorism.

（71）

A. routing

B. switching

C. transmitting

D. receiving

(72)

A. path

B. hop `

C. route

D. packet

(73）

A. connection

B. window

C. source

D. destination

(74)

A. status

B. search

C. state

D. research

(75）

A. table

B. state

C. metric

D. cost

正确答案：A,B,D,C,A

第2题：

OSPF is a link-state routing protocol。It is designed to be run internal to a single __（71）__system。Each OSPF router maintains an identical __（72）__ describing the autonomous system’s topology。From this database，a routing table is calculated by constructing a shortest-path __（73）__。OSPF recalculates routes quickly in the face of topological changes，utilizing a minimum of routing __（74）__ traffic。OSPF provides support for equal-cost multipath。An area routing capability is provided，enabling an additional level of routing protection and a reduction in routing protocol__（75）__。

A.autonomous

B.network

C.computer

D.server

正确答案：A
OSPF是一种链路状态路由协议。该协议被设计成运行在单一的自治系统内部。每一个OFPF路由器都保持了同样的数据库，该数据库可以描述自治系统的拓扑图。通过该数据库，可以搭建的最短路径树以此计算路由表。OSPF在拓扑发生变化时，利用最小路由组播流量的快速重新计算路由。OSPF支持多条等价路径。OSPF提供区域路由的能力，在路由协议流量中赋予一个额外的路由保护和路由剪截能力。

第3题：

●In the following essay，each blank has four choices．Choose the most suitable one from the four choices and write down in the answer sheet．

Open Shortest Path First(OSPF)is a (66) routing algorithm that (67) work done on the OSI IS-IS intradomain routing protocol．This routing，as compared to distance-vector routing，requires (68) processing power．The Dijkstra algorithm is used to calculate (69) OSPF routing table updates only take place when necessary， (70) at regular intervals．

(66) A．distance-vector

B．link-state

C．flow-based

D．selective flooding

(67) A．derived from

B．deviated from

C．was derived from

D．was deviated from

(68) A．more

B．less

C．same

D．most

(69) A．routes

B．road

C．distance

D．cost

(70) A．but rather

B．rather too

C．rather than

D．rather that

正确答案：B,C,A,A,D
【解析】OSPF(Open Shortest Path First)是一个内部网关协议(Interior Gateway Protocol，IGP)，用于在单一自治系统(Autonomous System，AS)内决策路由。与RIP相对，OSPF是链路状态路由协议，而RIP是距离矢量路由协议。
链路是路由器接口的另一种说法，因此OSPF也称为接口状态路由协议。OSPF通过路由器之间通告网络接口的状态来建立链路状态数据库，生成最短路径树，每个OSPF路由器使用这些最短路径构造路由表。

第4题：

Distribution layer: This layer includes LAN－based routers and layer 3 switches . When is a first－hop redundancy protocol needed in the distribution layer?()

A. OSPF is not supported by the design

B. HSRP is not supported by the design

C. preempt tuning of the default gateway is needed

D. the design implements Layer 3 between the access switch and the distribution switch

参考答案：D

第5题：

Which command displays the number of times that the OSPF Shortest Path First (SPF) algorithm has been executed?()

A. show ip protocol

B. show ip ospf

C. sho w ip ospf database

D. show ip ospf interface

参考答案：B

第6题：

OSPF is a link-state routing protocol。It is designed to be run internal to a single __（71__system。Each OSPF router maintains an identical __（72）__ describing the autonomous system’s topology。From this database，a routing table is calculated by constructing a shortest-path __（73）__。OSPF recalculates routes quickly in the face of topological changes，utilizing a minimum of routing __（74）__ traffic。OSPF provides support for equal-cost multipath。An area routing capability is provided，enabling an additional level of routing protection and a reduction in routing protocol __（75）__。

A.autonomous

B.network

C.computer

D.server

第7题：

Open Shortes t Path First (OSPF) is a routing protocol developed for Internet Protocol (IP) networks by the Interior Gateway Protocol (IGP) working group of the Internet Engineering Task Force (IETF).Which two statements best describe the OSPF link - state routing pro tocol?（）

A. OSPF sends updates every 10 seconds

B. OSPF sends triggered updates when a network change occurs

C. When a link state is changed, the router that detected the change creates a link - state advertisement (LSA) and propagates it to all OSPF devices using the 224.0.0.6 multicast address

D. OSPF sends summaries of individual link- state entries every 30 minutes to ensure LSDB synchronization

参考答案：B, D

第8题：

根据下面的文字资料回答 71～75 题 n the following essay，each blank has four choices．Choose the most suitable one from the four choices and write down in the answer sheet．

Open Shortest Path First(OSPF)is a（ 1 ）routing algorithm that（ 2 ）work done on the OSI IS-IS intradomain routing protocol．This routing，as compared to distance-vector routing，requires（ 3 ）processing power．The Dijkstra algorithm is used to calculate（ 4 ）OSPF routing table updates only take place when necessary，（ 5 ）at regular intervals．

第6题：文中（ 1 ）处正确的答案是（）。

A．distance-vector

B．link-state

C．flow-based

D．selective flooding

正确答案：B

OSPF(Open Shortest Path First)是一个内部网关协议(Interior Gateway Protocol，IGP)，用于在单一自治系统(Autonomous System，AS)内决策路由。与RIP相对，OSPF是链路状态路由协}义，而RIP是距离矢量路由协议。
链路是路由器接口的另一种说法，因此oSPF也称为接口状态路赢协议。0SPF通过路由器之间通告网络接口的状态来建立链路状态数据库，生成最短路径树，每个0SPF路由器使用这些最短路径构造路由表。

第9题：

Into which two types of areas would an area border router (ABR) inject a default route?()

A. stub

B. the autonomous system of an exte rior gateway protocol (EGP)

C. NSSA

D. totally stubby

E. the autonomous system of a different interior gateway protocol (IGP)

F. area 0

参考答案：A, D

第10题：

OSPF is a link-state routing protocol。It is designed to be run internal to a single （71）system。Each OSPF router maintains an identical （）describing the autonomous system’s topology。From this database，a routing table is calculated by constructing a shortest-path （）。OSPF recalculates routes quickly in the face of topological changes，utilizing a minimum of routing （） traffic。OSPF provides support for equal-cost multipath。An area routing capability is provided，enabling an additional level of routing protection and a reduction in routing protocol （）。

A.autonomous
B.network
C.computer
D.server

答案：A

解析：

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 （）

题目

相似问题和答案

更多相关问题

相关内容

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 （ ）

题目

相似问题和答案

更多相关问题

相关内容

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 （）