niusouti.com

OSPF is a link-state routing protocol。It is designed to be run internal to a single （71）system。Each OSPF router maintains an identical （）describing the autonomous system’s topology。From this database，a routing table is calculated by constructing a shortes

题目
OSPF is a link-state routing protocol。It is designed to be run internal to a single （71）system。Each OSPF router maintains an identical （）describing the autonomous system’s topology。From this database，a routing table is calculated by constructing a shortest-path （）。OSPF recalculates routes quickly in the face of topological changes，utilizing a minimum of routing （） traffic。OSPF provides support for equal-cost multipath。An area routing capability is provided，enabling an additional level of routing protection and a reduction in routing protocol （）。

A.autonomous
B.network
C.computer
D.server
相似考题

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

2.What is the purpose of the OSPF link－state update packet?()A. describes a change to the OSPF hello timerB. carries one or more link-state advertisementsC. establishes and maintains neighbor relationshipsD. describes the contents of the entire link-state database

3.OSPF is a link-state routing protocol。It is designed to be run internal to a single __（71）__system。Each OSPF router maintains an identical __（72）__ describing the autonomous system’s topology。From this database，a routing table is calculated by constructing a shortest-path __（73）__。OSPF recalculates routes quickly in the face of topological changes，utilizing a minimum of routing __（74）__ traffic。OSPF provides support for equal-cost multipath。An area routing capability is provided，enabling an additional level of routing protection and a reduction in routing protocol__（75）__。71A.autonomousB.networkC.computerD.server

4.OSPF is a link-state routing protocol。It is designed to be run internal to a single __（71__system。Each OSPF router maintains an identical __（72）__ describing the autonomous system’s topology。From this database，a routing table is calculated by constructing a shortest-path __（73）__。OSPF recalculates routes quickly in the face of topological changes，utilizing a minimum of routing __（74）__ traffic。OSPF provides support for equal-cost multipath。An area routing capability is provided，enabling an additional level of routing protection and a reduction in routing protocol __（75）__。A.autonomousB.networkC.computerD.server

更多“OSPF is a link-state routing protocol。It is designed to be run internal to a single （71）system。Each OSPF router maintains an identical （）describing the autonomous system’s topology。From this database”相关问题

  • 第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 receives 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 router 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
    边界网关协议(BGP)是自治系统间的路由协议。BGP是基于路径选择的向量路由方法。距离向量路由作为自治系统间的路由不是一个好的选择,因为具有最小跳数的路由并不一定是最合适的路由。例如，我们不想一个数据包通过即使路径最短但不安全的路线，距离向量路由具有不确定性,因为它只告知了到达目的地路径的跳数，而没有真正定义具体的路径。如果接收路由器接收到了一个通过它本身来计算得到的距离向量广播包，那么显然它是被愚弄的。链路状态路由作为自治系统间的路由也不是一个好的选择，因为在使用链路状态路由时，整个互联网将要求每个路由器有一个庞大的链路状态资料库，这就需要花费大量的时间去为路由器计算其路由表。

  • 第2题：

    Which two are NOT characteristics of the OSPF routing protocol?()

    A. It confines network instability to a single area of network.

    B. It increases the routing overhead of the network

    C. It supports VLSM

    D. It routes between Autonomous Systems.

    E. It allows extensive control of routing updates


    参考答案：B, D

  • 第3题：

    OSPF is a link-state routing protocol。It is designed to be run internal to a single （）system。Each OSPF router maintains an identical （）describing the autonomous system’s topology。From this database，a routing table is calculated by constructing a shortest-path （）。OSPF recalculates routes quickly in the face of topological changes，utilizing a minimum of routing （74） traffic。OSPF provides support for equal-cost multipath。An area routing capability is provided，enabling an additional level of routing protection and a reduction in routing protocol （）。

    A.protocol
    B.network
    C.broadcast
    D.multipath

    答案：D
    解析：

  • 第4题：

    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.table
    B.databases
    C.maps
    D.topology

    答案：B
    解析：

  • 第5题：

    What are some of the characteristics of the OSPF routing protocol?（）

    • A、It confines network instability to a single area of network.
    • B、It increases the routing overhead of the network
    • C、It supports VLSM
    • D、It routes between Autonomous Systems.
    • E、It allows extensive control of routing updates
    • F、None of the above

    正确答案:A,C,E

  • 第6题：

    A switch has been configured with two vlans and is connected to a router with a trunk for inter-vlan routing.OSPF has been configured on the router，as the routing protocol for the network.Which statement about thisnetwork is true？（）

    • A、For the two vlans to communicate，a network statement for the trunk interface needs to be added to the  OSPF configuration.
    • B、For the two vlans to communicate， a network statement for each subinterface needs to be  added  to the OSPF configuration.
    • C、Direct inter-vlan communication does not require OSPF
    • D、OSPF cannot be used if router-on-a-stick is configured on the router

    正确答案:C

  • 第7题：

    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.

    正确答案:D

  • 第8题：

    Which two are NOT characteristics of the OSPF routing protocol?（）

    • A、It confines network instability to a single area of network.
    • B、It increases the routing overhead of the network
    • C、It supports VLSM
    • D、It routes between Autonomous Systems.
    • E、It allows extensive control of routing updates

    正确答案:B,D

  • 第9题：

    单选题
    What is the purpose of the OSPF link-state update packet?（）
    A

    describes a change to the OSPF hello timer

    B

    carries one or more link-state advertisements

    C

    establishes and maintains neighbor relationships

    D

    describes the contents of the entire link-state database


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

  • 第10题：

    单选题
    When learning a new route, if a LSA received is not found in the topological database, what will an internal OSPF router do?（）
    A

    The sequence numbers are checked, and if the LSA is val id it is entered into the topology database.

    B

    The LSA is placed in the topological database and an acknowledgement is sent to the transmitting router.

    C

    The LSA is dropped and a message is sent to the transmitting router.

    D

    The LSA is flooded imme diately out of all the OSPF interfaces, except the interface from which the LSA was received.


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

  • 第11题：

    多选题
    Which two are NOT characteristics of the OSPF routing protocol?（）
    A

    It confines network instability to a single area of network.

    B

    It increases the routing overhead of the network

    C

    It supports VLSM

    D

    It routes between Autonomous Systems.

    E

    It allows extensive control of routing updates


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

  • 第12题：

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


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

  • 第13题：

    Refer to the above exhibit. Why are the EIGRP neighbors for this router not learning the routes redistributed from OSPF?()

    A. Redistribution must be enabled mutually (in both directions) to work correctly.

    B. auto - summary causes the OSPF routes redistributed into EIGRP to be summarized; thus the OSPF network 116.16.34 is summarized to 116.3 4.0.0, which is already covered by the EIGRP protocol.

    C. Default metrics are not configured under EIGRP.

    D. Both routing protocols must have unique autonomous system numbers for redistribution to function correctly.


    参考答案：C

  • 第14题：

    While troubleshooting some connectivity issues，you issue the “show ip ospf database”in order to ex amine the link state database. Which three of the statements below are true regarding the OSPF link state database（）

    A.Each router has an identical link state database.

    B.External routes are imported into a separate link state database.

    C.Syn chronization of link state databases is maintained via floodingo f LSAs.

    D.Information in the link state database is used to build a routing table by calculating a shortest-path tree.

    E.By default,link state databases are refreshede very 10 minutes in the absence of topology changes.


    参考答案：A, C, D

  • 第15题：

    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
    解析：

  • 第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.exterior
    B.interior
    C.border
    D.routing

    答案：B
    解析：

  • 第17题：

    Which of the following data structures exist on a router for the OSPF routing protocol？（）

    • A、OSPF topology table
    • B、OSPF interface table
    • C、OSPF routing information base
    • D、OSPF link-state database
    • E、OSPF adjacency table
    • F、OSPF neighbor table

    正确答案:B,C,D,F

  • 第18题：

    Which statement best describes OSPF external LSAs （type 5）？（）

    • A、OSPF external LSAs are automatically flooded into all OSPF areas， unlike type 7 LSAs， which require that redistribution be configured.
    • B、External LSAs （type 5） are automatically changed to type 1 LSAs at ASBRs.
    • C、Type 5 LSAs are route summaries describing routes to networks outside the OSPF Autonomous System.
    • D、External network LSAs （type 5） redistributed from other routing protocols into OSPF are not permitted to flood into a stub area.

    正确答案:D

  • 第19题：

    When learning a new route, if a LSA received is not found in the topological database, what will an internal OSPF router do?（）

    • A、The sequence numbers are checked, and if the LSA is val id it is entered into the topology database.
    • B、The LSA is placed in the topological database and an acknowledgement is sent to the transmitting router.
    • C、The LSA is dropped and a message is sent to the transmitting router.
    • D、The LSA is flooded imme diately out of all the OSPF interfaces, except the interface from which the LSA was received.

    正确答案:D

  • 第20题：

    For a router to successfully redistribute routes between OSPF and EIGRP, which of the following are true?（）

    • A、The router must have one routing protocol configured, but configuration for both routing protocols is not necessary
    • B、The router must hav e at least one working link connected to each routing domain
    • C、The redistribute command must be configured under EIGRP to send the routes to OSPF
    • D、The redistribute command should be configured under OSPF to take routes from EIGRP into OSPF

    正确答案:B,D

  • 第21题：

    多选题
    Which of the following data structures exist on a router for the OSPF routing protocol？（）
    A

    OSPF topology table

    B

    OSPF interface table

    C

    OSPF routing information base

    D

    OSPF link-state database

    E

    OSPF adjacency table

    F

    OSPF neighbor table


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

  • 第22题：

    多选题
    For a router to successfully redistribute routes between OSPF and EIGRP, which of the following are true?（）
    A

    The router must have one routing protocol configured, but configuration for both routing protocols is not necessary

    B

    The router must hav e at least one working link connected to each routing domain

    C

    The redistribute command must be configured under EIGRP to send the routes to OSPF

    D

    The redistribute command should be configured under OSPF to take routes from EIGRP into OSPF


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

  • 第23题：

    单选题
    Which statement best describes OSPF external LSAs （type 5）？（）
    A

    OSPF external LSAs are automatically flooded into all OSPF areas, unlike type 7 LSAs, which require that redistribution be configured.

    B

    External LSAs (type 5) are automatically changed to type 1 LSAs at ASBRs.

    C

    Type 5 LSAs are route summaries describing routes to networks outside the OSPF Autonomous System.

    D

    External network LSAs (type 5) redistributed from other routing protocols into OSPF are not permitted to flood into a stub area


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

相关内容