niusouti.com

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 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

相似考题

1.●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

2.根据下面的文字资料回答 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

3.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

4.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

更多“Which one of the routing protocol below does NOT use a distance vector algorithm to calculate a route to a given destination?() ”相关问题

  • 第1题：

    ●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. routing

    B. switching

    C. transmitting

    D. receiving

    (72)

    A. path

    B. hop `

    C. route

    D. packet

    (73）

    A. connection

    B. window

    C. source

    D. destination

    (74)

    A. status

    B. search

    C. state

    D. research

    (75）

    A. table

    B. state

    C. metric

    D. cost


    正确答案：A,B,D,C,A

  • 第2题：

    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.


    参考答案：A, D

  • 第3题：

    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

    答案：B
    解析：

  • 第4题：

    Which two statements are characteristics of a distance vector routing protocol?（）

    • A、RIP is an example of distance vector routing protocols
    • B、Updates are periodic and include the entire routing table
    • C、Routing updates are sent only after topology changes
    • D、The protocol can be useful in hub-and-spoke and hierarchical networks
    • E、Convergence is usually faster than with link state protocols
    • F、Each router has its own view of the topology

    正确答案:A,B

  • 第5题：

    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.

    正确答案:A

  • 第6题：

    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.

    正确答案:D

  • 第7题：

    What is an appropriate use of a default route？（）

    • A、to provide routing to a local web server
    • B、to provide routing from an ISP to a stub network
    • C、to provide routing that will override the configured dynamic routing protocol
    • D、to provide routing to a destination that is not specified in the routing table and which is outside the local network

    正确答案:D

  • 第8题：

    Which of the following routing protocols is strictly a distance vector protocol?（）

    • A、IS-IS
    • B、BGP
    • C、EIGRP
    • D、OSPF

    正确答案:B

  • 第9题：

    单选题
    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?（）
    A

    ping

    B

    trace

    C

    show ip route

    D

    show interface

    E

    show cdp neighbors


    正确答案： D
    解析： 暂无解析

  • 第10题：

    单选题
    Which of the following routing protocols is strictly a distance vector protocol?（）
    A

    IS-IS

    B

    BGP

    C

    EIGRP

    D

    OSPF


    正确答案： B
    解析： 暂无解析

  • 第11题：

    多选题
    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.


    正确答案： B,C
    解析： 暂无解析

  • 第12题：

    单选题
    Which of the following is a disadvantage of using the EIGRP protocol?（）
    A

    It does not scale well

    B

    It converges slower than OSPF

    C

    It is a proprietary protocol

    D

    It is a distance vector protocol


    正确答案： D
    解析： 暂无解析

  • 第13题：

    For each blank, choose the best answer from the four choices and write down on the answer'sheet.

    (66)is a protocol that a host uses to inform. a router when it joins or leaves an Internet multicast group.

    (67)is an error detection code that most data communication networks use.

    (68)is an interior gateway protocol that uses a distance vector algorithm to propagate routing information.

    (69)is a transfer mode in which all types of information are organized into fixed form. cells on an asynchronous or non-periodic basis over a range of media.

    (70)is an identifier of a web page.

    A．ICMP

    B．SMTP

    C．IGMP

    D．ARP


    正确答案：C
    解析：IGMP协议是接收者发现协议。IGMP协议运行在主机和路由器之间，用于路由器维护组播组是否有组成员。IGMP只维护组播组是否有成员，而不维护组播组有哪些成员，因此状态信息不会因组播组成员的增加而增加。
      循环冗余校验(cyclic redundancy check，CRC)是由分组线性码的分解而来，其主要应用是二元码组，主要应用于数据传输过程中的差错控制。
      OSPF是一个内部网关协议(Interior Gateway Protocol，IGP)，用于在单一自治系统 (autonomous system，AS)内决策路由。与RIP相对，OSPF是链路状态路由协议，而RIP是距离向量路由协议。它是依靠距离，即跳数来衡量一条路径的好坏。通过距离向量路由算法来传播路由信息。
      ATM是异步传输模式，实现OSI物理层和链路层功能。ATM以独有的ATM信元进行数据传输，每个ATM信元为53个字节。ATM不严格要求信元交替地从不同的源到来，每一列从各个源来的信元，没有特别的模式，信元可以从任意不同的源到来，而且不要求从一台计算机来的信元流是连续的，数据信元可以有间隔，这些间隔由特殊的空闲信元(idle cell)填充。
      URL(Uniform. Resource Locator)是单一资源定位符，是一种用来鉴别文件与资源在WWW中地址的专用表示。

  • 第14题：

    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

    答案：B
    解析：

  • 第15题：

    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.

    正确答案:A,D

  • 第16题：

    Which of the following is a disadvantage of using the EIGRP protocol?（）

    • A、It does not scale well
    • B、It converges slower than OSPF
    • C、It is a proprietary protocol
    • D、It is a distance vector protocol

    正确答案:C

  • 第17题：

    Which two statements are characteristics of a distance vector routing protocol?（）

    • A、RIP is an example of distance vector routing protocols.
    • B、Updates are periodic and include the entire routing table.
    • C、Routing updates are sent only after topology changes
    • D、The protocol can be useful in hub-and-spoke and hierarchical networks.
    • E、Convergence is usually faster than with link state protocols
    • F、Each router has its own view of the topology

    正确答案:A,B

  • 第18题：

    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.

    正确答案:A,D

  • 第19题：

    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?（）

    • A、ping
    • B、trace
    • C、show ip route
    • D、show interface
    • E、show cdp neighbors

    正确答案:C

  • 第20题：

    Which type of IGP should you use to achieve scalability in a large enterprise network？（）

    • A、link-state protocol
    • B、path-vector protocol
    • C、Bellman-Ford protocol
    • D、distance-vector protocol

    正确答案:A

  • 第21题：

    多选题
    Which two statements are characteristics of a distance vector routing protocol?（）
    A

    RIP is an example of distance vector routing protocols

    B

    Updates are periodic and include the entire routing table

    C

    Routing updates are sent only after topology changes

    D

    The protocol can be useful in hub-and-spoke and hierarchical networks

    E

    Convergence is usually faster than with link state protocols

    F

    Each router has its own view of the topology


    正确答案： B,F
    解析： 暂无解析

  • 第22题：

    多选题
    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


    正确答案： A,B
    解析： 暂无解析

  • 第23题：

    多选题
    Which two statements are characteristics of a distance vector routing protocol?（）
    A

    RIP is an example of distance vector routing protocols.

    B

    Updates are periodic and include the entire routing table.

    C

    Routing updates are sent only after topology changes

    D

    The protocol can be useful in hub-and-spoke and hierarchical networks.

    E

    Convergence is usually faster than with link state protocols

    F

    Each router has its own view of the topology


    正确答案： A,C
    解析： 暂无解析

相关内容