多选题Which one of the routing protocol below does NOT use a distance vector algorithm to calculate a route to a given destination?（）ARIPBIPX RIPCIGRPDOSPFEIS-IS
多选题
Which one of the routing protocol below does NOT use a distance vector algorithm to calculate a route to a given destination?（）
A
RIP
B
IPX RIP
C
IGRP
D
OSPF
E
IS-IS
参考解析
解析：
暂无解析
相关考题：
●In the following essay，each blank has four choices．Choose the most suitable one from the four choices and write down in the answer sheet．Open Shortest Path First(OSPF)is a (66) routing algorithm that (67) work done on the OSI IS-IS intradomain routing protocol．This routing，as compared to distance-vector routing，requires (68) processing power．The Dijkstra algorithm is used to calculate (69) OSPF routing table updates only take place when necessary， (70) at regular intervals．(66) A．distance-vectorB．link-stateC．flow-basedD．selective flooding(67) A．derived fromB．deviated fromC．was derived fromD．was deviated from(68) A．moreB．lessC．sameD．most(69) A．routesB．roadC．distanceD．cost(70) A．but ratherB．rather tooC．rather thanD．rather that
Which routing select algorithm is described below ? According to a kind of fix regulation, the select algorithm of route works and has nothing to do with the network information newly.A．Static Routing AlgorithmB．Dynamic Routing AlgorithmC．Centralized Routing AlgorithmD．Distributed Routing Algorithm
根据下面的文字资料回答 71～75 题 n the following essay，each blank has four choices．Choose the most suitable one from the four choices and write down in the answer sheet．Open Shortest Path First(OSPF)is a（ 1 ）routing algorithm that（ 2 ）work done on the OSI IS-IS intradomain routing protocol．This routing，as compared to distance-vector routing，requires（ 3 ）processing power．The Dijkstra algorithm is used to calculate（ 4 ）OSPF routing table updates only take place when necessary，（ 5 ）at regular intervals．第6题：文中（ 1 ）处正确的答案是（ ）。A．distance-vectorB．link-stateC．flow-basedD．selective flooding
Which routing algorithm is described below?It is a mechanism in which the sending station determines the route the frame. will follow andincludes the routing information with the flame；bridges read the routing information to determineif they should forward the frame．A．Fixed RoutingB．Spanning TreeC．Source RoutingD．Frame. Forwarding
●Border Gateway Protocol(BGP) is inter-autonomous system (71) protocol. BGP is based on a routing method called path vector routing. Distance vector routing is not a good candidate for inter-autonomous system routing because there are occasions on which the route with the smallest (72) count is not the preferred route. For example, we may not want a packet through an not secure even though it is the shortest route. Also, distance vector routing is unstable due to the fact that the routers announce only the number of hop counts to the destination without actually defining the path that leads to that (73) ．A router that recevives a distance vector advertisement packet may be fooled if the shortest path is actually calculated through the receiving router itself. Link (74) routing is also not a good candidate for inter-autonomous system routing because an Internet is usually too big for this routing method. To use link state routing for the whole internet would require each routex to have a huge link state database. It would also take a long time for each router to calculate its rousting (75) using the Dijkstra algorism.（71）A. routingB. switchingC. transmittingD. receiving(72)A. pathB. hop `C. routeD. packet(73）A. connectionB. windowC. sourceD. destination(74)A. statusB. searchC. stateD. research(75）A. tableB. stateC. metricD. cost
Which of the following is a disadvantage of using the EIGRP protocol?() A. It does not scale wellB. It converges slower than OSPFC. It is a proprietary protocolD. It is a distance vector protocol
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.
Which one of the routing protocol below does NOT use a distance vector algorithm to calculate a route to a given destination?() A. RIPB. IPX RIPC. IGRPD. OSPFE. IS-IS
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.
What two things will a router do when running a distance vector routing protocol?() A. Send periodic updates regardless of topology changes.B. Send entire routing table to all routers in the routing domain.C. Use the shortest-path algorithm to the determine best path.D. Update the routing table based on updates from their neighbors.E. Maintain the topology of the entire network in its database.
Which two statements are characteristics of a distance vector routing protocol?() A.RIP is an example of distance vector routing protocolsB.Updates are periodic and include the entire routing tableC.Routing updates are sent only after topology changesD.The protocol can be useful in hub-and-spoke and hierarchical networksE.Convergence is usually faster than with link state protocolsF.Each router has its own view of the 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.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
What two things will a router do when running a distance vector routing protocol? （）A、Send periodic updates regardless of topology changes.B、Send entire routing table to all routers in the routing domain.C、Use the shortest-path algorithm to the determine best path.D、Update the routing table based on updates from their neighbors.E、Maintain the topology of the entire network in its database.
Which two statements are characteristics of a distance vector routing protocol?（）A、RIP is an example of distance vector routing protocolsB、Updates are periodic and include the entire routing tableC、Routing updates are sent only after topology changesD、The protocol can be useful in hub-and-spoke and hierarchical networksE、Convergence is usually faster than with link state protocolsF、Each router has its own view of the topology
Which one of the routing protocol below does NOT use a distance vector algorithm to calculate a route to a given destination?（）A、RIPB、IPX RIPC、IGRPD、OSPFE、IS-IS
Which of the following is a disadvantage of using the EIGRP protocol?（）A、It does not scale wellB、It converges slower than OSPFC、It is a proprietary protocolD、It is a distance vector protocol
Which of the following routing protocols is strictly a distance vector protocol?（）A、IS-ISB、BGPC、EIGRPD、OSPF
What is the role of route preference?（）A、It is used as a tiebreaker when the same prefix is available through multiple protocols.B、It is used to determine the preferred path to a given destination.C、It is used to select the best route between multiple equal-cost paths.D、It is used to select which routing table to use for forwarding.
Which type of IGP should you use to achieve scalability in a large enterprise network？（）A、link-state protocolB、path-vector protocolC、Bellman-Ford protocolD、distance-vector protocol
多选题hat two things will a router do when running a distance vector routing protocol？（）ASend periodic updates regardless of topology changes.BSend entire routing table to all routers in the routing domain.CUse the shortest-path algorithm to the determine best path.DUpdate the routing table based on updates from their neighbors.EMaintain the topology of the entire network in its database.
多选题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 routing protocols is strictly a distance vector protocol?（）AIS-ISBBGPCEIGRPDOSPF
多选题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 two statements are characteristics of a distance vector routing protocol?（）ARIP is an example of distance vector routing protocolsBUpdates are periodic and include the entire routing tableCRouting updates are sent only after topology changesDThe protocol can be useful in hub-and-spoke and hierarchical networksEConvergence is usually faster than with link state protocolsFEach router has its own view of the topology
单选题While troubleshooting a network connectivity issue, you suspect that a router may be missing a route, or may be receiving bad routing information to a destination. What command should you issue to view the route that the router will use to reach a given destination?（）ApingBtraceCshow ip routeDshow interfaceEshow cdp neighbors
多选题Regarding DHCP (dynamic host configuration protocol), which two of the following choices below are true?（）AThe DHCP Discover message uses FF-FF-FF-FF-FF as the Layer 2 destination address.BThe DHCP Discover message uses UDP as the transport layer protocol.CThe DHCP Discover message uses a special Layer 2 multicast address as the destination address.DThe DHCP Discover message uses TCP as the transport layer protocol.EThe DHCP Discover message does not use a Layer 2 destination address.FThe DHCP Discover message does not require a transport layer protocol.