Refer to the router topology shown in the graphic. Assuming that all routers are running OSPF, which statements correctly describe how the routers exchange routing information?() A. Denmark exchanges with Utah, Paris, and Berlin.B. Utah exchanges only with Denmark.C. Berlin exchanges with Denmark, Utah, and Paris.D. Paris exchanges only with Denmark.E. Denmark exchanges with only Paris and Utah.

Refer to the router topology shown in the graphic. Assuming that all routers are running OSPF, which statements correctly describe how the routers exchange routing information?()

A. Denmark exchanges with Utah, Paris, and Berlin.

B. Utah exchanges only with Denmark.

C. Berlin exchanges with Denmark, Utah, and Paris.

D. Paris exchanges only with Denmark.

E. Denmark exchanges with only Paris and Utah.


相关考题:

When multiple routers are used in interconnected networks,the routers exchange information about()using a dynamic routing protocolA.destination addressesB.IP addressesC.work addressesD.router addresses

Refer to the exhibit. Two routers are connected by Frame Relay and are running OSPF bet ween them. Each router has been configured with the appropriate network statements under router ospf 1, but the routers are not forming an adjacency. Which of the following three commands could be configured on each router to correct this problem?()A. RouterC(config - if)#ip ospf network broadcast RouterD(config - if)#ip ospf network broadcastB. RouterC(config - if)#ip ospf network point - to - point RouterD(config - if)#ip ospf network point - to - pointC. RouterC(config - router)#neighbor 10.100. 100.4 RouterD(config - router)#neighbor 10.100.100.3D. RouterC(config - router)#neighbor 10.255.255.254 RouterD(config - router)#neighbor 10.255.255.253

Refer to the exhibit. You are the network administrator of the Route.com company. You have been tasked to implement a hub and spoke EIGRP topology over Frame Relay to provide connectivity between the networks at headquarters and all 300 spokes. Before you begin the actual implementation, which three pieces of information are more important to know than the others?()A. the Committed Information Rate of all the Frame Relay PVCsB. the Cisco IOS version running on all the routersC. the router model number of all the spoke routersD. the number of HQ networks connected behind the headquarter routersE. the routing policy, such as whether or not the spokes can be used as backup transient point between the two headquarter routers

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.

Refer to the diagram. Which OSPF configuration command is required to configure Area 3 a s atotally stubby area?() A. On the ABR router ospf 10 area 3 stubB. On all Area 3 routers router ospf 10 area 3 stubC. On all Area 3 routers router ospf 10 area 3 stub no - summaryD. On the ABR router ospf 10 area 3 nssaE. On the ABR rou ter ospf 10 area 3 stub no - summary

The internetwork infrastructure of company XYZ consists of a single OSPF area as shown in the graphic. There is concern that a lack of router resources is impeding internetwork performance. As part of examining the router resources, the OSPF DRs need to be known. All the router OSPF priorities are at the default and the router IDs are shown with each router. Which routers are likely to have been elected as DR?()A.Corp-1B.Corp-2C.Corp-3D.Corp-4E.Branch-1F.Branch-2

Which of the following describe the process identifier that is used to run OSPF on a router (Choose two.)()。 A.It is locally significantB.It is globally significantC.It is needed to identify a unique instance of an OSPF databaseD.It is an optional parameter required only if multiple OSPF processes are running on the routerE.All routers in the same OSPF area must have the same process ID if they are to exchange routing information

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

Refer to the exhibit. When running EIGRP, What is required for RouterA to exchange routing updates with RouterC?()A、As numbers must be changed to match on all the routers.B、Loopback interface must be configured so a DR is elected.C、The no auto-summary command is needed on Router A and Router C.D、Router B needs to have two network statements, one for each connected network.

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.

Which of the following describe the process identifier that is used to run OSPF on a router (Choose two.)()。A、It is locally significantB、It is globally significantC、It is needed to identify a unique instance of an OSPF databaseD、It is an optional parameter required only if multiple OSPF processes are running on the routerE、All routers in the same OSPF area must have the same process ID if they are to exchange routing information

Refer to the router topology shown in the graphic. Assuming that all routers are running OSPF, which statements correctly describe how the routers exchange routing information?()A、Denmark exchanges with Utah, Paris, and Berlin.B、Utah exchanges only with Denmark.C、Berlin exchanges with Denmark, Utah, and Paris.D、Paris exchanges only with Denmark.E、Denmark exchanges with only Paris and Utah.

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.

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.

Which of the following describe the process identifier that is used to run OSPF on a router?()A、It is logically 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.

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.

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.

Which routers must be configured with the same authentication string when configuring OSPF authentication?()A、all routers on a linkB、all routers in an areaC、all external OSPF peersD、all routers in an OSPF domain

单选题Refer to the exhibit. When running EIGRP, What is required for RouterA to exchange routing updates with RouterC?()AAs numbers must be changed to match on all the routers.BLoopback interface must be configured so a DR is elected.CThe no auto-summary command is needed on Router A and Router C.DRouter B needs to have two network statements, one for each connected network.

多选题Which of the following describe the process identifier that is used to run OSPF on a router (Choose two.)()。AIt is locally significantBIt is globally significantCIt is needed to identify a unique instance of an OSPF databaseDIt is an optional parameter required only if multiple OSPF processes are running on the routerEAll routers in the same OSPF area must have the same process ID if they are to exchange routing information

多选题Refer to the router topology shown in the graphic. Assuming that all routers are running OSPF, which statements correctly describe how the routers exchange routing information?()ADenmark exchanges with Utah, Paris, and Berlin.BUtah exchanges only with Denmark.CBerlin exchanges with Denmark, Utah, and Paris.DParis exchanges only with Denmark.EDenmark exchanges with only Paris and Utah.

多选题Which of the following statements describe the characteristic of link state routing protocols?()AThe exchange of an advertisement is triggered by a change in the network.BAll routers exchange routing tables with each other in 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.

多选题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 three of the statements below correctly describe the characteristics of Autonomous Systems in routed networks?()AWithin an AS, all routers must run either BGP or IBGP.BAn AS uses exterior gatew ay protocols (EGPs) to exchange information with other autonomous systems.CAn AS is a group of routers under the same technical administration.DWithin an AS, routes learned through BGP can be redistributed using interior gateway protocols.EWi thin an AS, routes learned through an interior protocol cannot be redistributed using BGP to other autonomous systems.

多选题Which of the following describe the process identifier that is used to run OSPF on a router? ()AIt is locally significant.BIt is globally significant.CIt is needed to identify a unique instance of an OSPF database.DIt is an optional parameter required only if multiple OSPF processes are running on the router.EAll routers in the same OSPF area must have the same process ID if they are to exchange routing information.

多选题Which of the following describe the process identifier that is used to run OSPF on a router? (Choose two.)()AIt is locally significant.BIt is globally significant.CIt is needed to identify a unique instance of an OSPF database.DIt is an optional parameter required only if multiple OSPF processes are running on the router.EAll routers in the same OSPF area must have the same process ID if they are to exchange routing information.