网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
When multiple routers are used in interconnected networks,the routers exchange information about （ ） using a dynamic routing protocol.
A.destination addresses
B.IP addresses
C.work addresses
D.router addresses
B.IP addresses
C.work addresses
D.router addresses
参考答案
参考解析
解析：翻译：当多个路由器进行互联的网络，对目的地址使用动态路由协议的路由器交换信息。 A．目标地址 B．IP地址 C．工作地址 D．路由地址
更多 “When multiple routers are used in interconnected networks,the routers exchange information about （ ） using a dynamic routing protocol. A.destination addresses B.IP addresses C.work addresses D.router addresses ” 相关考题
考题
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
考题
You are a network administrator and you need to implement a routing protocol onyour network that provides:* Scalability* VLSM support* Minimal overhead* Support for connecting networks using routers of multiple vendorsWhich of the following routing protocol would best serve your needs?（）A. VTPB. RIP version 1C. EIGRPD. OSPFE. IGRPF. CDP
考题
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
考题
● One of the most widely used routing protocols in IP networks is the Routing Information Protocol (RIP). RIP is the canonical example of a routing protocol built on the （71）algorithm. Routing protocols in internetworks differ slightly from the idealized graph model. In an internetwork, the goal of the routers to forward packets to various （72）.Routers running RIP send their advertisement about cost every （73） seconds. A router also sends an update message whenever an update from another router causes it to change its routing table.It is possible to use a range of different metrics or costs for the links in a routing protocol. RIP takes the simplest approach, with all link costs being equal （74）. Thus it always tries to find the minimum hop route. Valid distances are 1 through （75）.This also limits RIP to running on fairly small networks.（71）A. distance vectorB. link stateC. floodingD. minimum spanning tree（72）A. computersB. routersC. switchesD. networks（73）A. 10B. 30C. 60D. 180（74）A. 1B. 15C. 16D. length of the link（75）A. 6B. 10C. 15D. 16
考题
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
考题
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
考题
One of the most widely used routing protocols in IP networks is the Routing Information Protocol（RIP）。RIP is the canonical example of a routing protocol built on the（ ）algorithm.Routing protocols in internetworks differ slightly from the idealized graph model.In an internetwork,the goal of the routers to forward packets to various（ ）.
Routers running RIP send their advertisement about cost every（ ）seconds.A router also sends an update message whenever an update from another router causes it to change its routing table.
It is possible to use a range of different metrics or costs for the links in a routing protocol.RIP takes the simplest approach,with all link costs being equal（ ）。Thus it always tries to find the minimum hop route.Valid distances are 1 through（请作答此空）。This also limits RIP to running on fairly small networks.A.6
B.10
C.15
D.16
考题
One of the most widely used routing protocols in IP networks is the Routing Information Protocol（RIP）。RIP is the canonical example of a routing protocol built on the（ ）algorithm.Routing protocols in internetworks differ slightly from the idealized graph model.In an internetwork,the goal of the routers to forward packets to various（请作答此空）.
Routers running RIP send their advertisement about cost every（ ）seconds.A router also sends an update message whenever an update from another router causes it to change its routing table.
It is possible to use a range of different metrics or costs for the links in a routing protocol.RIP takes the simplest approach,with all link costs being equal（ ）。Thus it always tries to find the minimum hop route.Valid distances are 1 through（ ）。This also limits RIP to running on fairly small networks.A.computers
B.routers
C.switches
D.networks
考题
Which statement describes the rule of split horizon?（）A、Only routers can split boundaries (horizons) between concentric networks.B、All distance vector protocols require fall back routers that may cause momentary loops as the topology changes.C、Networks can only remain fully converged if all information about routers is sent out all active interfaces.D、Information about a route should not be sent back in the direction from which the original update come.E、Each AS must keep routing tables converged to prevent dead routes from being advertised across the AS boundary.
考题
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
考题
What is true regarding Autonomous Systems （AS ）？（）A、AS numbers are assigned by the IANAB、AS numbers are used by BGP （Border Gateway protocol ） to exchange IP routing information with neighboring ASC、In the internet， an Autonomous System （AS） is a collection of IP networks and routers under the controlD、All of the Above
考题
You are a network administrator and you need to implement a routing protocol on your network that provides: * Scalability * VLSM support * Minimal overhead * Support for connecting networks using routers of multiple vendors Which of the following routing protocol would best serve your needs?（）A、VTPB、RIP version 1C、EIGRPD、OSPFE、IGRPF、CDP
考题
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 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 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.
考题
When implementing MPLS VPNs between CE and PE routers, which of these statements is correct? （）A、If using IS-IS as the PE-CE routing protocol, no redistribution is required.B、If using static routes between the CE and PE routers, no redistribution of other VPN routes is required.C、If the PE-CE protocol is not BGP, redistribution of other VPN routes from MP-BGP is required.D、If RIP is the routing protocol that is used between the PE-CE routers, no redistribution is required, but any other protocol will require redistribution.E、If using OSPF or EIGRP as the PE-CE routing protocol, redistribution is not required, but any other protocol or static route will require redistribution.
考题
What are three key concepts that apply when configuring the EIGRP stub routing feature in a hub and spoke network？（）A、A hub router prevents routes from being advertised to the remote router.B、Only remote routers are configured as stubs.C、Stub routers are not queried for routes.D、Spoke routers connected to hub routers answer the route queries for the stub router.E、A stub router should have only EIGRP hub routers as neighbors.F、EIGRP stub routing should be used on hub routers only.
考题
A route-based VPN is required for which scenario？（）A、when the remote VPN peer is behind a NAT deviceB、when multiple networks need to be reached across the tunnel and GRE cannot be usedC、when the remote VPN peer is a dialup or remote access clientD、when a dynamic routing protocol is required across the VPN and GRE cannot be used
考题
多选题Refer to the exhibit.The network administrator requires easy configuration options and minimal routing protocol traffic.Which two options provide adequate routing table information for traffic that passes between the two routers and satisfy the requests of the network administrator?（）Aa dynamic routing procotol on InternetRouter to advertise summarized routers to CentralRouter.Ba dynamic routing procotol on CentralRouter to advertise summarized routers to InternetRouter.Ca static route on InternetRouter to direct traffic that is destined for 172.16.0.0/16 to CentralRouter.Da dynamic routing procotol on InternetRouter to advertise all routes to CentralRouer.Ea dynamic routing procotol on CentralRouer to advertise all routes to InternetRouterFa static,default route on CentralRouter that directs traffic to InternetRouter.
考题
单选题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 is true regarding Autonomous Systems （AS ）？（）A
AS numbers are assigned by the IANAB
AS numbers are used by BGP （Border Gateway protocol ） to exchange IP routing information with neighboring ASC
In the internet， an Autonomous System （AS） is a collection of IP networks and routers under the controlD
All of the Above
考题
单选题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
考题
单选题You are a network administrator and you need to implement a routing protocol on your network that provides: * Scalability * VLSM support * Minimal overhead * Support for connecting networks using routers of multiple vendors Which of the following routing protocol would best serve your needs?（）A
VTPB
RIP version 1C
EIGRPD
OSPFE
IGRPF
CDP
考题
单选题Which statement describes the rule of split horizon?（）A
Only routers can split boundaries (horizons) between concentric networks.B
All distance vector protocols require fall back routers that may cause momentary loops as the topology changes.C
Networks can only remain fully converged if all information about routers is sent out all active interfaces.D
Information about a route should not be sent back in the direction from which the original update come.E
Each AS must keep routing tables converged to prevent dead routes from being advertised across the AS boundary.
考题
多选题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.
考题
多选题What are two characteristics of the OSPF process identifier?（）AIt is needed to identify a unique instance of an OSPF database.BIt is an optional parameter only necessary if multiple OSPF processes are used.CIt is locally significant.DIt is globally insignificantEAll routers in the same OSPF area must have the same process ID 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.
热门标签
最新试卷
