单选题Which information is carried in the OSPFv3 intra-area Prefix LSA？（）Aall link-local addressesBall IPv6 prefix and topology information that OSPFv2 included in Router LSA and Network LSAClist of options associated with the link to all other routers attached to the linkDall prefix-specific information that OSPFv2 included in Router LSA and Network LSA
单选题
Which information is carried in the OSPFv3 intra-area Prefix LSA？（）
A
all link-local addresses
B
all IPv6 prefix and topology information that OSPFv2 included in Router LSA and Network LSA
C
list of options associated with the link to all other routers attached to the link
D
all prefix-specific information that OSPFv2 included in Router LSA and Network LSA
参考解析
解析：
暂无解析
相关考题：
OSPFv3 interarea－prefix－LSAs are most similar to which OSPFv2 LSA type?() A. Type 7 LSAsB. Type 4 summary LSAsC. Type 3 summary LSAsD. Type 5 AS-external LSAs
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.
Refer to the exhibits. Router B should advertise the network co nnected to the E0/0/0 interface to router A and block all other network advertisements. The IP routing table on router A indicates that it is not receiving this prefix from router B. What is the probable cause of the problem?（）A. An access list on router B is causing the 192.168.3.16/28 network to be deniedB. An access list on router B is causing the 192.168.3.32/28 network to be deniedC. The distribute list on router B is referencing a numbered access list that does not exist on router BD. The d istribute list on router B is referencing the wrong interface
Which description regarding OSPF Network LSAs is correct?() A. They are originated by Area Border Router and are sent into a single area to advertise an Autonomous System Border Router.B. They are originat ed by Area Border Routers and are sent into a single area to advertise destinations outside that area.C. They are originated by the DR on every multi - access network. They include all attached routers including the DR itself.D. They are originated by every router in the OPSF network. They include all routers on the link, interfaces, the cost of the link, and any known neighbor on the link.
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.
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.
Your network trainee asks you, in the context of IPv6 and OSPF, what best des cribes a type 9 LSA? What should you tell her?() A. Link LSAB. Interarea prefix LSA for ABRsC. Router LSAD. Switch LSAE. Intra - area prefix LSAF. None of the above
On the serial interface of a router, an inbound access list is configured to deny all traffic from UDP and TCP ports 21, 23, and 25. All other traffic is permitted. Based on this information, which types of traffic will be allowed through this interface?（）A.SMTPB.DNSC.FTPD.TelnetE.HTTPF.POP3
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.tableB.databasesC.mapsD.topology
Which three of these items are found within the router advertisement message of IPv6 stateless autoconfiguration?（） (Choose three.)A、flags indicating the kind of autoconfiguration that can be done by hostsB、default router informationC、/64 prefix that can be used on the link and the lifetime of the prefixD、IPv6 DHCP server address information
Which three fields are optional in an OSPFv3 external LSA？（）A、Forwarding AddressB、External RouteC、Reference Link-State IDD、OptionE、Prefix Options
Your network trainee asks you, in the context of IPv6 and OSPF, what best des cribes a type 9 LSA? What should you tell her?（）A、Link LSAB、Interarea prefix LSA for ABRsC、Router LSAD、Switch LSAE、Intra - area prefix LSAF、None of the above
Which of the following LSA is the Type 10？（）A、Router LSAB、Opaque LSAC、AS attributes LSAD、ASBR summary LSAE、Network summary LSA
Which LSA is the Type 10？（）A、Router LSAB、Opaque LSAC、AS attributes LSAD、ASBR summary LSAE、Network summary LSA
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 information is carried in an OSPFv3 intra-area-prefix LSA？（）A、IPv6 prefixesB、link-local addressesC、solicited node multicast addressesD、IPv6 prefixes and topology information
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.
Which information is carried in the OSPFv3 intra-area Prefix LSA？（）A、all link-local addressesB、all IPv6 prefix and topology information that OSPFv2 included in Router LSA and Network LSAC、list of options associated with the link to all other routers attached to the linkD、all prefix-specific information that OSPFv2 included in Router LSA and Network LSA
OSPFv3 interarea-prefix-LSAs are most similar to which OSPFv2 LSA type?（）A、Type 7 LSAsB、Type 4 summary LSAsC、Type 3 summary LSAsD、Type 5 AS-external LSAs
单选题Which description regarding OSPF Network LSAs is correct?（）AThey are originated by Area Border Router and are sent into a single area to advertise an Autonomous System Border Router.BThey are originat ed by Area Border Routers and are sent into a single area to advertise destinations outside that area.CThey are originated by the DR on every multi - access network. They include all attached routers including the DR itself.DThey are originated by every router in the OPSF network. They include all routers on the link, interfaces, the cost of the link, and any known neighbor on the link.
多选题On the serial interface of a router, an inbound access list is configured to deny all traffic from UDP and TCP ports 21, 23, and 25. All other traffic is permitted. Based on this information, which types of traffic will be allowed through this interface?（）ASMTPBDNSCFTPDTelnetEHTTPFPOP3
单选题When learning a new route, if a LSA received is not found in the topological database, what will an internal OSPF router do?（）AThe sequence numbers are checked, and if the LSA is val id it is entered into the topology database.BThe LSA is placed in the topological database and an acknowledgement is sent to the transmitting router.CThe LSA is dropped and a message is sent to the transmitting router.DThe LSA is flooded imme diately out of all the OSPF interfaces, except the interface from which the LSA was received.
单选题Which information is carried in an OSPFv3 intra-area-prefix LSA？ （）A IPv6 prefixesB link-local addressesC solicited node multicast addressesD IPv6 prefixes and topology information
单选题Your network trainee asks you, in the context of IPv6 and OSPF, what best des cribes a type 9 LSA? What should you tell her?（）ALink LSABInterarea prefix LSA for ABRsCRouter LSADSwitch LSAEIntra - area prefix LSAFNone of the above
单选题Which information is carried in the OSPFv3 intra-area Prefix LSA？（）Aall link-local addressesBall IPv6 prefix and topology information that OSPFv2 included in Router LSA and Network LSAClist of options associated with the link to all other routers attached to the linkDall prefix-specific information that OSPFv2 included in Router LSA and Network LSA
单选题Which information is carried in an OSPFv3 intra-area-prefix LSA？（）AIPv6 prefixesBlink-local addressesCsolicited node multicast addressesDIPv6 prefixes and topology information
单选题OSPFv3 interarea-prefix-LSAs are most similar to which OSPFv2 LSA type?（）AType 7 LSAsBType 4 summary LSAsCType 3 summary LSAsDType 5 AS-external LSAs