1.A network-layer packet is called a

datagram.

frame.

message.

segment.

2. In a decentralized routing algorithm, the routers will calculate the least-cost path in an iterative and distributed manner.

true or false

3. In a decentralized routing algorithm, the routers will calculate the least-cost path in an iterative and distributed manner.

true or false

4. The distance-vector algorithm uses global knowledge about the network.

true or false

5. The count-to-infinity problem can be avoided using a technique known as __________ .

iterative convergence

a poison pill

poisoned reverse

a routing loop

6. OSPF link weights/costs are

a measure of network traffic.

configured by the network administrator.

equal to the number of hops.

proportional to congestion.

7.

OSPF is a __________ protocol.

distance vector

link-state

Both of the above.

None of the above.

8. OSPF is an example of an __________ routing protocol.

intra-AS

inter-AS

outer-AS

under-AS