单选题Which of the following routing protocols is a link state and uses a backbone called area 0？（）AOSPFBEIGRPCBGPDIS-IS
单选题
Which of the following routing protocols is a link state and uses a backbone called area 0？（）
A
OSPF
B
EIGRP
C
BGP
D
IS-IS
参考解析
解析：
暂无解析
相关考题：
Which CLI command is used to see the current OSPF link－state database?() A. show ospf databaseB. show ospf neighborC. show protocols ospfD. show ospf link-state
Which of the following are considered link state protocols?() A. RIPv2 and EIGRPB. EGP and IGPC. OSPF and IS-ISD. RIP and BGP
What are the different characteristics of distance vector and link state routing protocols?() A. Distance vector protocols send the entire routing table to directly connected neighbors.B. Distance vector protocols are responsible for sending updates to all networks listed in the routing table.C. Link state protocols are responsible for sending the entire routing table to the whole network.D. Link state protocols send updates regarding their own links status to all other routers on the network.E. None of the above
Which of the following technologies can be used in distance vector routing protocols to prevent routing loops?() A. Spanning Tree ProtocolB. Shortest path first treeC. Link-state advertisements (LSA)D. Hold-down timersE. Split horizonF. VRRP
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
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
Which of the following technologies can be used in distance vector routing protocols to prevent routing loops?（）A、Spanning Tree ProtocolB、Shortest path first treeC、Link-state advertisements (LSA)D、Hold-down timersE、Split horizonF、VRP
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
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.
Which two statements are characteristics of a distance vector routing protocol?（）A、RIP is an example of distance vector routing protocols.B、Updates are periodic and include the entire routing table.C、Routing updates are sent only after topology changesD、The protocol can be useful in hub-and-spoke and hierarchical networks.E、Convergence is usually faster than with link state protocolsF、Each router has its own view of the topology
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.
What are the different characteristics of distance vector and link state routing protocols?（）A、Distance vector protocols send the entire routing table to directly connected neighbors.B、Distance vector protocols are responsible for sending updates to all networks listed in the routing table.C、Link state protocols are responsible for sending the entire routing table to the whole network.D、Link state protocols send updates regarding their own links status to all other routers on the network.E、None of the above
The statements below compare and contrast link state and distance vector routing protocols. Which of these are true?（）A、Distance vector protocols send the entire routing table to directly connected neighbors.B、Distance vector protocols are responsible for sending updates to all networks listed in the routing table.C、Link state protocols are responsible for sending the entire routing table to the whole network.D、Link state protocols send updates regarding their own links status to all other routers on the network.
Which of the following routing protocols is strictly a distance vector protocol?（）A、IS-ISB、BGPC、EIGRPD、OSPF
Which of the following routing protocols is a link state and uses a backbone called area 0？（）A、OSPFB、EIGRPC、BGPD、IS-IS
Which of the following routing protocols uses AS-Path as one of the methods to build the routing table?（）A、OSPFB、IS-ISC、EIGRPD、BGP
Which of the following are considered link state protocols?（）A、RIPv2 and EIGRPB、EGP and IGPC、OSPF and IS-ISD、RIP and BGP
单选题Which CLI command is used to see the current OSPF link-state database?（）Ashow ospf databaseBshow ospf neighborCshow protocols ospfDshow ospf link-state
单选题Which of the following routing protocols uses AS-Path as one of the methods to build the routing table?（）AOSPFBIS-ISCEIGRPDBGP
多选题Which of the following data structures exist on a router for the OSPF routing protocol？（）AOSPF topology tableBOSPF interface tableCOSPF routing information baseDOSPF link-state databaseEOSPF adjacency tableFOSPF neighbor table
单选题Which of the following routing protocols is strictly a distance vector protocol?（）AIS-ISBBGPCEIGRPDOSPF
多选题Which two routing protocols support MPLS traffic engineering link information distribution？ （）AOSPFBBGPCRIP version 2DIS-ISEEIGRP
多选题Which two statements are characteristics of a distance vector routing protocol?（）ARIP is an example of distance vector routing protocols.BUpdates are periodic and include the entire routing table.CRouting updates are sent only after topology changesDThe protocol can be useful in hub-and-spoke and hierarchical networks.EConvergence is usually faster than with link state protocolsFEach router has its own view of the topology
多选题Which of the following technologies can be used in distance vector routing protocols to prevent routing loops?（）ASpanning Tree ProtocolBShortest path first treeCLink-state advertisements (LSA)DHold-down timersESplit horizonFVRP
单选题Routing convergence time is which of the following？（）ATime required for a VPN connection to occurBTime required by protocols to update their forwarding tables after changes have occurredCTime required for an IDS to detect suspicious softwareDTime required by switch ports to update their link status and transition to the forwarding state
多选题What are the different characteristics of distance vector and link state routing protocols?（）ADistance vector protocols send the entire routing table to directly connected neighbors.BDistance vector protocols are responsible for sending updates to all networks listed in the routing table.CLink state protocols are responsible for sending the entire routing table to the whole network.DLink state protocols send updates regarding their own links status to all other routers on the network.ENone of the above
多选题The statements below compare and contrast link state and distance vector routing protocols. Which of these are true?（）ADistance vector protocols send the entire routing table to directly connected neighbors.BDistance vector protocols are responsible for sending updates to all networks listed in the routing table.CLink state protocols are responsible for sending the entire routing table to the whole network.DLink state protocols send updates regarding their own links status to all other routers on the network.
单选题Which of the following routing protocols is a link state and uses a backbone called area 0？（）AOSPFBEIGRPCBGPDIS-IS