违法和不良信息举报 联系客服
免费注册 登录

多选题Which two are characteristics of link-state routing protocols?（） (Choose two.)ARouters choose a best path for a destination based on the SPF algorithm.BAll routers in a given area or level build a consistent database describing the network's topology.C

题目
多选题
Which two are characteristics of link-state routing protocols?（） (Choose two.)
A

Routers choose a best path for a destination based on the SPF algorithm.

B

All routers in a given area or level build a consistent database describing the network's topology.

C

Routers choose the best path for a destination based on the interface on which they received the link stateadvertisement with the lowest cost.

D

All routers in a given area or level forward link state advertisements between interfaces in the same area or level, adding their metric to the link state advertisement's cost information when they forward it.

参考答案和解析
正确答案： D,C
解析： 暂无解析
如果没有搜索结果或未解决您的问题，请直接 联系老师 获取答案。
相似问题和答案

第1题：

Which of the following statements describe the characteristic of link state routing protocols?()

A. The exchange of an advertisement is triggered by a change in the network.

B. All routers exchange routing tables with each other in a multipoint network.

C. Packets are routed based upon the shortest path to the destination.

D. Paths are chosen depending on the cost efficiency factor.

E. Every router in an OSPF area is capable of representing the entire network topology.

F. Only the designated router in an OSPF area can represent the entire network topology.


参考答案：A, C, E

第2题：

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

答案：B
解析：

第3题：

Which two are components of the enhanced services software architecture?() (Choose two.)

A. Linux kernel

B. routing protocol daemon

C. session-based forwarding module

D. separate routing and security planes


参考答案：B, C

第4题：

What functions do routers perform in a network (Choose two.)（）。

  • A、packet switching
  • B、access layer security
  • C、path selection
  • D、VLAN membership assignment
  • E、bridging between LAN segments
  • F、microsegmentation of broadcast domai

正确答案:A,C

第5题：

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
解析：

第6题：

What are the characteristic of link state routing protocols?()

A. The exchange of advertisement is triggered by a change in the network.

B. All routers exchange routing tables with each other iIn a multipoint network.

C. Packets are routed based upon the shortest path to the destination.

D. Paths are chosen depending on the cost efficiency factor.

E. Every router in an OSPF area is capable of representing the entire network topology.

F. Only the designated router in an OSPF area can represent the entire network topology.


参考答案：A, C, E

第7题：

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.exterior
B.interior
C.border
D.routing

答案：B
解析：

第8题：

Which two statements are correct regarding IS－IS?()

A. Routers maintain a single link-state database per area.

B. Routers maintain a separate Level 1 link-state database.

C. Routers maintain a separate Level 2 link-state database.

D. Routers maintain a single Level 1 link-state database across multiple areas.


参考答案：B, C

第9题：

Which of the following describe the process identifier that is used to run OSPF on a router? (Choose two.)（）

  • A、It is locally significant.
  • B、It is globally significant.
  • C、It is needed to identify a unique instance of an OSPF database.
  • D、It is an optional parameter required only if multiple OSPF processes are running on the router.
  • E、All routers in the same OSPF area must have the same process ID if they are to exchange routing information.

正确答案:A,C

第10题：

Which two are characteristics of link-state routing protocols?（） (Choose two.)

  • A、Routers choose a best path for a destination based on the SPF algorithm.
  • B、All routers in a given area or level build a consistent database describing the network's topology.
  • C、Routers choose the best path for a destination based on the interface on which they received the link stateadvertisement with the lowest cost.
  • D、All routers in a given area or level forward link state advertisements between interfaces in the same area or level, adding their metric to the link state advertisement's cost information when they forward it.

正确答案:A,B

更多相关问题
相关内容