网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
What kind of information does a router running a link-state routing protocol need to create and maintain its topological database?（）
- A、LSAs from other routers
- B、Beacons received on point-to-point links
- C、hello packets
- D、Routing tables received from neighbors
- E、SAP packets sent by other routers
- F、TTL packets from exclusive routers
参考答案
更多 “What kind of information does a router running a link-state routing protocol need to create and maintain its topological database?（）A、LSAs from other routersB、Beacons received on point-to-point linksC、hello packetsD、Routing tables received from neighborsE、SAP packets sent by other routersF、TTL packets from exclusive routers” 相关考题
考题
Which two statements are true regarding routing tables?()
A. The routing table is populated by the forwarding table.B. Devices running the Junos OS can accommodate multiple routing tables.C. Information learned from routing protocols is stored in the routing table.D. The primary routing table for IPv4 unicast routes is inet.4.
考题
Which statement is true about a forwarding table?()
A.It stores a subset of information from the routing table.B.It contains routes learned from all protocols to a destination.C.It provides a database for routes selected and placed into the routing table.D.Every routing protocol maintains its own forwarding table.
考题
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.
考题
What kind of information does a router running a link－state routing protocol need to create and maintain its topological database?()
A. LSAs from other routersB. Beacons received on point-to-point linksC. hello packetsD. Routing tables received from neighborsE. SAP packets sent by other routersF. TTL packets from exclusive routers
考题
What information does a router running a link－state protocol use to build and maintain its topological database?()
A. hello packetsB. SAP messages sent by other routersC. LSAs from other routersD. beacons received on point-to-point linksE. routing tables received from other link-state routersF. TTL packets from designated routers
考题
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.
考题
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
考题
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
考题
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
考题
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
考题
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 of these best identifies the types of prefixes a router running BGP will advertise to an EBGP peer？ （）A、 prefixes received from any other BGP peer and prefixes locally originated via networkstatements or redistributed to BGPB、 all prefixes in its IP routing tableC、 only prefixes received from EBGP peers and prefixes locally originated via network statements or redistributedD、 only prefixes received from EBGP peers and prefixes received from route reflectorsE、 all prefixes in its routing table except the prefixes received from other EBGP peersF、 all prefixes in its routing table except the prefixes received from other IBGP peers
考题
hat 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 statement is true about a forwarding table?（）A、It stores a subset of information from the routing table.B、It contains routes learned from all protocols to a destination.C、It provides a database for routes selected and placed into the routing table.D、Every routing protocol maintains its own forwarding table.
考题
Which types of prefixes will a router running BGP most likely advertise to an IBGP peer， assuming it is not configured as a route reflector？（）A、prefixes received from any other BGP peer and prefixes locally originated via networkstatements or redistributedB、all prefixes in its routing tableC、prefixes received from EBGP peers and prefixes locally originated via network statements or redistributedD、prefixes received from EBGP peers and prefixes received from route reflectorsE、prefixes received from other IBGP peers， prefixes received from EBGP peers，and prefixes redistributed to BGPF、prefixes received from other IBGP peers and prefixes received from route reflectors
考题
Which of these best identifies the types of prefixes a router running BGP will advertise to an EBGP peer？（）A、prefixes received from any other BGP peer and prefixes locally originated via network statements or redistributed to BGPB、all prefixes in its IP routing tableC、only prefixes received from EBGP peers and prefixes locally originated via network statements or redistributedD、only prefixes received from EBGP peers and prefixes received from route reflectorsE、all prefixes in its routing table except the prefixes received from other EBGP peersF、all prefixes in its routing table except the prefixes received from other IBGP peers
考题
What information does a router running a link-state protocol use to build and maintain its topological database？ （）A、 hello packetsB、 SAP messages sent by other routers C、 LSAs from other routersD、 beacons received on point-to-point linksE、 routing tables received from other link-state routersF、 TTL packets from designated routers
考题
单选题Which statement is true about a forwarding table?（）A
It stores a subset of information from the routing table.B
It contains routes learned from all protocols to a destination.C
It provides a database for routes selected and placed into the routing table.D
Every routing protocol maintains its own forwarding table.
考题
多选题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 types of prefixes will a router running BGP most likely advertise to an IBGP peer， assuming it is not configured as a route reflector？ （）A
prefixes received from any other BGP peer and prefixes locally originated via network statements or redistributedB
all prefixes in its routing tableC
prefixes received from EBGP peers and prefixes locally originated via network statements or redistributedD
prefixes received from EBGP peers and prefixes received from route reflectorsE
prefixes received from other IBGP peers， prefixes received from EBGP peers， and prefixes redistributed to BGPF
prefixes received from other IBGP peers and prefixes received from route reflectors
考题
多选题What information does a router running a link-state protocol use to build and maintain its topological database? （）Ahello packetsBSAP messages sent by other routersCLSAs from other routersDbeacons received on point-to-point linksErouting tables received from other link-state routersFTTL packets from designated routers
考题
单选题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.
考题
单选题Which types of prefixes will a router running BGP most likely advertise to an IBGP peer， assuming it is notconfigured as a route reflector？（）A
prefixes received from any other BGP peer and prefixes locally originated via network statements or redistributedB
all prefixes in its routing tableC
prefixes received from EBGP peers and prefixes locally originated via network statements or redistributedD
prefixes received from EBGP peers and prefixes received from route reflectorsE
prefixes received from other IBGP peers， prefixes received from EBGP peers，and prefixes redistributedto BGPF
prefixes received from other IBGP peers and prefixes received from route reflectors
考题
多选题What 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.
考题
多选题What kind of information does a router running a link-state routing protocol need to create and maintain its topological database?（）ALSAs from other routersBBeacons received on point-to-point linksChello packetsDRouting tables received from neighborsESAP packets sent by other routersFTTL packets from exclusive routers
热门标签
最新试卷
