OSPF is a link-state routing protocol。It is designed to be run internal to a single （）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 （73）。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.connection B.treeC.decisionD.bitmap
OSPF is a link-state routing protocol。It is designed to be run internal to a single （）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 （73）。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.connection
B.tree
C.decision
D.bitmap
B.tree
C.decision
D.bitmap
参考解析
解析：
相关考题：
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.autonomousB.networkC.computerD.server
What is the purpose of the OSPF link－state update packet?() A. describes a change to the OSPF hello timerB. carries one or more link-state advertisementsC. establishes and maintains neighbor relationshipsD. describes the contents of the entire link-state database
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）__。71A.autonomousB.networkC.computerD.server
Refer to the above exhibit. Why are the EIGRP neighbors for this router not learning the routes redistributed from OSPF?() A. Redistribution must be enabled mutually (in both directions) to work correctly.B. auto - summary causes the OSPF routes redistributed into EIGRP to be summarized; thus the OSPF network 116.16.34 is summarized to 116.3 4.0.0, which is already covered by the EIGRP protocol.C. Default metrics are not configured under EIGRP.D. Both routing protocols must have unique autonomous system numbers for redistribution to function correctly.
What are some of the characteristics of the OSPF routing protocol?() A. It confines network instability to a single area of network.B. It increases the routing overhead of the networkC. It supports VLSMD. It routes between Autonomous Systems.E. It allows extensive control of routing updatesF. None of the above
Which two are NOT characteristics of the OSPF routing protocol?() A. It confines network instability to a single area of network.B. It increases the routing overhead of the networkC. It supports VLSMD. It routes between Autonomous Systems.E. It allows extensive control of routing updates
While troubleshooting some connectivity issues，you issue the “show ip ospf database”in order to ex amine the link state database. Which three of the statements below are true regarding the OSPF link state database（）A.Each router has an identical link state database.B.External routes are imported into a separate link state database.C.Syn chronization of link state databases is maintained via floodingo f LSAs.D.Information in the link state database is used to build a routing table by calculating a shortest-path tree.E.By default,link state databases are refreshede very 10 minutes in the absence of topology changes.
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.tableB.databasesC.mapsD.topology
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
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
What are some of the characteristics of the OSPF routing protocol?（）A、It confines network instability to a single area of network.B、It increases the routing overhead of the networkC、It supports VLSMD、It routes between Autonomous Systems.E、It allows extensive control of routing updatesF、None of the above
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
A switch has been configured with two vlans and is connected to a router with a trunk for inter-vlan routing.OSPF has been configured on the router，as the routing protocol for the network.Which statement about thisnetwork is true？（）A、For the two vlans to communicate，a network statement for the trunk interface needs to be added to the OSPF configuration.B、For the two vlans to communicate， a network statement for each subinterface needs to be added to the OSPF configuration.C、Direct inter-vlan communication does not require OSPFD、OSPF cannot be used if router-on-a-stick is configured on the router
Which statement best describes OSPF external LSAs （type 5）？（）A、OSPF external LSAs are automatically flooded into all OSPF areas， unlike type 7 LSAs， which require that redistribution be configured.B、External LSAs （type 5） are automatically changed to type 1 LSAs at ASBRs.C、Type 5 LSAs are route summaries describing routes to networks outside the OSPF Autonomous System.D、External network LSAs （type 5） redistributed from other routing protocols into OSPF are not permitted to flood into a stub area.
Which one of the following answer choices below is true regarding the OSPF topology database?（）A、All entries in the topology database will be included on each router.B、All routers in the same OSPF area will have one topology database.C、The Dijkstra algorithm is used in the creation of the topology database.D、LSA packets are used to update and maintain the topology database.
When learning a new route, if a LSA received is not found in the topological database, what will an internal OSPF router do?（）A、The sequence numbers are checked, and if the LSA is val id it is entered into the topology database.B、The LSA is placed in the topological database and an acknowledgement is sent to the transmitting router.C、The LSA is dropped and a message is sent to the transmitting router.D、The LSA is flooded imme diately out of all the OSPF interfaces, except the interface from which the LSA was received.
Which two are NOT characteristics of the OSPF routing protocol?（）A、It confines network instability to a single area of network.B、It increases the routing overhead of the networkC、It supports VLSMD、It routes between Autonomous Systems.E、It allows extensive control of routing updates
For a router to successfully redistribute routes between OSPF and EIGRP, which of the following are true?（）A、The router must have one routing protocol configured, but configuration for both routing protocols is not necessaryB、The router must hav e at least one working link connected to each routing domainC、The redistribute command must be configured under EIGRP to send the routes to OSPFD、The redistribute command should be configured under OSPF to take routes from EIGRP into OSPF
单选题What is the purpose of the OSPF link-state update packet?（）Adescribes a change to the OSPF hello timerBcarries one or more link-state advertisementsCestablishes and maintains neighbor relationshipsDdescribes the contents of the entire link-state database
多选题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
单选题When learning a new route, if a LSA received is not found in the topological database, what will an internal OSPF router do?（）AThe sequence numbers are checked, and if the LSA is val id it is entered into the topology database.BThe LSA is placed in the topological database and an acknowledgement is sent to the transmitting router.CThe LSA is dropped and a message is sent to the transmitting router.DThe LSA is flooded imme diately out of all the OSPF interfaces, except the interface from which the LSA was received.
多选题For a router to successfully redistribute routes between OSPF and EIGRP, which of the following are true?（）AThe router must have one routing protocol configured, but configuration for both routing protocols is not necessaryBThe router must hav e at least one working link connected to each routing domainCThe redistribute command must be configured under EIGRP to send the routes to OSPFDThe redistribute command should be configured under OSPF to take routes from EIGRP into OSPF
多选题What are some of the characteristics of the OSPF routing protocol?（）AIt confines network instability to a single area of network.BIt increases the routing overhead of the networkCIt supports VLSMDIt routes between Autonomous Systems.EIt allows extensive control of routing updatesFNone of the above
多选题What are the characteristic of link state routing protocols?（）AThe exchange of advertisement is triggered by a change in the network.BAll routers exchange routing tables with each other iIn a multipoint network.CPackets are routed based upon the shortest path to the destination.DPaths are chosen depending on the cost efficiency factor.EEvery router in an OSPF area is capable of representing the entire network topology.FOnly the designated router in an OSPF area can represent the entire network topology.
多选题Which two are NOT characteristics of the OSPF routing protocol?（）AIt confines network instability to a single area of network.BIt increases the routing overhead of the networkCIt supports VLSMDIt routes between Autonomous Systems.EIt allows extensive control of routing updates
单选题Which statement best describes OSPF external LSAs （type 5）？（）AOSPF external LSAs are automatically flooded into all OSPF areas, unlike type 7 LSAs, which require that redistribution be configured.BExternal LSAs (type 5) are automatically changed to type 1 LSAs at ASBRs.CType 5 LSAs are route summaries describing routes to networks outside the OSPF Autonomous System.DExternal network LSAs (type 5) redistributed from other routing protocols into OSPF are not permitted to flood into a stub area
单选题Which one of the following answer choices below is true regarding the OSPF topology database?（）AAll entries in the topology database will be included on each router.BAll routers in the same OSPF area will have one topology database.CThe Dijkstra algorithm is used in the creation of the topology database.DLSA packets are used to update and maintain the topology database.