Ch10

1.

1 point

What action does a link-state router take immediately upon receipt of an LSP from a neighboring router?

floods the LSP to neighbors

calculates the SPF algorithm

runs the Bellman-Ford algorithm

computes the best path to the destination network

2.

1 point

Why is it difficult for routing loops to occur in networks that use link-state routing?

Routers use hold-down timers to prevent routing loops.

Routers flood the network with LSAs to discover routing loops.

Each router builds a simple view of the network based on hop count.

Each router builds a complete and synchronized view of the network.

3.

1 point

Refer to the exhibit. What kind of information would be seen in an LSP sent from router JAX to router ATL?

cost of the link

a list of all the routing protocols in use

uptime of the route

hop count

4.

1 point

To achieve network convergence, what three steps does each link state router take? (Choose three.)

discover neighbors and establish adjacencies using the hello packet sent at regular intervals

flood the LSP to all neighbors, who then store all LSPs received in a database

build a Link State Packet (LSP) containing the state of each directly connected link

construct a complete map of the topology and compute the best path to each destination network

use automatic summarization to reduce the size of routing tables

5.

1 point

Refer to the exhibit. When Router D is configured to use a link-state routing protocol and is added to the network, what is the first thing that it does to begin learning the network topology?

It sends information about its directly connected neighbors to all routers in the network.

It sends LSP packets to all routers in the network

It learns about its directly connected networks when its interfaces reach the up state.

It sends information about its directly connected neighbors to Routers A and E.

It sends LSP packets to Routers B and C.

It sends Hello packets to all routers in the network.

6.

1 point

A new network administrator is given the task of selecting an appropriate dynamic routing protocol for a software development company. The company has over 100 routers, uses CIDR and VLSM, requires fast convergence, and uses both Cisco and non-Cisco equipment. Which routing protocol is appropriate for this company?

RIP version 2

EIGRP

OSPF

BGP

IGRP

7.

1 point

What two events will cause a link state router to send LSPs to all neighbors? (Choose two.)

immediately after the Bellman-Ford algorithm has run

30 second timer expires

upon initial startup of router or routing protocol

immediately after the DUAL FSM has built the topology database

whenever the network topology changes

8.

1 point

What is the final step in the link state routing process?

LSPs are flooded to all neighbors to converge the network

SPF computes best path to each destination network

successors are placed into the routing table

DUAL algorithm is run to find best path to destination networks

9.

1 point

Refer to the exhibit. What does JAX do with link-state packets from ORL?

queries BOS to see if it has a better route

sends out the individual link-state packets out the interface connected to BOS

only adds it to the local routing table and performs no other actions

sends out its updated routing table to both ORL and BOS routers

10.

1 point

What two statements correctly describe the link state routing process? (Choose two.)

Reliable Transport Protocol (RTP) is the protocol used by for the delivery and reception of LSPs

all routers in the area have identical link state databases

LSPs use the reserved multicast address of 224.0.0.10 to reach neighbors

routing loops are prevented by running the Diffusing Update Algorithm (DUAL)

each router in the area floods LSPs to all neighbors

11.

1 point

Which database or table must be identical on all link-state routers within an area in order to construct an accurate SPF tree?

neighbor table

link-state database

routing table

topology database

adjacency table

12.

1 point

Refer to the exhibit. Which statement correctly describes the path traffic would take from the 10.0.0.0/24 network to the 192.168.1.0/24 network if a link-state routing protocol was in use?

BOS -> ATL because this path is the least hops

BOS -> ORL -> JAX -> ATL because this path is the lowest cost

BOS -> ATL because this path is highest cost

traffic would load balance across all links

13.

1 point

What feature do modern link-state protocols provide to minimize processing and memory requirements?

splitting routing topologies into smaller areas

using update timers to restrict routing updates

assigning lower process priorities to route calculations

strict split horizon rules to reduce routing table entries

14.

1 point

What speeds up convergence in a network using link-state routing?

updates sent only to directly connected neighbors

updates triggered by network changes

updates sent at regular intervals

updates that include complete routing tables

15.

1 point

Which algorithm is run by link-state routing protocols to calculate the shortest path to destination networks?

DUAL

Diffie-Hellman

Bellman-Ford

Dijkstra

16.

1 point

What are some of the advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)

Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database.

Link-state protocols require less router processor power than distance vector protocols.

Routers have direct knowledge of all links in the network and how they are connected.

After the inital LSA flooding, they generally require less bandwidth to communicate changes in a topology.

The topology database eliminates the need for a routing table.

17.

1 point

Refer to the exhibit. If all routers and interfaces are configured to use a link-state routing protocol, from which routers will router D receive hello packets?

A and E

C only

B and C

A, B, C, and E

18.

1 point

Which two routing protocols use Dijkstra’s shortest path first algorithm? (Choose two.)

EIGRP

BGP

RIPv1

RIPv2

IS-IS

OSPF

19.

1 point

When are link-state packets sent to neighbors?

every 30 seconds

after the holddown time expires

when a link goes up or down

when a routing loop occurs

every 180 seconds

20.

1 point

What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)

Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database.

Link-state protocols require less router processor power than distance vector protocols.

Each router independently determines the route to each network.

The topology database eliminates the need for a routing table.

After the inital LSP flooding, they generally require less bandwidth to communicate changes in a topology.

21.

1 point

To achieve network convergence, what three steps does each link state router take? (Choose three.)

construct a complete map of the topology and compute the best path to each destination network

send hello packages at regular intervals to discover neighbors and establish adjacencies

flood the LSP to all neighbors, who then store all LSPs received in a database

use the DUAL FSM to select efficient, loop-free paths, and insert routes into therouting table

use automatic summarization to reduce the size of routing tables

build a Link State Packet (LSP) containing the state of each directly connected link

22.

1 point

Of the steps given, what is the final step in the link state routing process?

LSPs are flooded to all neighbors to converge the network

successors are placed into the routing table

DUAL algorithm is run to find best path to destination networks

SPF computes best path to each destination network