Which of the following routing protocols involves all routers knowing the connections status ofother routers within the network?（）A、RIPv2B、OSPFC、IGRPD、BGP
Which of the following routing protocols involves all routers knowing the connections status ofother routers within the network?（）
- A、RIPv2
- B、OSPF
- C、IGRP
- D、BGP
相关考题：
When implementing MPLS VPNs between CE and PE routers, which of these statements is correct?As a Network Engineer, it is necessary for you to know how to implement MPLS VPNs between Customer Edge and Provider Edge routers.Refer to the following descriptions, which one is making sense?（）A. If using OSPF or EIGRP as the PE-CE routing protocol, redistribution is not required, but any other protocol or static route will require redistributionB. If using IS-IS as the PE-CE routing protocol, no redistribution is requiredC. If using static routes between the CE and PE routers, no redistribution of other VPN routes is requiredD. If PE-CE protocol is not BGP, redistribution of other VPN routes from MP-BGP is required
You are developing a verification plan for an upcoming OSPF implementation. Part of this plan is to verify the status of type 3 LSAs within the network. Which routers should you verify first to ensure that the configuration s are correct for generating type 3 LSAs?（）A. Internal routers within the backbone area (area 0)B. Internal routers within the NSSAsC. Internal routers within the stubby areasD. ASBRsE. ABRsF. DRs and BDRs
What does a router do if it has no EIGRP feasible successor route to a destination network and the successor route to that destination network is inactive status?() A. It routes all traffic that is addresses to the destination network to the interface indicates in the routing table.B. It sends a copy of its neighbor table to all adjacent routers.C. It sends a multicast query packet to all adjacent neighbors requesting available routing paths to the destination network.D. It broadcasts Hello packets to all routers in the network to re-establish neighbor adjacencies.
Which one of the following statements best explains the split horizon rule used in distance vector routing protocols?() A. Only routers can split boundaries (horizons) between concentric networks.B. Each AS must keep routing tables converged to prevent dead routes from being advertised across boundaries.C. Networks can only remain fully converged if all information is sent out all active interfaces.D. Information about a route should not be sent back in the direction from which the original update came.E. Distance vector protocols need fall back routers that are responsible for momentary loops.
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 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 three of the statements below correctly describe the characteristics of Autonomous Systems in routed networks?() A. Within an AS, all routers must run either BGP or IBGP.B. An AS uses exterior gatew ay protocols (EGPs) to exchange information with other autonomous systems.C. An AS is a group of routers under the same technical administration.D. Within an AS, routes learned through BGP can be redistributed using interior gateway protocols.E. Wi thin an AS, routes learned through an interior protocol cannot be redistributed using BGP to other autonomous systems.
DR (Designated Router) is for environments where many routers on the same network such as Ethernet. In the following presented network, all routers are reloaded simultaneously, and DR is selected as expected. What is the RTC status?（）A. 2WAY/DRB. FULL/DRC. FULL/DROTHERD. FULL/BDR
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.
The Testking Network consists of the following 5 IP networks:NETWORK 1: 192.168.10.0/26NETWORK 2: 192.168.10.64/27NETWORK 3: 192.168.10.96/27NETWORK 4: 192.168.10.128/30NETWORK 5: 192.168.10.132/30Which of the following routing protocols will support this IP addressing scheme?（）A. RIP version 1B. RIP version 2C. IGRPD. EIGRPE. OSPFF. BGP
Which routing protocols can be used within the enterprise network shown in the diagram?() A.RIP v1B.RIP v2C.IGRPD.OSPFE.BGPF.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.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.RIPB.IGRPC.OSPFD.BGP
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
When implementing MPLS VPNs between CE and PE routers, which of these statements is correct? As a Network Engineer, it is necessary for you to know how to implement MPLS VPNs between Customer Edge and Provider Edge routers. Refer to the following descriptions, which one is making sense?（）A、If using OSPF or EIGRP as the PE-CE routing protocol, redistribution is not required, but any other protocol or static route will require redistributionB、If using IS-IS as the PE-CE routing protocol, no redistribution is requiredC、If using static routes between the CE and PE routers, no redistribution of other VPN routes is requiredD、If PE-CE protocol is not BGP, redistribution of other VPN routes from MP-BGP is required
When BGP is used as the PE-CE routing protocol, which of these statements is correct?（）A、On the CE router, PE neighbors must be configured in the VRF context on the CE routerB、On PE routers, the CE IBGP neighbors are configured in the global BGP configurationC、On PE routers, the CE EBGP neighbors are configured in the VRF contextD、A separate BGP process must be used on the PE routers for CE routers so that they do not use the same BGP routing process as that used for the PE router's other provider neighbors
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 three factors have the biggest influence on OSPF scalability？（）A、Flooding paths and redundancyB、Amount of routing information in the OSPF area or routing domainC、Number of routers with Cisco Express Forwarding enabledD、Number of neighbor adjacenciesE、Other routing protocols in useF、OSPF timer reconstruction negotiationG、Redistribution with BGP neighborsH、Redistribution with other IGP routing protocols， such as RIP or EIGRP
You are developing a verification plan for an upcoming OSPF implementation. Part of this plan is to verify the status of type 3 LSAs within the network. Which routers should you verify first to ensure that the configuration s are correct for generating type 3 LSAs?（）A、Internal routers within the backbone area (area 0)B、Internal routers within the NSSAsC、Internal routers within the stubby areasD、ASBRsE、ABRsF、DRs and BDRs
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 Testking Network consists of the following 5 IP networks: NETWORK 1: 192.168.10.0/26 NETWORK 2: 192.168.10.64/27 NETWORK 3: 192.168.10.96/27 NETWORK 4: 192.168.10.128/30 NETWORK 5: 192.168.10.132/30 Which of the following routing protocols will support this IP addressing scheme?（）A、RIP version 1B、RIP version 2C、IGRPD、EIGRPE、OSPFF、BGP
A network administrator of a company has many branch locations each using a subnet mask of 255.255.255.224. Which of the following dynamic routing protocols should be used？（）A、IPv6B、RIPC、IGRPD、RIPv2
单选题Which of the following routing protocols involves all routers knowing the connections status ofother routers within the network?（）ARIPv2BOSPFCIGRPDBGP
单选题What does a router do if it has no EIGRP feasible successor route to a destination network and the successor route to that destination network is inactive status?（）AIt routes all traffic that is addresses to the destination network to the interface indicates in the routing table.BIt sends a copy of its neighbor table to all adjacent routers.CIt sends a multicast query packet to all adjacent neighbors requesting available routing paths to the destination network.DIt broadcasts Hello packets to all routers in the network to re-establish neighbor adjacencies.
单选题When BGP is used as the PE-CE routing protocol, which of these statements is correct?（）AOn the CE router, PE neighbors must be configured in the VRF context on the CE routerBOn PE routers, the CE IBGP neighbors are configured in the global BGP configurationCOn PE routers, the CE EBGP neighbors are configured in the VRF contextDA separate BGP process must be used on the PE routers for CE routers so that they do not use the same BGP routing process as that used for the PE router's other provider neighbors
单选题You are developing a verification plan for an upcoming OSPF implementation. Part of this plan is to verify the status of type 3 LSAs within the network. Which routers should you verify first to ensure that the configuration s are correct for generating type 3 LSAs?（）AInternal routers within the backbone area (area 0)BInternal routers within the NSSAsCInternal routers within the stubby areasDASBRsEABRsFDRs and BDRs
多选题Which three factors have the biggest influence on OSPF scalability？（）AFlooding paths and redundancyBAmount of routing information in the OSPF area or routing domainCNumber of routers with Cisco Express Forwarding enabledDNumber of neighbor adjacenciesEOther routing protocols in useFOSPF timer reconstruction negotiationGRedistribution with BGP neighborsHRedistribution with other IGP routing protocols， such as RIP or EIGRP